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.22 by jsr166, Thu Nov 4 01:04:54 2010 UTC vs.
Revision 1.23 by jsr166, Fri Nov 5 00:17:22 2010 UTC

#	Line 25 | Line 25 | public class ConcurrentLinkedQueueTest e
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();
28	>	private ConcurrentLinkedQueue<Integer> populatedQueue(int n) {
29	>	ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<Integer>();
30		assertTrue(q.isEmpty());
31		for (int i = 0; i < n; ++i)
32		assertTrue(q.offer(new Integer(i)));
#	Line 382 | Line 382 | public class ConcurrentLinkedQueueTest e
382		* toArray(a) contains all elements in FIFO order
383		*/
384		public void testToArray2() {
385	<	ConcurrentLinkedQueue q = populatedQueue(SIZE);
385	>	ConcurrentLinkedQueue<Integer> q = populatedQueue(SIZE);
386		Integer[] ints = new Integer[SIZE];
387	<	assertSame(ints, q.toArray(ints));
387	>	Integer[] array = q.toArray(ints);
388	>	assertSame(ints, array);
389		for (int i = 0; i < ints.length; i++)
390		assertSame(ints[i], q.poll());
391		}

Diff Legend

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