34 |
|
return map; |
35 |
|
} |
36 |
|
|
37 |
+ |
/** Re-implement Integer.compare for old java versions */ |
38 |
+ |
static int compare(int x, int y) { return x < y ? -1 : x > y ? 1 : 0; } |
39 |
+ |
|
40 |
|
// classes for testing Comparable fallbacks |
41 |
|
static class BI implements Comparable<BI> { |
42 |
|
private final int value; |
43 |
|
BI(int value) { this.value = value; } |
44 |
|
public int compareTo(BI other) { |
45 |
< |
return Integer.compare(value, other.value); |
45 |
> |
return compare(value, other.value); |
46 |
|
} |
47 |
|
public boolean equals(Object x) { |
48 |
|
return (x instanceof BI) && ((BI)x).value == value; |
76 |
|
break; |
77 |
|
} |
78 |
|
if (r == 0) |
79 |
< |
r = Integer.compare(size(), other.size()); |
79 |
> |
r = compare(size(), other.size()); |
80 |
|
return r; |
81 |
|
} |
82 |
|
private static final long serialVersionUID = 0; |
83 |
|
} |
84 |
|
|
85 |
+ |
static class CollidingObject { |
86 |
+ |
final String value; |
87 |
+ |
CollidingObject(final String value) { this.value = value; } |
88 |
+ |
public int hashCode() { return this.value.hashCode() & 1; } |
89 |
+ |
public boolean equals(final Object obj) { |
90 |
+ |
return (obj instanceof CollidingObject) && ((CollidingObject)obj).value.equals(value); |
91 |
+ |
} |
92 |
+ |
} |
93 |
+ |
|
94 |
+ |
static class ComparableCollidingObject extends CollidingObject implements Comparable<ComparableCollidingObject> { |
95 |
+ |
ComparableCollidingObject(final String value) { super(value); } |
96 |
+ |
public int compareTo(final ComparableCollidingObject o) { |
97 |
+ |
return value.compareTo(o.value); |
98 |
+ |
} |
99 |
+ |
} |
100 |
+ |
|
101 |
|
/** |
102 |
|
* Inserted elements that are subclasses of the same Comparable |
103 |
|
* class are found. |
155 |
|
} |
156 |
|
} |
157 |
|
|
158 |
+ |
/** |
159 |
+ |
* Mixtures of instances of comparable and non-comparable classes |
160 |
+ |
* can be inserted and found. |
161 |
+ |
*/ |
162 |
+ |
public void testMixedComparable() { |
163 |
+ |
int size = 10000; |
164 |
+ |
ConcurrentHashMap<Object, Object> map = |
165 |
+ |
new ConcurrentHashMap<Object, Object>(); |
166 |
+ |
Random rng = new Random(1370014958369218000L); |
167 |
+ |
for(int i = 0; i < size; i++) { |
168 |
+ |
Object x; |
169 |
+ |
switch(rng.nextInt(4)) { |
170 |
+ |
case 0: |
171 |
+ |
x = new Object(); |
172 |
+ |
break; |
173 |
+ |
case 1: |
174 |
+ |
x = new CollidingObject(Integer.toString(i)); |
175 |
+ |
break; |
176 |
+ |
default: |
177 |
+ |
x = new ComparableCollidingObject(Integer.toString(i)); |
178 |
+ |
} |
179 |
+ |
assertNull(map.put(x, x)); |
180 |
+ |
} |
181 |
+ |
int count = 0; |
182 |
+ |
for (Object k : map.keySet()) { |
183 |
+ |
assertEquals(map.get(k), k); |
184 |
+ |
++count; |
185 |
+ |
} |
186 |
+ |
assertEquals(count, size); |
187 |
+ |
assertEquals(map.size(), size); |
188 |
+ |
for (Object k : map.keySet()) { |
189 |
+ |
assertEquals(map.put(k, k), k); |
190 |
+ |
} |
191 |
+ |
} |
192 |
+ |
|
193 |
|
/** |
194 |
|
* clear removes all pairs |
195 |
|
*/ |