--- jsr166/src/test/tck/LinkedBlockingDequeTest.java	2011/05/31 16:16:24	1.41
+++ jsr166/src/test/tck/LinkedBlockingDequeTest.java	2011/10/25 20:29:12	1.43
@@ -29,7 +29,7 @@ public class LinkedBlockingDequeTest ext
 
     public static class Bounded extends BlockingQueueTest {
         protected BlockingQueue emptyCollection() {
-            return new LinkedBlockingDeque(20);
+            return new LinkedBlockingDeque(SIZE);
         }
     }
 
@@ -1400,27 +1400,6 @@ public class LinkedBlockingDequeTest ext
     }
 
     /**
-     * remove(x) removes x and returns true if present
-     */
-    public void testRemoveElement() {
-        LinkedBlockingDeque q = populatedDeque(SIZE);
-        for (int i = 1; i < SIZE; i+=2) {
-            assertTrue(q.contains(i));
-            assertTrue(q.remove(i));
-            assertFalse(q.contains(i));
-            assertTrue(q.contains(i-1));
-        }
-        for (int i = 0; i < SIZE; i+=2) {
-            assertTrue(q.contains(i));
-            assertTrue(q.remove(i));
-            assertFalse(q.contains(i));
-            assertFalse(q.remove(i+1));
-            assertFalse(q.contains(i+1));
-        }
-        assertTrue(q.isEmpty());
-    }
-
-    /**
      * contains(x) reports true when elements added but not yet removed
      */
     public void testContains() {
@@ -1500,7 +1479,7 @@ public class LinkedBlockingDequeTest ext
     /**
      * toArray contains all elements in FIFO order
      */
-    public void testToArray() throws InterruptedException{
+    public void testToArray() throws InterruptedException {
         LinkedBlockingDeque q = populatedDeque(SIZE);
         Object[] o = q.toArray();
         for (int i = 0; i < o.length; i++)