--- jsr166/src/test/tck/ArrayDequeTest.java	2016/10/10 14:18:06	1.39
+++ jsr166/src/test/tck/ArrayDequeTest.java	2016/10/16 20:44:18	1.41
@@ -22,12 +22,20 @@ public class ArrayDequeTest extends JSR1
     }
 
     public static Test suite() {
-        return new TestSuite(ArrayDequeTest.class);
+        class Implementation implements CollectionImplementation {
+            public Class<?> klazz() { return ArrayDeque.class; }
+            public Collection emptyCollection() { return new ArrayDeque(); }
+            public Object makeElement(int i) { return i; }
+            public boolean isConcurrent() { return false; }
+            public boolean permitsNulls() { return false; }
+        }
+        return newTestSuite(ArrayDequeTest.class,
+                            CollectionTest.testSuite(new Implementation()));
     }
 
     /**
      * Returns a new deque of given size containing consecutive
-     * Integers 0 ... n.
+     * Integers 0 ... n - 1.
      */
     private ArrayDeque<Integer> populatedDeque(int n) {
         ArrayDeque<Integer> q = new ArrayDeque<Integer>();
@@ -36,6 +44,8 @@ public class ArrayDequeTest extends JSR1
             assertTrue(q.offerLast(new Integer(i)));
         assertFalse(q.isEmpty());
         assertEquals(n, q.size());
+        assertEquals((Integer) 0, q.peekFirst());
+        assertEquals((Integer) (n - 1), q.peekLast());
         return q;
     }