6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
< |
import junit.framework.*; |
10 |
< |
import java.util.*; |
9 |
> |
import java.util.ArrayList; |
10 |
> |
import java.util.Arrays; |
11 |
> |
import java.util.Collection; |
12 |
> |
import java.util.Collections; |
13 |
> |
import java.util.Enumeration; |
14 |
> |
import java.util.Iterator; |
15 |
> |
import java.util.Map; |
16 |
> |
import java.util.Random; |
17 |
> |
import java.util.Set; |
18 |
|
import java.util.concurrent.ConcurrentHashMap; |
19 |
|
|
20 |
+ |
import junit.framework.Test; |
21 |
+ |
import junit.framework.TestSuite; |
22 |
+ |
|
23 |
|
public class ConcurrentHashMapTest extends JSR166TestCase { |
24 |
|
public static void main(String[] args) { |
25 |
|
junit.textui.TestRunner.run(suite()); |
31 |
|
/** |
32 |
|
* Returns a new map from Integers 1-5 to Strings "A"-"E". |
33 |
|
*/ |
34 |
< |
private static ConcurrentHashMap map5() { |
35 |
< |
ConcurrentHashMap map = new ConcurrentHashMap(5); |
34 |
> |
private static ConcurrentHashMap<Integer, String> map5() { |
35 |
> |
ConcurrentHashMap map = new ConcurrentHashMap<Integer, String>(5); |
36 |
|
assertTrue(map.isEmpty()); |
37 |
|
map.put(one, "A"); |
38 |
|
map.put(two, "B"); |
113 |
|
* class are found. |
114 |
|
*/ |
115 |
|
public void testComparableFamily() { |
116 |
+ |
int size = 500; // makes measured test run time -> 60ms |
117 |
|
ConcurrentHashMap<BI, Boolean> m = |
118 |
|
new ConcurrentHashMap<BI, Boolean>(); |
119 |
< |
for (int i = 0; i < 1000; i++) { |
119 |
> |
for (int i = 0; i < size; i++) { |
120 |
|
assertTrue(m.put(new CI(i), true) == null); |
121 |
|
} |
122 |
< |
for (int i = 0; i < 1000; i++) { |
122 |
> |
for (int i = 0; i < size; i++) { |
123 |
|
assertTrue(m.containsKey(new CI(i))); |
124 |
|
assertTrue(m.containsKey(new DI(i))); |
125 |
|
} |
130 |
|
* on Comparable can be inserted and found. |
131 |
|
*/ |
132 |
|
public void testGenericComparable() { |
133 |
+ |
int size = 120; // makes measured test run time -> 60ms |
134 |
|
ConcurrentHashMap<Object, Boolean> m = |
135 |
|
new ConcurrentHashMap<Object, Boolean>(); |
136 |
< |
for (int i = 0; i < 1000; i++) { |
136 |
> |
for (int i = 0; i < size; i++) { |
137 |
|
BI bi = new BI(i); |
138 |
|
BS bs = new BS(String.valueOf(i)); |
139 |
|
LexicographicList<BI> bis = new LexicographicList<BI>(bi); |
144 |
|
assertTrue(m.containsKey(bss)); |
145 |
|
assertTrue(m.containsKey(bis)); |
146 |
|
} |
147 |
< |
for (int i = 0; i < 1000; i++) { |
148 |
< |
assertTrue(m.containsKey(new ArrayList(Collections.singleton(new BI(i))))); |
147 |
> |
for (int i = 0; i < size; i++) { |
148 |
> |
assertTrue(m.containsKey(Collections.singletonList(new BI(i)))); |
149 |
|
} |
150 |
|
} |
151 |
|
|
155 |
|
* inserted and found. |
156 |
|
*/ |
157 |
|
public void testGenericComparable2() { |
158 |
+ |
int size = 500; // makes measured test run time -> 60ms |
159 |
|
ConcurrentHashMap<Object, Boolean> m = |
160 |
|
new ConcurrentHashMap<Object, Boolean>(); |
161 |
< |
for (int i = 0; i < 1000; i++) { |
162 |
< |
m.put(new ArrayList(Collections.singleton(new BI(i))), true); |
161 |
> |
for (int i = 0; i < size; i++) { |
162 |
> |
m.put(Collections.singletonList(new BI(i)), true); |
163 |
|
} |
164 |
|
|
165 |
< |
for (int i = 0; i < 1000; i++) { |
165 |
> |
for (int i = 0; i < size; i++) { |
166 |
|
LexicographicList<BI> bis = new LexicographicList<BI>(new BI(i)); |
167 |
|
assertTrue(m.containsKey(bis)); |
168 |
|
} |
173 |
|
* can be inserted and found. |
174 |
|
*/ |
175 |
|
public void testMixedComparable() { |
176 |
< |
int size = 10000; |
176 |
> |
int size = 1200; // makes measured test run time -> 35ms |
177 |
|
ConcurrentHashMap<Object, Object> map = |
178 |
|
new ConcurrentHashMap<Object, Object>(); |
179 |
< |
Random rng = new Random(1370014958369218000L); |
179 |
> |
Random rng = new Random(); |
180 |
|
for (int i = 0; i < size; i++) { |
181 |
|
Object x; |
182 |
|
switch (rng.nextInt(4)) { |
226 |
|
} |
227 |
|
|
228 |
|
/** |
229 |
+ |
* hashCode() equals sum of each key.hashCode ^ value.hashCode |
230 |
+ |
*/ |
231 |
+ |
public void testHashCode() { |
232 |
+ |
ConcurrentHashMap<Integer,String> map = map5(); |
233 |
+ |
int sum = 0; |
234 |
+ |
for (Map.Entry<Integer,String> e : map.entrySet()) |
235 |
+ |
sum += e.getKey().hashCode() ^ e.getValue().hashCode(); |
236 |
+ |
assertEquals(sum, map.hashCode()); |
237 |
+ |
} |
238 |
+ |
|
239 |
+ |
/** |
240 |
|
* contains returns true for contained value |
241 |
|
*/ |
242 |
|
public void testContains() { |
287 |
|
assertEquals("A", (String)map.get(one)); |
288 |
|
ConcurrentHashMap empty = new ConcurrentHashMap(); |
289 |
|
assertNull(map.get("anything")); |
290 |
+ |
assertNull(empty.get("anything")); |
291 |
|
} |
292 |
|
|
293 |
|
/** |
521 |
|
// Exception tests |
522 |
|
|
523 |
|
/** |
524 |
< |
* Cannot create with negative capacity |
524 |
> |
* Cannot create with only negative capacity |
525 |
|
*/ |
526 |
|
public void testConstructor1() { |
527 |
|
try { |
528 |
< |
new ConcurrentHashMap(-1,0,1); |
528 |
> |
new ConcurrentHashMap(-1); |
529 |
|
shouldThrow(); |
530 |
|
} catch (IllegalArgumentException success) {} |
531 |
|
} |
532 |
|
|
533 |
|
/** |
534 |
< |
* Cannot create with negative concurrency level |
535 |
< |
*/ |
534 |
> |
* Constructor (initialCapacity, loadFactor) throws |
535 |
> |
* IllegalArgumentException if either argument is negative |
536 |
> |
*/ |
537 |
|
public void testConstructor2() { |
538 |
|
try { |
539 |
< |
new ConcurrentHashMap(1,0,-1); |
539 |
> |
new ConcurrentHashMap(-1, .75f); |
540 |
> |
shouldThrow(); |
541 |
> |
} catch (IllegalArgumentException success) {} |
542 |
> |
|
543 |
> |
try { |
544 |
> |
new ConcurrentHashMap(16, -1); |
545 |
|
shouldThrow(); |
546 |
|
} catch (IllegalArgumentException success) {} |
547 |
|
} |
548 |
|
|
549 |
|
/** |
550 |
< |
* Cannot create with only negative capacity |
550 |
> |
* Constructor (initialCapacity, loadFactor, concurrencyLevel) |
551 |
> |
* throws IllegalArgumentException if any argument is negative |
552 |
|
*/ |
553 |
|
public void testConstructor3() { |
554 |
|
try { |
555 |
< |
new ConcurrentHashMap(-1); |
555 |
> |
new ConcurrentHashMap(-1, .75f, 1); |
556 |
|
shouldThrow(); |
557 |
|
} catch (IllegalArgumentException success) {} |
558 |
+ |
|
559 |
+ |
try { |
560 |
+ |
new ConcurrentHashMap(16, -1, 1); |
561 |
+ |
shouldThrow(); |
562 |
+ |
} catch (IllegalArgumentException success) {} |
563 |
+ |
|
564 |
+ |
try { |
565 |
+ |
new ConcurrentHashMap(16, .75f, -1); |
566 |
+ |
shouldThrow(); |
567 |
+ |
} catch (IllegalArgumentException success) {} |
568 |
+ |
} |
569 |
+ |
|
570 |
+ |
/** |
571 |
+ |
* ConcurrentHashMap(map) throws NullPointerException if the given |
572 |
+ |
* map is null |
573 |
+ |
*/ |
574 |
+ |
public void testConstructor4() { |
575 |
+ |
try { |
576 |
+ |
new ConcurrentHashMap(null); |
577 |
+ |
shouldThrow(); |
578 |
+ |
} catch (NullPointerException success) {} |
579 |
+ |
} |
580 |
+ |
|
581 |
+ |
/** |
582 |
+ |
* ConcurrentHashMap(map) creates a new map with the same mappings |
583 |
+ |
* as the given map |
584 |
+ |
*/ |
585 |
+ |
public void testConstructor5() { |
586 |
+ |
ConcurrentHashMap map1 = map5(); |
587 |
+ |
ConcurrentHashMap map2 = new ConcurrentHashMap(map5()); |
588 |
+ |
assertTrue(map2.equals(map1)); |
589 |
+ |
map2.put(one, "F"); |
590 |
+ |
assertFalse(map2.equals(map1)); |
591 |
|
} |
592 |
|
|
593 |
|
/** |