ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/ArrayDequeTest.java
(Generate patch)

Comparing jsr166/src/test/tck/ArrayDequeTest.java (file contents):
Revision 1.36 by jsr166, Sat May 23 00:53:08 2015 UTC vs.
Revision 1.51 by jsr166, Tue Oct 25 01:32:55 2016 UTC

# Line 1 | Line 1
1   /*
2 < * Written by Doug Lea with assistance from members of JCP JSR-166
3 < * Expert Group and released to the public domain, as explained at
2 > * Written by Doug Lea and Martin Buchholz with assistance from
3 > * members of JCP JSR-166 Expert Group and released to the public
4 > * domain, as explained at
5   * http://creativecommons.org/publicdomain/zero/1.0/
6   */
7  
8   import java.util.ArrayDeque;
9   import java.util.Arrays;
10   import java.util.Collection;
11 + import java.util.Collections;
12   import java.util.Deque;
13   import java.util.Iterator;
14   import java.util.NoSuchElementException;
15   import java.util.Queue;
16   import java.util.Random;
17 + import java.util.concurrent.ThreadLocalRandom;
18  
19   import junit.framework.Test;
20   import junit.framework.TestSuite;
# Line 22 | Line 25 | public class ArrayDequeTest extends JSR1
25      }
26  
27      public static Test suite() {
28 <        return new TestSuite(ArrayDequeTest.class);
28 >        class Implementation implements CollectionImplementation {
29 >            public Class<?> klazz() { return ArrayDeque.class; }
30 >            public Collection emptyCollection() { return populatedDeque(0); }
31 >            public Object makeElement(int i) { return i; }
32 >            public boolean isConcurrent() { return false; }
33 >            public boolean permitsNulls() { return false; }
34 >        }
35 >        return newTestSuite(ArrayDequeTest.class,
36 >                            CollectionTest.testSuite(new Implementation()));
37      }
38  
39      /**
40       * Returns a new deque of given size containing consecutive
41 <     * Integers 0 ... n.
41 >     * Integers 0 ... n - 1.
42       */
43 <    private ArrayDeque<Integer> populatedDeque(int n) {
44 <        ArrayDeque<Integer> q = new ArrayDeque<Integer>();
43 >    private static ArrayDeque<Integer> populatedDeque(int n) {
44 >        // Randomize various aspects of memory layout, including
45 >        // filled-to-capacity and wraparound.
46 >        final ArrayDeque<Integer> q;
47 >        ThreadLocalRandom rnd = ThreadLocalRandom.current();
48 >        switch (rnd.nextInt(6)) {
49 >        case 0: q = new ArrayDeque<Integer>();      break;
50 >        case 1: q = new ArrayDeque<Integer>(0);     break;
51 >        case 2: q = new ArrayDeque<Integer>(1);     break;
52 >        case 3: q = new ArrayDeque<Integer>(Math.max(0, n - 1)); break;
53 >        case 4: q = new ArrayDeque<Integer>(n);     break;
54 >        case 5: q = new ArrayDeque<Integer>(n + 1); break;
55 >        default: throw new AssertionError();
56 >        }
57 >        switch (rnd.nextInt(3)) {
58 >        case 0:
59 >            q.addFirst(42);
60 >            assertEquals((Integer) 42, q.removeLast());
61 >            break;
62 >        case 1:
63 >            q.addLast(42);
64 >            assertEquals((Integer) 42, q.removeFirst());
65 >            break;
66 >        case 2: /* do nothing */ break;
67 >        default: throw new AssertionError();
68 >        }
69          assertTrue(q.isEmpty());
70 <        for (int i = 0; i < n; ++i)
71 <            assertTrue(q.offerLast(new Integer(i)));
72 <        assertFalse(q.isEmpty());
70 >        if (rnd.nextBoolean())
71 >            for (int i = 0; i < n; i++)
72 >                assertTrue(q.offerLast((Integer) i));
73 >        else
74 >            for (int i = n; --i >= 0; )
75 >                q.addFirst((Integer) i);
76          assertEquals(n, q.size());
77 +        if (n > 0) {
78 +            assertFalse(q.isEmpty());
79 +            assertEquals((Integer) 0, q.peekFirst());
80 +            assertEquals((Integer) (n - 1), q.peekLast());
81 +        }
82          return q;
83      }
84  
# Line 395 | Line 438 | public class ArrayDequeTest extends JSR1
438              assertTrue(q.contains(i));
439              assertTrue(q.remove(i));
440              assertFalse(q.contains(i));
441 <            assertTrue(q.contains(i-1));
441 >            assertTrue(q.contains(i - 1));
442          }
443          for (int i = 0; i < SIZE; i += 2) {
444              assertTrue(q.contains(i));
445              assertTrue(q.remove(i));
446              assertFalse(q.contains(i));
447 <            assertFalse(q.remove(i+1));
448 <            assertFalse(q.contains(i+1));
447 >            assertFalse(q.remove(i + 1));
448 >            assertFalse(q.contains(i + 1));
449          }
450          assertTrue(q.isEmpty());
451      }
# Line 530 | Line 573 | public class ArrayDequeTest extends JSR1
573       */
574      public void testRemoveFirstOccurrence() {
575          ArrayDeque q = populatedDeque(SIZE);
576 +        assertFalse(q.removeFirstOccurrence(null));
577          for (int i = 1; i < SIZE; i += 2) {
578              assertTrue(q.removeFirstOccurrence(new Integer(i)));
579          }
580          for (int i = 0; i < SIZE; i += 2) {
581              assertTrue(q.removeFirstOccurrence(new Integer(i)));
582 <            assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
582 >            assertFalse(q.removeFirstOccurrence(new Integer(i + 1)));
583          }
584          assertTrue(q.isEmpty());
585 +        assertFalse(q.removeFirstOccurrence(null));
586 +        assertFalse(q.removeFirstOccurrence(42));
587 +        q = new ArrayDeque();
588 +        assertFalse(q.removeFirstOccurrence(null));
589 +        assertFalse(q.removeFirstOccurrence(42));
590      }
591  
592      /**
# Line 545 | Line 594 | public class ArrayDequeTest extends JSR1
594       */
595      public void testRemoveLastOccurrence() {
596          ArrayDeque q = populatedDeque(SIZE);
597 +        assertFalse(q.removeLastOccurrence(null));
598          for (int i = 1; i < SIZE; i += 2) {
599              assertTrue(q.removeLastOccurrence(new Integer(i)));
600          }
601          for (int i = 0; i < SIZE; i += 2) {
602              assertTrue(q.removeLastOccurrence(new Integer(i)));
603 <            assertFalse(q.removeLastOccurrence(new Integer(i+1)));
603 >            assertFalse(q.removeLastOccurrence(new Integer(i + 1)));
604          }
605          assertTrue(q.isEmpty());
606 +        assertFalse(q.removeLastOccurrence(null));
607 +        assertFalse(q.removeLastOccurrence(42));
608 +        q = new ArrayDeque();
609 +        assertFalse(q.removeLastOccurrence(null));
610 +        assertFalse(q.removeLastOccurrence(42));
611      }
612  
613      /**
# Line 660 | Line 715 | public class ArrayDequeTest extends JSR1
715  
716      void checkToArray2(ArrayDeque q) {
717          int size = q.size();
718 <        Integer[] a1 = size == 0 ? null : new Integer[size-1];
718 >        Integer[] a1 = (size == 0) ? null : new Integer[size - 1];
719          Integer[] a2 = new Integer[size];
720 <        Integer[] a3 = new Integer[size+2];
720 >        Integer[] a3 = new Integer[size + 2];
721          if (size > 0) Arrays.fill(a1, 42);
722          Arrays.fill(a2, 42);
723          Arrays.fill(a3, 42);
724 <        Integer[] b1 = size == 0 ? null : (Integer[]) q.toArray(a1);
724 >        Integer[] b1 = (size == 0) ? null : (Integer[]) q.toArray(a1);
725          Integer[] b2 = (Integer[]) q.toArray(a2);
726          Integer[] b3 = (Integer[]) q.toArray(a3);
727          assertSame(a2, b2);
# Line 680 | Line 735 | public class ArrayDequeTest extends JSR1
735              assertSame(b3[i], x);
736          }
737          assertNull(a3[size]);
738 <        assertEquals(42, (int) a3[size+1]);
738 >        assertEquals(42, (int) a3[size + 1]);
739          if (size > 0) {
740              assertNotSame(a1, b1);
741              assertEquals(size, b1.length);
# Line 781 | Line 836 | public class ArrayDequeTest extends JSR1
836          final Random rng = new Random();
837          for (int iters = 0; iters < 100; ++iters) {
838              int max = rng.nextInt(5) + 2;
839 <            int split = rng.nextInt(max-1) + 1;
839 >            int split = rng.nextInt(max - 1) + 1;
840              for (int j = 1; j <= max; ++j)
841                  q.add(new Integer(j));
842              Iterator it = q.iterator();
843              for (int j = 1; j <= split; ++j)
844                  assertEquals(it.next(), new Integer(j));
845              it.remove();
846 <            assertEquals(it.next(), new Integer(split+1));
846 >            assertEquals(it.next(), new Integer(split + 1));
847              for (int j = 1; j <= split; ++j)
848                  q.remove(new Integer(j));
849              it = q.iterator();
850 <            for (int j = split+1; j <= max; ++j) {
850 >            for (int j = split + 1; j <= max; ++j) {
851                  assertEquals(it.next(), new Integer(j));
852                  it.remove();
853              }
# Line 849 | Line 904 | public class ArrayDequeTest extends JSR1
904          final Random rng = new Random();
905          for (int iters = 0; iters < 100; ++iters) {
906              int max = rng.nextInt(5) + 2;
907 <            int split = rng.nextInt(max-1) + 1;
907 >            int split = rng.nextInt(max - 1) + 1;
908              for (int j = max; j >= 1; --j)
909                  q.add(new Integer(j));
910              Iterator it = q.descendingIterator();
911              for (int j = 1; j <= split; ++j)
912                  assertEquals(it.next(), new Integer(j));
913              it.remove();
914 <            assertEquals(it.next(), new Integer(split+1));
914 >            assertEquals(it.next(), new Integer(split + 1));
915              for (int j = 1; j <= split; ++j)
916                  q.remove(new Integer(j));
917              it = q.descendingIterator();
918 <            for (int j = split+1; j <= max; ++j) {
918 >            for (int j = split + 1; j <= max; ++j) {
919                  assertEquals(it.next(), new Integer(j));
920                  it.remove();
921              }
# Line 889 | Line 944 | public class ArrayDequeTest extends JSR1
944  
945          assertNotSame(y, x);
946          assertEquals(x.size(), y.size());
947 +        assertEquals(x.toString(), y.toString());
948 +        assertTrue(Arrays.equals(x.toArray(), y.toArray()));
949 +        while (!x.isEmpty()) {
950 +            assertFalse(y.isEmpty());
951 +            assertEquals(x.remove(), y.remove());
952 +        }
953 +        assertTrue(y.isEmpty());
954 +    }
955 +
956 +    /**
957 +     * A cloned deque has same elements in same order
958 +     */
959 +    public void testClone() throws Exception {
960 +        ArrayDeque<Integer> x = populatedDeque(SIZE);
961 +        ArrayDeque<Integer> y = x.clone();
962 +
963 +        assertNotSame(y, x);
964 +        assertEquals(x.size(), y.size());
965          assertEquals(x.toString(), y.toString());
966          assertTrue(Arrays.equals(x.toArray(), y.toArray()));
967          while (!x.isEmpty()) {

Diff Legend

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