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
|
package gtPlusPlus.api.objects.data;
import java.util.*;
public class ReverseAutoMap<N> extends AutoMap<N> {
/**
* The Internal Map
*/
private Map<N, Integer> mInternalMapReverseLookup = new HashMap<N, Integer>();
/**
* The Internal ID
*/
private int mInternalID = 0;
private static final long serialVersionUID = 3771412318075131790L;
@Override
public Iterator<N> iterator() {
return values().iterator();
}
public synchronized boolean setValue(N object){
int mOriginalID = this.mInternalID;
put(object);
if (this.mInternalMap.get(mOriginalID).equals(object) || mOriginalID > this.mInternalID){
return true;
}
else {
return false;
}
}
@Override
public synchronized N put(N object){
return set(object);
}
@Override
public synchronized N set(N object){
int newID = getNextFreeMapID();
mInternalMapReverseLookup.put(object, newID);
return mInternalMap.put(newID, object);
}
public synchronized int putToInternalMap(N object){
return setInternalMap(object);
}
public synchronized int setInternalMap(N object){
int newID = getNextFreeMapID();
mInternalMap.put(newID, object);
mInternalMapReverseLookup.put(object, newID);
return newID;
}
public synchronized boolean injectCleanDataToAutoMap(Integer g, N object){
if (!mInternalMap.containsKey(g) && !mInternalMapReverseLookup.containsKey(object)) {
int a1 = 0, a2 = 0, a11 = 0, a22 = 0;
a1 = mInternalMap.size();
a2 = mInternalMapReverseLookup.size();
a11 = a1;
a22 = a2;
mInternalMap.put(g, object);
a1 = mInternalMap.size();
mInternalMapReverseLookup.put(object, g);
a2 = mInternalMapReverseLookup.size();
if (a1 > a11 && a2 > a22)
return true;
}
return false;
}
public synchronized boolean injectDataToAutoMap(Integer g, N object){
int a1 = 0, a2 = 0, a11 = 0, a22 = 0;
a1 = mInternalMap.size();
a2 = mInternalMapReverseLookup.size();
a11 = a1;
a22 = a2;
mInternalMap.put(g, object);
a1 = mInternalMap.size();
mInternalMapReverseLookup.put(object, g);
a2 = mInternalMapReverseLookup.size();
if (a1 > a11 && a2 > a22)
return true;
return false;
}
private boolean raiseInternalID() {
int mOld = mInternalID;
mInternalID++;
return mInternalID > mOld;
}
public synchronized int getNextFreeMapID() {
if (raiseInternalID()) {
return mInternalID;
}
return Short.MIN_VALUE;
}
@Override
public synchronized N get(int id){
return mInternalMap.get(id);
}
public synchronized int get(N key) {
return mInternalMapReverseLookup.get(key);
}
@Override
public synchronized Collection<N> values(){
return mInternalMap.values();
}
public synchronized Collection<Integer> keys(){
return mInternalMapReverseLookup.values();
}
@Override
public synchronized int size(){
return mInternalMap.size();
}
@Override
public synchronized int hashCode(){
return mInternalMap.hashCode()+mInternalMapReverseLookup.hashCode();
}
@Override
public synchronized boolean containsKey(int key){
return mInternalMap.containsKey(key);
}
@Override
public synchronized boolean containsValue(N value){
return mInternalMap.containsValue(value);
}
public synchronized boolean containsKey(N key){
return mInternalMapReverseLookup.containsKey(key);
}
public synchronized boolean containsValue(int value){
return mInternalMapReverseLookup.containsValue(value);
}
@Override
public synchronized boolean isEmpty(){
return mInternalMap.isEmpty() && mInternalMapReverseLookup.isEmpty();
}
@Override
public synchronized void clear(){
this.mInternalID = 0;
this.mInternalMap.clear();
this.mInternalMapReverseLookup.clear();
return;
}
@Override
public synchronized N[] toArray() {
Collection<N> col = this.mInternalMap.values();
@SuppressWarnings("unchecked")
N[] val = (N[]) col.toArray();
return val;
}
public synchronized Integer[] toArrayInternalMap() {
Collection<Integer> col = this.mInternalMapReverseLookup.values();
Integer[] val = col.toArray(new Integer[col.size()]);
return val;
}
}
|
