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 |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
import junit.framework.*; |
11 |
|
|
12 |
|
public class ConcurrentSkipListMapTest extends JSR166TestCase { |
13 |
|
public static void main(String[] args) { |
14 |
< |
junit.textui.TestRunner.run (suite()); |
14 |
> |
junit.textui.TestRunner.run(suite()); |
15 |
|
} |
16 |
|
public static Test suite() { |
17 |
|
return new TestSuite(ConcurrentSkipListMapTest.class); |
34 |
|
} |
35 |
|
|
36 |
|
/** |
37 |
< |
* clear removes all pairs |
37 |
> |
* clear removes all pairs |
38 |
|
*/ |
39 |
|
public void testClear() { |
40 |
|
ConcurrentSkipListMap map = map5(); |
52 |
|
} |
53 |
|
|
54 |
|
/** |
55 |
< |
* Maps with same contents are equal |
55 |
> |
* Maps with same contents are equal |
56 |
|
*/ |
57 |
|
public void testEquals() { |
58 |
|
ConcurrentSkipListMap map1 = map5(); |
65 |
|
} |
66 |
|
|
67 |
|
/** |
68 |
< |
* containsKey returns true for contained key |
68 |
> |
* containsKey returns true for contained key |
69 |
|
*/ |
70 |
|
public void testContainsKey() { |
71 |
|
ConcurrentSkipListMap map = map5(); |
74 |
|
} |
75 |
|
|
76 |
|
/** |
77 |
< |
* containsValue returns true for held values |
77 |
> |
* containsValue returns true for held values |
78 |
|
*/ |
79 |
|
public void testContainsValue() { |
80 |
|
ConcurrentSkipListMap map = map5(); |
83 |
|
} |
84 |
|
|
85 |
|
/** |
86 |
< |
* get returns the correct element at the given key, |
87 |
< |
* or null if not present |
86 |
> |
* get returns the correct element at the given key, |
87 |
> |
* or null if not present |
88 |
|
*/ |
89 |
|
public void testGet() { |
90 |
|
ConcurrentSkipListMap map = map5(); |
94 |
|
} |
95 |
|
|
96 |
|
/** |
97 |
< |
* isEmpty is true of empty map and false for non-empty |
97 |
> |
* isEmpty is true of empty map and false for non-empty |
98 |
|
*/ |
99 |
|
public void testIsEmpty() { |
100 |
|
ConcurrentSkipListMap empty = new ConcurrentSkipListMap(); |
104 |
|
} |
105 |
|
|
106 |
|
/** |
107 |
< |
* firstKey returns first key |
107 |
> |
* firstKey returns first key |
108 |
|
*/ |
109 |
|
public void testFirstKey() { |
110 |
|
ConcurrentSkipListMap map = map5(); |
112 |
|
} |
113 |
|
|
114 |
|
/** |
115 |
< |
* lastKey returns last key |
115 |
> |
* lastKey returns last key |
116 |
|
*/ |
117 |
|
public void testLastKey() { |
118 |
|
ConcurrentSkipListMap map = map5(); |
119 |
|
assertEquals(five, map.lastKey()); |
120 |
|
} |
121 |
|
|
122 |
– |
|
122 |
|
/** |
123 |
< |
* keySet.toArray returns contains all keys |
123 |
> |
* keySet.toArray returns contains all keys |
124 |
|
*/ |
125 |
|
public void testKeySetToArray() { |
126 |
|
ConcurrentSkipListMap map = map5(); |
133 |
|
} |
134 |
|
|
135 |
|
/** |
136 |
< |
* descendingkeySet.toArray returns contains all keys |
136 |
> |
* descendingkeySet.toArray returns contains all keys |
137 |
|
*/ |
138 |
|
public void testDescendingKeySetToArray() { |
139 |
|
ConcurrentSkipListMap map = map5(); |
146 |
|
} |
147 |
|
|
148 |
|
/** |
149 |
< |
* keySet returns a Set containing all the keys |
149 |
> |
* keySet returns a Set containing all the keys |
150 |
|
*/ |
151 |
|
public void testKeySet() { |
152 |
|
ConcurrentSkipListMap map = map5(); |
160 |
|
} |
161 |
|
|
162 |
|
/** |
163 |
< |
* keySet is ordered |
163 |
> |
* keySet is ordered |
164 |
|
*/ |
165 |
|
public void testKeySetOrder() { |
166 |
|
ConcurrentSkipListMap map = map5(); |
198 |
|
} |
199 |
|
|
200 |
|
/** |
201 |
< |
* descendingKeySet is ordered |
201 |
> |
* descendingKeySet is ordered |
202 |
|
*/ |
203 |
|
public void testDescendingKeySetOrder() { |
204 |
|
ConcurrentSkipListMap map = map5(); |
217 |
|
} |
218 |
|
|
219 |
|
/** |
220 |
< |
* descending iterator of descendingKeySet is ordered |
220 |
> |
* descending iterator of descendingKeySet is ordered |
221 |
|
*/ |
222 |
|
public void testDescendingKeySetDescendingIteratorOrder() { |
223 |
|
ConcurrentSkipListMap map = map5(); |
236 |
|
} |
237 |
|
|
238 |
|
/** |
239 |
< |
* Values.toArray contains all values |
239 |
> |
* Values.toArray contains all values |
240 |
|
*/ |
241 |
|
public void testValuesToArray() { |
242 |
|
ConcurrentSkipListMap map = map5(); |
304 |
|
} |
305 |
|
|
306 |
|
/** |
307 |
< |
* entrySet.toArray contains all entries |
307 |
> |
* entrySet.toArray contains all entries |
308 |
|
*/ |
309 |
|
public void testEntrySetToArray() { |
310 |
|
ConcurrentSkipListMap map = map5(); |
318 |
|
} |
319 |
|
|
320 |
|
/** |
321 |
< |
* descendingEntrySet.toArray contains all entries |
321 |
> |
* descendingEntrySet.toArray contains all entries |
322 |
|
*/ |
323 |
|
public void testDescendingEntrySetToArray() { |
324 |
|
ConcurrentSkipListMap map = map5(); |
332 |
|
} |
333 |
|
|
334 |
|
/** |
335 |
< |
* putAll adds all key-value pairs from the given map |
335 |
> |
* putAll adds all key-value pairs from the given map |
336 |
|
*/ |
337 |
|
public void testPutAll() { |
338 |
|
ConcurrentSkipListMap empty = new ConcurrentSkipListMap(); |
347 |
|
} |
348 |
|
|
349 |
|
/** |
350 |
< |
* putIfAbsent works when the given key is not present |
350 |
> |
* putIfAbsent works when the given key is not present |
351 |
|
*/ |
352 |
|
public void testPutIfAbsent() { |
353 |
|
ConcurrentSkipListMap map = map5(); |
356 |
|
} |
357 |
|
|
358 |
|
/** |
359 |
< |
* putIfAbsent does not add the pair if the key is already present |
359 |
> |
* putIfAbsent does not add the pair if the key is already present |
360 |
|
*/ |
361 |
|
public void testPutIfAbsent2() { |
362 |
|
ConcurrentSkipListMap map = map5(); |
364 |
|
} |
365 |
|
|
366 |
|
/** |
367 |
< |
* replace fails when the given key is not present |
367 |
> |
* replace fails when the given key is not present |
368 |
|
*/ |
369 |
|
public void testReplace() { |
370 |
|
ConcurrentSkipListMap map = map5(); |
373 |
|
} |
374 |
|
|
375 |
|
/** |
376 |
< |
* replace succeeds if the key is already present |
376 |
> |
* replace succeeds if the key is already present |
377 |
|
*/ |
378 |
|
public void testReplace2() { |
379 |
|
ConcurrentSkipListMap map = map5(); |
381 |
|
assertEquals("Z", map.get(one)); |
382 |
|
} |
383 |
|
|
385 |
– |
|
384 |
|
/** |
385 |
|
* replace value fails when the given key not mapped to expected value |
386 |
|
*/ |
401 |
|
assertEquals("Z", map.get(one)); |
402 |
|
} |
403 |
|
|
406 |
– |
|
404 |
|
/** |
405 |
< |
* remove removes the correct key-value pair from the map |
405 |
> |
* remove removes the correct key-value pair from the map |
406 |
|
*/ |
407 |
|
public void testRemove() { |
408 |
|
ConcurrentSkipListMap map = map5(); |
424 |
|
map.remove(four, "A"); |
425 |
|
assertEquals(4, map.size()); |
426 |
|
assertTrue(map.containsKey(four)); |
430 |
– |
|
427 |
|
} |
428 |
|
|
429 |
|
/** |
442 |
|
|
443 |
|
Map.Entry e4 = map.lowerEntry(zero); |
444 |
|
assertNull(e4); |
449 |
– |
|
445 |
|
} |
446 |
|
|
447 |
|
/** |
460 |
|
|
461 |
|
Map.Entry e4 = map.higherEntry(six); |
462 |
|
assertNull(e4); |
468 |
– |
|
463 |
|
} |
464 |
|
|
465 |
|
/** |
478 |
|
|
479 |
|
Map.Entry e4 = map.floorEntry(zero); |
480 |
|
assertNull(e4); |
487 |
– |
|
481 |
|
} |
482 |
|
|
483 |
|
/** |
496 |
|
|
497 |
|
Map.Entry e4 = map.ceilingEntry(six); |
498 |
|
assertNull(e4); |
506 |
– |
|
499 |
|
} |
500 |
|
|
501 |
|
/** |
502 |
|
* lowerEntry, higherEntry, ceilingEntry, and floorEntry return |
503 |
< |
* imutable entries |
503 |
> |
* immutable entries |
504 |
|
*/ |
505 |
|
public void testEntryImmutablity() { |
506 |
|
ConcurrentSkipListMap map = map5(); |
508 |
|
assertEquals(two, e.getKey()); |
509 |
|
try { |
510 |
|
e.setValue("X"); |
511 |
< |
fail(); |
511 |
> |
shouldThrow(); |
512 |
|
} catch (UnsupportedOperationException success) {} |
513 |
|
e = map.higherEntry(zero); |
514 |
|
assertEquals(one, e.getKey()); |
515 |
|
try { |
516 |
|
e.setValue("X"); |
517 |
< |
fail(); |
517 |
> |
shouldThrow(); |
518 |
|
} catch (UnsupportedOperationException success) {} |
519 |
|
e = map.floorEntry(one); |
520 |
|
assertEquals(one, e.getKey()); |
521 |
|
try { |
522 |
|
e.setValue("X"); |
523 |
< |
fail(); |
523 |
> |
shouldThrow(); |
524 |
|
} catch (UnsupportedOperationException success) {} |
525 |
|
e = map.ceilingEntry(five); |
526 |
|
assertEquals(five, e.getKey()); |
527 |
|
try { |
528 |
|
e.setValue("X"); |
529 |
< |
fail(); |
529 |
> |
shouldThrow(); |
530 |
|
} catch (UnsupportedOperationException success) {} |
531 |
|
} |
532 |
|
|
533 |
|
|
542 |
– |
|
534 |
|
/** |
535 |
|
* lowerKey returns preceding element |
536 |
|
*/ |
547 |
|
|
548 |
|
Object e4 = q.lowerKey(zero); |
549 |
|
assertNull(e4); |
559 |
– |
|
550 |
|
} |
551 |
|
|
552 |
|
/** |
565 |
|
|
566 |
|
Object e4 = q.higherKey(six); |
567 |
|
assertNull(e4); |
578 |
– |
|
568 |
|
} |
569 |
|
|
570 |
|
/** |
583 |
|
|
584 |
|
Object e4 = q.floorKey(zero); |
585 |
|
assertNull(e4); |
597 |
– |
|
586 |
|
} |
587 |
|
|
588 |
|
/** |
601 |
|
|
602 |
|
Object e4 = q.ceilingKey(six); |
603 |
|
assertNull(e4); |
616 |
– |
|
604 |
|
} |
605 |
|
|
606 |
|
/** |
625 |
|
try { |
626 |
|
e.setValue("A"); |
627 |
|
shouldThrow(); |
628 |
< |
} catch (Exception ok) { |
642 |
< |
} |
628 |
> |
} catch (UnsupportedOperationException success) {} |
629 |
|
e = map.pollFirstEntry(); |
630 |
|
assertNull(e); |
631 |
|
} |
652 |
|
try { |
653 |
|
e.setValue("E"); |
654 |
|
shouldThrow(); |
655 |
< |
} catch (Exception ok) { |
670 |
< |
} |
655 |
> |
} catch (UnsupportedOperationException success) {} |
656 |
|
e = map.pollLastEntry(); |
657 |
|
assertNull(e); |
658 |
|
} |
659 |
|
|
660 |
|
/** |
661 |
< |
* size returns the correct values |
661 |
> |
* size returns the correct values |
662 |
|
*/ |
663 |
|
public void testSize() { |
664 |
|
ConcurrentSkipListMap map = map5(); |
674 |
|
ConcurrentSkipListMap map = map5(); |
675 |
|
String s = map.toString(); |
676 |
|
for (int i = 1; i <= 5; ++i) { |
677 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
677 |
> |
assertTrue(s.contains(String.valueOf(i))); |
678 |
|
} |
679 |
|
} |
680 |
|
|
688 |
|
ConcurrentSkipListMap c = map5(); |
689 |
|
c.get(null); |
690 |
|
shouldThrow(); |
691 |
< |
} catch (NullPointerException e) {} |
691 |
> |
} catch (NullPointerException success) {} |
692 |
|
} |
693 |
|
|
694 |
|
/** |
699 |
|
ConcurrentSkipListMap c = map5(); |
700 |
|
c.containsKey(null); |
701 |
|
shouldThrow(); |
702 |
< |
} catch (NullPointerException e) {} |
702 |
> |
} catch (NullPointerException success) {} |
703 |
|
} |
704 |
|
|
705 |
|
/** |
710 |
|
ConcurrentSkipListMap c = new ConcurrentSkipListMap(); |
711 |
|
c.containsValue(null); |
712 |
|
shouldThrow(); |
713 |
< |
} catch (NullPointerException e) {} |
713 |
> |
} catch (NullPointerException success) {} |
714 |
|
} |
715 |
|
|
731 |
– |
|
716 |
|
/** |
717 |
|
* put(null,x) throws NPE |
718 |
|
*/ |
721 |
|
ConcurrentSkipListMap c = map5(); |
722 |
|
c.put(null, "whatever"); |
723 |
|
shouldThrow(); |
724 |
< |
} catch (NullPointerException e) {} |
724 |
> |
} catch (NullPointerException success) {} |
725 |
|
} |
726 |
|
|
727 |
|
/** |
732 |
|
ConcurrentSkipListMap c = map5(); |
733 |
|
c.putIfAbsent(null, "whatever"); |
734 |
|
shouldThrow(); |
735 |
< |
} catch (NullPointerException e) {} |
735 |
> |
} catch (NullPointerException success) {} |
736 |
|
} |
737 |
|
|
738 |
|
/** |
743 |
|
ConcurrentSkipListMap c = map5(); |
744 |
|
c.replace(null, "whatever"); |
745 |
|
shouldThrow(); |
746 |
< |
} catch (NullPointerException e) {} |
746 |
> |
} catch (NullPointerException success) {} |
747 |
|
} |
748 |
|
|
749 |
|
/** |
754 |
|
ConcurrentSkipListMap c = map5(); |
755 |
|
c.replace(null, one, "whatever"); |
756 |
|
shouldThrow(); |
757 |
< |
} catch (NullPointerException e) {} |
757 |
> |
} catch (NullPointerException success) {} |
758 |
|
} |
759 |
|
|
760 |
|
/** |
766 |
|
c.put("sadsdf", "asdads"); |
767 |
|
c.remove(null); |
768 |
|
shouldThrow(); |
769 |
< |
} catch (NullPointerException e) {} |
769 |
> |
} catch (NullPointerException success) {} |
770 |
|
} |
771 |
|
|
772 |
|
/** |
778 |
|
c.put("sadsdf", "asdads"); |
779 |
|
c.remove(null, "whatever"); |
780 |
|
shouldThrow(); |
781 |
< |
} catch (NullPointerException e) {} |
781 |
> |
} catch (NullPointerException success) {} |
782 |
|
} |
783 |
|
|
784 |
|
/** |
785 |
|
* remove(x, null) returns false |
786 |
|
*/ |
787 |
|
public void testRemove3() { |
788 |
< |
try { |
789 |
< |
ConcurrentSkipListMap c = new ConcurrentSkipListMap(); |
790 |
< |
c.put("sadsdf", "asdads"); |
807 |
< |
assertFalse(c.remove("sadsdf", null)); |
808 |
< |
} catch (NullPointerException e) { |
809 |
< |
fail(); |
810 |
< |
} |
788 |
> |
ConcurrentSkipListMap c = new ConcurrentSkipListMap(); |
789 |
> |
c.put("sadsdf", "asdads"); |
790 |
> |
assertFalse(c.remove("sadsdf", null)); |
791 |
|
} |
792 |
|
|
793 |
|
/** |
794 |
|
* A deserialized map equals original |
795 |
|
*/ |
796 |
< |
public void testSerialization() { |
796 |
> |
public void testSerialization() throws Exception { |
797 |
|
ConcurrentSkipListMap q = map5(); |
798 |
|
|
799 |
< |
try { |
800 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
801 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
802 |
< |
out.writeObject(q); |
803 |
< |
out.close(); |
804 |
< |
|
805 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
806 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
807 |
< |
ConcurrentSkipListMap r = (ConcurrentSkipListMap)in.readObject(); |
808 |
< |
assertEquals(q.size(), r.size()); |
809 |
< |
assertTrue(q.equals(r)); |
830 |
< |
assertTrue(r.equals(q)); |
831 |
< |
} catch (Exception e) { |
832 |
< |
e.printStackTrace(); |
833 |
< |
unexpectedException(); |
834 |
< |
} |
799 |
> |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
800 |
> |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
801 |
> |
out.writeObject(q); |
802 |
> |
out.close(); |
803 |
> |
|
804 |
> |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
805 |
> |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
806 |
> |
ConcurrentSkipListMap r = (ConcurrentSkipListMap)in.readObject(); |
807 |
> |
assertEquals(q.size(), r.size()); |
808 |
> |
assertTrue(q.equals(r)); |
809 |
> |
assertTrue(r.equals(q)); |
810 |
|
} |
811 |
|
|
837 |
– |
|
838 |
– |
|
812 |
|
/** |
813 |
|
* subMap returns map with keys in requested range |
814 |
|
*/ |
845 |
|
assertEquals(1, sm.size()); |
846 |
|
assertEquals(three, sm.firstKey()); |
847 |
|
assertEquals(three, sm.lastKey()); |
848 |
< |
assertTrue(sm.remove(three) != null); |
848 |
> |
assertEquals("C", sm.remove(three)); |
849 |
|
assertTrue(sm.isEmpty()); |
850 |
|
assertEquals(3, map.size()); |
851 |
|
} |
878 |
|
assertEquals(4, map.size()); |
879 |
|
assertEquals(0, sm.size()); |
880 |
|
assertTrue(sm.isEmpty()); |
881 |
< |
assertTrue(sm.remove(three) == null); |
881 |
> |
assertSame(sm.remove(three), null); |
882 |
|
assertEquals(4, map.size()); |
883 |
|
} |
884 |
|
|
960 |
|
NavigableMap ssm = sm.tailMap(four, true); |
961 |
|
assertEquals(four, ssm.firstKey()); |
962 |
|
assertEquals(five, ssm.lastKey()); |
963 |
< |
assertTrue(ssm.remove(four) != null); |
963 |
> |
assertEquals("D", ssm.remove(four)); |
964 |
|
assertEquals(1, ssm.size()); |
965 |
|
assertEquals(3, sm.size()); |
966 |
|
assertEquals(4, map.size()); |
972 |
|
/** |
973 |
|
* Submaps of submaps subdivide correctly |
974 |
|
*/ |
975 |
< |
public void testRecursiveSubMaps() { |
976 |
< |
int mapSize = 1000; |
975 |
> |
public void testRecursiveSubMaps() throws Exception { |
976 |
> |
int mapSize = expensiveTests ? 1000 : 100; |
977 |
|
Class cl = ConcurrentSkipListMap.class; |
978 |
|
NavigableMap<Integer, Integer> map = newMap(cl); |
979 |
|
bs = new BitSet(mapSize); |
990 |
|
0, mapSize - 1, true); |
991 |
|
} |
992 |
|
|
993 |
< |
static NavigableMap<Integer, Integer> newMap(Class cl) { |
994 |
< |
NavigableMap<Integer, Integer> result = null; |
995 |
< |
try { |
1023 |
< |
result = (NavigableMap<Integer, Integer>) cl.newInstance(); |
1024 |
< |
} catch (Exception e) { |
1025 |
< |
fail(); |
1026 |
< |
} |
993 |
> |
static NavigableMap<Integer, Integer> newMap(Class cl) throws Exception { |
994 |
> |
NavigableMap<Integer, Integer> result = |
995 |
> |
(NavigableMap<Integer, Integer>) cl.newInstance(); |
996 |
|
assertEquals(result.size(), 0); |
997 |
|
assertFalse(result.keySet().iterator().hasNext()); |
998 |
|
return result; |
1055 |
|
} else { |
1056 |
|
try { |
1057 |
|
map.put(key, 2 * key); |
1058 |
< |
fail(); |
1059 |
< |
} catch (IllegalArgumentException e) { |
1091 |
< |
// expected |
1092 |
< |
} |
1058 |
> |
shouldThrow(); |
1059 |
> |
} catch (IllegalArgumentException success) {} |
1060 |
|
} |
1061 |
|
} |
1062 |
|
} |
1154 |
|
*/ |
1155 |
|
void check(NavigableMap<Integer, Integer> map, |
1156 |
|
final int min, final int max, final boolean ascending) { |
1157 |
< |
class ReferenceSet { |
1157 |
> |
class ReferenceSet { |
1158 |
|
int lower(int key) { |
1159 |
|
return ascending ? lowerAscending(key) : higherAscending(key); |
1160 |
|
} |
1185 |
|
// BitSet should support this! Test would run much faster |
1186 |
|
while (key >= min) { |
1187 |
|
if (bs.get(key)) |
1188 |
< |
return(key); |
1188 |
> |
return key; |
1189 |
|
key--; |
1190 |
|
} |
1191 |
|
return -1; |
1251 |
|
assertEq(rs.last(), -1); |
1252 |
|
try { |
1253 |
|
map.firstKey(); |
1254 |
< |
fail(); |
1255 |
< |
} catch (NoSuchElementException e) { |
1289 |
< |
// expected |
1290 |
< |
} |
1254 |
> |
shouldThrow(); |
1255 |
> |
} catch (NoSuchElementException success) {} |
1256 |
|
try { |
1257 |
|
map.lastKey(); |
1258 |
< |
fail(); |
1259 |
< |
} catch (NoSuchElementException e) { |
1295 |
< |
// expected |
1296 |
< |
} |
1258 |
> |
shouldThrow(); |
1259 |
> |
} catch (NoSuchElementException success) {} |
1260 |
|
} |
1261 |
|
} |
1262 |
|
|