ViewVC Help

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

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

Comparing jsr166/src/test/tck/ConcurrentLinkedQueueTest.java (file contents):
Revision 1.4 by dl, Sat Sep 20 18:20:07 2003 UTC vs.
Revision 1.40 by jsr166, Sun May 24 01:42:14 2015 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.*;
12	<	import java.io.*;
9	>	import java.util.Arrays;
10	>	import java.util.Collection;
11	>	import java.util.Iterator;
12	>	import java.util.NoSuchElementException;
13	>	import java.util.Queue;
14	>	import java.util.concurrent.ConcurrentLinkedQueue;
15	>
16	>	import junit.framework.Test;
17	>	import junit.framework.TestSuite;
18
19		public class ConcurrentLinkedQueueTest extends JSR166TestCase {
20
21		public static void main(String[] args) {
22	<	junit.textui.TestRunner.run (suite());
22	>	main(suite(), args);
23		}
24
25		public static Test suite() {
26	<	return new TestSuite(ConcurrentLinkedQueueTest.class);
26	>	return new TestSuite(ConcurrentLinkedQueueTest.class);
27		}
28
29		/**
30	<	* Create a queue of given size containing consecutive
30	>	* Returns a new queue of given size containing consecutive
31		* Integers 0 ... n.
32		*/
33	<	private ConcurrentLinkedQueue populatedQueue(int n) {
34	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
33	>	private ConcurrentLinkedQueue<Integer> populatedQueue(int n) {
34	>	ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<Integer>();
35		assertTrue(q.isEmpty());
36	<	for(int i = 0; i < n; ++i)
37	<	assertTrue(q.offer(new Integer(i)));
36	>	for (int i = 0; i < n; ++i)
37	>	assertTrue(q.offer(new Integer(i)));
38		assertFalse(q.isEmpty());
39	<	assertEquals(n, q.size());
39	>	assertEquals(n, q.size());
40		return q;
41		}
42	<
42	>
43		/**
44	<	*
44	>	* new queue is empty
45		*/
46		public void testConstructor1() {
47		assertEquals(0, new ConcurrentLinkedQueue().size());
48		}
49
50		/**
51	<	*
51	>	* Initializing from null Collection throws NPE
52		*/
53		public void testConstructor3() {
54		try {
55	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue((Collection)null);
55	>	new ConcurrentLinkedQueue((Collection)null);
56		shouldThrow();
57	<	}
52	<	catch (NullPointerException success) {}
57	>	} catch (NullPointerException success) {}
58		}
59
60		/**
61	<	*
61	>	* Initializing from Collection of null elements throws NPE
62		*/
63		public void testConstructor4() {
64		try {
65	<	Integer[] ints = new Integer[SIZE];
61	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
65	>	new ConcurrentLinkedQueue(Arrays.asList(new Integer[SIZE]));
66		shouldThrow();
67	<	}
64	<	catch (NullPointerException success) {}
67	>	} catch (NullPointerException success) {}
68		}
69
70		/**
71	<	*
71	>	* Initializing from Collection with some null elements throws NPE
72		*/
73		public void testConstructor5() {
74	+	Integer[] ints = new Integer[SIZE];
75	+	for (int i = 0; i < SIZE - 1; ++i)
76	+	ints[i] = new Integer(i);
77		try {
78	<	Integer[] ints = new Integer[SIZE];
73	<	for (int i = 0; i < SIZE-1; ++i)
74	<	ints[i] = new Integer(i);
75	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
78	>	new ConcurrentLinkedQueue(Arrays.asList(ints));
79		shouldThrow();
80	<	}
78	<	catch (NullPointerException success) {}
80	>	} catch (NullPointerException success) {}
81		}
82
83		/**
84	<	*
84	>	* Queue contains all elements of collection used to initialize
85		*/
86		public void testConstructor6() {
87	<	try {
88	<	Integer[] ints = new Integer[SIZE];
89	<	for (int i = 0; i < SIZE; ++i)
90	<	ints[i] = new Integer(i);
91	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
92	<	for (int i = 0; i < SIZE; ++i)
91	<	assertEquals(ints[i], q.poll());
92	<	}
93	<	finally {}
87	>	Integer[] ints = new Integer[SIZE];
88	>	for (int i = 0; i < SIZE; ++i)
89	>	ints[i] = new Integer(i);
90	>	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
91	>	for (int i = 0; i < SIZE; ++i)
92	>	assertEquals(ints[i], q.poll());
93		}
94
95		/**
96	<	*
96	>	* isEmpty is true before add, false after
97		*/
98		public void testEmpty() {
99		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 108 | Line 107 | public class ConcurrentLinkedQueueTest e
107		}
108
109		/**
110	<	*
110	>	* size changes when elements added and removed
111		*/
112		public void testSize() {
113		ConcurrentLinkedQueue q = populatedQueue(SIZE);
114		for (int i = 0; i < SIZE; ++i) {
115	<	assertEquals(SIZE-i, q.size());
115	>	assertEquals(SIZE - i, q.size());
116		q.remove();
117		}
118		for (int i = 0; i < SIZE; ++i) {
#	Line 123 | Line 122 | public class ConcurrentLinkedQueueTest e
122		}
123
124		/**
125	<	*
125	>	* offer(null) throws NPE
126		*/
127		public void testOfferNull() {
128	<	try {
129	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
128	>	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
129	>	try {
130		q.offer(null);
131		shouldThrow();
132	<	} catch (NullPointerException success) { }
132	>	} catch (NullPointerException success) {}
133	>	}
134	>
135	>	/**
136	>	* add(null) throws NPE
137	>	*/
138	>	public void testAddNull() {
139	>	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
140	>	try {
141	>	q.add(null);
142	>	shouldThrow();
143	>	} catch (NullPointerException success) {}
144		}
145
146		/**
147	<	*
147	>	* Offer returns true
148		*/
149		public void testOffer() {
150		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 143 | Line 153 | public class ConcurrentLinkedQueueTest e
153		}
154
155		/**
156	<	*
156	>	* add returns true
157		*/
158		public void testAdd() {
159		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 154 | Line 164 | public class ConcurrentLinkedQueueTest e
164		}
165
166		/**
167	<	*
167	>	* addAll(null) throws NPE
168		*/
169		public void testAddAll1() {
170	+	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
171		try {
161	–	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
172		q.addAll(null);
173		shouldThrow();
174	<	}
165	<	catch (NullPointerException success) {}
174	>	} catch (NullPointerException success) {}
175		}
176	+
177	+	/**
178	+	* addAll(this) throws IAE
179	+	*/
180	+	public void testAddAllSelf() {
181	+	ConcurrentLinkedQueue q = populatedQueue(SIZE);
182	+	try {
183	+	q.addAll(q);
184	+	shouldThrow();
185	+	} catch (IllegalArgumentException success) {}
186	+	}
187	+
188		/**
189	<	*
189	>	* addAll of a collection with null elements throws NPE
190		*/
191		public void testAddAll2() {
192	+	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
193		try {
194	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
173	<	Integer[] ints = new Integer[SIZE];
174	<	q.addAll(Arrays.asList(ints));
194	>	q.addAll(Arrays.asList(new Integer[SIZE]));
195		shouldThrow();
196	<	}
177	<	catch (NullPointerException success) {}
196	>	} catch (NullPointerException success) {}
197		}
198	+
199		/**
200	<	*
200	>	* addAll of a collection with any null elements throws NPE after
201	>	* possibly adding some elements
202		*/
203		public void testAddAll3() {
204	+	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
205	+	Integer[] ints = new Integer[SIZE];
206	+	for (int i = 0; i < SIZE - 1; ++i)
207	+	ints[i] = new Integer(i);
208		try {
184	–	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
185	–	Integer[] ints = new Integer[SIZE];
186	–	for (int i = 0; i < SIZE-1; ++i)
187	–	ints[i] = new Integer(i);
209		q.addAll(Arrays.asList(ints));
210		shouldThrow();
211	<	}
191	<	catch (NullPointerException success) {}
211	>	} catch (NullPointerException success) {}
212		}
213
214		/**
215	<	*
215	>	* Queue contains all elements, in traversal order, of successful addAll
216		*/
217		public void testAddAll5() {
218	<	try {
219	<	Integer[] empty = new Integer[0];
220	<	Integer[] ints = new Integer[SIZE];
221	<	for (int i = 0; i < SIZE; ++i)
222	<	ints[i] = new Integer(i);
223	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
224	<	assertFalse(q.addAll(Arrays.asList(empty)));
225	<	assertTrue(q.addAll(Arrays.asList(ints)));
226	<	for (int i = 0; i < SIZE; ++i)
207	<	assertEquals(ints[i], q.poll());
208	<	}
209	<	finally {}
218	>	Integer[] empty = new Integer[0];
219	>	Integer[] ints = new Integer[SIZE];
220	>	for (int i = 0; i < SIZE; ++i)
221	>	ints[i] = new Integer(i);
222	>	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
223	>	assertFalse(q.addAll(Arrays.asList(empty)));
224	>	assertTrue(q.addAll(Arrays.asList(ints)));
225	>	for (int i = 0; i < SIZE; ++i)
226	>	assertEquals(ints[i], q.poll());
227		}
228
229		/**
230	<	*
230	>	* poll succeeds unless empty
231		*/
232		public void testPoll() {
233		ConcurrentLinkedQueue q = populatedQueue(SIZE);
234		for (int i = 0; i < SIZE; ++i) {
235	<	assertEquals(i, ((Integer)q.poll()).intValue());
235	>	assertEquals(i, q.poll());
236		}
237	<	assertNull(q.poll());
237	>	assertNull(q.poll());
238		}
239
240		/**
241	<	*
241	>	* peek returns next element, or null if empty
242		*/
243		public void testPeek() {
244		ConcurrentLinkedQueue q = populatedQueue(SIZE);
245		for (int i = 0; i < SIZE; ++i) {
246	<	assertEquals(i, ((Integer)q.peek()).intValue());
247	<	q.poll();
246	>	assertEquals(i, q.peek());
247	>	assertEquals(i, q.poll());
248		assertTrue(q.peek() == null ||
249	<	i != ((Integer)q.peek()).intValue());
249	>	!q.peek().equals(i));
250		}
251	<	assertNull(q.peek());
251	>	assertNull(q.peek());
252		}
253
254		/**
255	<	*
255	>	* element returns next element, or throws NSEE if empty
256		*/
257		public void testElement() {
258		ConcurrentLinkedQueue q = populatedQueue(SIZE);
259		for (int i = 0; i < SIZE; ++i) {
260	<	assertEquals(i, ((Integer)q.element()).intValue());
261	<	q.poll();
260	>	assertEquals(i, q.element());
261	>	assertEquals(i, q.poll());
262		}
263		try {
264		q.element();
265		shouldThrow();
266	<	}
250	<	catch (NoSuchElementException success) {}
266	>	} catch (NoSuchElementException success) {}
267		}
268
269		/**
270	<	*
270	>	* remove removes next element, or throws NSEE if empty
271		*/
272		public void testRemove() {
273		ConcurrentLinkedQueue q = populatedQueue(SIZE);
274		for (int i = 0; i < SIZE; ++i) {
275	<	assertEquals(i, ((Integer)q.remove()).intValue());
275	>	assertEquals(i, q.remove());
276		}
277		try {
278		q.remove();
279		shouldThrow();
280	<	} catch (NoSuchElementException success){
265	<	}
280	>	} catch (NoSuchElementException success) {}
281		}
282
283		/**
284	<	*
284	>	* remove(x) removes x and returns true if present
285		*/
286		public void testRemoveElement() {
287		ConcurrentLinkedQueue q = populatedQueue(SIZE);
288	<	for (int i = 1; i < SIZE; i+=2) {
289	<	assertTrue(q.remove(new Integer(i)));
290	<	}
291	<	for (int i = 0; i < SIZE; i+=2) {
292	<	assertTrue(q.remove(new Integer(i)));
293	<	assertFalse(q.remove(new Integer(i+1)));
288	>	for (int i = 1; i < SIZE; i += 2) {
289	>	assertTrue(q.contains(i));
290	>	assertTrue(q.remove(i));
291	>	assertFalse(q.contains(i));
292	>	assertTrue(q.contains(i - 1));
293	>	}
294	>	for (int i = 0; i < SIZE; i += 2) {
295	>	assertTrue(q.contains(i));
296	>	assertTrue(q.remove(i));
297	>	assertFalse(q.contains(i));
298	>	assertFalse(q.remove(i + 1));
299	>	assertFalse(q.contains(i + 1));
300		}
301		assertTrue(q.isEmpty());
302		}
303	<
303	>
304		/**
305	<	*
305	>	* contains(x) reports true when elements added but not yet removed
306		*/
307		public void testContains() {
308		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 293 | Line 314 | public class ConcurrentLinkedQueueTest e
314		}
315
316		/**
317	<	*
317	>	* clear removes all elements
318		*/
319		public void testClear() {
320		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 307 | Line 328 | public class ConcurrentLinkedQueueTest e
328		}
329
330		/**
331	<	*
331	>	* containsAll(c) is true when c contains a subset of elements
332		*/
333		public void testContainsAll() {
334		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 321 | Line 342 | public class ConcurrentLinkedQueueTest e
342		}
343
344		/**
345	<	*
345	>	* retainAll(c) retains only those elements of c and reports true if change
346		*/
347		public void testRetainAll() {
348		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 334 | Line 355 | public class ConcurrentLinkedQueueTest e
355		assertTrue(changed);
356
357		assertTrue(q.containsAll(p));
358	<	assertEquals(SIZE-i, q.size());
358	>	assertEquals(SIZE - i, q.size());
359		p.remove();
360		}
361		}
362
363		/**
364	<	*
364	>	* removeAll(c) removes only those elements of c and reports true if changed
365		*/
366		public void testRemoveAll() {
367		for (int i = 1; i < SIZE; ++i) {
368		ConcurrentLinkedQueue q = populatedQueue(SIZE);
369		ConcurrentLinkedQueue p = populatedQueue(i);
370		assertTrue(q.removeAll(p));
371	<	assertEquals(SIZE-i, q.size());
371	>	assertEquals(SIZE - i, q.size());
372		for (int j = 0; j < i; ++j) {
373	<	Integer I = (Integer)(p.remove());
374	<	assertFalse(q.contains(I));
373	>	Integer x = (Integer)(p.remove());
374	>	assertFalse(q.contains(x));
375		}
376		}
377		}
378
379		/**
380	<	*
380	>	* toArray contains all elements in FIFO order
381		*/
382		public void testToArray() {
383		ConcurrentLinkedQueue q = populatedQueue(SIZE);
384	<	Object[] o = q.toArray();
385	<	Arrays.sort(o);
386	<	for(int i = 0; i < o.length; i++)
366	<	assertEquals(o[i], q.poll());
384	>	Object[] o = q.toArray();
385	>	for (int i = 0; i < o.length; i++)
386	>	assertSame(o[i], q.poll());
387		}
388
389		/**
390	<	*
390	>	* toArray(a) contains all elements in FIFO order
391		*/
392		public void testToArray2() {
393	+	ConcurrentLinkedQueue<Integer> q = populatedQueue(SIZE);
394	+	Integer[] ints = new Integer[SIZE];
395	+	Integer[] array = q.toArray(ints);
396	+	assertSame(ints, array);
397	+	for (int i = 0; i < ints.length; i++)
398	+	assertSame(ints[i], q.poll());
399	+	}
400	+
401	+	/**
402	+	* toArray(null) throws NullPointerException
403	+	*/
404	+	public void testToArray_NullArg() {
405		ConcurrentLinkedQueue q = populatedQueue(SIZE);
406	<	Integer[] ints = new Integer[SIZE];
407	<	ints = (Integer[])q.toArray(ints);
408	<	Arrays.sort(ints);
409	<	for(int i = 0; i < ints.length; i++)
378	<	assertEquals(ints[i], q.poll());
406	>	try {
407	>	q.toArray(null);
408	>	shouldThrow();
409	>	} catch (NullPointerException success) {}
410		}
411	<
411	>
412	>	/**
413	>	* toArray(incompatible array type) throws ArrayStoreException
414	>	*/
415	>	public void testToArray1_BadArg() {
416	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
417	>	try {
418	>	q.toArray(new String[10]);
419	>	shouldThrow();
420	>	} catch (ArrayStoreException success) {}
421	>	}
422	>
423		/**
424	<	*
424	>	* iterator iterates through all elements
425		*/
426		public void testIterator() {
427		ConcurrentLinkedQueue q = populatedQueue(SIZE);
428	<	int i = 0;
429	<	Iterator it = q.iterator();
430	<	while(it.hasNext()) {
428	>	Iterator it = q.iterator();
429	>	int i;
430	>	for (i = 0; it.hasNext(); i++)
431		assertTrue(q.contains(it.next()));
390	–	++i;
391	–	}
432		assertEquals(i, SIZE);
433	+	assertIteratorExhausted(it);
434		}
435
436		/**
437	<	*
437	>	* iterator of empty collection has no elements
438	>	*/
439	>	public void testEmptyIterator() {
440	>	assertIteratorExhausted(new ConcurrentLinkedQueue().iterator());
441	>	}
442	>
443	>	/**
444	>	* iterator ordering is FIFO
445		*/
446		public void testIteratorOrdering() {
447		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 403 | Line 451 | public class ConcurrentLinkedQueueTest e
451
452		int k = 0;
453		for (Iterator it = q.iterator(); it.hasNext();) {
454	<	int i = ((Integer)(it.next())).intValue();
407	<	assertEquals(++k, i);
454	>	assertEquals(++k, it.next());
455		}
456
457		assertEquals(3, k);
458		}
459
460		/**
461	<	*
461	>	* Modifications do not cause iterators to fail
462		*/
463	<	public void testWeaklyConsistentIteration () {
463	>	public void testWeaklyConsistentIteration() {
464		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
465		q.add(one);
466		q.add(two);
467		q.add(three);
468
469	<	try {
470	<	for (Iterator it = q.iterator(); it.hasNext();) {
471	<	q.remove();
425	<	it.next();
426	<	}
427	<	}
428	<	catch (ConcurrentModificationException e) {
429	<	shouldThrow();
469	>	for (Iterator it = q.iterator(); it.hasNext();) {
470	>	q.remove();
471	>	it.next();
472		}
473
474		assertEquals("queue should be empty again", 0, q.size());
475		}
476
477		/**
478	<	*
478	>	* iterator.remove removes current element
479		*/
480	<	public void testIteratorRemove () {
480	>	public void testIteratorRemove() {
481		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
482		q.add(one);
483		q.add(two);
#	Line 444 | Line 486 | public class ConcurrentLinkedQueueTest e
486		it.next();
487		it.remove();
488		it = q.iterator();
489	<	assertEquals(it.next(), two);
490	<	assertEquals(it.next(), three);
489	>	assertSame(it.next(), two);
490	>	assertSame(it.next(), three);
491		assertFalse(it.hasNext());
492		}
493
452	–
494		/**
495	<	*
495	>	* toString contains toStrings of elements
496		*/
497		public void testToString() {
498		ConcurrentLinkedQueue q = populatedQueue(SIZE);
499		String s = q.toString();
500		for (int i = 0; i < SIZE; ++i) {
501	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
501	>	assertTrue(s.contains(String.valueOf(i)));
502		}
503	<	}
503	>	}
504
505		/**
506	<	*
506	>	* A deserialized serialized queue has same elements in same order
507		*/
508	<	public void testSerialization() {
509	<	ConcurrentLinkedQueue q = populatedQueue(SIZE);
510	<	try {
470	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
471	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
472	<	out.writeObject(q);
473	<	out.close();
508	>	public void testSerialization() throws Exception {
509	>	Queue x = populatedQueue(SIZE);
510	>	Queue y = serialClone(x);
511
512	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
513	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
514	<	ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
515	<	assertEquals(q.size(), r.size());
516	<	while (!q.isEmpty())
517	<	assertEquals(q.remove(), r.remove());
518	<	} catch(Exception e){
482	<	unexpectedException();
512	>	assertNotSame(x, y);
513	>	assertEquals(x.size(), y.size());
514	>	assertEquals(x.toString(), y.toString());
515	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
516	>	while (!x.isEmpty()) {
517	>	assertFalse(y.isEmpty());
518	>	assertEquals(x.remove(), y.remove());
519		}
520	+	assertTrue(y.isEmpty());
521		}
522
523	+	/**
524	+	* remove(null), contains(null) always return false
525	+	*/
526	+	public void testNeverContainsNull() {
527	+	Collection<?>[] qs = {
528	+	new ConcurrentLinkedQueue<Object>(),
529	+	populatedQueue(2),
530	+	};
531	+
532	+	for (Collection<?> q : qs) {
533	+	assertFalse(q.contains(null));
534	+	assertFalse(q.remove(null));
535	+	}
536	+	}
537		}

Diff Legend

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