ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/ArrayBlockingQueueTest.java

Comparing jsr166/src/test/tck/ArrayBlockingQueueTest.java (file contents):
Revision 1.40 by jsr166, Thu Nov 4 01:04:54 2010 UTC vs.
Revision 1.41 by jsr166, Fri Nov 5 00:17:22 2010 UTC

#	Line 41 | Line 41 | public class ArrayBlockingQueueTest exte
41		* Create a queue of given size containing consecutive
42		* Integers 0 ... n.
43		*/
44	<	private ArrayBlockingQueue populatedQueue(int n) {
45	<	ArrayBlockingQueue q = new ArrayBlockingQueue(n);
44	>	private ArrayBlockingQueue<Integer> populatedQueue(int n) {
45	>	ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n);
46		assertTrue(q.isEmpty());
47		for (int i = 0; i < n; i++)
48		assertTrue(q.offer(new Integer(i)));
#	Line 620 | Line 620 | public class ArrayBlockingQueueTest exte
620		* toArray(a) contains all elements in FIFO order
621		*/
622		public void testToArray2() {
623	<	ArrayBlockingQueue q = populatedQueue(SIZE);
623	>	ArrayBlockingQueue<Integer> q = populatedQueue(SIZE);
624		Integer[] ints = new Integer[SIZE];
625	<	assertSame(ints, q.toArray(ints));
625	>	Integer[] array = q.toArray(ints);
626	>	assertSame(ints, array);
627		for (int i = 0; i < ints.length; i++)
628		assertSame(ints[i], q.poll());
629		}

Diff Legend

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