ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/ConcurrentHashMapTest.java

Comparing jsr166/src/test/tck/ConcurrentHashMapTest.java (file contents):
Revision 1.1 by dl, Sun Aug 31 19:24:54 2003 UTC vs.
Revision 1.36 by dl, Sun Jul 21 22:24:18 2013 UTC

#	Line 1 | Line 1
1		/*
2	<	* Written by members of JCP JSR-166 Expert Group and released to the
3	<	* public domain. Use, modify, and redistribute this code in any way
4	<	* without acknowledgement. Other contributors include Andrew Wright,
5	<	* Jeffrey Hayes, Pat Fischer, Mike Judd.
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/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.*;
11	<	import java.util.Enumeration;
11	>	import java.util.concurrent.ConcurrentHashMap;
12
13	<	public class ConcurrentHashMapTest extends TestCase{
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);
18	>	return new TestSuite(ConcurrentHashMapTest.class);
19		}
20
21	<	static final Integer one = new Integer(1);
22	<	static final Integer two = new Integer(2);
23	<	static final Integer three = new Integer(3);
24	<	static final Integer four = new Integer(4);
25	<	static final Integer five = new Integer(5);
26	<
27	<	private static ConcurrentHashMap map5() {
28	<	ConcurrentHashMap map = new ConcurrentHashMap(5);
21	>	/**
22	>	* Returns a new map from Integers 1-5 to Strings "A"-"E".
23	>	*/
24	>	private static ConcurrentHashMap<Integer, String> map5() {
25	>	ConcurrentHashMap map = new ConcurrentHashMap<Integer, String>(5);
26		assertTrue(map.isEmpty());
27	<	map.put(one, "A");
28	<	map.put(two, "B");
29	<	map.put(three, "C");
30	<	map.put(four, "D");
31	<	map.put(five, "E");
27	>	map.put(one, "A");
28	>	map.put(two, "B");
29	>	map.put(three, "C");
30	>	map.put(four, "D");
31	>	map.put(five, "E");
32		assertFalse(map.isEmpty());
33		assertEquals(5, map.size());
34	<	return map;
34	>	return map;
35	>	}
36	>
37	>	/** Re-implement Integer.compare for old java versions */
38	>	static int compare(int x, int y) { return x < y ? -1 : x > y ? 1 : 0; }
39	>
40	>	// classes for testing Comparable fallbacks
41	>	static class BI implements Comparable<BI> {
42	>	private final int value;
43	>	BI(int value) { this.value = value; }
44	>	public int compareTo(BI other) {
45	>	return compare(value, other.value);
46	>	}
47	>	public boolean equals(Object x) {
48	>	return (x instanceof BI) && ((BI)x).value == value;
49	>	}
50	>	public int hashCode() { return 42; }
51	>	}
52	>	static class CI extends BI { CI(int value) { super(value); } }
53	>	static class DI extends BI { DI(int value) { super(value); } }
54	>
55	>	static class BS implements Comparable<BS> {
56	>	private final String value;
57	>	BS(String value) { this.value = value; }
58	>	public int compareTo(BS other) {
59	>	return value.compareTo(other.value);
60	>	}
61	>	public boolean equals(Object x) {
62	>	return (x instanceof BS) && value.equals(((BS)x).value);
63	>	}
64	>	public int hashCode() { return 42; }
65	>	}
66	>
67	>	static class LexicographicList<E extends Comparable<E>> extends ArrayList<E>
68	>	implements Comparable<LexicographicList<E>> {
69	>	LexicographicList(Collection<E> c) { super(c); }
70	>	LexicographicList(E e) { super(Collections.singleton(e)); }
71	>	public int compareTo(LexicographicList<E> other) {
72	>	int common = Math.min(size(), other.size());
73	>	int r = 0;
74	>	for (int i = 0; i < common; i++) {
75	>	if ((r = get(i).compareTo(other.get(i))) != 0)
76	>	break;
77	>	}
78	>	if (r == 0)
79	>	r = compare(size(), other.size());
80	>	return r;
81	>	}
82	>	private static final long serialVersionUID = 0;
83	>	}
84	>
85	>	static class CollidingObject {
86	>	final String value;
87	>	CollidingObject(final String value) { this.value = value; }
88	>	public int hashCode() { return this.value.hashCode() & 1; }
89	>	public boolean equals(final Object obj) {
90	>	return (obj instanceof CollidingObject) && ((CollidingObject)obj).value.equals(value);
91	>	}
92	>	}
93	>
94	>	static class ComparableCollidingObject extends CollidingObject implements Comparable<ComparableCollidingObject> {
95	>	ComparableCollidingObject(final String value) { super(value); }
96	>	public int compareTo(final ComparableCollidingObject o) {
97	>	return value.compareTo(o.value);
98	>	}
99		}
100
101		/**
102	<	*  Test to verify clear correctly removes all key-element pairs from the map
102	>	* Inserted elements that are subclasses of the same Comparable
103	>	* class are found.
104		*/
105	<	public void testClear(){
106	<	ConcurrentHashMap map = map5();
107	<	map.clear();
108	<	assertEquals(map.size(), 0);
105	>	public void testComparableFamily() {
106	>	ConcurrentHashMap<BI, Boolean> m =
107	>	new ConcurrentHashMap<BI, Boolean>();
108	>	for (int i = 0; i < 1000; i++) {
109	>	assertTrue(m.put(new CI(i), true) == null);
110	>	}
111	>	for (int i = 0; i < 1000; i++) {
112	>	assertTrue(m.containsKey(new CI(i)));
113	>	assertTrue(m.containsKey(new DI(i)));
114	>	}
115		}
116
117		/**
118	<	*  Test to verify contains gives the appropriate value
118	>	* Elements of classes with erased generic type parameters based
119	>	* on Comparable can be inserted and found.
120		*/
121	<	public void testContains(){
122	<	ConcurrentHashMap map = map5();
123	<	assertTrue(map.contains("A"));
124	<	assertFalse(map.contains("Z"));
121	>	public void testGenericComparable() {
122	>	ConcurrentHashMap<Object, Boolean> m =
123	>	new ConcurrentHashMap<Object, Boolean>();
124	>	for (int i = 0; i < 1000; i++) {
125	>	BI bi = new BI(i);
126	>	BS bs = new BS(String.valueOf(i));
127	>	LexicographicList<BI> bis = new LexicographicList<BI>(bi);
128	>	LexicographicList<BS> bss = new LexicographicList<BS>(bs);
129	>	assertTrue(m.putIfAbsent(bis, true) == null);
130	>	assertTrue(m.containsKey(bis));
131	>	if (m.putIfAbsent(bss, true) == null)
132	>	assertTrue(m.containsKey(bss));
133	>	assertTrue(m.containsKey(bis));
134	>	}
135	>	for (int i = 0; i < 1000; i++) {
136	>	assertTrue(m.containsKey(new ArrayList(Collections.singleton(new BI(i)))));
137	>	}
138		}
139	<
139	>
140		/**
141	<	*  Test to verify containsKey gives the appropriate value
141	>	* Elements of non-comparable classes equal to those of classes
142	>	* with erased generic type parameters based on Comparable can be
143	>	* inserted and found.
144	>	*/
145	>	public void testGenericComparable2() {
146	>	ConcurrentHashMap<Object, Boolean> m =
147	>	new ConcurrentHashMap<Object, Boolean>();
148	>	for (int i = 0; i < 1000; i++) {
149	>	m.put(new ArrayList(Collections.singleton(new BI(i))), true);
150	>	}
151	>
152	>	for (int i = 0; i < 1000; i++) {
153	>	LexicographicList<BI> bis = new LexicographicList<BI>(new BI(i));
154	>	assertTrue(m.containsKey(bis));
155	>	}
156	>	}
157	>
158	>	/**
159	>	* Mixtures of instances of comparable and non-comparable classes
160	>	* can be inserted and found.
161	>	*/
162	>	public void testMixedComparable() {
163	>	int size = 10000;
164	>	ConcurrentHashMap<Object, Object> map =
165	>	new ConcurrentHashMap<Object, Object>();
166	>	Random rng = new Random(1370014958369218000L);
167	>	for (int i = 0; i < size; i++) {
168	>	Object x;
169	>	switch (rng.nextInt(4)) {
170	>	case 0:
171	>	x = new Object();
172	>	break;
173	>	case 1:
174	>	x = new CollidingObject(Integer.toString(i));
175	>	break;
176	>	default:
177	>	x = new ComparableCollidingObject(Integer.toString(i));
178	>	}
179	>	assertNull(map.put(x, x));
180	>	}
181	>	int count = 0;
182	>	for (Object k : map.keySet()) {
183	>	assertEquals(map.get(k), k);
184	>	++count;
185	>	}
186	>	assertEquals(count, size);
187	>	assertEquals(map.size(), size);
188	>	for (Object k : map.keySet()) {
189	>	assertEquals(map.put(k, k), k);
190	>	}
191	>	}
192	>
193	>	/**
194	>	* clear removes all pairs
195		*/
196	<	public void testContainsKey(){
196	>	public void testClear() {
197		ConcurrentHashMap map = map5();
198	<	assertTrue(map.containsKey(one));
199	<	assertFalse(map.containsKey(new Integer(100)));
198	>	map.clear();
199	>	assertEquals(0, map.size());
200		}
201
202		/**
203	<	*  Identical to normal contains
203	>	* Maps with same contents are equal
204		*/
205	<	public void testContainsValue(){
205	>	public void testEquals() {
206	>	ConcurrentHashMap map1 = map5();
207	>	ConcurrentHashMap map2 = map5();
208	>	assertEquals(map1, map2);
209	>	assertEquals(map2, map1);
210	>	map1.clear();
211	>	assertFalse(map1.equals(map2));
212	>	assertFalse(map2.equals(map1));
213	>	}
214	>
215	>
216	>	/**
217	>	* hashCode() equals sum of each key.hashCode ^ value.hashCode
218	>	*/
219	>	public void testHashCode() {
220	>	ConcurrentHashMap<Integer,String> map = map5();
221	>	int sum = 0;
222	>	for (Map.Entry<Integer,String> e : map.entrySet())
223	>	sum += e.getKey().hashCode() ^ e.getValue().hashCode();
224	>	assertEquals(sum, map.hashCode());
225	>	}
226	>
227	>	/**
228	>	* contains returns true for contained value
229	>	*/
230	>	public void testContains() {
231		ConcurrentHashMap map = map5();
232	<	assertTrue(map.contains("A"));
232	>	assertTrue(map.contains("A"));
233		assertFalse(map.contains("Z"));
234		}
235
236		/**
237	<	*  tes to verify enumeration returns an enumeration containing the correct elements
237	>	* containsKey returns true for contained key
238		*/
239	<	public void testEnumeration(){
239	>	public void testContainsKey() {
240		ConcurrentHashMap map = map5();
241	<	Enumeration e = map.elements();
242	<	int count = 0;
83	<	while(e.hasMoreElements()){
84	<	count++;
85	<	e.nextElement();
86	<	}
87	<	assertEquals(5, count);
241	>	assertTrue(map.containsKey(one));
242	>	assertFalse(map.containsKey(zero));
243		}
244
245		/**
246	<	*  Test to verify get returns the correct element at the given index
246	>	* containsValue returns true for held values
247		*/
248	<	public void testGet(){
248	>	public void testContainsValue() {
249		ConcurrentHashMap map = map5();
250	<	assertEquals("A", (String)map.get(one));
250	>	assertTrue(map.containsValue("A"));
251	>	assertFalse(map.containsValue("Z"));
252		}
253
254		/**
255	<	*  Test to verify get on a nonexistant key returns null
255	>	* enumeration returns an enumeration containing the correct
256	>	* elements
257		*/
258	<	public void testGet2(){
258	>	public void testEnumeration() {
259	>	ConcurrentHashMap map = map5();
260	>	Enumeration e = map.elements();
261	>	int count = 0;
262	>	while (e.hasMoreElements()) {
263	>	count++;
264	>	e.nextElement();
265	>	}
266	>	assertEquals(5, count);
267	>	}
268	>
269	>	/**
270	>	* get returns the correct element at the given key,
271	>	* or null if not present
272	>	*/
273	>	public void testGet() {
274	>	ConcurrentHashMap map = map5();
275	>	assertEquals("A", (String)map.get(one));
276		ConcurrentHashMap empty = new ConcurrentHashMap();
277	<	assertNull(empty.get("anything"));
277	>	assertNull(map.get("anything"));
278		}
279
280		/**
281	<	*  Simple test to verify isEmpty returns the correct value
281	>	* isEmpty is true of empty map and false for non-empty
282		*/
283	<	public void testIsEmpty(){
283	>	public void testIsEmpty() {
284		ConcurrentHashMap empty = new ConcurrentHashMap();
285		ConcurrentHashMap map = map5();
286	<	assertTrue(empty.isEmpty());
286	>	assertTrue(empty.isEmpty());
287		assertFalse(map.isEmpty());
288		}
289
290		/**
291	<	*  Test to verify keys returns an enumeration containing all the keys from the map
291	>	* keys returns an enumeration containing all the keys from the map
292	>	*/
293	>	public void testKeys() {
294	>	ConcurrentHashMap map = map5();
295	>	Enumeration e = map.keys();
296	>	int count = 0;
297	>	while (e.hasMoreElements()) {
298	>	count++;
299	>	e.nextElement();
300	>	}
301	>	assertEquals(5, count);
302	>	}
303	>
304	>	/**
305	>	* keySet returns a Set containing all the keys
306	>	*/
307	>	public void testKeySet() {
308	>	ConcurrentHashMap map = map5();
309	>	Set s = map.keySet();
310	>	assertEquals(5, s.size());
311	>	assertTrue(s.contains(one));
312	>	assertTrue(s.contains(two));
313	>	assertTrue(s.contains(three));
314	>	assertTrue(s.contains(four));
315	>	assertTrue(s.contains(five));
316	>	}
317	>
318	>	/**
319	>	* keySet.toArray returns contains all keys
320		*/
321	<	public void testKeys(){
321	>	public void testKeySetToArray() {
322		ConcurrentHashMap map = map5();
323	<	Enumeration e = map.keys();
324	<	int count = 0;
325	<	while(e.hasMoreElements()){
326	<	count++;
327	<	e.nextElement();
328	<	}
127	<	assertEquals(5, count);
323	>	Set s = map.keySet();
324	>	Object[] ar = s.toArray();
325	>	assertTrue(s.containsAll(Arrays.asList(ar)));
326	>	assertEquals(5, ar.length);
327	>	ar[0] = m10;
328	>	assertFalse(s.containsAll(Arrays.asList(ar)));
329		}
330
331		/**
332	<	*  Test to verify keySet returns a Set containing all the keys
332	>	* Values.toArray contains all values
333		*/
334	<	public void testKeySet(){
334	>	public void testValuesToArray() {
335		ConcurrentHashMap map = map5();
336	<	Set s = map.keySet();
337	<	assertEquals(5, s.size());
338	<	assertTrue(s.contains(one));
339	<	assertTrue(s.contains(two));
340	<	assertTrue(s.contains(three));
341	<	assertTrue(s.contains(four));
342	<	assertTrue(s.contains(five));
336	>	Collection v = map.values();
337	>	Object[] ar = v.toArray();
338	>	ArrayList s = new ArrayList(Arrays.asList(ar));
339	>	assertEquals(5, ar.length);
340	>	assertTrue(s.contains("A"));
341	>	assertTrue(s.contains("B"));
342	>	assertTrue(s.contains("C"));
343	>	assertTrue(s.contains("D"));
344	>	assertTrue(s.contains("E"));
345		}
346
347	<	public void testValues(){
347	>	/**
348	>	* entrySet.toArray contains all entries
349	>	*/
350	>	public void testEntrySetToArray() {
351		ConcurrentHashMap map = map5();
352	<	Collection s = map.values();
353	<	assertEquals(5, s.size());
354	<	assertTrue(s.contains("A"));
355	<	assertTrue(s.contains("B"));
356	<	assertTrue(s.contains("C"));
357	<	assertTrue(s.contains("D"));
358	<	assertTrue(s.contains("E"));
352	>	Set s = map.entrySet();
353	>	Object[] ar = s.toArray();
354	>	assertEquals(5, ar.length);
355	>	for (int i = 0; i < 5; ++i) {
356	>	assertTrue(map.containsKey(((Map.Entry)(ar[i])).getKey()));
357	>	assertTrue(map.containsValue(((Map.Entry)(ar[i])).getValue()));
358	>	}
359		}
360
361	<	public void testEntrySet(){
361	>	/**
362	>	* values collection contains all values
363	>	*/
364	>	public void testValues() {
365		ConcurrentHashMap map = map5();
366	<	Set s = map.entrySet();
367	<	assertEquals(5, s.size());
366	>	Collection s = map.values();
367	>	assertEquals(5, s.size());
368	>	assertTrue(s.contains("A"));
369	>	assertTrue(s.contains("B"));
370	>	assertTrue(s.contains("C"));
371	>	assertTrue(s.contains("D"));
372	>	assertTrue(s.contains("E"));
373	>	}
374	>
375	>	/**
376	>	* entrySet contains all pairs
377	>	*/
378	>	public void testEntrySet() {
379	>	ConcurrentHashMap map = map5();
380	>	Set s = map.entrySet();
381	>	assertEquals(5, s.size());
382		Iterator it = s.iterator();
383		while (it.hasNext()) {
384		Map.Entry e = (Map.Entry) it.next();
385	<	assertTrue(
385	>	assertTrue(
386		(e.getKey().equals(one) && e.getValue().equals("A")) ||
387		(e.getKey().equals(two) && e.getValue().equals("B")) ||
388		(e.getKey().equals(three) && e.getValue().equals("C")) ||
#	Line 169 | Line 392 | public class ConcurrentHashMapTest exten
392		}
393
394		/**
395	<	*  Test to verify putAll correctly adds all key-value pairs from the given map
395	>	* putAll adds all key-value pairs from the given map
396		*/
397	<	public void testPutAll(){
397	>	public void testPutAll() {
398		ConcurrentHashMap empty = new ConcurrentHashMap();
399		ConcurrentHashMap map = map5();
400	<	empty.putAll(map);
401	<	assertEquals(5, empty.size());
402	<	assertTrue(empty.containsKey(one));
403	<	assertTrue(empty.containsKey(two));
404	<	assertTrue(empty.containsKey(three));
405	<	assertTrue(empty.containsKey(four));
406	<	assertTrue(empty.containsKey(five));
400	>	empty.putAll(map);
401	>	assertEquals(5, empty.size());
402	>	assertTrue(empty.containsKey(one));
403	>	assertTrue(empty.containsKey(two));
404	>	assertTrue(empty.containsKey(three));
405	>	assertTrue(empty.containsKey(four));
406	>	assertTrue(empty.containsKey(five));
407		}
408
409		/**
410	<	*  Test to verify putIfAbsent works when the given key is not present
410	>	* putIfAbsent works when the given key is not present
411		*/
412	<	public void testPutIfAbsent(){
412	>	public void testPutIfAbsent() {
413		ConcurrentHashMap map = map5();
414	<	map.putIfAbsent(new Integer(6), "Z");
415	<	assertTrue(map.containsKey(new Integer(6)));
414	>	map.putIfAbsent(six, "Z");
415	>	assertTrue(map.containsKey(six));
416		}
417
418		/**
419	<	*  Test to verify putIfAbsent does not add the pair if the key is already present
419	>	* putIfAbsent does not add the pair if the key is already present
420		*/
421	<	public void testPutIfAbsent2(){
421	>	public void testPutIfAbsent2() {
422		ConcurrentHashMap map = map5();
423		assertEquals("A", map.putIfAbsent(one, "Z"));
424		}
425
426		/**
427	<	*  Test to verify remove removes the correct key-value pair from the map
427	>	* replace fails when the given key is not present
428	>	*/
429	>	public void testReplace() {
430	>	ConcurrentHashMap map = map5();
431	>	assertNull(map.replace(six, "Z"));
432	>	assertFalse(map.containsKey(six));
433	>	}
434	>
435	>	/**
436	>	* replace succeeds if the key is already present
437	>	*/
438	>	public void testReplace2() {
439	>	ConcurrentHashMap map = map5();
440	>	assertNotNull(map.replace(one, "Z"));
441	>	assertEquals("Z", map.get(one));
442	>	}
443	>
444	>	/**
445	>	* replace value fails when the given key not mapped to expected value
446		*/
447	<	public void testRemove(){
447	>	public void testReplaceValue() {
448		ConcurrentHashMap map = map5();
449	<	map.remove(five);
450	<	assertEquals(4, map.size());
451	<	assertFalse(map.containsKey(five));
449	>	assertEquals("A", map.get(one));
450	>	assertFalse(map.replace(one, "Z", "Z"));
451	>	assertEquals("A", map.get(one));
452		}
453
454	<	public void testRemove2(){
454	>	/**
455	>	* replace value succeeds when the given key mapped to expected value
456	>	*/
457	>	public void testReplaceValue2() {
458		ConcurrentHashMap map = map5();
459	<	map.remove(five, "E");
460	<	assertEquals(4, map.size());
461	<	assertFalse(map.containsKey(five));
462	<	map.remove(four, "A");
219	<	assertEquals(4, map.size());
220	<	assertTrue(map.containsKey(four));
459	>	assertEquals("A", map.get(one));
460	>	assertTrue(map.replace(one, "A", "Z"));
461	>	assertEquals("Z", map.get(one));
462	>	}
463
464	+	/**
465	+	* remove removes the correct key-value pair from the map
466	+	*/
467	+	public void testRemove() {
468	+	ConcurrentHashMap map = map5();
469	+	map.remove(five);
470	+	assertEquals(4, map.size());
471	+	assertFalse(map.containsKey(five));
472	+	}
473	+
474	+	/**
475	+	* remove(key,value) removes only if pair present
476	+	*/
477	+	public void testRemove2() {
478	+	ConcurrentHashMap map = map5();
479	+	map.remove(five, "E");
480	+	assertEquals(4, map.size());
481	+	assertFalse(map.containsKey(five));
482	+	map.remove(four, "A");
483	+	assertEquals(4, map.size());
484	+	assertTrue(map.containsKey(four));
485		}
486
487		/**
488	<	*  Simple test to verify size returns the correct values
488	>	* size returns the correct values
489		*/
490	<	public void testSize(){
490	>	public void testSize() {
491		ConcurrentHashMap map = map5();
492		ConcurrentHashMap empty = new ConcurrentHashMap();
493	<	assertEquals(0, empty.size());
494	<	assertEquals(5, map.size());
493	>	assertEquals(0, empty.size());
494	>	assertEquals(5, map.size());
495		}
496
497	<	public void testToString(){
497	>	/**
498	>	* toString contains toString of elements
499	>	*/
500	>	public void testToString() {
501		ConcurrentHashMap map = map5();
502		String s = map.toString();
503		for (int i = 1; i <= 5; ++i) {
504	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
504	>	assertTrue(s.contains(String.valueOf(i)));
505		}
506	<	}
506	>	}
507
508		// Exception tests
243	–
244	–	public void testConstructor1(){
245	–	try{
246	–	new ConcurrentHashMap(-1,0,1);
247	–	fail("ConcurrentHashMap(int, float, int) should throw Illegal Argument Exception");
248	–	}catch(IllegalArgumentException e){}
249	–	}
250	–
251	–	public void testConstructor2(){
252	–	try{
253	–	new ConcurrentHashMap(1,0,-1);
254	–	fail("ConcurrentHashMap(int, float, int) should throw Illegal Argument Exception");
255	–	}catch(IllegalArgumentException e){}
256	–	}
509
510	<	public void testConstructor3(){
511	<	try{
510	>	/**
511	>	* Cannot create with only negative capacity
512	>	*/
513	>	public void testConstructor1() {
514	>	try {
515		new ConcurrentHashMap(-1);
516	<	fail("ConcurrentHashMap(int) should throw Illegal Argument Exception");
517	<	}catch(IllegalArgumentException e){}
516	>	shouldThrow();
517	>	} catch (IllegalArgumentException success) {}
518		}
519
520	<	public void testGet_NullPointerException(){
521	<	try{
520	>	/**
521	>	* Constructor (initialCapacity, loadFactor) throws
522	>	* IllegalArgumentException if either argument is negative
523	>	*/
524	>	public void testConstructor2() {
525	>	try {
526	>	new ConcurrentHashMap(-1, .75f);
527	>	shouldThrow();
528	>	} catch (IllegalArgumentException e) {}
529	>
530	>	try {
531	>	new ConcurrentHashMap(16, -1);
532	>	shouldThrow();
533	>	} catch (IllegalArgumentException e) {}
534	>	}
535	>
536	>	/**
537	>	* Constructor (initialCapacity, loadFactor, concurrencyLevel)
538	>	* throws IllegalArgumentException if any argument is negative
539	>	*/
540	>	public void testConstructor3() {
541	>	try {
542	>	new ConcurrentHashMap(-1, .75f, 1);
543	>	shouldThrow();
544	>	} catch (IllegalArgumentException e) {}
545	>
546	>	try {
547	>	new ConcurrentHashMap(16, -1, 1);
548	>	shouldThrow();
549	>	} catch (IllegalArgumentException e) {}
550	>
551	>	try {
552	>	new ConcurrentHashMap(16, .75f, -1);
553	>	shouldThrow();
554	>	} catch (IllegalArgumentException e) {}
555	>	}
556	>
557	>	/**
558	>	* ConcurrentHashMap(map) throws NullPointerException if the given
559	>	* map is null
560	>	*/
561	>	public void testConstructor4() {
562	>	try {
563	>	new ConcurrentHashMap(null);
564	>	shouldThrow();
565	>	} catch (NullPointerException e) {}
566	>	}
567	>
568	>	/**
569	>	* ConcurrentHashMap(map) creates a new map with the same mappings
570	>	* as the given map
571	>	*/
572	>	public void testConstructor5() {
573	>	ConcurrentHashMap map1 = map5();
574	>	ConcurrentHashMap map2 = new ConcurrentHashMap(map5());
575	>	assertTrue(map2.equals(map1));
576	>	map2.put(one, "F");
577	>	assertFalse(map2.equals(map1));
578	>	}
579	>
580	>
581	>	/**
582	>	* get(null) throws NPE
583	>	*/
584	>	public void testGet_NullPointerException() {
585	>	try {
586		ConcurrentHashMap c = new ConcurrentHashMap(5);
587		c.get(null);
588	<	fail("ConcurrentHashMap - Object get(Object) should throw Null Pointer exception");
589	<	}catch(NullPointerException e){}
588	>	shouldThrow();
589	>	} catch (NullPointerException success) {}
590		}
591
592	<	public void testContainsKey_NullPointerException(){
593	<	try{
592	>	/**
593	>	* containsKey(null) throws NPE
594	>	*/
595	>	public void testContainsKey_NullPointerException() {
596	>	try {
597		ConcurrentHashMap c = new ConcurrentHashMap(5);
598		c.containsKey(null);
599	<	fail("ConcurrenthashMap - boolean containsKey(Object) should throw Null Pointer exception");
600	<	}catch(NullPointerException e){}
599	>	shouldThrow();
600	>	} catch (NullPointerException success) {}
601		}
602
603	<	public void testContainsValue_NullPointerException(){
604	<	try{
603	>	/**
604	>	* containsValue(null) throws NPE
605	>	*/
606	>	public void testContainsValue_NullPointerException() {
607	>	try {
608		ConcurrentHashMap c = new ConcurrentHashMap(5);
609		c.containsValue(null);
610	<	fail("ConcurrentHashMap - boolean containsValue(Object) should throw Null Pointer exception");
611	<	}catch(NullPointerException e){}
610	>	shouldThrow();
611	>	} catch (NullPointerException success) {}
612		}
613
614	<	public void testContains_NullPointerException(){
615	<	try{
614	>	/**
615	>	* contains(null) throws NPE
616	>	*/
617	>	public void testContains_NullPointerException() {
618	>	try {
619		ConcurrentHashMap c = new ConcurrentHashMap(5);
620		c.contains(null);
621	<	fail("ConcurrentHashMap - boolean contains(Object) should throw Null Pointer exception");
622	<	}catch(NullPointerException e){}
621	>	shouldThrow();
622	>	} catch (NullPointerException success) {}
623		}
624
625	<	public void testPut1_NullPointerException(){
626	<	try{
625	>	/**
626	>	* put(null,x) throws NPE
627	>	*/
628	>	public void testPut1_NullPointerException() {
629	>	try {
630		ConcurrentHashMap c = new ConcurrentHashMap(5);
631		c.put(null, "whatever");
632	<	fail("ConcurrentHashMap - Object put(Object, Object) should throw Null Pointer exception");
633	<	}catch(NullPointerException e){}
632	>	shouldThrow();
633	>	} catch (NullPointerException success) {}
634		}
635
636	<	public void testPut2_NullPointerException(){
637	<	try{
636	>	/**
637	>	* put(x, null) throws NPE
638	>	*/
639	>	public void testPut2_NullPointerException() {
640	>	try {
641		ConcurrentHashMap c = new ConcurrentHashMap(5);
642		c.put("whatever", null);
643	<	fail("ConcurrentHashMap - Object put(Object, Object) should throw Null Pointer exception");
644	<	}catch(NullPointerException e){}
643	>	shouldThrow();
644	>	} catch (NullPointerException success) {}
645		}
646
647	<	public void testPutIfAbsent1_NullPointerException(){
648	<	try{
647	>	/**
648	>	* putIfAbsent(null, x) throws NPE
649	>	*/
650	>	public void testPutIfAbsent1_NullPointerException() {
651	>	try {
652		ConcurrentHashMap c = new ConcurrentHashMap(5);
653		c.putIfAbsent(null, "whatever");
654	<	fail("ConcurrentHashMap - Object putIfAbsent(Object, Object) should throw Null Pointer exception");
655	<	}catch(NullPointerException e){}
654	>	shouldThrow();
655	>	} catch (NullPointerException success) {}
656		}
657
658	<	public void testPutIfAbsent2_NullPointerException(){
659	<	try{
658	>	/**
659	>	* replace(null, x) throws NPE
660	>	*/
661	>	public void testReplace_NullPointerException() {
662	>	try {
663	>	ConcurrentHashMap c = new ConcurrentHashMap(5);
664	>	c.replace(null, "whatever");
665	>	shouldThrow();
666	>	} catch (NullPointerException success) {}
667	>	}
668	>
669	>	/**
670	>	* replace(null, x, y) throws NPE
671	>	*/
672	>	public void testReplaceValue_NullPointerException() {
673	>	try {
674	>	ConcurrentHashMap c = new ConcurrentHashMap(5);
675	>	c.replace(null, one, "whatever");
676	>	shouldThrow();
677	>	} catch (NullPointerException success) {}
678	>	}
679	>
680	>	/**
681	>	* putIfAbsent(x, null) throws NPE
682	>	*/
683	>	public void testPutIfAbsent2_NullPointerException() {
684	>	try {
685		ConcurrentHashMap c = new ConcurrentHashMap(5);
686		c.putIfAbsent("whatever", null);
687	<	fail("COncurrentHashMap - Object putIfAbsent(Object, Object) should throw Null Pointer exception");
688	<	}catch(NullPointerException e){}
687	>	shouldThrow();
688	>	} catch (NullPointerException success) {}
689		}
690
691	+	/**
692	+	* replace(x, null) throws NPE
693	+	*/
694	+	public void testReplace2_NullPointerException() {
695	+	try {
696	+	ConcurrentHashMap c = new ConcurrentHashMap(5);
697	+	c.replace("whatever", null);
698	+	shouldThrow();
699	+	} catch (NullPointerException success) {}
700	+	}
701	+
702	+	/**
703	+	* replace(x, null, y) throws NPE
704	+	*/
705	+	public void testReplaceValue2_NullPointerException() {
706	+	try {
707	+	ConcurrentHashMap c = new ConcurrentHashMap(5);
708	+	c.replace("whatever", null, "A");
709	+	shouldThrow();
710	+	} catch (NullPointerException success) {}
711	+	}
712	+
713	+	/**
714	+	* replace(x, y, null) throws NPE
715	+	*/
716	+	public void testReplaceValue3_NullPointerException() {
717	+	try {
718	+	ConcurrentHashMap c = new ConcurrentHashMap(5);
719	+	c.replace("whatever", one, null);
720	+	shouldThrow();
721	+	} catch (NullPointerException success) {}
722	+	}
723
724	<	public void testRemove1_NullPointerException(){
725	<	try{
724	>	/**
725	>	* remove(null) throws NPE
726	>	*/
727	>	public void testRemove1_NullPointerException() {
728	>	try {
729		ConcurrentHashMap c = new ConcurrentHashMap(5);
730		c.put("sadsdf", "asdads");
731		c.remove(null);
732	<	fail("ConcurrentHashMap - Object remove(Object) should throw Null pointer exceptione");
733	<	}catch(NullPointerException e){}
732	>	shouldThrow();
733	>	} catch (NullPointerException success) {}
734		}
735
736	<	public void testRemove2_NullPointerException(){
737	<	try{
736	>	/**
737	>	* remove(null, x) throws NPE
738	>	*/
739	>	public void testRemove2_NullPointerException() {
740	>	try {
741		ConcurrentHashMap c = new ConcurrentHashMap(5);
742		c.put("sadsdf", "asdads");
743		c.remove(null, "whatever");
744	<	fail("ConcurrentHashMap - Object remove(Object, Object) should throw Null pointer exceptione");
745	<	}catch(NullPointerException e){}
744	>	shouldThrow();
745	>	} catch (NullPointerException success) {}
746		}
747	<
747	>
748	>	/**
749	>	* remove(x, null) returns false
750	>	*/
751	>	public void testRemove3() {
752	>	ConcurrentHashMap c = new ConcurrentHashMap(5);
753	>	c.put("sadsdf", "asdads");
754	>	assertFalse(c.remove("sadsdf", null));
755	>	}
756	>
757	>	/**
758	>	* A deserialized map equals original
759	>	*/
760	>	public void testSerialization() throws Exception {
761	>	Map x = map5();
762	>	Map y = serialClone(x);
763	>
764	>	assertNotSame(x, y);
765	>	assertEquals(x.size(), y.size());
766	>	assertEquals(x, y);
767	>	assertEquals(y, x);
768	>	}
769	>
770	>	/**
771	>	* SetValue of an EntrySet entry sets value in the map.
772	>	*/
773	>	public void testSetValueWriteThrough() {
774	>	// Adapted from a bug report by Eric Zoerner
775	>	ConcurrentHashMap map = new ConcurrentHashMap(2, 5.0f, 1);
776	>	assertTrue(map.isEmpty());
777	>	for (int i = 0; i < 20; i++)
778	>	map.put(new Integer(i), new Integer(i));
779	>	assertFalse(map.isEmpty());
780	>	Map.Entry entry1 = (Map.Entry)map.entrySet().iterator().next();
781	>	// Unless it happens to be first (in which case remainder of
782	>	// test is skipped), remove a possibly-colliding key from map
783	>	// which, under some implementations, may cause entry1 to be
784	>	// cloned in map
785	>	if (!entry1.getKey().equals(new Integer(16))) {
786	>	map.remove(new Integer(16));
787	>	entry1.setValue("XYZ");
788	>	assertTrue(map.containsValue("XYZ")); // fails if write-through broken
789	>	}
790	>	}
791	>
792		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines