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.3 by dl, Sun Sep 14 20:42:40 2003 UTC vs.
Revision 1.19 by jsr166, Sat Oct 9 19:30:34 2010 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	<
38	<	public void testConstructor1(){
37	>
38	>	/**
39	>	* new queue is empty
40	>	*/
41	>	public void testConstructor1() {
42		assertEquals(0, new ConcurrentLinkedQueue().size());
43		}
44
45	+	/**
46	+	* Initializing from null Collection throws NPE
47	+	*/
48		public void testConstructor3() {
49		try {
50		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue((Collection)null);
51	<	fail("Cannot make from null collection");
52	<	}
46	<	catch (NullPointerException success) {}
51	>	shouldThrow();
52	>	} catch (NullPointerException success) {}
53		}
54
55	<	public void testConstructor4(){
55	>	/**
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	<	fail("Cannot make with null elements");
63	<	}
55	<	catch (NullPointerException success) {}
62	>	shouldThrow();
63	>	} catch (NullPointerException success) {}
64		}
65
66	<	public void testConstructor5(){
66	>	/**
67	>	* Initializing from Collection with some null elements throws NPE
68	>	*/
69	>	public void testConstructor5() {
70		try {
71		Integer[] ints = new Integer[SIZE];
72		for (int i = 0; i < SIZE-1; ++i)
73		ints[i] = new Integer(i);
74		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
75	<	fail("Cannot make with null elements");
76	<	}
66	<	catch (NullPointerException success) {}
75	>	shouldThrow();
76	>	} catch (NullPointerException success) {}
77		}
78
79	<	public void testConstructor6(){
80	<	try {
81	<	Integer[] ints = new Integer[SIZE];
82	<	for (int i = 0; i < SIZE; ++i)
83	<	ints[i] = new Integer(i);
84	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
85	<	for (int i = 0; i < SIZE; ++i)
86	<	assertEquals(ints[i], q.poll());
87	<	}
88	<	finally {}
79	>	/**
80	>	* Queue contains all elements of collection used to initialize
81	>	*/
82	>	public void testConstructor6() {
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	+	* isEmpty is true before add, false after
93	+	*/
94		public void testEmpty() {
95		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
96		assertTrue(q.isEmpty());
#	Line 89 | Line 102 | public class ConcurrentLinkedQueueTest e
102		assertTrue(q.isEmpty());
103		}
104
105	+	/**
106	+	* size changes when elements added and removed
107	+	*/
108		public void testSize() {
109		ConcurrentLinkedQueue q = populatedQueue(SIZE);
110		for (int i = 0; i < SIZE; ++i) {
#	Line 101 | Line 117 | public class ConcurrentLinkedQueueTest e
117		}
118		}
119
120	<	public void testOfferNull(){
121	<	try {
120	>	/**
121	>	* offer(null) throws NPE
122	>	*/
123	>	public void testOfferNull() {
124	>	try {
125		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
126		q.offer(null);
127	<	fail("should throw NPE");
128	<	} catch (NullPointerException success) { }
127	>	shouldThrow();
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	+	/**
144	+	* Offer returns true
145	+	*/
146		public void testOffer() {
147		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
148		assertTrue(q.offer(zero));
149		assertTrue(q.offer(one));
150		}
151
152	<	public void testAdd(){
152	>	/**
153	>	* add returns true
154	>	*/
155	>	public void testAdd() {
156		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
157		for (int i = 0; i < SIZE; ++i) {
158		assertEquals(i, q.size());
#	Line 123 | Line 160 | public class ConcurrentLinkedQueueTest e
160		}
161		}
162
163	<	public void testAddAll1(){
163	>	/**
164	>	* addAll(null) throws NPE
165	>	*/
166	>	public void testAddAll1() {
167		try {
168		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
169		q.addAll(null);
170	<	fail("Cannot add null collection");
171	<	}
132	<	catch (NullPointerException success) {}
170	>	shouldThrow();
171	>	} catch (NullPointerException success) {}
172		}
173	<	public void testAddAll2(){
173	>
174	>	/**
175	>	* addAll(this) throws IAE
176	>	*/
177	>	public void testAddAllSelf() {
178	>	try {
179	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
180	>	q.addAll(q);
181	>	shouldThrow();
182	>	} catch (IllegalArgumentException success) {}
183	>	}
184	>
185	>	/**
186	>	* addAll of a collection with null elements throws NPE
187	>	*/
188	>	public void testAddAll2() {
189		try {
190		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
191		Integer[] ints = new Integer[SIZE];
192		q.addAll(Arrays.asList(ints));
193	<	fail("Cannot add null elements");
194	<	}
141	<	catch (NullPointerException success) {}
193	>	shouldThrow();
194	>	} catch (NullPointerException success) {}
195		}
196	<	public void testAddAll3(){
196	>
197	>	/**
198	>	* addAll of a collection with any null elements throws NPE after
199	>	* possibly adding some elements
200	>	*/
201	>	public void testAddAll3() {
202		try {
203		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
204		Integer[] ints = new Integer[SIZE];
205		for (int i = 0; i < SIZE-1; ++i)
206		ints[i] = new Integer(i);
207		q.addAll(Arrays.asList(ints));
208	<	fail("Cannot add null elements");
209	<	}
152	<	catch (NullPointerException success) {}
208	>	shouldThrow();
209	>	} catch (NullPointerException success) {}
210		}
211
212	<	public void testAddAll5(){
213	<	try {
214	<	Integer[] empty = new Integer[0];
215	<	Integer[] ints = new Integer[SIZE];
216	<	for (int i = 0; i < SIZE; ++i)
217	<	ints[i] = new Integer(i);
218	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
219	<	assertFalse(q.addAll(Arrays.asList(empty)));
220	<	assertTrue(q.addAll(Arrays.asList(ints)));
221	<	for (int i = 0; i < SIZE; ++i)
222	<	assertEquals(ints[i], q.poll());
223	<	}
224	<	finally {}
212	>	/**
213	>	* Queue contains all elements, in traversal order, of successful addAll
214	>	*/
215	>	public void testAddAll5() {
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)
224	>	assertEquals(ints[i], q.poll());
225		}
226
227	<	public void testPoll(){
227	>	/**
228	>	* poll succeeds unless empty
229	>	*/
230	>	public void testPoll() {
231		ConcurrentLinkedQueue q = populatedQueue(SIZE);
232		for (int i = 0; i < SIZE; ++i) {
233	<	assertEquals(i, ((Integer)q.poll()).intValue());
233	>	assertEquals(i, q.poll());
234		}
235	<	assertNull(q.poll());
235	>	assertNull(q.poll());
236		}
237
238	<	public void testPeek(){
238	>	/**
239	>	* peek returns next element, or null if empty
240	>	*/
241	>	public void testPeek() {
242		ConcurrentLinkedQueue q = populatedQueue(SIZE);
243		for (int i = 0; i < SIZE; ++i) {
244	<	assertEquals(i, ((Integer)q.peek()).intValue());
245	<	q.poll();
244	>	assertEquals(i, q.peek());
245	>	assertEquals(i, q.poll());
246		assertTrue(q.peek() == null ||
247	<	i != ((Integer)q.peek()).intValue());
247	>	!q.peek().equals(i));
248		}
249	<	assertNull(q.peek());
249	>	assertNull(q.peek());
250		}
251
252	<	public void testElement(){
252	>	/**
253	>	* element returns next element, or throws NSEE if empty
254	>	*/
255	>	public void testElement() {
256		ConcurrentLinkedQueue q = populatedQueue(SIZE);
257		for (int i = 0; i < SIZE; ++i) {
258	<	assertEquals(i, ((Integer)q.element()).intValue());
259	<	q.poll();
258	>	assertEquals(i, q.element());
259	>	assertEquals(i, q.poll());
260		}
261		try {
262		q.element();
263	<	fail("no such element");
264	<	}
199	<	catch (NoSuchElementException success) {}
263	>	shouldThrow();
264	>	} catch (NoSuchElementException success) {}
265		}
266
267	<	public void testRemove(){
267	>	/**
268	>	* remove removes next element, or throws NSEE if empty
269	>	*/
270	>	public void testRemove() {
271		ConcurrentLinkedQueue q = populatedQueue(SIZE);
272		for (int i = 0; i < SIZE; ++i) {
273	<	assertEquals(i, ((Integer)q.remove()).intValue());
273	>	assertEquals(i, q.remove());
274		}
275		try {
276		q.remove();
277	<	fail("remove should throw");
278	<	} catch (NoSuchElementException success){
211	<	}
277	>	shouldThrow();
278	>	} catch (NoSuchElementException success) {}
279		}
280
281	<	public void testRemoveElement(){
281	>	/**
282	>	* remove(x) removes x and returns true if present
283	>	*/
284	>	public void testRemoveElement() {
285		ConcurrentLinkedQueue q = populatedQueue(SIZE);
286		for (int i = 1; i < SIZE; i+=2) {
287		assertTrue(q.remove(new Integer(i)));
#	Line 222 | Line 292 | public class ConcurrentLinkedQueueTest e
292		}
293		assertTrue(q.isEmpty());
294		}
295	<
296	<	public void testContains(){
295	>
296	>	/**
297	>	* contains(x) reports true when elements added but not yet removed
298	>	*/
299	>	public void testContains() {
300		ConcurrentLinkedQueue q = populatedQueue(SIZE);
301		for (int i = 0; i < SIZE; ++i) {
302		assertTrue(q.contains(new Integer(i)));
#	Line 232 | Line 305 | public class ConcurrentLinkedQueueTest e
305		}
306		}
307
308	<	public void testClear(){
308	>	/**
309	>	* clear removes all elements
310	>	*/
311	>	public void testClear() {
312		ConcurrentLinkedQueue q = populatedQueue(SIZE);
313		q.clear();
314		assertTrue(q.isEmpty());
#	Line 243 | Line 319 | public class ConcurrentLinkedQueueTest e
319		assertTrue(q.isEmpty());
320		}
321
322	<	public void testContainsAll(){
322	>	/**
323	>	* containsAll(c) is true when c contains a subset of elements
324	>	*/
325	>	public void testContainsAll() {
326		ConcurrentLinkedQueue q = populatedQueue(SIZE);
327		ConcurrentLinkedQueue p = new ConcurrentLinkedQueue();
328		for (int i = 0; i < SIZE; ++i) {
#	Line 254 | Line 333 | public class ConcurrentLinkedQueueTest e
333		assertTrue(p.containsAll(q));
334		}
335
336	<	public void testRetainAll(){
336	>	/**
337	>	* retainAll(c) retains only those elements of c and reports true if change
338	>	*/
339	>	public void testRetainAll() {
340		ConcurrentLinkedQueue q = populatedQueue(SIZE);
341		ConcurrentLinkedQueue p = populatedQueue(SIZE);
342		for (int i = 0; i < SIZE; ++i) {
#	Line 270 | Line 352 | public class ConcurrentLinkedQueueTest e
352		}
353		}
354
355	<	public void testRemoveAll(){
355	>	/**
356	>	* removeAll(c) removes only those elements of c and reports true if changed
357	>	*/
358	>	public void testRemoveAll() {
359		for (int i = 1; i < SIZE; ++i) {
360		ConcurrentLinkedQueue q = populatedQueue(SIZE);
361		ConcurrentLinkedQueue p = populatedQueue(i);
#	Line 283 | Line 368 | public class ConcurrentLinkedQueueTest e
368		}
369		}
370
371	<	public void testToArray(){
371	>	/**
372	>	* toArray contains all elements
373	>	*/
374	>	public void testToArray() {
375		ConcurrentLinkedQueue q = populatedQueue(SIZE);
376	<	Object[] o = q.toArray();
376	>	Object[] o = q.toArray();
377		Arrays.sort(o);
378	<	for(int i = 0; i < o.length; i++)
379	<	assertEquals(o[i], q.poll());
378	>	for (int i = 0; i < o.length; i++)
379	>	assertEquals(o[i], q.poll());
380		}
381
382	<	public void testToArray2(){
382	>	/**
383	>	* toArray(a) contains all elements
384	>	*/
385	>	public void testToArray2() {
386		ConcurrentLinkedQueue q = populatedQueue(SIZE);
387	<	Integer[] ints = new Integer[SIZE];
388	<	ints = (Integer[])q.toArray(ints);
387	>	Integer[] ints = new Integer[SIZE];
388	>	ints = (Integer[])q.toArray(ints);
389		Arrays.sort(ints);
390	<	for(int i = 0; i < ints.length; i++)
390	>	for (int i = 0; i < ints.length; i++)
391		assertEquals(ints[i], q.poll());
392		}
393	<
394	<	public void testIterator(){
393	>
394	>	/**
395	>	* toArray(null) throws NPE
396	>	*/
397	>	public void testToArray_BadArg() {
398	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
399	>	try {
400	>	Object o[] = q.toArray(null);
401	>	shouldThrow();
402	>	} catch (NullPointerException success) {}
403	>	}
404	>
405	>	/**
406	>	* toArray with incompatible array type throws ArrayStoreException
407	>	*/
408	>	public void testToArray1_BadArg() {
409	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
410	>	try {
411	>	Object o[] = q.toArray(new String[10]);
412	>	shouldThrow();
413	>	} catch (ArrayStoreException success) {}
414	>	}
415	>
416	>	/**
417	>	* iterator iterates through all elements
418	>	*/
419	>	public void testIterator() {
420		ConcurrentLinkedQueue q = populatedQueue(SIZE);
421		int i = 0;
422	<	Iterator it = q.iterator();
423	<	while(it.hasNext()) {
422	>	Iterator it = q.iterator();
423	>	while (it.hasNext()) {
424		assertTrue(q.contains(it.next()));
425		++i;
426		}
427		assertEquals(i, SIZE);
428		}
429
430	+	/**
431	+	* iterator ordering is FIFO
432	+	*/
433		public void testIteratorOrdering() {
434		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
435		q.add(one);
#	Line 319 | Line 438 | public class ConcurrentLinkedQueueTest e
438
439		int k = 0;
440		for (Iterator it = q.iterator(); it.hasNext();) {
441	<	int i = ((Integer)(it.next())).intValue();
323	<	assertEquals("items should come out in order", ++k, i);
441	>	assertEquals(++k, it.next());
442		}
443
444	<	assertEquals("should go through 3 elements", 3, k);
444	>	assertEquals(3, k);
445		}
446
447	<	public void testWeaklyConsistentIteration () {
447	>	/**
448	>	* Modifications do not cause iterators to fail
449	>	*/
450	>	public void testWeaklyConsistentIteration() {
451		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
452		q.add(one);
453		q.add(two);
454		q.add(three);
455
456	<	try {
457	<	for (Iterator it = q.iterator(); it.hasNext();) {
458	<	q.remove();
338	<	it.next();
339	<	}
340	<	}
341	<	catch (ConcurrentModificationException e) {
342	<	fail("weakly consistent iterator; should not get CME");
456	>	for (Iterator it = q.iterator(); it.hasNext();) {
457	>	q.remove();
458	>	it.next();
459		}
460
461		assertEquals("queue should be empty again", 0, q.size());
462		}
463
464	<	public void testIteratorRemove () {
464	>	/**
465	>	* iterator.remove removes current element
466	>	*/
467	>	public void testIteratorRemove() {
468		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
469		q.add(one);
470		q.add(two);
#	Line 354 | Line 473 | public class ConcurrentLinkedQueueTest e
473		it.next();
474		it.remove();
475		it = q.iterator();
476	<	assertEquals(it.next(), two);
477	<	assertEquals(it.next(), three);
476	>	assertSame(it.next(), two);
477	>	assertSame(it.next(), three);
478		assertFalse(it.hasNext());
479		}
480
481
482	<	public void testToString(){
482	>	/**
483	>	* toString contains toStrings of elements
484	>	*/
485	>	public void testToString() {
486		ConcurrentLinkedQueue q = populatedQueue(SIZE);
487		String s = q.toString();
488		for (int i = 0; i < SIZE; ++i) {
489		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
490		}
491	<	}
491	>	}
492
493	<	public void testSerialization() {
493	>	/**
494	>	* A deserialized serialized queue has same elements in same order
495	>	*/
496	>	public void testSerialization() throws Exception {
497		ConcurrentLinkedQueue q = populatedQueue(SIZE);
498	<	try {
499	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
500	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
501	<	out.writeObject(q);
502	<	out.close();
503	<
504	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
505	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
506	<	ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
507	<	assertEquals(q.size(), r.size());
508	<	while (!q.isEmpty())
384	<	assertEquals(q.remove(), r.remove());
385	<	} catch(Exception e){
386	<	e.printStackTrace();
387	<	fail("unexpected exception");
388	<	}
498	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
499	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
500	>	out.writeObject(q);
501	>	out.close();
502	>
503	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
504	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
505	>	ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
506	>	assertEquals(q.size(), r.size());
507	>	while (!q.isEmpty())
508	>	assertEquals(q.remove(), r.remove());
509		}
510
511		}

Diff Legend

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