ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/ConcurrentHashMapTest.java
(Generate patch)

Comparing jsr166/src/test/tck/ConcurrentHashMapTest.java (file contents):
Revision 1.20 by jsr166, Tue Dec 1 09:48:13 2009 UTC vs.
Revision 1.31 by jsr166, Thu May 30 03:28:55 2013 UTC

# Line 1 | Line 1
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   * Other contributors include Andrew Wright, Jeffrey Hayes,
6   * Pat Fisher, Mike Judd.
7   */
8  
9   import junit.framework.*;
10   import java.util.*;
11 < import java.util.concurrent.*;
12 < import java.util.Enumeration;
13 < import java.io.*;
11 > import java.util.concurrent.ConcurrentHashMap;
12  
13   public class ConcurrentHashMapTest extends JSR166TestCase {
14      public static void main(String[] args) {
15 <        junit.textui.TestRunner.run (suite());
15 >        junit.textui.TestRunner.run(suite());
16      }
17      public static Test suite() {
18          return new TestSuite(ConcurrentHashMapTest.class);
19      }
20  
21      /**
22 <     * Create a map from Integers 1-5 to Strings "A"-"E".
22 >     * Returns a new map from Integers 1-5 to Strings "A"-"E".
23       */
24      private static ConcurrentHashMap map5() {
25          ConcurrentHashMap map = new ConcurrentHashMap(5);
# Line 36 | Line 34 | public class ConcurrentHashMapTest exten
34          return map;
35      }
36  
37 +    // classes for testing Comparable fallbacks
38 +    static class BI implements Comparable<BI> {
39 +        private final int value;
40 +        BI(int value) { this.value = value; }
41 +        public int compareTo(BI other) {
42 +            return Integer.compare(value, other.value);
43 +        }
44 +        public boolean equals(Object x) {
45 +            return (x instanceof BI) && ((BI)x).value == value;
46 +        }
47 +        public int hashCode() { return 42; }
48 +    }
49 +    static class CI extends BI { CI(int value) { super(value); } }
50 +    static class DI extends BI { DI(int value) { super(value); } }
51 +
52 +    static class BS implements Comparable<BS> {
53 +        private final String value;
54 +        BS(String value) { this.value = value; }
55 +        public int compareTo(BS other) {
56 +            return value.compareTo(other.value);
57 +        }
58 +        public boolean equals(Object x) {
59 +            return (x instanceof BS) && value.equals(((BS)x).value);
60 +        }
61 +        public int hashCode() { return 42; }
62 +    }
63 +
64 +    static class LexicographicList<E extends Comparable<E>> extends ArrayList<E>
65 +        implements Comparable<LexicographicList<E>> {
66 +        LexicographicList(Collection<E> c) { super(c); }
67 +        LexicographicList(E e) { super(Collections.singleton(e)); }
68 +        public int compareTo(LexicographicList<E> other) {
69 +            int common = Math.min(size(), other.size());
70 +            int r = 0;
71 +            for (int i = 0; i < common; i++) {
72 +                if ((r = get(i).compareTo(other.get(i))) != 0)
73 +                    break;
74 +            }
75 +            if (r == 0)
76 +                r = Integer.compare(size(), other.size());
77 +            return r;
78 +        }
79 +        private static final long serialVersionUID = 0;
80 +    }
81 +
82 +    /**
83 +     * Inserted elements that are subclasses of the same Comparable
84 +     * class are found.
85 +     */
86 +    public void testComparableFamily() {
87 +        ConcurrentHashMap<BI, Boolean> m = new ConcurrentHashMap<>();
88 +        for (int i = 0; i < 1000; i++) {
89 +            assertTrue(m.put(new CI(i), true) == null);
90 +        }
91 +        for (int i = 0; i < 1000; i++) {
92 +            assertTrue(m.containsKey(new CI(i)));
93 +            assertTrue(m.containsKey(new DI(i)));
94 +        }
95 +    }
96 +
97 +    /**
98 +     * Elements of classes with erased generic type parameters based
99 +     * on Comparable can be inserted and found.
100 +     */
101 +    public void testGenericComparable() {
102 +        ConcurrentHashMap<Object, Boolean> m = new ConcurrentHashMap<>();
103 +        for (int i = 0; i < 1000; i++) {
104 +            BI bi = new BI(i);
105 +            BS bs = new BS(String.valueOf(i));
106 +            LexicographicList<BI> bis = new LexicographicList<BI>(bi);
107 +            LexicographicList<BS> bss = new LexicographicList<BS>(bs);
108 +            assertTrue(m.putIfAbsent(bis, true) == null);
109 +            assertTrue(m.containsKey(bis));
110 +            if (m.putIfAbsent(bss, true) == null)
111 +                assertTrue(m.containsKey(bss));
112 +            assertTrue(m.containsKey(bis));
113 +        }
114 +        for (int i = 0; i < 1000; i++) {
115 +            assertTrue(m.containsKey(new ArrayList(Collections.singleton(new BI(i)))));
116 +        }
117 +    }
118 +
119 +    /**
120 +     * Elements of non-comparable classes equal to those of classes
121 +     * with erased generic type parameters based on Comparable can be
122 +     * inserted and found.
123 +     */
124 +    public void testGenericComparable2() {
125 +        ConcurrentHashMap<Object, Boolean> m = new ConcurrentHashMap<>();
126 +        for (int i = 0; i < 1000; i++) {
127 +            m.put(new ArrayList(Collections.singleton(new BI(i))), true);
128 +        }
129 +
130 +        for (int i = 0; i < 1000; i++) {
131 +            LexicographicList<BI> bis = new LexicographicList<BI>(new BI(i));
132 +            assertTrue(m.containsKey(bis));
133 +        }
134 +    }
135 +
136      /**
137 <     *  clear removes all pairs
137 >     * clear removes all pairs
138       */
139      public void testClear() {
140          ConcurrentHashMap map = map5();
141          map.clear();
142 <        assertEquals(map.size(), 0);
142 >        assertEquals(0, map.size());
143      }
144  
145      /**
146 <     *  Maps with same contents are equal
146 >     * Maps with same contents are equal
147       */
148      public void testEquals() {
149          ConcurrentHashMap map1 = map5();
# Line 59 | Line 156 | public class ConcurrentHashMapTest exten
156      }
157  
158      /**
159 <     *  contains returns true for contained value
159 >     * contains returns true for contained value
160       */
161      public void testContains() {
162          ConcurrentHashMap map = map5();
# Line 68 | Line 165 | public class ConcurrentHashMapTest exten
165      }
166  
167      /**
168 <     *  containsKey returns true for contained key
168 >     * containsKey returns true for contained key
169       */
170      public void testContainsKey() {
171          ConcurrentHashMap map = map5();
# Line 77 | Line 174 | public class ConcurrentHashMapTest exten
174      }
175  
176      /**
177 <     *  containsValue returns true for held values
177 >     * containsValue returns true for held values
178       */
179      public void testContainsValue() {
180          ConcurrentHashMap map = map5();
# Line 86 | Line 183 | public class ConcurrentHashMapTest exten
183      }
184  
185      /**
186 <     *   enumeration returns an enumeration containing the correct
187 <     *   elements
186 >     * enumeration returns an enumeration containing the correct
187 >     * elements
188       */
189      public void testEnumeration() {
190          ConcurrentHashMap map = map5();
# Line 101 | Line 198 | public class ConcurrentHashMapTest exten
198      }
199  
200      /**
201 <     *  get returns the correct element at the given key,
202 <     *  or null if not present
201 >     * get returns the correct element at the given key,
202 >     * or null if not present
203       */
204      public void testGet() {
205          ConcurrentHashMap map = map5();
# Line 112 | Line 209 | public class ConcurrentHashMapTest exten
209      }
210  
211      /**
212 <     *  isEmpty is true of empty map and false for non-empty
212 >     * isEmpty is true of empty map and false for non-empty
213       */
214      public void testIsEmpty() {
215          ConcurrentHashMap empty = new ConcurrentHashMap();
# Line 122 | Line 219 | public class ConcurrentHashMapTest exten
219      }
220  
221      /**
222 <     *   keys returns an enumeration containing all the keys from the map
222 >     * keys returns an enumeration containing all the keys from the map
223       */
224      public void testKeys() {
225          ConcurrentHashMap map = map5();
# Line 136 | Line 233 | public class ConcurrentHashMapTest exten
233      }
234  
235      /**
236 <     *   keySet returns a Set containing all the keys
236 >     * keySet returns a Set containing all the keys
237       */
238      public void testKeySet() {
239          ConcurrentHashMap map = map5();
# Line 150 | Line 247 | public class ConcurrentHashMapTest exten
247      }
248  
249      /**
250 <     *  keySet.toArray returns contains all keys
250 >     * keySet.toArray returns contains all keys
251       */
252      public void testKeySetToArray() {
253          ConcurrentHashMap map = map5();
# Line 163 | Line 260 | public class ConcurrentHashMapTest exten
260      }
261  
262      /**
263 <     *  Values.toArray contains all values
263 >     * Values.toArray contains all values
264       */
265      public void testValuesToArray() {
266          ConcurrentHashMap map = map5();
# Line 179 | Line 276 | public class ConcurrentHashMapTest exten
276      }
277  
278      /**
279 <     *  entrySet.toArray contains all entries
279 >     * entrySet.toArray contains all entries
280       */
281      public void testEntrySetToArray() {
282          ConcurrentHashMap map = map5();
# Line 226 | Line 323 | public class ConcurrentHashMapTest exten
323      }
324  
325      /**
326 <     *   putAll  adds all key-value pairs from the given map
326 >     * putAll adds all key-value pairs from the given map
327       */
328      public void testPutAll() {
329          ConcurrentHashMap empty = new ConcurrentHashMap();
# Line 241 | Line 338 | public class ConcurrentHashMapTest exten
338      }
339  
340      /**
341 <     *   putIfAbsent works when the given key is not present
341 >     * putIfAbsent works when the given key is not present
342       */
343      public void testPutIfAbsent() {
344          ConcurrentHashMap map = map5();
# Line 250 | Line 347 | public class ConcurrentHashMapTest exten
347      }
348  
349      /**
350 <     *   putIfAbsent does not add the pair if the key is already present
350 >     * putIfAbsent does not add the pair if the key is already present
351       */
352      public void testPutIfAbsent2() {
353          ConcurrentHashMap map = map5();
# Line 258 | Line 355 | public class ConcurrentHashMapTest exten
355      }
356  
357      /**
358 <     *   replace fails when the given key is not present
358 >     * replace fails when the given key is not present
359       */
360      public void testReplace() {
361          ConcurrentHashMap map = map5();
# Line 267 | Line 364 | public class ConcurrentHashMapTest exten
364      }
365  
366      /**
367 <     *   replace succeeds if the key is already present
367 >     * replace succeeds if the key is already present
368       */
369      public void testReplace2() {
370          ConcurrentHashMap map = map5();
# Line 275 | Line 372 | public class ConcurrentHashMapTest exten
372          assertEquals("Z", map.get(one));
373      }
374  
278
375      /**
376       * replace value fails when the given key not mapped to expected value
377       */
# Line 296 | Line 392 | public class ConcurrentHashMapTest exten
392          assertEquals("Z", map.get(one));
393      }
394  
299
395      /**
396 <     *   remove removes the correct key-value pair from the map
396 >     * remove removes the correct key-value pair from the map
397       */
398      public void testRemove() {
399          ConcurrentHashMap map = map5();
# Line 321 | Line 416 | public class ConcurrentHashMapTest exten
416      }
417  
418      /**
419 <     *   size returns the correct values
419 >     * size returns the correct values
420       */
421      public void testSize() {
422          ConcurrentHashMap map = map5();
# Line 337 | Line 432 | public class ConcurrentHashMapTest exten
432          ConcurrentHashMap map = map5();
433          String s = map.toString();
434          for (int i = 1; i <= 5; ++i) {
435 <            assertTrue(s.indexOf(String.valueOf(i)) >= 0);
435 >            assertTrue(s.contains(String.valueOf(i)));
436          }
437      }
438  
# Line 483 | Line 578 | public class ConcurrentHashMapTest exten
578          } catch (NullPointerException success) {}
579      }
580  
486
581      /**
582       * replace(x, null) throws NPE
583       */
# Line 517 | Line 611 | public class ConcurrentHashMapTest exten
611          } catch (NullPointerException success) {}
612      }
613  
520
614      /**
615       * remove(null) throws NPE
616       */
# Line 555 | Line 648 | public class ConcurrentHashMapTest exten
648       * A deserialized map equals original
649       */
650      public void testSerialization() throws Exception {
651 <        ConcurrentHashMap q = map5();
651 >        Map x = map5();
652 >        Map y = serialClone(x);
653  
654 <        ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
655 <        ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
656 <        out.writeObject(q);
657 <        out.close();
564 <
565 <        ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
566 <        ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
567 <        ConcurrentHashMap r = (ConcurrentHashMap)in.readObject();
568 <        assertEquals(q.size(), r.size());
569 <        assertTrue(q.equals(r));
570 <        assertTrue(r.equals(q));
654 >        assertNotSame(x, y);
655 >        assertEquals(x.size(), y.size());
656 >        assertEquals(x, y);
657 >        assertEquals(y, x);
658      }
659  
573
660      /**
661       * SetValue of an EntrySet entry sets value in the map.
662       */
# Line 582 | Line 668 | public class ConcurrentHashMapTest exten
668              map.put(new Integer(i), new Integer(i));
669          assertFalse(map.isEmpty());
670          Map.Entry entry1 = (Map.Entry)map.entrySet().iterator().next();
671 <
672 <        // assert that entry1 is not 16
673 <        assertTrue("entry is 16, test not valid",
674 <                   !entry1.getKey().equals(new Integer(16)));
675 <
676 <        // remove 16 (a different key) from map
677 <        // which just happens to cause entry1 to be cloned in map
678 <        map.remove(new Integer(16));
679 <        entry1.setValue("XYZ");
594 <        assertTrue(map.containsValue("XYZ")); // fails
671 >        // Unless it happens to be first (in which case remainder of
672 >        // test is skipped), remove a possibly-colliding key from map
673 >        // which, under some implementations, may cause entry1 to be
674 >        // cloned in map
675 >        if (!entry1.getKey().equals(new Integer(16))) {
676 >            map.remove(new Integer(16));
677 >            entry1.setValue("XYZ");
678 >            assertTrue(map.containsValue("XYZ")); // fails if write-through broken
679 >        }
680      }
681  
682   }

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines