ArrayMap.java
9.11 KB
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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
/*
* Decompiled with CFR 0_118.
*/
package com.adobe.internal.util;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
public class ArrayMap
implements Map {
private ArrayList mKeys;
private ArrayList mValues;
private HashMap mKeysMapping;
private int mCurIndex;
public ArrayMap(int size) {
this.mKeys = new ArrayList(size);
this.mValues = new ArrayList(size);
this.mKeysMapping = new HashMap(size * 2);
this.mCurIndex = 0;
}
public ArrayMap() {
this(100);
}
@Override
public int size() {
return this.mCurIndex;
}
@Override
public void clear() {
this.mCurIndex = 0;
this.mKeys.clear();
this.mValues.clear();
this.mKeysMapping.clear();
}
@Override
public boolean isEmpty() {
return this.mCurIndex == 0;
}
@Override
public boolean containsKey(Object arg0) {
return this.mKeysMapping.containsKey(arg0);
}
@Override
public boolean containsValue(Object arg0) {
return this.mValues.contains(arg0);
}
public Collection values() {
return this.mValues;
}
public void putAll(Map arg0) {
for (Map.Entry curEntry : arg0.entrySet()) {
this.put(curEntry.getKey(), curEntry.getValue());
}
}
public Set entrySet() {
return new ArrayEntrySet();
}
public Set keySet() {
return new ArrayKeySet();
}
public Object get(Object arg0) {
Integer pos = (Integer)this.mKeysMapping.get(arg0);
if (pos == null) {
return null;
}
return this.mValues.get(pos);
}
public Object remove(Object arg0) {
Integer pos = (Integer)this.mKeysMapping.get(arg0);
if (pos == null) {
return null;
}
Object oldValue = this.mValues.get(pos);
this.mKeysMapping.remove(arg0);
this.mKeys.remove(pos);
this.mValues.remove(pos);
--this.mCurIndex;
for (int mapInd = pos.intValue(); mapInd < this.mCurIndex; ++mapInd) {
this.mKeysMapping.put(this.mKeys.get(mapInd), mapInd);
}
return oldValue;
}
public Object put(Object arg0, Object arg1) {
Integer pos = (Integer)this.mKeysMapping.get(arg0);
Object oldValue = null;
if (pos != null) {
oldValue = this.mValues.get(pos);
this.mValues.set(pos, arg1);
} else {
Integer key = this.mCurIndex;
this.mKeysMapping.put(arg0, key);
this.mKeys.add(this.mCurIndex, arg0);
this.mValues.add(this.mCurIndex++, arg1);
}
return oldValue;
}
private class ArrayEntrySet
implements Set {
ArrayEntrySet() {
}
@Override
public int size() {
return ArrayMap.this.size();
}
@Override
public void clear() {
throw new UnsupportedOperationException();
}
@Override
public boolean isEmpty() {
return ArrayMap.this.isEmpty();
}
@Override
public Object[] toArray() {
Object[] entries = new Object[ArrayMap.this.size()];
for (int posInd = 0; posInd < ArrayMap.this.size(); ++posInd) {
entries[posInd] = new Entry(posInd);
}
return entries;
}
@Override
public boolean add(Object arg0) {
throw new UnsupportedOperationException();
}
@Override
public boolean contains(Object arg0) {
if (!(arg0 instanceof Entry)) {
return false;
}
Object entryKey = ((Entry)arg0).getKey();
Object mapKey = ArrayMap.this.get(entryKey);
if (mapKey == null) {
return false;
}
return ArrayMap.this.get(mapKey).equals(((Entry)arg0).getValue());
}
@Override
public boolean remove(Object arg0) {
if (!(arg0 instanceof Entry)) {
return false;
}
Object key = ((Entry)arg0).getKey();
if (!ArrayMap.this.containsKey(key)) {
return false;
}
ArrayMap.this.remove(arg0);
return true;
}
@Override
public boolean addAll(Collection arg0) {
throw new UnsupportedOperationException();
}
@Override
public boolean containsAll(Collection arg0) {
if (arg0 == null) {
return false;
}
Iterator entryIterator = arg0.iterator();
while (entryIterator.hasNext()) {
if (this.contains(entryIterator.next())) continue;
return false;
}
return true;
}
@Override
public boolean removeAll(Collection arg0) {
throw new UnsupportedOperationException();
}
@Override
public boolean retainAll(Collection arg0) {
throw new UnsupportedOperationException();
}
@Override
public Iterator iterator() {
return new EntryIterator();
}
@Override
public Object[] toArray(Object[] arg0) {
throw new UnsupportedOperationException();
}
}
private class EntryIterator
implements Iterator {
int mPos;
EntryIterator() {
this.mPos = 0;
}
@Override
public boolean hasNext() {
return this.mPos < ArrayMap.this.size();
}
public Object next() {
return new Entry(this.mPos++);
}
@Override
public void remove() {
if (this.mPos < 1) {
throw new IllegalStateException();
}
Entry curEntry = new Entry(--this.mPos);
Object key = curEntry.getKey();
ArrayMap.this.remove(key);
}
}
private class KeyIterator
implements Iterator {
int mPos;
KeyIterator() {
this.mPos = 0;
}
@Override
public boolean hasNext() {
return this.mPos < ArrayMap.this.size();
}
public Object next() {
return ArrayMap.this.mKeys.get(this.mPos++);
}
@Override
public void remove() {
if (this.mPos < 1) {
throw new IllegalStateException();
}
Object key = ArrayMap.this.mKeys.get(--this.mPos);
ArrayMap.this.remove(key);
}
}
private class ArrayKeySet
implements Set {
ArrayKeySet() {
}
@Override
public int size() {
return ArrayMap.this.size();
}
@Override
public void clear() {
throw new UnsupportedOperationException();
}
@Override
public boolean isEmpty() {
return ArrayMap.this.isEmpty();
}
@Override
public Object[] toArray() {
return ArrayMap.this.mKeys.toArray();
}
@Override
public boolean add(Object arg0) {
throw new UnsupportedOperationException();
}
@Override
public boolean contains(Object arg0) {
return ArrayMap.this.containsKey(arg0);
}
@Override
public boolean remove(Object arg0) {
if (!ArrayMap.this.containsKey(arg0)) {
return false;
}
ArrayMap.this.remove(arg0);
return true;
}
@Override
public boolean addAll(Collection arg0) {
throw new UnsupportedOperationException();
}
@Override
public boolean containsAll(Collection arg0) {
return ArrayMap.this.mKeys.containsAll(arg0);
}
@Override
public boolean removeAll(Collection arg0) {
throw new UnsupportedOperationException();
}
@Override
public boolean retainAll(Collection arg0) {
throw new UnsupportedOperationException();
}
@Override
public Iterator iterator() {
return new KeyIterator();
}
@Override
public Object[] toArray(Object[] arg0) {
return ArrayMap.this.mKeys.toArray(arg0);
}
}
public class Entry
implements Map.Entry {
int mMapPos;
Object mKey;
Object mValue;
Entry(int pos) {
this.mMapPos = pos;
this.mKey = ArrayMap.this.mKeys.get(this.mMapPos);
this.mValue = ArrayMap.this.mValues.get(this.mMapPos);
}
public Object getKey() {
return this.mKey;
}
public Object getValue() {
return this.mValue;
}
public Object setValue(Object arg0) {
Object oldValue = this.mValue;
this.mValue = arg0;
if (ArrayMap.this.containsKey(this.mKey)) {
ArrayMap.this.put(this.mKey, arg0);
}
return oldValue;
}
}
}