1 |
|
/* |
2 |
< |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
< |
* Expert Group and released to the public domain, as explained at |
2 |
> |
* Written by Doug Lea and Martin Buchholz with assistance from |
3 |
> |
* members of JCP JSR-166 Expert Group and released to the public |
4 |
> |
* domain, as explained at |
5 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
6 |
|
* Other contributors include Andrew Wright, Jeffrey Hayes, |
7 |
|
* Pat Fisher, Mike Judd. |
17 |
|
import java.util.Random; |
18 |
|
import java.util.Set; |
19 |
|
import java.util.concurrent.ConcurrentHashMap; |
19 |
– |
import java.util.concurrent.ExecutorService; |
20 |
– |
import java.util.concurrent.Executors; |
20 |
|
|
21 |
|
import junit.framework.Test; |
23 |
– |
import junit.framework.TestSuite; |
22 |
|
|
23 |
|
public class ConcurrentHashMapTest extends JSR166TestCase { |
24 |
|
public static void main(String[] args) { |
25 |
|
main(suite(), args); |
26 |
|
} |
27 |
|
public static Test suite() { |
28 |
< |
return new TestSuite(ConcurrentHashMapTest.class); |
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; } |
33 |
> |
public boolean isConcurrent() { return true; } |
34 |
> |
public boolean permitsNullKeys() { return false; } |
35 |
> |
public boolean permitsNullValues() { return false; } |
36 |
> |
public boolean supportsSetValue() { return true; } |
37 |
> |
} |
38 |
> |
return newTestSuite( |
39 |
> |
ConcurrentHashMapTest.class, |
40 |
> |
MapTest.testSuite(new Implementation())); |
41 |
|
} |
42 |
|
|
43 |
|
/** |
56 |
|
return map; |
57 |
|
} |
58 |
|
|
49 |
– |
/** Re-implement Integer.compare for old java versions */ |
50 |
– |
static int compare(int x, int y) { |
51 |
– |
return (x < y) ? -1 : (x > y) ? 1 : 0; |
52 |
– |
} |
53 |
– |
|
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 = |
122 |
< |
new ConcurrentHashMap<BI, Boolean>(); |
126 |
> |
ConcurrentHashMap<BI, Boolean> m = new ConcurrentHashMap<>(); |
127 |
|
for (int i = 0; i < size; i++) { |
128 |
< |
assertTrue(m.put(new CI(i), true) == null); |
128 |
> |
assertNull(m.put(new CI(i), true)); |
129 |
|
} |
130 |
|
for (int i = 0; i < size; i++) { |
131 |
|
assertTrue(m.containsKey(new CI(i))); |
139 |
|
*/ |
140 |
|
public void testGenericComparable() { |
141 |
|
int size = 120; // makes measured test run time -> 60ms |
142 |
< |
ConcurrentHashMap<Object, Boolean> m = |
139 |
< |
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); |
148 |
< |
assertTrue(m.putIfAbsent(bis, true) == null); |
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) |
151 |
|
assertTrue(m.containsKey(bss)); |
163 |
|
*/ |
164 |
|
public void testGenericComparable2() { |
165 |
|
int size = 500; // makes measured test run time -> 60ms |
166 |
< |
ConcurrentHashMap<Object, Boolean> m = |
164 |
< |
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 = |
182 |
< |
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; |
787 |
|
} |
788 |
|
|
789 |
|
/** |
790 |
< |
* A deserialized map equals original |
790 |
> |
* A deserialized/reserialized map equals original |
791 |
|
*/ |
792 |
|
public void testSerialization() throws Exception { |
793 |
|
Map x = map5(); |
838 |
|
assertEquals(mapSize, map.size()); |
839 |
|
} |
840 |
|
|
841 |
+ |
|
842 |
+ |
|
843 |
+ |
public void testReentrantComputeIfAbsent() { |
844 |
+ |
ConcurrentHashMap<Integer, Integer> map = new ConcurrentHashMap<>(16); |
845 |
+ |
try { |
846 |
+ |
for (int i = 0; i < 100; i++) { // force a resize |
847 |
+ |
map.computeIfAbsent(i, key -> findValue(map, key)); |
848 |
+ |
} |
849 |
+ |
fail("recursive computeIfAbsent"); |
850 |
+ |
} catch (IllegalStateException ex) { |
851 |
+ |
} |
852 |
+ |
} |
853 |
+ |
|
854 |
+ |
private Integer findValue(ConcurrentHashMap<Integer, Integer> map, |
855 |
+ |
Integer key) { |
856 |
+ |
return (key % 5 == 0) ? key : |
857 |
+ |
map.computeIfAbsent(key + 1, k -> findValue(map, k)); |
858 |
+ |
} |
859 |
+ |
|
860 |
|
} |