--- jsr166/src/test/tck/ConcurrentLinkedDequeTest.java	2010/11/04 01:04:54	1.4
+++ jsr166/src/test/tck/ConcurrentLinkedDequeTest.java	2010/11/05 00:17:22	1.5
@@ -25,8 +25,8 @@ public class ConcurrentLinkedDequeTest e
      * Create a deque of given size containing consecutive
      * Integers 0 ... n.
      */
-    private ConcurrentLinkedDeque populatedDeque(int n) {
-        ConcurrentLinkedDeque q = new ConcurrentLinkedDeque();
+    private ConcurrentLinkedDeque<Integer> populatedDeque(int n) {
+        ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<Integer>();
         assertTrue(q.isEmpty());
         for (int i = 0; i < n; ++i)
             assertTrue(q.offer(new Integer(i)));
@@ -648,9 +648,10 @@ public class ConcurrentLinkedDequeTest e
      * toArray(a) contains all elements in FIFO order
      */
     public void testToArray2() {
-        ConcurrentLinkedDeque q = populatedDeque(SIZE);
+        ConcurrentLinkedDeque<Integer> q = populatedDeque(SIZE);
         Integer[] ints = new Integer[SIZE];
-        assertSame(ints, q.toArray(ints));
+        Integer[] array = q.toArray(ints);
+        assertSame(ints, array);
         for (int i = 0; i < ints.length; i++)
             assertSame(ints[i], q.poll());
     }