ViewVC Help

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

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

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

#	Line 38 | Line 38 | public class LinkedBlockingDequeTest ext
38		* Create a deque of given size containing consecutive
39		* Integers 0 ... n.
40		*/
41	<	private LinkedBlockingDeque populatedDeque(int n) {
42	<	LinkedBlockingDeque q = new LinkedBlockingDeque(n);
41	>	private LinkedBlockingDeque<Integer> populatedDeque(int n) {
42	>	LinkedBlockingDeque<Integer> q =
43	>	new LinkedBlockingDeque<Integer>(n);
44		assertTrue(q.isEmpty());
45		for (int i = 0; i < n; i++)
46		assertTrue(q.offer(new Integer(i)));
#	Line 1307 | Line 1308 | public class LinkedBlockingDequeTest ext
1308		* toArray(a) contains all elements in FIFO order
1309		*/
1310		public void testToArray2() {
1311	<	LinkedBlockingDeque q = populatedDeque(SIZE);
1311	>	LinkedBlockingDeque<Integer> q = populatedDeque(SIZE);
1312		Integer[] ints = new Integer[SIZE];
1313	<	assertSame(ints, q.toArray(ints));
1313	>	Integer[] array = q.toArray(ints);
1314	>	assertSame(ints, array);
1315		for (int i = 0; i < ints.length; i++)
1316		assertSame(ints[i], q.remove());
1317		}

Diff Legend

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