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. |
19 |
|
import java.util.concurrent.ConcurrentHashMap; |
20 |
|
|
21 |
|
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()); |
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 |
|
/** |
44 |
|
* Returns a new map from Integers 1-5 to Strings "A"-"E". |
45 |
|
*/ |
46 |
|
private static ConcurrentHashMap<Integer, String> map5() { |
47 |
< |
ConcurrentHashMap map = new ConcurrentHashMap<Integer, String>(5); |
47 |
> |
ConcurrentHashMap<Integer, String> map = new ConcurrentHashMap<>(5); |
48 |
|
assertTrue(map.isEmpty()); |
49 |
|
map.put(one, "A"); |
50 |
|
map.put(two, "B"); |
57 |
|
} |
58 |
|
|
59 |
|
/** Re-implement Integer.compare for old java versions */ |
60 |
< |
static int compare(int x, int y) { return x < y ? -1 : x > y ? 1 : 0; } |
60 |
> |
static int compare(int x, int y) { |
61 |
> |
return (x < y) ? -1 : (x > y) ? 1 : 0; |
62 |
> |
} |
63 |
|
|
64 |
|
// classes for testing Comparable fallbacks |
65 |
|
static class BI implements Comparable<BI> { |
131 |
|
ConcurrentHashMap<BI, Boolean> m = |
132 |
|
new ConcurrentHashMap<BI, Boolean>(); |
133 |
|
for (int i = 0; i < size; i++) { |
134 |
< |
assertTrue(m.put(new CI(i), true) == null); |
134 |
> |
assertNull(m.put(new CI(i), true)); |
135 |
|
} |
136 |
|
for (int i = 0; i < size; i++) { |
137 |
|
assertTrue(m.containsKey(new CI(i))); |
152 |
|
BS bs = new BS(String.valueOf(i)); |
153 |
|
LexicographicList<BI> bis = new LexicographicList<BI>(bi); |
154 |
|
LexicographicList<BS> bss = new LexicographicList<BS>(bs); |
155 |
< |
assertTrue(m.putIfAbsent(bis, true) == null); |
155 |
> |
assertNull(m.putIfAbsent(bis, true)); |
156 |
|
assertTrue(m.containsKey(bis)); |
157 |
|
if (m.putIfAbsent(bss, true) == null) |
158 |
|
assertTrue(m.containsKey(bss)); |
343 |
|
} |
344 |
|
|
345 |
|
/** |
346 |
+ |
* Test keySet().removeAll on empty map |
347 |
+ |
*/ |
348 |
+ |
public void testKeySet_empty_removeAll() { |
349 |
+ |
ConcurrentHashMap<Integer, String> map = new ConcurrentHashMap<>(); |
350 |
+ |
Set<Integer> set = map.keySet(); |
351 |
+ |
set.removeAll(Collections.emptyList()); |
352 |
+ |
assertTrue(map.isEmpty()); |
353 |
+ |
assertTrue(set.isEmpty()); |
354 |
+ |
// following is test for JDK-8163353 |
355 |
+ |
set.removeAll(Collections.emptySet()); |
356 |
+ |
assertTrue(map.isEmpty()); |
357 |
+ |
assertTrue(set.isEmpty()); |
358 |
+ |
} |
359 |
+ |
|
360 |
+ |
/** |
361 |
|
* keySet.toArray returns contains all keys |
362 |
|
*/ |
363 |
|
public void testKeySetToArray() { |
562 |
|
/** |
563 |
|
* Constructor (initialCapacity, loadFactor) throws |
564 |
|
* IllegalArgumentException if either argument is negative |
565 |
< |
*/ |
565 |
> |
*/ |
566 |
|
public void testConstructor2() { |
567 |
|
try { |
568 |
|
new ConcurrentHashMap(-1, .75f); |
623 |
|
* get(null) throws NPE |
624 |
|
*/ |
625 |
|
public void testGet_NullPointerException() { |
626 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
627 |
|
try { |
598 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
628 |
|
c.get(null); |
629 |
|
shouldThrow(); |
630 |
|
} catch (NullPointerException success) {} |
634 |
|
* containsKey(null) throws NPE |
635 |
|
*/ |
636 |
|
public void testContainsKey_NullPointerException() { |
637 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
638 |
|
try { |
609 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
639 |
|
c.containsKey(null); |
640 |
|
shouldThrow(); |
641 |
|
} catch (NullPointerException success) {} |
645 |
|
* containsValue(null) throws NPE |
646 |
|
*/ |
647 |
|
public void testContainsValue_NullPointerException() { |
648 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
649 |
|
try { |
620 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
650 |
|
c.containsValue(null); |
651 |
|
shouldThrow(); |
652 |
|
} catch (NullPointerException success) {} |
656 |
|
* contains(null) throws NPE |
657 |
|
*/ |
658 |
|
public void testContains_NullPointerException() { |
659 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
660 |
|
try { |
631 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
661 |
|
c.contains(null); |
662 |
|
shouldThrow(); |
663 |
|
} catch (NullPointerException success) {} |
667 |
|
* put(null,x) throws NPE |
668 |
|
*/ |
669 |
|
public void testPut1_NullPointerException() { |
670 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
671 |
|
try { |
642 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
672 |
|
c.put(null, "whatever"); |
673 |
|
shouldThrow(); |
674 |
|
} catch (NullPointerException success) {} |
678 |
|
* put(x, null) throws NPE |
679 |
|
*/ |
680 |
|
public void testPut2_NullPointerException() { |
681 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
682 |
|
try { |
653 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
683 |
|
c.put("whatever", null); |
684 |
|
shouldThrow(); |
685 |
|
} catch (NullPointerException success) {} |
689 |
|
* putIfAbsent(null, x) throws NPE |
690 |
|
*/ |
691 |
|
public void testPutIfAbsent1_NullPointerException() { |
692 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
693 |
|
try { |
664 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
694 |
|
c.putIfAbsent(null, "whatever"); |
695 |
|
shouldThrow(); |
696 |
|
} catch (NullPointerException success) {} |
700 |
|
* replace(null, x) throws NPE |
701 |
|
*/ |
702 |
|
public void testReplace_NullPointerException() { |
703 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
704 |
|
try { |
675 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
705 |
|
c.replace(null, "whatever"); |
706 |
|
shouldThrow(); |
707 |
|
} catch (NullPointerException success) {} |
711 |
|
* replace(null, x, y) throws NPE |
712 |
|
*/ |
713 |
|
public void testReplaceValue_NullPointerException() { |
714 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
715 |
|
try { |
686 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
716 |
|
c.replace(null, one, "whatever"); |
717 |
|
shouldThrow(); |
718 |
|
} catch (NullPointerException success) {} |
722 |
|
* putIfAbsent(x, null) throws NPE |
723 |
|
*/ |
724 |
|
public void testPutIfAbsent2_NullPointerException() { |
725 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
726 |
|
try { |
697 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
727 |
|
c.putIfAbsent("whatever", null); |
728 |
|
shouldThrow(); |
729 |
|
} catch (NullPointerException success) {} |
733 |
|
* replace(x, null) throws NPE |
734 |
|
*/ |
735 |
|
public void testReplace2_NullPointerException() { |
736 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
737 |
|
try { |
708 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
738 |
|
c.replace("whatever", null); |
739 |
|
shouldThrow(); |
740 |
|
} catch (NullPointerException success) {} |
744 |
|
* replace(x, null, y) throws NPE |
745 |
|
*/ |
746 |
|
public void testReplaceValue2_NullPointerException() { |
747 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
748 |
|
try { |
719 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
749 |
|
c.replace("whatever", null, "A"); |
750 |
|
shouldThrow(); |
751 |
|
} catch (NullPointerException success) {} |
755 |
|
* replace(x, y, null) throws NPE |
756 |
|
*/ |
757 |
|
public void testReplaceValue3_NullPointerException() { |
758 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
759 |
|
try { |
730 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
760 |
|
c.replace("whatever", one, null); |
761 |
|
shouldThrow(); |
762 |
|
} catch (NullPointerException success) {} |
766 |
|
* remove(null) throws NPE |
767 |
|
*/ |
768 |
|
public void testRemove1_NullPointerException() { |
769 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
770 |
+ |
c.put("sadsdf", "asdads"); |
771 |
|
try { |
741 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
742 |
– |
c.put("sadsdf", "asdads"); |
772 |
|
c.remove(null); |
773 |
|
shouldThrow(); |
774 |
|
} catch (NullPointerException success) {} |
778 |
|
* remove(null, x) throws NPE |
779 |
|
*/ |
780 |
|
public void testRemove2_NullPointerException() { |
781 |
+ |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
782 |
+ |
c.put("sadsdf", "asdads"); |
783 |
|
try { |
753 |
– |
ConcurrentHashMap c = new ConcurrentHashMap(5); |
754 |
– |
c.put("sadsdf", "asdads"); |
784 |
|
c.remove(null, "whatever"); |
785 |
|
shouldThrow(); |
786 |
|
} catch (NullPointerException success) {} |
796 |
|
} |
797 |
|
|
798 |
|
/** |
799 |
< |
* A deserialized map equals original |
799 |
> |
* A deserialized/reserialized map equals original |
800 |
|
*/ |
801 |
|
public void testSerialization() throws Exception { |
802 |
|
Map x = map5(); |
830 |
|
} |
831 |
|
} |
832 |
|
|
833 |
+ |
/** |
834 |
+ |
* Tests performance of removeAll when the other collection is much smaller. |
835 |
+ |
* ant -Djsr166.tckTestClass=ConcurrentHashMapTest -Djsr166.methodFilter=testRemoveAll_performance -Djsr166.expensiveTests=true tck |
836 |
+ |
*/ |
837 |
+ |
public void testRemoveAll_performance() { |
838 |
+ |
final int mapSize = expensiveTests ? 1_000_000 : 100; |
839 |
+ |
final int iterations = expensiveTests ? 500 : 2; |
840 |
+ |
final ConcurrentHashMap<Integer, Integer> map = new ConcurrentHashMap<>(); |
841 |
+ |
for (int i = 0; i < mapSize; i++) |
842 |
+ |
map.put(i, i); |
843 |
+ |
Set<Integer> keySet = map.keySet(); |
844 |
+ |
Collection<Integer> removeMe = Arrays.asList(new Integer[] { -99, -86 }); |
845 |
+ |
for (int i = 0; i < iterations; i++) |
846 |
+ |
assertFalse(keySet.removeAll(removeMe)); |
847 |
+ |
assertEquals(mapSize, map.size()); |
848 |
+ |
} |
849 |
+ |
|
850 |
|
} |