1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*
* Fernflower - The Analytical Java Decompiler
* http://www.reversed-java.com
*
* (C) 2008 - 2010, Stiver
*
* This software is NEITHER public domain NOR free software
* as per GNU License. See license.txt for more details.
*
* This software is distributed WITHOUT ANY WARRANTY; without
* even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE.
*/
package org.jetbrains.java.decompiler.util;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
public class VBStyleCollection<E, K> extends ArrayList<E> {
private HashMap<K, Integer> map = new HashMap<K, Integer>();
private ArrayList<K> lstKeys = new ArrayList<K>();
public VBStyleCollection() {
super();
}
public VBStyleCollection(int initialCapacity) {
super(initialCapacity);
lstKeys = new ArrayList<K>(initialCapacity);
map = new HashMap<K, Integer>(initialCapacity);
}
public VBStyleCollection(Collection<E> c) {
super(c);
}
public boolean add(E element) {
lstKeys.add(null);
super.add(element);
return true;
}
public boolean remove(Object element) { // TODO: error on void remove(E element)
throw new RuntimeException("not implemented!");
}
public boolean addAll(Collection<? extends E> c) {
for(int i=c.size()-1;i>=0;i--) {
lstKeys.add(null);
}
return super.addAll(c);
}
public void addAllWithKey(VBStyleCollection<E, K> c) {
for(int i=0;i<c.size();i++) {
addWithKey(c.get(i), c.getKey(i));
}
}
public void addAllWithKey(Collection<E> elements, Collection<K> keys) {
int index = super.size();
for(K key : keys) {
map.put(key, index++);
}
super.addAll(elements);
lstKeys.addAll(keys);
}
public void addWithKey(E element, K key) {
map.put(key, super.size());
super.add(element);
lstKeys.add(key);
}
// TODO: speed up the method
public E putWithKey(E element, K key) {
Integer index = map.get(key);
if (index == null) {
addWithKey(element, key);
} else {
return super.set(index, element);
}
return null;
}
public void add(int index, E element) {
addToListIndex(index, 1);
lstKeys.add(index, null);
super.add(index, element);
}
public void addWithKeyAndIndex(int index, E element, K key) {
addToListIndex(index, 1);
map.put(key, new Integer(index));
super.add(index, element);
lstKeys.add(index, key);
}
public void removeWithKey(K key) {
int index = ((Integer) map.get(key)).intValue();
addToListIndex(index + 1, -1);
super.remove(index);
lstKeys.remove(index);
map.remove(key);
}
public E remove(int index) {
addToListIndex(index + 1, -1);
Object obj = lstKeys.get(index);
if (obj != null) {
map.remove(obj);
}
lstKeys.remove(index);
return super.remove(index);
}
public E getWithKey(K key) {
Integer index = map.get(key);
if (index == null) {
return null;
}
return super.get(index.intValue());
}
public int getIndexByKey(K key) {
return map.get(key).intValue();
}
public E getLast() {
return super.get(super.size()-1);
}
public boolean containsKey(K key) {
return map.containsKey(key);
}
public void clear() {
map.clear();
lstKeys.clear();
super.clear();
}
public VBStyleCollection<E, K> clone() {
VBStyleCollection<E, K> c = new VBStyleCollection<E, K>();
c.addAll(new ArrayList<E>(this));
c.setMap(new HashMap<K, Integer>(map));
c.setLstKeys(new ArrayList<K>(lstKeys));
return c;
}
public void swap(int index1, int index2) {
Collections.swap(this, index1, index2);
Collections.swap(lstKeys, index1, index2);
K key = lstKeys.get(index1);
if(key!=null) {
map.put(key, new Integer(index1));
}
key = lstKeys.get(index2);
if(key!=null) {
map.put(key, new Integer(index2));
}
}
public HashMap<K, Integer> getMap() {
return map;
}
public void setMap(HashMap<K, Integer> map) {
this.map = map;
}
public K getKey(int index) {
return lstKeys.get(index);
}
public ArrayList<K> getLstKeys() {
return lstKeys;
}
public void setLstKeys(ArrayList<K> lstKeys) {
this.lstKeys = lstKeys;
}
private void addToListIndex(int index, int diff) {
for (int i = lstKeys.size() - 1; i >= index; i--) {
K obj = lstKeys.get(i);
if (obj != null) {
map.put(obj, new Integer(i + diff));
}
}
}
}
|
