ViewVC Help

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

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

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

#	Line 49 | Line 49 | public class PriorityBlockingQueueTest e
49		* Create a queue of given size containing consecutive
50		* Integers 0 ... n.
51		*/
52	<	private PriorityBlockingQueue populatedQueue(int n) {
53	<	PriorityBlockingQueue q = new PriorityBlockingQueue(n);
52	>	private PriorityBlockingQueue<Integer> populatedQueue(int n) {
53	>	PriorityBlockingQueue<Integer> q =
54	>	new PriorityBlockingQueue<Integer>(n);
55		assertTrue(q.isEmpty());
56		for (int i = n-1; i >= 0; i-=2)
57		assertTrue(q.offer(new Integer(i)));
#	Line 593 | Line 594 | public class PriorityBlockingQueueTest e
594		* toArray(a) contains all elements
595		*/
596		public void testToArray2() throws InterruptedException {
597	<	PriorityBlockingQueue q = populatedQueue(SIZE);
597	>	PriorityBlockingQueue<Integer> q = populatedQueue(SIZE);
598		Integer[] ints = new Integer[SIZE];
599	<	assertSame(ints, q.toArray(ints));
599	>	Integer[] array = q.toArray(ints);
600	>	assertSame(ints, array);
601		Arrays.sort(ints);
602		for (int i = 0; i < ints.length; i++)
603		assertSame(ints[i], q.take());

Diff Legend

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