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, q.poll());
        }
        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, q.peek());
            assertEquals(i, q.poll());
            assertTrue(q.peek() == null ||
                       !q.peek().equals(i));
        }
        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, q.element());
            assertEquals(i, 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, q.remove());
        }
        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() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        try {
            Object o[] = q.toArray(null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * toArray with incompatible array type throws ArrayStoreException
     */
    public void testToArray1_BadArg() {
        ConcurrentLinkedQueue q = populatedQueue(SIZE);
        try {
            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();) {
            assertEquals(++k, it.next());
        }

        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.16
Committed:	Sun Nov 22 18:57:17 2009 UTC (14 years, 5 months ago) by jsr166
Branch:	MAIN
Changes since 1.15:	+11 -12 lines
Log Message:	use autoboxing judiciously for readability
#	User	Rev	Content
1	dl	1.1	/*
2	dl	1.6	* 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	jsr166	1.8	* Other contributors include Andrew Wright, Jeffrey Hayes,
6			* Pat Fisher, Mike Judd.
7	dl	1.1	*/
8
9			import junit.framework.*;
10			import java.util.*;
11			import java.util.concurrent.*;
12	dl	1.2	import java.io.*;
13	dl	1.1
14	dl	1.3	public class ConcurrentLinkedQueueTest extends JSR166TestCase {
15	dl	1.1
16			public static void main(String[] args) {
17	jsr166	1.12	junit.textui.TestRunner.run (suite());
18	dl	1.1	}
19
20			public static Test suite() {
21	jsr166	1.12	return new TestSuite(ConcurrentLinkedQueueTest.class);
22	dl	1.1	}
23
24			/**
25			* Create a queue of given size containing consecutive
26			* Integers 0 ... n.
27			*/
28	dl	1.3	private ConcurrentLinkedQueue populatedQueue(int n) {
29	dl	1.1	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
30			assertTrue(q.isEmpty());
31	jsr166	1.12	for (int i = 0; i < n; ++i)
32			assertTrue(q.offer(new Integer(i)));
33	dl	1.1	assertFalse(q.isEmpty());
34	jsr166	1.12	assertEquals(n, q.size());
35	dl	1.1	return q;
36			}
37	jsr166	1.8
38	dl	1.4	/**
39	dl	1.5	* new queue is empty
40	dl	1.4	*/
41			public void testConstructor1() {
42	dl	1.1	assertEquals(0, new ConcurrentLinkedQueue().size());
43			}
44
45	dl	1.4	/**
46	dl	1.5	* Initializing from null Collection throws NPE
47	dl	1.4	*/
48	dl	1.1	public void testConstructor3() {
49			try {
50			ConcurrentLinkedQueue q = new ConcurrentLinkedQueue((Collection)null);
51	dl	1.4	shouldThrow();
52	jsr166	1.13	} catch (NullPointerException success) {}
53	dl	1.1	}
54
55	dl	1.4	/**
56	dl	1.5	* Initializing from Collection of null elements throws NPE
57	dl	1.4	*/
58			public void testConstructor4() {
59	dl	1.1	try {
60	dl	1.3	Integer[] ints = new Integer[SIZE];
61	dl	1.1	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
62	dl	1.4	shouldThrow();
63	jsr166	1.13	} catch (NullPointerException success) {}
64	dl	1.1	}
65
66	dl	1.4	/**
67	dl	1.5	* Initializing from Collection with some null elements throws NPE
68	dl	1.4	*/
69			public void testConstructor5() {
70	dl	1.1	try {
71	dl	1.3	Integer[] ints = new Integer[SIZE];
72			for (int i = 0; i < SIZE-1; ++i)
73	dl	1.1	ints[i] = new Integer(i);
74			ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
75	dl	1.4	shouldThrow();
76	jsr166	1.15	} catch (NullPointerException success) {}
77	dl	1.1	}
78
79	dl	1.4	/**
80	dl	1.5	* Queue contains all elements of collection used to initialize
81	dl	1.4	*/
82			public void testConstructor6() {
83	jsr166	1.14	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	dl	1.1	}
90
91	dl	1.4	/**
92	dl	1.5	* isEmpty is true before add, false after
93	dl	1.4	*/
94	dl	1.1	public void testEmpty() {
95			ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
96			assertTrue(q.isEmpty());
97	dl	1.3	q.add(one);
98	dl	1.1	assertFalse(q.isEmpty());
99	dl	1.3	q.add(two);
100	dl	1.1	q.remove();
101			q.remove();
102			assertTrue(q.isEmpty());
103			}
104
105	dl	1.4	/**
106	dl	1.5	* size changes when elements added and removed
107	dl	1.4	*/
108	dl	1.1	public void testSize() {
109	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
110			for (int i = 0; i < SIZE; ++i) {
111			assertEquals(SIZE-i, q.size());
112	dl	1.1	q.remove();
113			}
114	dl	1.3	for (int i = 0; i < SIZE; ++i) {
115	dl	1.1	assertEquals(i, q.size());
116			q.add(new Integer(i));
117			}
118			}
119
120	dl	1.4	/**
121	dl	1.5	* offer(null) throws NPE
122	dl	1.4	*/
123			public void testOfferNull() {
124	jsr166	1.12	try {
125	dl	1.1	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
126			q.offer(null);
127	dl	1.4	shouldThrow();
128	jsr166	1.13	} catch (NullPointerException success) {}
129	dl	1.1	}
130
131	dl	1.4	/**
132	dl	1.5	* add(null) throws NPE
133			*/
134			public void testAddNull() {
135	jsr166	1.12	try {
136	dl	1.5	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
137			q.add(null);
138			shouldThrow();
139	jsr166	1.13	} catch (NullPointerException success) {}
140	dl	1.5	}
141
142
143			/**
144			* Offer returns true
145	dl	1.4	*/
146	dl	1.1	public void testOffer() {
147			ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
148	dl	1.3	assertTrue(q.offer(zero));
149			assertTrue(q.offer(one));
150	dl	1.1	}
151
152	dl	1.4	/**
153	dl	1.5	* add returns true
154	dl	1.4	*/
155			public void testAdd() {
156	dl	1.1	ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
157	dl	1.3	for (int i = 0; i < SIZE; ++i) {
158	dl	1.1	assertEquals(i, q.size());
159			assertTrue(q.add(new Integer(i)));
160			}
161			}
162
163	dl	1.4	/**
164	dl	1.5	* addAll(null) throws NPE
165	dl	1.4	*/
166			public void testAddAll1() {
167	dl	1.1	try {
168			ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
169			q.addAll(null);
170	dl	1.4	shouldThrow();
171	jsr166	1.13	} catch (NullPointerException success) {}
172	dl	1.1	}
173	dl	1.5
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	jsr166	1.13	} catch (IllegalArgumentException success) {}
183	dl	1.5	}
184
185	dl	1.4	/**
186	dl	1.5	* addAll of a collection with null elements throws NPE
187	dl	1.4	*/
188			public void testAddAll2() {
189	dl	1.1	try {
190			ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
191	dl	1.3	Integer[] ints = new Integer[SIZE];
192	dl	1.1	q.addAll(Arrays.asList(ints));
193	dl	1.4	shouldThrow();
194	jsr166	1.13	} catch (NullPointerException success) {}
195	dl	1.1	}
196	dl	1.4	/**
197	dl	1.5	* addAll of a collection with any null elements throws NPE after
198			* possibly adding some elements
199	dl	1.4	*/
200			public void testAddAll3() {
201	dl	1.1	try {
202			ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
203	dl	1.3	Integer[] ints = new Integer[SIZE];
204			for (int i = 0; i < SIZE-1; ++i)
205	dl	1.1	ints[i] = new Integer(i);
206			q.addAll(Arrays.asList(ints));
207	dl	1.4	shouldThrow();
208	jsr166	1.13	} catch (NullPointerException success) {}
209	dl	1.1	}
210
211	dl	1.4	/**
212	dl	1.5	* Queue contains all elements, in traversal order, of successful addAll
213	dl	1.4	*/
214			public void testAddAll5() {
215	jsr166	1.14	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	dl	1.1	}
225
226	dl	1.4	/**
227	dl	1.5	* poll succeeds unless empty
228	dl	1.4	*/
229			public void testPoll() {
230	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
231			for (int i = 0; i < SIZE; ++i) {
232	jsr166	1.16	assertEquals(i, q.poll());
233	dl	1.1	}
234	jsr166	1.12	assertNull(q.poll());
235	dl	1.1	}
236
237	dl	1.4	/**
238	dl	1.5	* peek returns next element, or null if empty
239	dl	1.4	*/
240			public void testPeek() {
241	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
242			for (int i = 0; i < SIZE; ++i) {
243	jsr166	1.16	assertEquals(i, q.peek());
244			assertEquals(i, q.poll());
245	dl	1.1	assertTrue(q.peek() == null \|\|
246	jsr166	1.16	!q.peek().equals(i));
247	dl	1.1	}
248	jsr166	1.12	assertNull(q.peek());
249	dl	1.1	}
250
251	dl	1.4	/**
252	dl	1.5	* element returns next element, or throws NSEE if empty
253	dl	1.4	*/
254			public void testElement() {
255	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
256			for (int i = 0; i < SIZE; ++i) {
257	jsr166	1.16	assertEquals(i, q.element());
258			assertEquals(i, q.poll());
259	dl	1.1	}
260			try {
261			q.element();
262	dl	1.4	shouldThrow();
263	jsr166	1.13	} catch (NoSuchElementException success) {}
264	dl	1.1	}
265
266	dl	1.4	/**
267	dl	1.5	* remove removes next element, or throws NSEE if empty
268	dl	1.4	*/
269			public void testRemove() {
270	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
271			for (int i = 0; i < SIZE; ++i) {
272	jsr166	1.16	assertEquals(i, q.remove());
273	dl	1.1	}
274			try {
275			q.remove();
276	dl	1.4	shouldThrow();
277	jsr166	1.13	} catch (NoSuchElementException success) {}
278	dl	1.1	}
279
280	dl	1.4	/**
281	dl	1.5	* remove(x) removes x and returns true if present
282	dl	1.4	*/
283			public void testRemoveElement() {
284	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
285			for (int i = 1; i < SIZE; i+=2) {
286	dl	1.1	assertTrue(q.remove(new Integer(i)));
287			}
288	dl	1.3	for (int i = 0; i < SIZE; i+=2) {
289	dl	1.1	assertTrue(q.remove(new Integer(i)));
290			assertFalse(q.remove(new Integer(i+1)));
291			}
292	dl	1.2	assertTrue(q.isEmpty());
293	dl	1.1	}
294	jsr166	1.8
295	dl	1.4	/**
296	dl	1.5	* contains(x) reports true when elements added but not yet removed
297	dl	1.4	*/
298			public void testContains() {
299	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
300			for (int i = 0; i < SIZE; ++i) {
301	dl	1.1	assertTrue(q.contains(new Integer(i)));
302			q.poll();
303			assertFalse(q.contains(new Integer(i)));
304			}
305			}
306
307	dl	1.4	/**
308	dl	1.5	* clear removes all elements
309	dl	1.4	*/
310			public void testClear() {
311	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
312	dl	1.1	q.clear();
313			assertTrue(q.isEmpty());
314			assertEquals(0, q.size());
315	dl	1.3	q.add(one);
316	dl	1.1	assertFalse(q.isEmpty());
317			q.clear();
318			assertTrue(q.isEmpty());
319			}
320
321	dl	1.4	/**
322	dl	1.5	* containsAll(c) is true when c contains a subset of elements
323	dl	1.4	*/
324			public void testContainsAll() {
325	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
326	dl	1.1	ConcurrentLinkedQueue p = new ConcurrentLinkedQueue();
327	dl	1.3	for (int i = 0; i < SIZE; ++i) {
328	dl	1.1	assertTrue(q.containsAll(p));
329			assertFalse(p.containsAll(q));
330			p.add(new Integer(i));
331			}
332			assertTrue(p.containsAll(q));
333			}
334
335	dl	1.4	/**
336	dl	1.5	* retainAll(c) retains only those elements of c and reports true if change
337	dl	1.4	*/
338			public void testRetainAll() {
339	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
340			ConcurrentLinkedQueue p = populatedQueue(SIZE);
341			for (int i = 0; i < SIZE; ++i) {
342	dl	1.1	boolean changed = q.retainAll(p);
343			if (i == 0)
344			assertFalse(changed);
345			else
346			assertTrue(changed);
347
348			assertTrue(q.containsAll(p));
349	dl	1.3	assertEquals(SIZE-i, q.size());
350	dl	1.1	p.remove();
351			}
352			}
353
354	dl	1.4	/**
355	dl	1.5	* removeAll(c) removes only those elements of c and reports true if changed
356	dl	1.4	*/
357			public void testRemoveAll() {
358	dl	1.3	for (int i = 1; i < SIZE; ++i) {
359			ConcurrentLinkedQueue q = populatedQueue(SIZE);
360			ConcurrentLinkedQueue p = populatedQueue(i);
361	dl	1.1	assertTrue(q.removeAll(p));
362	dl	1.3	assertEquals(SIZE-i, q.size());
363	dl	1.1	for (int j = 0; j < i; ++j) {
364			Integer I = (Integer)(p.remove());
365			assertFalse(q.contains(I));
366			}
367			}
368			}
369
370	dl	1.4	/**
371	dl	1.5	* toArray contains all elements
372	dl	1.4	*/
373			public void testToArray() {
374	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
375	jsr166	1.12	Object[] o = q.toArray();
376	dl	1.1	Arrays.sort(o);
377	jsr166	1.12	for (int i = 0; i < o.length; i++)
378			assertEquals(o[i], q.poll());
379	dl	1.1	}
380
381	dl	1.4	/**
382	dl	1.5	* toArray(a) contains all elements
383	dl	1.4	*/
384			public void testToArray2() {
385	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
386	jsr166	1.12	Integer[] ints = new Integer[SIZE];
387			ints = (Integer[])q.toArray(ints);
388	dl	1.1	Arrays.sort(ints);
389	jsr166	1.9	for (int i = 0; i < ints.length; i++)
390	dl	1.1	assertEquals(ints[i], q.poll());
391			}
392	dl	1.5
393			/**
394			* toArray(null) throws NPE
395			*/
396			public void testToArray_BadArg() {
397	jsr166	1.16	ConcurrentLinkedQueue q = populatedQueue(SIZE);
398	jsr166	1.12	try {
399			Object o[] = q.toArray(null);
400			shouldThrow();
401			} catch (NullPointerException success) {}
402	dl	1.5	}
403
404			/**
405	jsr166	1.11	* toArray with incompatible array type throws ArrayStoreException
406	dl	1.5	*/
407			public void testToArray1_BadArg() {
408	jsr166	1.16	ConcurrentLinkedQueue q = populatedQueue(SIZE);
409	jsr166	1.12	try {
410	jsr166	1.16	Object o[] = q.toArray(new String[10]);
411	jsr166	1.12	shouldThrow();
412			} catch (ArrayStoreException success) {}
413	dl	1.5	}
414	jsr166	1.8
415	dl	1.4	/**
416	dl	1.5	* iterator iterates through all elements
417	dl	1.4	*/
418			public void testIterator() {
419	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
420	dl	1.1	int i = 0;
421	jsr166	1.12	Iterator it = q.iterator();
422	jsr166	1.9	while (it.hasNext()) {
423	dl	1.1	assertTrue(q.contains(it.next()));
424			++i;
425			}
426	dl	1.3	assertEquals(i, SIZE);
427	dl	1.1	}
428
429	dl	1.4	/**
430	dl	1.5	* iterator ordering is FIFO
431	dl	1.4	*/
432	dl	1.1	public void testIteratorOrdering() {
433			final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
434	dl	1.3	q.add(one);
435			q.add(two);
436			q.add(three);
437	dl	1.1
438			int k = 0;
439			for (Iterator it = q.iterator(); it.hasNext();) {
440	jsr166	1.16	assertEquals(++k, it.next());
441	dl	1.1	}
442
443	dl	1.4	assertEquals(3, k);
444	dl	1.1	}
445
446	dl	1.4	/**
447	dl	1.5	* Modifications do not cause iterators to fail
448	dl	1.4	*/
449	dl	1.1	public void testWeaklyConsistentIteration () {
450			final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
451	dl	1.3	q.add(one);
452			q.add(two);
453			q.add(three);
454	dl	1.1
455	jsr166	1.13	for (Iterator it = q.iterator(); it.hasNext();) {
456			q.remove();
457			it.next();
458	dl	1.1	}
459
460			assertEquals("queue should be empty again", 0, q.size());
461			}
462
463	dl	1.4	/**
464	dl	1.5	* iterator.remove removes current element
465	dl	1.4	*/
466	dl	1.1	public void testIteratorRemove () {
467			final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
468	dl	1.3	q.add(one);
469			q.add(two);
470			q.add(three);
471	dl	1.1	Iterator it = q.iterator();
472			it.next();
473			it.remove();
474			it = q.iterator();
475	dl	1.3	assertEquals(it.next(), two);
476			assertEquals(it.next(), three);
477	dl	1.1	assertFalse(it.hasNext());
478			}
479
480
481	dl	1.4	/**
482	dl	1.5	* toString contains toStrings of elements
483	dl	1.4	*/
484			public void testToString() {
485	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
486	dl	1.1	String s = q.toString();
487	dl	1.3	for (int i = 0; i < SIZE; ++i) {
488	dl	1.1	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
489			}
490	jsr166	1.8	}
491	dl	1.2
492	dl	1.4	/**
493	dl	1.5	* A deserialized serialized queue has same elements in same order
494	dl	1.4	*/
495	jsr166	1.13	public void testSerialization() throws Exception {
496	dl	1.3	ConcurrentLinkedQueue q = populatedQueue(SIZE);
497	jsr166	1.13	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	dl	1.2	}
509	dl	1.1
510			}