56 |
|
return map; |
57 |
|
} |
58 |
|
|
59 |
– |
/** Re-implement Integer.compare for old java versions */ |
60 |
– |
static int compare(int x, int y) { |
61 |
– |
return (x < y) ? -1 : (x > y) ? 1 : 0; |
62 |
– |
} |
63 |
– |
|
59 |
|
// classes for testing Comparable fallbacks |
60 |
|
static class BI implements Comparable<BI> { |
61 |
|
private final int value; |
62 |
|
BI(int value) { this.value = value; } |
63 |
|
public int compareTo(BI other) { |
64 |
< |
return compare(value, other.value); |
64 |
> |
return Integer.compare(value, other.value); |
65 |
|
} |
66 |
|
public boolean equals(Object x) { |
67 |
|
return (x instanceof BI) && ((BI)x).value == value; |
95 |
|
break; |
96 |
|
} |
97 |
|
if (r == 0) |
98 |
< |
r = compare(size(), other.size()); |
98 |
> |
r = Integer.compare(size(), other.size()); |
99 |
|
return r; |
100 |
|
} |
101 |
|
private static final long serialVersionUID = 0; |
123 |
|
*/ |
124 |
|
public void testComparableFamily() { |
125 |
|
int size = 500; // makes measured test run time -> 60ms |
126 |
< |
ConcurrentHashMap<BI, Boolean> m = |
132 |
< |
new ConcurrentHashMap<BI, Boolean>(); |
126 |
> |
ConcurrentHashMap<BI, Boolean> m = new ConcurrentHashMap<>(); |
127 |
|
for (int i = 0; i < size; i++) { |
128 |
|
assertNull(m.put(new CI(i), true)); |
129 |
|
} |
139 |
|
*/ |
140 |
|
public void testGenericComparable() { |
141 |
|
int size = 120; // makes measured test run time -> 60ms |
142 |
< |
ConcurrentHashMap<Object, Boolean> m = |
149 |
< |
new ConcurrentHashMap<Object, Boolean>(); |
142 |
> |
ConcurrentHashMap<Object, Boolean> m = new ConcurrentHashMap<>(); |
143 |
|
for (int i = 0; i < size; i++) { |
144 |
|
BI bi = new BI(i); |
145 |
|
BS bs = new BS(String.valueOf(i)); |
146 |
< |
LexicographicList<BI> bis = new LexicographicList<BI>(bi); |
147 |
< |
LexicographicList<BS> bss = new LexicographicList<BS>(bs); |
146 |
> |
LexicographicList<BI> bis = new LexicographicList<>(bi); |
147 |
> |
LexicographicList<BS> bss = new LexicographicList<>(bs); |
148 |
|
assertNull(m.putIfAbsent(bis, true)); |
149 |
|
assertTrue(m.containsKey(bis)); |
150 |
|
if (m.putIfAbsent(bss, true) == null) |
163 |
|
*/ |
164 |
|
public void testGenericComparable2() { |
165 |
|
int size = 500; // makes measured test run time -> 60ms |
166 |
< |
ConcurrentHashMap<Object, Boolean> m = |
174 |
< |
new ConcurrentHashMap<Object, Boolean>(); |
166 |
> |
ConcurrentHashMap<Object, Boolean> m = new ConcurrentHashMap<>(); |
167 |
|
for (int i = 0; i < size; i++) { |
168 |
|
m.put(Collections.singletonList(new BI(i)), true); |
169 |
|
} |
170 |
|
|
171 |
|
for (int i = 0; i < size; i++) { |
172 |
< |
LexicographicList<BI> bis = new LexicographicList<BI>(new BI(i)); |
172 |
> |
LexicographicList<BI> bis = new LexicographicList<>(new BI(i)); |
173 |
|
assertTrue(m.containsKey(bis)); |
174 |
|
} |
175 |
|
} |
180 |
|
*/ |
181 |
|
public void testMixedComparable() { |
182 |
|
int size = 1200; // makes measured test run time -> 35ms |
183 |
< |
ConcurrentHashMap<Object, Object> map = |
192 |
< |
new ConcurrentHashMap<Object, Object>(); |
183 |
> |
ConcurrentHashMap<Object, Object> map = new ConcurrentHashMap<>(); |
184 |
|
Random rng = new Random(); |
185 |
|
for (int i = 0; i < size; i++) { |
186 |
|
Object x; |
838 |
|
assertEquals(mapSize, map.size()); |
839 |
|
} |
840 |
|
|
841 |
+ |
public void testReentrantComputeIfAbsent() { |
842 |
+ |
ConcurrentHashMap<Integer, Integer> map = new ConcurrentHashMap<>(16); |
843 |
+ |
try { |
844 |
+ |
for (int i = 0; i < 100; i++) { // force a resize |
845 |
+ |
map.computeIfAbsent(i, key -> findValue(map, key)); |
846 |
+ |
} |
847 |
+ |
fail("recursive computeIfAbsent"); |
848 |
+ |
} catch (IllegalStateException ex) { |
849 |
+ |
} |
850 |
+ |
} |
851 |
+ |
|
852 |
+ |
private Integer findValue(ConcurrentHashMap<Integer, Integer> map, |
853 |
+ |
Integer key) { |
854 |
+ |
return (key % 5 == 0) ? key : |
855 |
+ |
map.computeIfAbsent(key + 1, k -> findValue(map, k)); |
856 |
+ |
} |
857 |
+ |
|
858 |
|
} |