aboutsummaryrefslogtreecommitdiff
path: root/src/main/java/gtPlusPlus/api/objects/data/AutoMap.java
blob: 4de2e9ab786923c8bb1c14ce1d8085a8b3e00c77 (plain)
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
package gtPlusPlus.api.objects.data;

import java.io.Serializable;
import java.util.Collection;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import java.util.Queue;
import java.util.Set;

public class AutoMap<V> implements Iterable<V>, Cloneable, Serializable, Collection<V>, Queue<V>, List<V> {

    /**
     * The Internal Map
     */
    protected final Map<Integer, V> mInternalMap;

    protected final Map<String, Integer> mInternalNameMap;

    /**
     * The Internal ID
     */
    private int mInternalID = 0;

    private static final long serialVersionUID = 3771412318075131790L;

    public AutoMap() {
        this(new LinkedHashMap<>());
    }

    public Map<Integer, V> getMap() {
        return mInternalMap;
    }

    public AutoMap(Map<Integer, V> defaultMapType) {
        mInternalMap = defaultMapType;
        mInternalNameMap = new LinkedHashMap<>();
    }

    /**
     * Generates an AutoMap from the List.
     *
     * @param aList - Data to be inserted into the AutoMap.
     */
    public AutoMap(List<V> aList) {
        mInternalMap = new LinkedHashMap<>();
        mInternalNameMap = new LinkedHashMap<>();
        if (aList != null && !aList.isEmpty()) {
            for (V obj : aList) {
                add(obj);
            }
        }
    }

    /**
     * Generates an AutoMap from a Set.
     *
     * @param aList - Data to be inserted into the AutoMap.
     */
    public AutoMap(Set<V> aList) {
        mInternalMap = new LinkedHashMap<>();
        mInternalNameMap = new LinkedHashMap<>();
        if (aList != null && !aList.isEmpty()) {
            for (V obj : aList) {
                add(obj);
            }
        }
    }

    /**
     * Generates an AutoMap from a Collection.
     *
     * @param aList - Data to be inserted into the AutoMap.
     */
    public AutoMap(Collection<V> aList) {
        mInternalMap = new LinkedHashMap<>();
        mInternalNameMap = new LinkedHashMap<>();
        if (aList != null && !aList.isEmpty()) {
            for (V obj : aList) {
                add(obj);
            }
        }
    }

    /**
     * Generates an AutoMap from a Array.
     *
     * @param aArray - Data to be inserted into the AutoMap.
     */
    public AutoMap(V[] aArray) {
        mInternalMap = new LinkedHashMap<>();
        mInternalNameMap = new LinkedHashMap<>();
        if (aArray != null) {
            for (V obj : aArray) {
                add(obj);
            }
        }
    }

    @Override
    public Iterator<V> iterator() {
        return values().iterator();
    }

    public synchronized boolean setValue(V object) {
        int mOriginalID = this.mInternalID;
        put(object);
        return this.mInternalMap.get(mOriginalID)
            .equals(object) || mOriginalID > this.mInternalID;
    }

    public synchronized V put(V object) {
        return set(object);
    }

    @Override
    public synchronized boolean add(V object) {
        return set(object) != null;
    }

    public synchronized V set(V object) {
        if (object == null) {
            return null;
        }
        mInternalNameMap.put("" + object.hashCode(), (mInternalID + 1));
        return mInternalMap.put(mInternalID++, object);
    }

    @Override
    public synchronized V get(int id) {
        return mInternalMap.get(id);
    }

    public synchronized Collection<V> values() {
        return mInternalMap.values();
    }

    @Override
    public synchronized int size() {
        return mInternalMap.size();
    }

    public synchronized int hashCode() {
        return mInternalMap.hashCode();
    }

    public synchronized boolean containsKey(int key) {
        return mInternalMap.containsKey(key);
    }

    public synchronized boolean containsValue(V value) {
        return mInternalMap.containsValue(value);
    }

    @Override
    public synchronized boolean isEmpty() {
        return mInternalMap.isEmpty();
    }

    @Override
    public synchronized void clear() {
        this.mInternalID = 0;
        this.mInternalMap.clear();
        this.mInternalNameMap.clear();
    }

    @Override
    @SuppressWarnings("unchecked")
    public V[] toArray() {
        V[] toR = (V[]) java.lang.reflect.Array.newInstance(
            mInternalMap.get(0)
                .getClass(),
            mInternalMap.size());
        for (int i = 0; i < mInternalMap.size(); i++) {
            toR[i] = mInternalMap.get(i);
        }
        return toR;
    }

    public final synchronized int getInternalID() {
        return mInternalID;
    }

    @Override
    public final synchronized boolean remove(Object value) {
        value.getClass();
        if (this.mInternalMap.containsValue(value)) {
            return this.mInternalMap.remove(mInternalNameMap.get("" + value.hashCode()), value);
        }
        return false;
    }

    @Override
    public boolean contains(Object o) {
        for (V g : this.mInternalMap.values()) {
            if (g.equals(o)) {
                return true;
            }
        }
        return false;
    }

    @SuppressWarnings("unchecked")
    @Override
    public <V> V[] toArray(V[] a) {
        return (V[]) toArray();
    }

    @Override
    public boolean containsAll(Collection<?> c) {
        boolean aTrue = true;
        for (Object g : c) {
            if (!this.contains(g)) {
                aTrue = false;
            }
        }
        return aTrue;
    }

    @Override
    public boolean addAll(Collection<? extends V> c) {
        boolean aTrue = true;
        for (V g : c) {
            if (!this.add(g)) {
                aTrue = false;
            }
        }
        return aTrue;
    }

    @Override
    public boolean removeAll(Collection<?> c) {
        boolean aTrue = true;
        for (Object g : c) {
            if (!this.remove(g)) {
                aTrue = false;
            }
        }
        return aTrue;
    }

    @Override
    public boolean retainAll(Collection<?> c) {
        AutoMap<?> aTempAllocation = new AutoMap<>();
        boolean aTrue = false;
        aTempAllocation = this;
        aTempAllocation.removeAll(c);
        aTempAllocation.clear();
        aTrue = aTempAllocation.isEmpty();
        aTempAllocation.clear();
        return aTrue;
    }

    @Override
    public boolean offer(V e) {
        return add(e);
    }

    @Override
    public V remove() {
        V y = this.get(0);
        if (remove(y)) return y;
        else return null;
    }

    @Override
    public V poll() {
        if (this.mInternalMap.isEmpty()) {
            return null;
        }
        return remove();
    }

    @Override
    public V element() {
        if (this.mInternalMap.isEmpty()) {
            return null;
        }
        return this.get(0);
    }

    @Override
    public V peek() {
        return element();
    }

    @Override
    public boolean addAll(int index, Collection<? extends V> c) {
        for (V y : c) {
            add(y);
        }
        return true;
    }

    @Override
    public V set(int index, V element) {
        return mInternalMap.put(index, element);
    }

    @Override
    public void add(int index, V element) {
        add(element);
    }

    @Override
    public V remove(int index) {
        V h = mInternalMap.get(index);
        set(index, null);
        return h;
    }

    @Override
    public int indexOf(Object o) {
        int aCount = 0;
        for (V of : mInternalMap.values()) {
            if (of != o) {
                aCount++;
            } else {
                return aCount;
            }
        }
        return -1;
    }

    @Override
    public int lastIndexOf(Object o) {
        // TODO
        return indexOf(o);
    }

    @Override
    public ListIterator<V> listIterator() {
        // TODO Auto-generated method stub
        return null;
    }

    @Override
    public ListIterator<V> listIterator(int index) {
        // TODO Auto-generated method stub
        return null;
    }

    @Override
    public List<V> subList(int fromIndex, int toIndex) {
        AutoMap<V> aNewSubList = new AutoMap<>();
        for (int slot = fromIndex; slot <= toIndex; slot++) {
            V obj = mInternalMap.get(slot);
            if (obj != null) {
                aNewSubList.put(obj);
            }
        }
        return aNewSubList;
    }
}