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

Diff Legend

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