test/tck/PriorityQueueTest.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/publicdomain/zero/1.0/
 * Other contributors include Andrew Wright, Jeffrey Hayes,
 * Pat Fisher, Mike Judd.
 */

import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.Queue;

import junit.framework.Test;
import junit.framework.TestSuite;

public class PriorityQueueTest extends JSR166TestCase {
    public static void main(String[] args) {
        junit.textui.TestRunner.run(suite());
    }
    public static Test suite() {
        return new TestSuite(PriorityQueueTest.class);
    }

    static class MyReverseComparator implements Comparator {
        public int compare(Object x, Object y) {
            return ((Comparable)y).compareTo(x);
        }
    }

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

    /**
     * A new queue has unbounded capacity
     */
    public void testConstructor1() {
        assertEquals(0, new PriorityQueue(SIZE).size());
    }

    /**
     * Constructor throws IAE if capacity argument nonpositive
     */
    public void testConstructor2() {
        try {
            new PriorityQueue(0);
            shouldThrow();
        } catch (IllegalArgumentException success) {}
    }

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

    /**
     * Initializing from Collection of null elements throws NPE
     */
    public void testConstructor4() {
        try {
            Integer[] ints = new Integer[SIZE];
            new PriorityQueue(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);
            new PriorityQueue(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);
        PriorityQueue q = new PriorityQueue(Arrays.asList(ints));
        for (int i = 0; i < SIZE; ++i)
            assertEquals(ints[i], q.poll());
    }

    /**
     * The comparator used in constructor is used
     */
    public void testConstructor7() {
        MyReverseComparator cmp = new MyReverseComparator();
        PriorityQueue q = new PriorityQueue(SIZE, cmp);
        assertEquals(cmp, q.comparator());
        Integer[] ints = new Integer[SIZE];
        for (int i = 0; i < SIZE; ++i)
            ints[i] = new Integer(i);
        q.addAll(Arrays.asList(ints));
        for (int i = SIZE-1; i >= 0; --i)
            assertEquals(ints[i], q.poll());
    }

    /**
     * isEmpty is true before add, false after
     */
    public void testEmpty() {
        PriorityQueue q = new PriorityQueue(2);
        assertTrue(q.isEmpty());
        q.add(new Integer(1));
        assertFalse(q.isEmpty());
        q.add(new Integer(2));
        q.remove();
        q.remove();
        assertTrue(q.isEmpty());
    }

    /**
     * size changes when elements added and removed
     */
    public void testSize() {
        PriorityQueue 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 {
            PriorityQueue q = new PriorityQueue(1);
            q.offer(null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }

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

    /**
     * Offer of comparable element succeeds
     */
    public void testOffer() {
        PriorityQueue q = new PriorityQueue(1);
        assertTrue(q.offer(zero));
        assertTrue(q.offer(one));
    }

    /**
     * Offer of non-Comparable throws CCE
     */
    public void testOfferNonComparable() {
        try {
            PriorityQueue q = new PriorityQueue(1);
            q.offer(new Object());
            q.offer(new Object());
            q.offer(new Object());
            shouldThrow();
        } catch (ClassCastException success) {}
    }

    /**
     * add of comparable succeeds
     */
    public void testAdd() {
        PriorityQueue q = new PriorityQueue(SIZE);
        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 {
            PriorityQueue q = new PriorityQueue(1);
            q.addAll(null);
            shouldThrow();
        } catch (NullPointerException success) {}
    }

    /**
     * addAll of a collection with null elements throws NPE
     */
    public void testAddAll2() {
        try {
            PriorityQueue q = new PriorityQueue(SIZE);
            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 {
            PriorityQueue q = new PriorityQueue(SIZE);
            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 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(SIZE-1-i);
        PriorityQueue q = new PriorityQueue(SIZE);
        assertFalse(q.addAll(Arrays.asList(empty)));
        assertTrue(q.addAll(Arrays.asList(ints)));
        for (int i = 0; i < SIZE; ++i)
            assertEquals(new Integer(i), q.poll());
    }

    /**
     * poll succeeds unless empty
     */
    public void testPoll() {
        PriorityQueue 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() {
        PriorityQueue 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() {
        PriorityQueue 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() {
        PriorityQueue 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() {
        PriorityQueue q = populatedQueue(SIZE);
        for (int i = 1; i < SIZE; i += 2) {
            assertTrue(q.contains(i));
            assertTrue(q.remove(i));
            assertFalse(q.contains(i));
            assertTrue(q.contains(i-1));
        }
        for (int i = 0; i < SIZE; i += 2) {
            assertTrue(q.contains(i));
            assertTrue(q.remove(i));
            assertFalse(q.contains(i));
            assertFalse(q.remove(i+1));
            assertFalse(q.contains(i+1));
        }
        assertTrue(q.isEmpty());
    }

    /**
     * contains(x) reports true when elements added but not yet removed
     */
    public void testContains() {
        PriorityQueue 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() {
        PriorityQueue q = populatedQueue(SIZE);
        q.clear();
        assertTrue(q.isEmpty());
        assertEquals(0, q.size());
        q.add(new Integer(1));
        assertFalse(q.isEmpty());
        q.clear();
        assertTrue(q.isEmpty());
    }

    /**
     * containsAll(c) is true when c contains a subset of elements
     */
    public void testContainsAll() {
        PriorityQueue q = populatedQueue(SIZE);
        PriorityQueue p = new PriorityQueue(SIZE);
        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 changed
     */
    public void testRetainAll() {
        PriorityQueue q = populatedQueue(SIZE);
        PriorityQueue 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) {
            PriorityQueue q = populatedQueue(SIZE);
            PriorityQueue p = populatedQueue(i);
            assertTrue(q.removeAll(p));
            assertEquals(SIZE-i, q.size());
            for (int j = 0; j < i; ++j) {
                Integer x = (Integer)(p.remove());
                assertFalse(q.contains(x));
            }
        }
    }

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

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

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

    /**
     * iterator of empty collection has no elements
     */
    public void testEmptyIterator() {
        assertIteratorExhausted(new PriorityQueue().iterator());
    }

    /**
     * iterator.remove removes current element
     */
    public void testIteratorRemove() {
        final PriorityQueue q = new PriorityQueue(3);
        q.add(new Integer(2));
        q.add(new Integer(1));
        q.add(new Integer(3));

        Iterator it = q.iterator();
        it.next();
        it.remove();

        it = q.iterator();
        assertEquals(it.next(), new Integer(2));
        assertEquals(it.next(), new Integer(3));
        assertFalse(it.hasNext());
    }

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

    /**
     * A deserialized serialized queue has same elements
     */
    public void testSerialization() throws Exception {
        Queue x = populatedQueue(SIZE);
        Queue y = serialClone(x);

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