-
-
Notifications
You must be signed in to change notification settings - Fork 938
Expand file tree
/
Copy pathGenericMap.java
More file actions
259 lines (208 loc) · 7.31 KB
/
GenericMap.java
File metadata and controls
259 lines (208 loc) · 7.31 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
/***** BEGIN LICENSE BLOCK *****
* Version: EPL 2.0/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Eclipse Public
* License Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.eclipse.org/legal/epl-v20.html
*
* Software distributed under the License is distributed on an "AS
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
* implied. See the License for the specific language governing
* rights and limitations under the License.
*
* Copyright (C) 2006 Kresten Krab Thorup <krab@gnu.org>
*
* Alternatively, the contents of this file may be used under the terms of
* either of the GNU General Public License Version 2 or later (the "GPL"),
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the EPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the EPL, the GPL or the LGPL.
***** END LICENSE BLOCK *****/
package org.jruby.util;
import java.util.AbstractCollection;
import java.util.AbstractSet;
import java.util.Collection;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
/**
* A <code>GenericMap</code> is simply an abstract <code>java.util.Map</code>
* implementation for which subclasses really only need to implement
* the method entryIterator.
*
* @author Kresten Krab Thorup (krab@trifork.com)
*/
public abstract class GenericMap implements Map {
protected int size;
public int size() {
return size;
}
public boolean isEmpty() {
return size() == 0;
}
protected int keyHash(Object key) {
return key == null ? 0 : key.hashCode();
}
protected boolean keyEquals(Object containedKey, Object givenKey) {
return containedKey == null ? givenKey == null : containedKey.equals(givenKey);
}
protected int valueHash(Object value) {
return value == null ? 0 : value.hashCode();
}
protected boolean valueEquals(Object value1, Object value2) {
return value1 == null ? value2 == null : value1.equals(value2);
}
abstract class Entry implements Map.Entry {
@Override
public int hashCode() {
return keyHash(getKey()) ^ valueHash(getValue());
}
@Override
public boolean equals(Object other) {
if (other instanceof Map.Entry) {
Map.Entry ent = (Map.Entry) other;
return keyEquals(getKey(), ent.getKey()) && valueEquals(getValue(), ent.getValue());
}
return false;
}
}
public void putAll(Map other) {
if (other == this) return;
for (Iterator it = other.entrySet().iterator(); it.hasNext();) {
Map.Entry entry = (Map.Entry) it.next();
put(entry.getKey(), entry.getValue());
}
}
protected abstract Iterator entryIterator();
protected Iterator keyIterator() {
return new KeyIterator();
}
protected Iterator valueIterator() {
return new ValueIterator();
}
abstract class KeyOrValueIterator implements Iterator {
final Iterator iter = entryIterator();
public boolean hasNext() {
return iter.hasNext();
}
protected Map.Entry nextEntry() {
return (Map.Entry) iter.next();
}
public void remove() {
throw new UnsupportedOperationException();
}
}
class KeyIterator extends KeyOrValueIterator {
public Object next() {
return nextEntry().getKey();
}
}
class ValueIterator extends KeyOrValueIterator {
public Object next() {
return nextEntry().getValue();
}
}
/**
* I don't quite understand why we need to replace this method from
* AbstractCollection, but it has been observed that toArray returns the
* *reverse* order of elements. --Kresten
*/
private static Object[] toArray(Object[] arr, int size, Iterator it) {
Object[] out;
if (arr != null && arr.length >= size) {
out = arr;
} else if (arr == null) {
out = new Object[size];
} else {
out = (Object[]) java.lang.reflect.Array.newInstance(arr.getClass().getComponentType(), size);
}
for (int i = 0; i < size; i++) {
out[i] = it.next();
}
if (out.length > size) out[size] = null;
return out;
}
public Collection values() {
return new AbstractCollection() {
public Iterator iterator() {
return valueIterator();
}
public int size() {
return GenericMap.this.size();
}
@Override
public Object[] toArray(Object[] arr) {
return GenericMap.toArray(arr, size(), iterator());
}
};
}
public Set keySet() {
return new AbstractSet() {
public Iterator iterator() {
return keyIterator();
}
public int size() {
return GenericMap.this.size();
}
@Override
public Object[] toArray(Object[] arr) {
return GenericMap.toArray(arr, size(), iterator());
}
};
}
@Override
public int hashCode() {
int code = 0;
for (Iterator it = entryIterator(); it.hasNext(); ) {
code += it.next().hashCode();
}
return code;
}
@Override
public boolean equals(Object other) {
if (!(other instanceof Map)) return false;
Map map = (Map) other;
if (map.size() != size()) return false;
for (Iterator it = entryIterator(); it.hasNext();) {
Entry ent = (Entry) it.next();
Object key = ent.getKey();
Object val = ent.getValue();
if (map.containsKey(key)) {
Object otherVal = map.get(key);
if (!valueEquals(val, otherVal)) return false;
}
}
return true;
}
public Set entrySet() {
return new AbstractSet() {
public Iterator iterator() {
return entryIterator();
}
public int size() {
return size;
}
@Override
public Object[] toArray(Object[] arr) {
return GenericMap.toArray(arr, size(), iterator());
}
};
}
/** return the element with the given key */
public boolean containsValue(Object value) {
for (Iterator it = valueIterator(); it.hasNext(); ) {
if (valueEquals(value, it.next())) return true;
}
return false;
}
public boolean containsKey(Object key) {
return get(key) != null;
}
}