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.2 by dl, Sun Sep 7 20:39:11 2003 UTC vs.
Revision 1.14 by jsr166, Sat Nov 21 10:29:50 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 10 | Line 11 | import java.util.*;
11		import java.util.concurrent.*;
12		import java.io.*;
13
14	<	public class ConcurrentLinkedQueueTest extends TestCase {
14	<	private static final int N = 10;
15	<	private static final long SHORT_DELAY_MS = 100;
16	<	private static final long MEDIUM_DELAY_MS = 1000;
17	<	private static final long LONG_DELAY_MS = 10000;
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 fullQueue(int n) {
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	<	}
50	<	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[N];
60	>	Integer[] ints = new Integer[SIZE];
61		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
62	<	fail("Cannot make with null elements");
63	<	}
59	<	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[N];
72	<	for (int i = 0; i < N-1; ++i)
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");
75	>	shouldThrow();
76		}
77		catch (NullPointerException success) {}
78		}
79
80	<	public void testConstructor6(){
81	<	try {
82	<	Integer[] ints = new Integer[N];
83	<	for (int i = 0; i < N; ++i)
84	<	ints[i] = new Integer(i);
85	<	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
86	<	for (int i = 0; i < N; ++i)
87	<	assertEquals(ints[i], q.poll());
88	<	}
89	<	finally {}
80	>	/**
81	>	* Queue contains all elements of collection used to initialize
82	>	*/
83	>	public void testConstructor6() {
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)
89	>	assertEquals(ints[i], q.poll());
90		}
91
92	+	/**
93	+	* isEmpty is true before add, false after
94	+	*/
95		public void testEmpty() {
96		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
97		assertTrue(q.isEmpty());
98	<	q.add(new Integer(1));
98	>	q.add(one);
99		assertFalse(q.isEmpty());
100	<	q.add(new Integer(2));
100	>	q.add(two);
101		q.remove();
102		q.remove();
103		assertTrue(q.isEmpty());
104		}
105
106	+	/**
107	+	* size changes when elements added and removed
108	+	*/
109		public void testSize() {
110	<	ConcurrentLinkedQueue q = fullQueue(N);
111	<	for (int i = 0; i < N; ++i) {
112	<	assertEquals(N-i, q.size());
110	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
111	>	for (int i = 0; i < SIZE; ++i) {
112	>	assertEquals(SIZE-i, q.size());
113		q.remove();
114		}
115	<	for (int i = 0; i < N; ++i) {
115	>	for (int i = 0; i < SIZE; ++i) {
116		assertEquals(i, q.size());
117		q.add(new Integer(i));
118		}
119		}
120
121	<	public void testOfferNull(){
122	<	try {
121	>	/**
122	>	* offer(null) throws NPE
123	>	*/
124	>	public void testOfferNull() {
125	>	try {
126		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
127		q.offer(null);
128	<	fail("should throw NPE");
129	<	} catch (NullPointerException success) { }
128	>	shouldThrow();
129	>	} catch (NullPointerException success) {}
130	>	}
131	>
132	>	/**
133	>	* add(null) throws NPE
134	>	*/
135	>	public void testAddNull() {
136	>	try {
137	>	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
138	>	q.add(null);
139	>	shouldThrow();
140	>	} catch (NullPointerException success) {}
141		}
142
143	+
144	+	/**
145	+	* Offer returns true
146	+	*/
147		public void testOffer() {
148		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
149	<	assertTrue(q.offer(new Integer(0)));
150	<	assertTrue(q.offer(new Integer(1)));
149	>	assertTrue(q.offer(zero));
150	>	assertTrue(q.offer(one));
151		}
152
153	<	public void testAdd(){
153	>	/**
154	>	* add returns true
155	>	*/
156	>	public void testAdd() {
157		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
158	<	for (int i = 0; i < N; ++i) {
158	>	for (int i = 0; i < SIZE; ++i) {
159		assertEquals(i, q.size());
160		assertTrue(q.add(new Integer(i)));
161		}
162		}
163
164	<	public void testAddAll1(){
164	>	/**
165	>	* addAll(null) throws NPE
166	>	*/
167	>	public void testAddAll1() {
168		try {
169		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
170		q.addAll(null);
171	<	fail("Cannot add null collection");
172	<	}
173	<	catch (NullPointerException success) {}
171	>	shouldThrow();
172	>	} catch (NullPointerException success) {}
173	>	}
174	>
175	>	/**
176	>	* addAll(this) throws IAE
177	>	*/
178	>	public void testAddAllSelf() {
179	>	try {
180	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
181	>	q.addAll(q);
182	>	shouldThrow();
183	>	} catch (IllegalArgumentException success) {}
184		}
185	<	public void testAddAll2(){
185	>
186	>	/**
187	>	* addAll of a collection with null elements throws NPE
188	>	*/
189	>	public void testAddAll2() {
190		try {
191		ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
192	<	Integer[] ints = new Integer[N];
192	>	Integer[] ints = new Integer[SIZE];
193		q.addAll(Arrays.asList(ints));
194	<	fail("Cannot add null elements");
195	<	}
145	<	catch (NullPointerException success) {}
194	>	shouldThrow();
195	>	} catch (NullPointerException success) {}
196		}
197	<	public void testAddAll3(){
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[N];
205	<	for (int i = 0; i < N-1; ++i)
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	<	}
156	<	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[N];
216	<	for (int i = 0; i < N; ++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 < N; ++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(){
228	<	ConcurrentLinkedQueue q = fullQueue(N);
229	<	for (int i = 0; i < N; ++i) {
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());
234		}
235	<	assertNull(q.poll());
235	>	assertNull(q.poll());
236		}
237
238	<	public void testPeek(){
239	<	ConcurrentLinkedQueue q = fullQueue(N);
240	<	for (int i = 0; i < N; ++i) {
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();
246		assertTrue(q.peek() == null ||
247		i != ((Integer)q.peek()).intValue());
248		}
249	<	assertNull(q.peek());
249	>	assertNull(q.peek());
250		}
251
252	<	public void testElement(){
253	<	ConcurrentLinkedQueue q = fullQueue(N);
254	<	for (int i = 0; i < N; ++i) {
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();
260		}
261		try {
262		q.element();
263	<	fail("no such element");
264	<	}
203	<	catch (NoSuchElementException success) {}
263	>	shouldThrow();
264	>	} catch (NoSuchElementException success) {}
265		}
266
267	<	public void testRemove(){
268	<	ConcurrentLinkedQueue q = fullQueue(N);
269	<	for (int i = 0; i < N; ++i) {
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());
274		}
275		try {
276		q.remove();
277	<	fail("remove should throw");
278	<	} catch (NoSuchElementException success){
215	<	}
277	>	shouldThrow();
278	>	} catch (NoSuchElementException success) {}
279		}
280
281	<	public void testRemoveElement(){
282	<	ConcurrentLinkedQueue q = fullQueue(N);
283	<	for (int i = 1; i < N; i+=2) {
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)));
288		}
289	<	for (int i = 0; i < N; i+=2) {
289	>	for (int i = 0; i < SIZE; i+=2) {
290		assertTrue(q.remove(new Integer(i)));
291		assertFalse(q.remove(new Integer(i+1)));
292		}
293		assertTrue(q.isEmpty());
294		}
295	<
296	<	public void testContains(){
297	<	ConcurrentLinkedQueue q = fullQueue(N);
298	<	for (int i = 0; i < N; ++i) {
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)));
303		q.poll();
304		assertFalse(q.contains(new Integer(i)));
305		}
306		}
307
308	<	public void testClear(){
309	<	ConcurrentLinkedQueue q = fullQueue(N);
308	>	/**
309	>	* clear removes all elements
310	>	*/
311	>	public void testClear() {
312	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
313		q.clear();
314		assertTrue(q.isEmpty());
315		assertEquals(0, q.size());
316	<	q.add(new Integer(1));
316	>	q.add(one);
317		assertFalse(q.isEmpty());
318		q.clear();
319		assertTrue(q.isEmpty());
320		}
321
322	<	public void testContainsAll(){
323	<	ConcurrentLinkedQueue q = fullQueue(N);
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 < N; ++i) {
328	>	for (int i = 0; i < SIZE; ++i) {
329		assertTrue(q.containsAll(p));
330		assertFalse(p.containsAll(q));
331		p.add(new Integer(i));
#	Line 258 | Line 333 | public class ConcurrentLinkedQueueTest e
333		assertTrue(p.containsAll(q));
334		}
335
336	<	public void testRetainAll(){
337	<	ConcurrentLinkedQueue q = fullQueue(N);
338	<	ConcurrentLinkedQueue p = fullQueue(N);
339	<	for (int i = 0; i < N; ++i) {
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) {
343		boolean changed = q.retainAll(p);
344		if (i == 0)
345		assertFalse(changed);
#	Line 269 | Line 347 | public class ConcurrentLinkedQueueTest e
347		assertTrue(changed);
348
349		assertTrue(q.containsAll(p));
350	<	assertEquals(N-i, q.size());
350	>	assertEquals(SIZE-i, q.size());
351		p.remove();
352		}
353		}
354
355	<	public void testRemoveAll(){
356	<	for (int i = 1; i < N; ++i) {
357	<	ConcurrentLinkedQueue q = fullQueue(N);
358	<	ConcurrentLinkedQueue p = fullQueue(i);
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);
362		assertTrue(q.removeAll(p));
363	<	assertEquals(N-i, q.size());
363	>	assertEquals(SIZE-i, q.size());
364		for (int j = 0; j < i; ++j) {
365		Integer I = (Integer)(p.remove());
366		assertFalse(q.contains(I));
#	Line 287 | Line 368 | public class ConcurrentLinkedQueueTest e
368		}
369		}
370
371	<	public void testToArray(){
372	<	ConcurrentLinkedQueue q = fullQueue(N);
373	<	Object[] o = q.toArray();
371	>	/**
372	>	* toArray contains all elements
373	>	*/
374	>	public void testToArray() {
375	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
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(){
383	<	ConcurrentLinkedQueue q = fullQueue(N);
384	<	Integer[] ints = new Integer[N];
385	<	ints = (Integer[])q.toArray(ints);
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);
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(){
395	<	ConcurrentLinkedQueue q = fullQueue(N);
393	>
394	>	/**
395	>	* toArray(null) throws NPE
396	>	*/
397	>	public void testToArray_BadArg() {
398	>	try {
399	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
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	>	try {
410	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
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, N);
427	>	assertEquals(i, SIZE);
428		}
429
430	+	/**
431	+	* iterator ordering is FIFO
432	+	*/
433		public void testIteratorOrdering() {
319	–
434		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
435	<
436	<	q.add(new Integer(1));
437	<	q.add(new Integer(2));
324	<	q.add(new Integer(3));
435	>	q.add(one);
436	>	q.add(two);
437	>	q.add(three);
438
439		int k = 0;
440		for (Iterator it = q.iterator(); it.hasNext();) {
441		int i = ((Integer)(it.next())).intValue();
442	<	assertEquals("items should come out in order", ++k, i);
442	>	assertEquals(++k, i);
443		}
444
445	<	assertEquals("should go through 3 elements", 3, k);
445	>	assertEquals(3, k);
446		}
447
448	+	/**
449	+	* Modifications do not cause iterators to fail
450	+	*/
451		public void testWeaklyConsistentIteration () {
336	–
452		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
453	+	q.add(one);
454	+	q.add(two);
455	+	q.add(three);
456
457	<	q.add(new Integer(1));
458	<	q.add(new Integer(2));
459	<	q.add(new Integer(3));
342	<
343	<	try {
344	<	for (Iterator it = q.iterator(); it.hasNext();) {
345	<	q.remove();
346	<	it.next();
347	<	}
348	<	}
349	<	catch (ConcurrentModificationException e) {
350	<	fail("weakly consistent iterator; should not get CME");
457	>	for (Iterator it = q.iterator(); it.hasNext();) {
458	>	q.remove();
459	>	it.next();
460		}
461
462		assertEquals("queue should be empty again", 0, q.size());
463		}
464
465	+	/**
466	+	* iterator.remove removes current element
467	+	*/
468		public void testIteratorRemove () {
357	–
469		final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
470	<
471	<	q.add(new Integer(1));
472	<	q.add(new Integer(2));
362	<	q.add(new Integer(3));
363	<
470	>	q.add(one);
471	>	q.add(two);
472	>	q.add(three);
473		Iterator it = q.iterator();
474		it.next();
475		it.remove();
367	–
476		it = q.iterator();
477	<	assertEquals(it.next(), new Integer(2));
478	<	assertEquals(it.next(), new Integer(3));
477	>	assertEquals(it.next(), two);
478	>	assertEquals(it.next(), three);
479		assertFalse(it.hasNext());
480		}
481
482
483	<	public void testToString(){
484	<	ConcurrentLinkedQueue q = fullQueue(N);
483	>	/**
484	>	* toString contains toStrings of elements
485	>	*/
486	>	public void testToString() {
487	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
488		String s = q.toString();
489	<	for (int i = 0; i < N; ++i) {
489	>	for (int i = 0; i < SIZE; ++i) {
490		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
491		}
492	<	}
492	>	}
493
494	<	public void testSerialization() {
495	<	ConcurrentLinkedQueue q = fullQueue(N);
496	<	try {
497	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
498	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
499	<	out.writeObject(q);
500	<	out.close();
501	<
502	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
503	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
504	<	ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
505	<	assertEquals(q.size(), r.size());
506	<	while (!q.isEmpty())
507	<	assertEquals(q.remove(), r.remove());
508	<	} catch(Exception e){
509	<	e.printStackTrace();
399	<	fail("unexpected exception");
400	<	}
494	>	/**
495	>	* A deserialized serialized queue has same elements in same order
496	>	*/
497	>	public void testSerialization() throws Exception {
498	>	ConcurrentLinkedQueue q = populatedQueue(SIZE);
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())
509	>	assertEquals(q.remove(), r.remove());
510		}
511
512		}

Diff Legend

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