| 28 |
|
class Implementation implements MapImplementation { |
| 29 |
|
public Class<?> klazz() { return ConcurrentHashMap.class; } |
| 30 |
|
public Map emptyMap() { return new ConcurrentHashMap(); } |
| 31 |
– |
public Object makeKey(int i) { return i; } |
| 32 |
– |
public Object makeValue(int i) { return i; } |
| 31 |
|
public boolean isConcurrent() { return true; } |
| 32 |
|
public boolean permitsNullKeys() { return false; } |
| 33 |
|
public boolean permitsNullValues() { return false; } |
| 836 |
|
assertEquals(mapSize, map.size()); |
| 837 |
|
} |
| 838 |
|
|
| 839 |
+ |
public void testReentrantComputeIfAbsent() { |
| 840 |
+ |
ConcurrentHashMap<Integer, Integer> map = new ConcurrentHashMap<>(16); |
| 841 |
+ |
try { |
| 842 |
+ |
for (int i = 0; i < 100; i++) { // force a resize |
| 843 |
+ |
map.computeIfAbsent(i, key -> findValue(map, key)); |
| 844 |
+ |
} |
| 845 |
+ |
fail("recursive computeIfAbsent should throw IllegalStateException"); |
| 846 |
+ |
} catch (IllegalStateException success) {} |
| 847 |
+ |
} |
| 848 |
+ |
|
| 849 |
+ |
private Integer findValue(ConcurrentHashMap<Integer, Integer> map, |
| 850 |
+ |
Integer key) { |
| 851 |
+ |
return (key % 5 == 0) ? key : |
| 852 |
+ |
map.computeIfAbsent(key + 1, k -> findValue(map, k)); |
| 853 |
+ |
} |
| 854 |
+ |
|
| 855 |
|
} |
