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.13 by jsr166, Sat Nov 21 10:25:05 2009 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/licenses/publicdomain
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		/**
#	Line 27 | Line 28 | public class ConcurrentLinkedQueueTest e
28		private ConcurrentLinkedQueue populatedQueue(int n) {
29		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
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 79 | Line 78 | public class ConcurrentLinkedQueueTest e
78		}
79
80		/**
81	<	*
81	>	* Queue contains all elements of collection used to initialize
82		*/
83		public void testConstructor6() {
84		try {
#	Line 94 | Line 93 | public class ConcurrentLinkedQueueTest e
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);
#	Line 123 | Line 122 | public class ConcurrentLinkedQueueTest e
122		}
123
124		/**
125	<	*
125	>	* offer(null) throws NPE
126		*/
127		public void testOfferNull() {
128	<	try {
128	>	try {
129		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
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	>	try {
140	>	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
141	>	q.add(null);
142	>	shouldThrow();
143	>	} catch (NullPointerException success) {}
144		}
145
146	+
147		/**
148	<	*
148	>	* Offer returns true
149		*/
150		public void testOffer() {
151		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 143 | Line 154 | public class ConcurrentLinkedQueueTest e
154		}
155
156		/**
157	<	*
157	>	* add returns true
158		*/
159		public void testAdd() {
160		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 154 | Line 165 | public class ConcurrentLinkedQueueTest e
165		}
166
167		/**
168	<	*
168	>	* addAll(null) throws NPE
169		*/
170		public void testAddAll1() {
171		try {
172		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
173		q.addAll(null);
174		shouldThrow();
175	<	}
176	<	catch (NullPointerException success) {}
175	>	} catch (NullPointerException success) {}
176	>	}
177	>
178	>	/**
179	>	* addAll(this) throws IAE
180	>	*/
181	>	public void testAddAllSelf() {
182	>	try {
183	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
184	>	q.addAll(q);
185	>	shouldThrow();
186	>	} catch (IllegalArgumentException success) {}
187		}
188	+
189		/**
190	<	*
190	>	* addAll of a collection with null elements throws NPE
191		*/
192		public void testAddAll2() {
193		try {
#	Line 173 | Line 195 | public class ConcurrentLinkedQueueTest e
195		Integer[] ints = new Integer[SIZE];
196		q.addAll(Arrays.asList(ints));
197		shouldThrow();
198	<	}
177	<	catch (NullPointerException success) {}
198	>	} catch (NullPointerException success) {}
199		}
200		/**
201	<	*
201	>	*  addAll of a collection with any null elements throws NPE after
202	>	* possibly adding some elements
203		*/
204		public void testAddAll3() {
205		try {
#	Line 187 | Line 209 | public class ConcurrentLinkedQueueTest e
209		ints[i] = new Integer(i);
210		q.addAll(Arrays.asList(ints));
211		shouldThrow();
212	<	}
191	<	catch (NullPointerException success) {}
212	>	} catch (NullPointerException success) {}
213		}
214
215		/**
216	<	*
216	>	* Queue contains all elements, in traversal order, of successful addAll
217		*/
218		public void testAddAll5() {
219		try {
#	Line 210 | Line 231 | public class ConcurrentLinkedQueueTest e
231		}
232
233		/**
234	<	*
234	>	* poll succeeds unless empty
235		*/
236		public void testPoll() {
237		ConcurrentLinkedQueue q = populatedQueue(SIZE);
238		for (int i = 0; i < SIZE; ++i) {
239		assertEquals(i, ((Integer)q.poll()).intValue());
240		}
241	<	assertNull(q.poll());
241	>	assertNull(q.poll());
242		}
243
244		/**
245	<	*
245	>	* peek returns next element, or null if empty
246		*/
247		public void testPeek() {
248		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 231 | Line 252 | public class ConcurrentLinkedQueueTest e
252		assertTrue(q.peek() == null ||
253		i != ((Integer)q.peek()).intValue());
254		}
255	<	assertNull(q.peek());
255	>	assertNull(q.peek());
256		}
257
258		/**
259	<	*
259	>	* element returns next element, or throws NSEE if empty
260		*/
261		public void testElement() {
262		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 246 | Line 267 | public class ConcurrentLinkedQueueTest e
267		try {
268		q.element();
269		shouldThrow();
270	<	}
250	<	catch (NoSuchElementException success) {}
270	>	} catch (NoSuchElementException success) {}
271		}
272
273		/**
274	<	*
274	>	*  remove removes next element, or throws NSEE if empty
275		*/
276		public void testRemove() {
277		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 261 | Line 281 | public class ConcurrentLinkedQueueTest e
281		try {
282		q.remove();
283		shouldThrow();
284	<	} catch (NoSuchElementException success){
265	<	}
284	>	} catch (NoSuchElementException success) {}
285		}
286
287		/**
288	<	*
288	>	* remove(x) removes x and returns true if present
289		*/
290		public void testRemoveElement() {
291		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 279 | Line 298 | public class ConcurrentLinkedQueueTest e
298		}
299		assertTrue(q.isEmpty());
300		}
301	<
301	>
302		/**
303	<	*
303	>	* contains(x) reports true when elements added but not yet removed
304		*/
305		public void testContains() {
306		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 293 | Line 312 | public class ConcurrentLinkedQueueTest e
312		}
313
314		/**
315	<	*
315	>	* clear removes all elements
316		*/
317		public void testClear() {
318		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 307 | Line 326 | public class ConcurrentLinkedQueueTest e
326		}
327
328		/**
329	<	*
329	>	* containsAll(c) is true when c contains a subset of elements
330		*/
331		public void testContainsAll() {
332		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 321 | Line 340 | public class ConcurrentLinkedQueueTest e
340		}
341
342		/**
343	<	*
343	>	* retainAll(c) retains only those elements of c and reports true if change
344		*/
345		public void testRetainAll() {
346		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 340 | Line 359 | public class ConcurrentLinkedQueueTest e
359		}
360
361		/**
362	<	*
362	>	* removeAll(c) removes only those elements of c and reports true if changed
363		*/
364		public void testRemoveAll() {
365		for (int i = 1; i < SIZE; ++i) {
#	Line 356 | Line 375 | public class ConcurrentLinkedQueueTest e
375		}
376
377		/**
378	<	*
378	>	* toArray contains all elements
379		*/
380		public void testToArray() {
381		ConcurrentLinkedQueue q = populatedQueue(SIZE);
382	<	Object[] o = q.toArray();
382	>	Object[] o = q.toArray();
383		Arrays.sort(o);
384	<	for(int i = 0; i < o.length; i++)
385	<	assertEquals(o[i], q.poll());
384	>	for (int i = 0; i < o.length; i++)
385	>	assertEquals(o[i], q.poll());
386		}
387
388		/**
389	<	*
389	>	*  toArray(a) contains all elements
390		*/
391		public void testToArray2() {
392		ConcurrentLinkedQueue q = populatedQueue(SIZE);
393	<	Integer[] ints = new Integer[SIZE];
394	<	ints = (Integer[])q.toArray(ints);
393	>	Integer[] ints = new Integer[SIZE];
394	>	ints = (Integer[])q.toArray(ints);
395		Arrays.sort(ints);
396	<	for(int i = 0; i < ints.length; i++)
396	>	for (int i = 0; i < ints.length; i++)
397		assertEquals(ints[i], q.poll());
398		}
399	<
399	>
400	>	/**
401	>	* toArray(null) throws NPE
402	>	*/
403	>	public void testToArray_BadArg() {
404	>	try {
405	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
406	>	Object o[] = q.toArray(null);
407	>	shouldThrow();
408	>	} catch (NullPointerException success) {}
409	>	}
410	>
411	>	/**
412	>	* toArray with incompatible array type throws ArrayStoreException
413	>	*/
414	>	public void testToArray1_BadArg() {
415	>	try {
416	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
417	>	Object o[] = q.toArray(new String[10] );
418	>	shouldThrow();
419	>	} catch (ArrayStoreException success) {}
420	>	}
421	>
422		/**
423	<	*
423	>	*  iterator iterates through all elements
424		*/
425		public void testIterator() {
426		ConcurrentLinkedQueue q = populatedQueue(SIZE);
427		int i = 0;
428	<	Iterator it = q.iterator();
429	<	while(it.hasNext()) {
428	>	Iterator it = q.iterator();
429	>	while (it.hasNext()) {
430		assertTrue(q.contains(it.next()));
431		++i;
432		}
#	Line 393 | Line 434 | public class ConcurrentLinkedQueueTest e
434		}
435
436		/**
437	<	*
437	>	* iterator ordering is FIFO
438		*/
439		public void testIteratorOrdering() {
440		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 411 | Line 452 | public class ConcurrentLinkedQueueTest e
452		}
453
454		/**
455	<	*
455	>	* Modifications do not cause iterators to fail
456		*/
457		public void testWeaklyConsistentIteration () {
458		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 419 | Line 460 | public class ConcurrentLinkedQueueTest e
460		q.add(two);
461		q.add(three);
462
463	<	try {
464	<	for (Iterator it = q.iterator(); it.hasNext();) {
465	<	q.remove();
425	<	it.next();
426	<	}
427	<	}
428	<	catch (ConcurrentModificationException e) {
429	<	shouldThrow();
463	>	for (Iterator it = q.iterator(); it.hasNext();) {
464	>	q.remove();
465	>	it.next();
466		}
467
468		assertEquals("queue should be empty again", 0, q.size());
469		}
470
471		/**
472	<	*
472	>	* iterator.remove removes current element
473		*/
474		public void testIteratorRemove () {
475		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
#	Line 451 | Line 487 | public class ConcurrentLinkedQueueTest e
487
488
489		/**
490	<	*
490	>	* toString contains toStrings of elements
491		*/
492		public void testToString() {
493		ConcurrentLinkedQueue q = populatedQueue(SIZE);
#	Line 459 | Line 495 | public class ConcurrentLinkedQueueTest e
495		for (int i = 0; i < SIZE; ++i) {
496		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
497		}
498	<	}
498	>	}
499
500		/**
501	<	*
501	>	* A deserialized serialized queue has same elements in same order
502		*/
503	<	public void testSerialization() {
503	>	public void testSerialization() throws Exception {
504		ConcurrentLinkedQueue q = populatedQueue(SIZE);
505	<	try {
506	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
507	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
508	<	out.writeObject(q);
509	<	out.close();
510	<
511	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
512	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
513	<	ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
514	<	assertEquals(q.size(), r.size());
515	<	while (!q.isEmpty())
480	<	assertEquals(q.remove(), r.remove());
481	<	} catch(Exception e){
482	<	unexpectedException();
483	<	}
505	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
506	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
507	>	out.writeObject(q);
508	>	out.close();
509	>
510	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
511	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
512	>	ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
513	>	assertEquals(q.size(), r.size());
514	>	while (!q.isEmpty())
515	>	assertEquals(q.remove(), r.remove());
516		}
517
518		}

Diff Legend

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