test/tck/ConcurrentLinkedQueueTest.java

/*
 * Written by Doug Lea with assistance from members of JCP JSR-166
 * Expert Group and released to the public domain, as explained at
 * http://creativecommons.org/licenses/publicdomain
 * Other contributors include Andrew Wright, Jeffrey Hayes,
 * Pat Fisher, Mike Judd.
 */

import junit.framework.*;
import java.util.*;
import java.util.concurrent.*;
import java.io.*;

public class ConcurrentLinkedQueueTest extends JSR166TestCase {

    public static void main(String[] args) {
        junit.textui.TestRunner.run (suite());
    }

    public static Test suite() {
        return new TestSuite(ConcurrentLinkedQueueTest.class);
    }

    /**
     * Create a queue of given size containing consecutive
     * Integers 0 ... n.
     */
    private ConcurrentLinkedQueue populatedQueue(int n) {
        ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        assertTrue(q.isEmpty());
        for (int i = 0; i < n; ++i)
            assertTrue(q.offer(new Integer(i)));
        assertFalse(q.isEmpty());
        assertEquals(n, q.size());
        return q;
    }

    /**
     * new queue is empty
     */
    public void testConstructor1() {
        assertEquals(0, new ConcurrentLinkedQueue().size());
    }

    /**
     *  Initializing from null Collection throws NPE
     */
    public void testConstructor3() {
        try {
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue((Collection)null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * Initializing from Collection of null elements throws NPE
     */
    public void testConstructor4() {
        try {
            Integer[] ints = new Integer[SIZE];
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * Initializing from Collection with some null elements throws NPE
     */
    public void testConstructor5() {
        try {
            Integer[] ints = new Integer[SIZE];
            for (int i = 0; i < SIZE-1; ++i)
                ints[i] = new Integer(i);
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
            shouldThrow();
        }
        catch (NullPointerException success) {}
    }

    /**
     * Queue contains all elements of collection used to initialize
     */
    public void testConstructor6() {
        Integer[] ints = new Integer[SIZE];
        for (int i = 0; i < SIZE; ++i)
            ints[i] = new Integer(i);
        ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
        for (int i = 0; i < SIZE; ++i)
            assertEquals(ints[i], q.poll());
    }

    /**
     * isEmpty is true before add, false after
     */
    public void testEmpty() {
        ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        assertTrue(q.isEmpty());
        q.add(one);
        assertFalse(q.isEmpty());
        q.add(two);
        q.remove();
        q.remove();
        assertTrue(q.isEmpty());
    }

    /**
     * size changes when elements added and removed
     */
    public void testSize() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            assertEquals(SIZE-i, q.size());
            q.remove();
        }
        for (int i = 0; i < SIZE; ++i) {
            assertEquals(i, q.size());
            q.add(new Integer(i));
        }
    }

    /**
     * offer(null) throws NPE
     */
    public void testOfferNull() {
        try {
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
            q.offer(null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * add(null) throws NPE
     */
    public void testAddNull() {
        try {
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
            q.add(null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }


    /**
     * Offer returns true
     */
    public void testOffer() {
        ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        assertTrue(q.offer(zero));
        assertTrue(q.offer(one));
    }

    /**
     * add returns true
     */
    public void testAdd() {
        ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        for (int i = 0; i < SIZE; ++i) {
            assertEquals(i, q.size());
            assertTrue(q.add(new Integer(i)));
        }
    }

    /**
     * addAll(null) throws NPE
     */
    public void testAddAll1() {
        try {
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
            q.addAll(null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * addAll(this) throws IAE
     */
    public void testAddAllSelf() {
        try {
            ConcurrentLinkedQueue q = populatedQueue(SIZE);
            q.addAll(q);
            shouldThrow();
        } catch (IllegalArgumentException success) {}
    }

    /**
     * addAll of a collection with null elements throws NPE
     */
    public void testAddAll2() {
        try {
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
            Integer[] ints = new Integer[SIZE];
            q.addAll(Arrays.asList(ints));
            shouldThrow();
        } catch (NullPointerException success) {}
    }
    /**
     *  addAll of a collection with any null elements throws NPE after
     * possibly adding some elements
     */
    public void testAddAll3() {
        try {
            ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
            Integer[] ints = new Integer[SIZE];
            for (int i = 0; i < SIZE-1; ++i)
                ints[i] = new Integer(i);
            q.addAll(Arrays.asList(ints));
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * Queue contains all elements, in traversal order, of successful addAll
     */
    public void testAddAll5() {
        Integer[] empty = new Integer[0];
        Integer[] ints = new Integer[SIZE];
        for (int i = 0; i < SIZE; ++i)
            ints[i] = new Integer(i);
        ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        assertFalse(q.addAll(Arrays.asList(empty)));
        assertTrue(q.addAll(Arrays.asList(ints)));
        for (int i = 0; i < SIZE; ++i)
            assertEquals(ints[i], q.poll());
    }

    /**
     * poll succeeds unless empty
     */
    public void testPoll() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            assertEquals(i, ((Integer)q.poll()).intValue());
        }
        assertNull(q.poll());
    }

    /**
     * peek returns next element, or null if empty
     */
    public void testPeek() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            assertEquals(i, ((Integer)q.peek()).intValue());
            q.poll();
            assertTrue(q.peek() == null ||
                       i != ((Integer)q.peek()).intValue());
        }
        assertNull(q.peek());
    }

    /**
     * element returns next element, or throws NSEE if empty
     */
    public void testElement() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            assertEquals(i, ((Integer)q.element()).intValue());
            q.poll();
        }
        try {
            q.element();
            shouldThrow();
        } catch (NoSuchElementException success) {}
    }

    /**
     *  remove removes next element, or throws NSEE if empty
     */
    public void testRemove() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            assertEquals(i, ((Integer)q.remove()).intValue());
        }
        try {
            q.remove();
            shouldThrow();
        } catch (NoSuchElementException success) {}
    }

    /**
     * remove(x) removes x and returns true if present
     */
    public void testRemoveElement() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        for (int i = 1; i < SIZE; i+=2) {
            assertTrue(q.remove(new Integer(i)));
        }
        for (int i = 0; i < SIZE; i+=2) {
            assertTrue(q.remove(new Integer(i)));
            assertFalse(q.remove(new Integer(i+1)));
        }
        assertTrue(q.isEmpty());
    }

    /**
     * contains(x) reports true when elements added but not yet removed
     */
    public void testContains() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            assertTrue(q.contains(new Integer(i)));
            q.poll();
            assertFalse(q.contains(new Integer(i)));
        }
    }

    /**
     * clear removes all elements
     */
    public void testClear() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        q.clear();
        assertTrue(q.isEmpty());
        assertEquals(0, q.size());
        q.add(one);
        assertFalse(q.isEmpty());
        q.clear();
        assertTrue(q.isEmpty());
    }

    /**
     * containsAll(c) is true when c contains a subset of elements
     */
    public void testContainsAll() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        ConcurrentLinkedQueue p = new ConcurrentLinkedQueue();
        for (int i = 0; i < SIZE; ++i) {
            assertTrue(q.containsAll(p));
            assertFalse(p.containsAll(q));
            p.add(new Integer(i));
        }
        assertTrue(p.containsAll(q));
    }

    /**
     * retainAll(c) retains only those elements of c and reports true if change
     */
    public void testRetainAll() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        ConcurrentLinkedQueue p = populatedQueue(SIZE);
        for (int i = 0; i < SIZE; ++i) {
            boolean changed = q.retainAll(p);
            if (i == 0)
                assertFalse(changed);
            else
                assertTrue(changed);

            assertTrue(q.containsAll(p));
            assertEquals(SIZE-i, q.size());
            p.remove();
        }
    }

    /**
     * removeAll(c) removes only those elements of c and reports true if changed
     */
    public void testRemoveAll() {
        for (int i = 1; i < SIZE; ++i) {
            ConcurrentLinkedQueue q = populatedQueue(SIZE);
            ConcurrentLinkedQueue p = populatedQueue(i);
            assertTrue(q.removeAll(p));
            assertEquals(SIZE-i, q.size());
            for (int j = 0; j < i; ++j) {
                Integer I = (Integer)(p.remove());
                assertFalse(q.contains(I));
            }
        }
    }

    /**
     * toArray contains all elements
     */
    public void testToArray() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        Object[] o = q.toArray();
        Arrays.sort(o);
        for (int i = 0; i < o.length; i++)
            assertEquals(o[i], q.poll());
    }

    /**
     *  toArray(a) contains all elements
     */
    public void testToArray2() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        Integer[] ints = new Integer[SIZE];
        ints = (Integer[])q.toArray(ints);
        Arrays.sort(ints);
        for (int i = 0; i < ints.length; i++)
            assertEquals(ints[i], q.poll());
    }

    /**
     * toArray(null) throws NPE
     */
    public void testToArray_BadArg() {
        try {
            ConcurrentLinkedQueue q = populatedQueue(SIZE);
            Object o[] = q.toArray(null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * toArray with incompatible array type throws ArrayStoreException
     */
    public void testToArray1_BadArg() {
        try {
            ConcurrentLinkedQueue q = populatedQueue(SIZE);
            Object o[] = q.toArray(new String[10] );
            shouldThrow();
        } catch (ArrayStoreException success) {}
    }

    /**
     *  iterator iterates through all elements
     */
    public void testIterator() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        int i = 0;
        Iterator it = q.iterator();
        while (it.hasNext()) {
            assertTrue(q.contains(it.next()));
            ++i;
        }
        assertEquals(i, SIZE);
    }

    /**
     * iterator ordering is FIFO
     */
    public void testIteratorOrdering() {
        final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        q.add(one);
        q.add(two);
        q.add(three);

        int k = 0;
        for (Iterator it = q.iterator(); it.hasNext();) {
            int i = ((Integer)(it.next())).intValue();
            assertEquals(++k, i);
        }

        assertEquals(3, k);
    }

    /**
     * Modifications do not cause iterators to fail
     */
    public void testWeaklyConsistentIteration () {
        final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        q.add(one);
        q.add(two);
        q.add(three);

        for (Iterator it = q.iterator(); it.hasNext();) {
            q.remove();
            it.next();
        }

        assertEquals("queue should be empty again", 0, q.size());
    }

    /**
     * iterator.remove removes current element
     */
    public void testIteratorRemove () {
        final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
        q.add(one);
        q.add(two);
        q.add(three);
        Iterator it = q.iterator();
        it.next();
        it.remove();
        it = q.iterator();
        assertEquals(it.next(), two);
        assertEquals(it.next(), three);
        assertFalse(it.hasNext());
    }


    /**
     * toString contains toStrings of elements
     */
    public void testToString() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        String s = q.toString();
        for (int i = 0; i < SIZE; ++i) {
            assertTrue(s.indexOf(String.valueOf(i)) >= 0);
        }
    }

    /**
     * A deserialized serialized queue has same elements in same order
     */
    public void testSerialization() throws Exception {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
        ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
        out.writeObject(q);
        out.close();

        ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
        ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
        ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
        assertEquals(q.size(), r.size());
        while (!q.isEmpty())
            assertEquals(q.remove(), r.remove());
    }

}
Revision:	1.14
Committed:	Sat Nov 21 10:29:50 2009 UTC (14 years, 6 months ago) by jsr166
Branch:	MAIN
Changes since 1.13:	+15 -21 lines
Log Message:	improve exception handling
#	Content
1	/*
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.*;
10	import java.util.*;
11	import java.util.concurrent.*;
12	import java.io.*;
13
14	public class ConcurrentLinkedQueueTest extends JSR166TestCase {
15
16	public static void main(String[] args) {
17	junit.textui.TestRunner.run (suite());
18	}
19
20	public static Test suite() {
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();
30	assertTrue(q.isEmpty());
31	for (int i = 0; i < n; ++i)
32	assertTrue(q.offer(new Integer(i)));
33	assertFalse(q.isEmpty());
34	assertEquals(n, q.size());
35	return q;
36	}
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	shouldThrow();
52	} catch (NullPointerException success) {}
53	}
54
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	shouldThrow();
63	} catch (NullPointerException success) {}
64	}
65
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	shouldThrow();
76	}
77	catch (NullPointerException success) {}
78	}
79
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(one);
99	assertFalse(q.isEmpty());
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 = 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 < SIZE; ++i) {
116	assertEquals(i, q.size());
117	q.add(new Integer(i));
118	}
119	}
120
121	/**
122	* offer(null) throws NPE
123	*/
124	public void testOfferNull() {
125	try {
126	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
127	q.offer(null);
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(zero));
150	assertTrue(q.offer(one));
151	}
152
153	/**
154	* add returns true
155	*/
156	public void testAdd() {
157	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
158	for (int i = 0; i < SIZE; ++i) {
159	assertEquals(i, q.size());
160	assertTrue(q.add(new Integer(i)));
161	}
162	}
163
164	/**
165	* addAll(null) throws NPE
166	*/
167	public void testAddAll1() {
168	try {
169	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
170	q.addAll(null);
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
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[SIZE];
193	q.addAll(Arrays.asList(ints));
194	shouldThrow();
195	} catch (NullPointerException success) {}
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	shouldThrow();
209	} catch (NullPointerException success) {}
210	}
211
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	/**
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());
236	}
237
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());
250	}
251
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	shouldThrow();
264	} catch (NoSuchElementException success) {}
265	}
266
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	shouldThrow();
278	} catch (NoSuchElementException success) {}
279	}
280
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 < 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	/**
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	/**
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(one);
317	assertFalse(q.isEmpty());
318	q.clear();
319	assertTrue(q.isEmpty());
320	}
321
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) {
329	assertTrue(q.containsAll(p));
330	assertFalse(p.containsAll(q));
331	p.add(new Integer(i));
332	}
333	assertTrue(p.containsAll(q));
334	}
335
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);
346	else
347	assertTrue(changed);
348
349	assertTrue(q.containsAll(p));
350	assertEquals(SIZE-i, q.size());
351	p.remove();
352	}
353	}
354
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(SIZE-i, q.size());
364	for (int j = 0; j < i; ++j) {
365	Integer I = (Integer)(p.remove());
366	assertFalse(q.contains(I));
367	}
368	}
369	}
370
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());
380	}
381
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++)
391	assertEquals(ints[i], q.poll());
392	}
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()) {
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);
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(++k, i);
443	}
444
445	assertEquals(3, k);
446	}
447
448	/**
449	* Modifications do not cause iterators to fail
450	*/
451	public void testWeaklyConsistentIteration () {
452	final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
453	q.add(one);
454	q.add(two);
455	q.add(three);
456
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 () {
469	final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
470	q.add(one);
471	q.add(two);
472	q.add(three);
473	Iterator it = q.iterator();
474	it.next();
475	it.remove();
476	it = q.iterator();
477	assertEquals(it.next(), two);
478	assertEquals(it.next(), three);
479	assertFalse(it.hasNext());
480	}
481
482
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 < SIZE; ++i) {
490	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
491	}
492	}
493
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	}