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.37 by jsr166, Sun May 24 01:23:17 2015 UTC vs.
Revision 1.48 by jsr166, Mon Oct 17 15:48:01 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.Spliterator;
18 + import java.util.concurrent.ThreadLocalRandom;
19  
20   import junit.framework.Test;
21   import junit.framework.TestSuite;
# Line 22 | Line 26 | public class ArrayDequeTest extends JSR1
26      }
27  
28      public static Test suite() {
29 <        return new TestSuite(ArrayDequeTest.class);
29 >        class Implementation implements CollectionImplementation {
30 >            public Class<?> klazz() { return ArrayDeque.class; }
31 >            public Collection emptyCollection() { return populatedDeque(0); }
32 >            public Object makeElement(int i) { return i; }
33 >            public boolean isConcurrent() { return false; }
34 >            public boolean permitsNulls() { return false; }
35 >        }
36 >        return newTestSuite(ArrayDequeTest.class,
37 >                            CollectionTest.testSuite(new Implementation()));
38      }
39  
40      /**
41       * Returns a new deque of given size containing consecutive
42 <     * Integers 0 ... n.
42 >     * Integers 0 ... n - 1.
43       */
44 <    private ArrayDeque<Integer> populatedDeque(int n) {
45 <        ArrayDeque<Integer> q = new ArrayDeque<Integer>();
44 >    private static ArrayDeque<Integer> populatedDeque(int n) {
45 >        // Randomize various aspects of memory layout, including
46 >        // filled-to-capacity and wraparound.
47 >        final ArrayDeque<Integer> q;
48 >        ThreadLocalRandom rnd = ThreadLocalRandom.current();
49 >        switch (rnd.nextInt(6)) {
50 >        case 0: q = new ArrayDeque<Integer>();      break;
51 >        case 1: q = new ArrayDeque<Integer>(0);     break;
52 >        case 2: q = new ArrayDeque<Integer>(1);     break;
53 >        case 3: q = new ArrayDeque<Integer>(Math.max(0, n - 1)); break;
54 >        case 4: q = new ArrayDeque<Integer>(n);     break;
55 >        case 5: q = new ArrayDeque<Integer>(n + 1); break;
56 >        default: throw new AssertionError();
57 >        }
58 >        switch (rnd.nextInt(3)) {
59 >        case 0:
60 >            q.addFirst(42);
61 >            assertEquals((Integer) 42, q.removeLast());
62 >            break;
63 >        case 1:
64 >            q.addLast(42);
65 >            assertEquals((Integer) 42, q.removeFirst());
66 >            break;
67 >        case 2: /* do nothing */ break;
68 >        default: throw new AssertionError();
69 >        }
70          assertTrue(q.isEmpty());
71 <        for (int i = 0; i < n; ++i)
72 <            assertTrue(q.offerLast(new Integer(i)));
73 <        assertFalse(q.isEmpty());
71 >        if (rnd.nextBoolean())
72 >            for (int i = 0; i < n; i++)
73 >                assertTrue(q.offerLast((Integer) i));
74 >        else
75 >            for (int i = n; --i >= 0; )
76 >                q.addFirst((Integer) i);
77          assertEquals(n, q.size());
78 +        if (n > 0) {
79 +            assertFalse(q.isEmpty());
80 +            assertEquals((Integer) 0, q.peekFirst());
81 +            assertEquals((Integer) (n - 1), q.peekLast());
82 +        }
83          return q;
84      }
85  
# Line 395 | Line 439 | public class ArrayDequeTest extends JSR1
439              assertTrue(q.contains(i));
440              assertTrue(q.remove(i));
441              assertFalse(q.contains(i));
442 <            assertTrue(q.contains(i-1));
442 >            assertTrue(q.contains(i - 1));
443          }
444          for (int i = 0; i < SIZE; i += 2) {
445              assertTrue(q.contains(i));
446              assertTrue(q.remove(i));
447              assertFalse(q.contains(i));
448 <            assertFalse(q.remove(i+1));
449 <            assertFalse(q.contains(i+1));
448 >            assertFalse(q.remove(i + 1));
449 >            assertFalse(q.contains(i + 1));
450          }
451          assertTrue(q.isEmpty());
452      }
# Line 530 | Line 574 | public class ArrayDequeTest extends JSR1
574       */
575      public void testRemoveFirstOccurrence() {
576          ArrayDeque q = populatedDeque(SIZE);
577 +        assertFalse(q.removeFirstOccurrence(null));
578          for (int i = 1; i < SIZE; i += 2) {
579              assertTrue(q.removeFirstOccurrence(new Integer(i)));
580          }
581          for (int i = 0; i < SIZE; i += 2) {
582              assertTrue(q.removeFirstOccurrence(new Integer(i)));
583 <            assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
583 >            assertFalse(q.removeFirstOccurrence(new Integer(i + 1)));
584          }
585          assertTrue(q.isEmpty());
586 +        assertFalse(q.removeFirstOccurrence(null));
587 +        assertFalse(q.removeFirstOccurrence(42));
588 +        q = new ArrayDeque();
589 +        assertFalse(q.removeFirstOccurrence(null));
590 +        assertFalse(q.removeFirstOccurrence(42));
591      }
592  
593      /**
# Line 545 | Line 595 | public class ArrayDequeTest extends JSR1
595       */
596      public void testRemoveLastOccurrence() {
597          ArrayDeque q = populatedDeque(SIZE);
598 +        assertFalse(q.removeLastOccurrence(null));
599          for (int i = 1; i < SIZE; i += 2) {
600              assertTrue(q.removeLastOccurrence(new Integer(i)));
601          }
602          for (int i = 0; i < SIZE; i += 2) {
603              assertTrue(q.removeLastOccurrence(new Integer(i)));
604 <            assertFalse(q.removeLastOccurrence(new Integer(i+1)));
604 >            assertFalse(q.removeLastOccurrence(new Integer(i + 1)));
605          }
606          assertTrue(q.isEmpty());
607 +        assertFalse(q.removeLastOccurrence(null));
608 +        assertFalse(q.removeLastOccurrence(42));
609 +        q = new ArrayDeque();
610 +        assertFalse(q.removeLastOccurrence(null));
611 +        assertFalse(q.removeLastOccurrence(42));
612      }
613  
614      /**
# Line 781 | Line 837 | public class ArrayDequeTest extends JSR1
837          final Random rng = new Random();
838          for (int iters = 0; iters < 100; ++iters) {
839              int max = rng.nextInt(5) + 2;
840 <            int split = rng.nextInt(max-1) + 1;
840 >            int split = rng.nextInt(max - 1) + 1;
841              for (int j = 1; j <= max; ++j)
842                  q.add(new Integer(j));
843              Iterator it = q.iterator();
844              for (int j = 1; j <= split; ++j)
845                  assertEquals(it.next(), new Integer(j));
846              it.remove();
847 <            assertEquals(it.next(), new Integer(split+1));
847 >            assertEquals(it.next(), new Integer(split + 1));
848              for (int j = 1; j <= split; ++j)
849                  q.remove(new Integer(j));
850              it = q.iterator();
851 <            for (int j = split+1; j <= max; ++j) {
851 >            for (int j = split + 1; j <= max; ++j) {
852                  assertEquals(it.next(), new Integer(j));
853                  it.remove();
854              }
# Line 849 | Line 905 | public class ArrayDequeTest extends JSR1
905          final Random rng = new Random();
906          for (int iters = 0; iters < 100; ++iters) {
907              int max = rng.nextInt(5) + 2;
908 <            int split = rng.nextInt(max-1) + 1;
908 >            int split = rng.nextInt(max - 1) + 1;
909              for (int j = max; j >= 1; --j)
910                  q.add(new Integer(j));
911              Iterator it = q.descendingIterator();
912              for (int j = 1; j <= split; ++j)
913                  assertEquals(it.next(), new Integer(j));
914              it.remove();
915 <            assertEquals(it.next(), new Integer(split+1));
915 >            assertEquals(it.next(), new Integer(split + 1));
916              for (int j = 1; j <= split; ++j)
917                  q.remove(new Integer(j));
918              it = q.descendingIterator();
919 <            for (int j = split+1; j <= max; ++j) {
919 >            for (int j = split + 1; j <= max; ++j) {
920                  assertEquals(it.next(), new Integer(j));
921                  it.remove();
922              }
# Line 899 | Line 955 | public class ArrayDequeTest extends JSR1
955      }
956  
957      /**
958 +     * A cloned deque has same elements in same order
959 +     */
960 +    public void testClone() throws Exception {
961 +        ArrayDeque<Integer> x = populatedDeque(SIZE);
962 +        ArrayDeque<Integer> y = x.clone();
963 +
964 +        assertNotSame(y, x);
965 +        assertEquals(x.size(), y.size());
966 +        assertEquals(x.toString(), y.toString());
967 +        assertTrue(Arrays.equals(x.toArray(), y.toArray()));
968 +        while (!x.isEmpty()) {
969 +            assertFalse(y.isEmpty());
970 +            assertEquals(x.remove(), y.remove());
971 +        }
972 +        assertTrue(y.isEmpty());
973 +    }
974 +
975 +    /**
976       * remove(null), contains(null) always return false
977       */
978      public void testNeverContainsNull() {
# Line 915 | Line 989 | public class ArrayDequeTest extends JSR1
989          }
990      }
991  
992 +    /**
993 +     * Spliterator characteristics are as advertised
994 +     */
995 +    public void testSpliterator_characteristics() {
996 +        ArrayDeque q = new ArrayDeque();
997 +        Spliterator s = q.spliterator();
998 +        int characteristics = s.characteristics();
999 +        int required = Spliterator.NONNULL
1000 +            | Spliterator.ORDERED
1001 +            | Spliterator.SIZED
1002 +            | Spliterator.SUBSIZED;
1003 +        assertEquals(required, characteristics & required);
1004 +        assertTrue(s.hasCharacteristics(required));
1005 +        assertEquals(0, characteristics
1006 +                     & (Spliterator.CONCURRENT
1007 +                        | Spliterator.DISTINCT
1008 +                        | Spliterator.IMMUTABLE
1009 +                        | Spliterator.SORTED));
1010 +    }
1011 +
1012 +    /**
1013 +     * Spliterator.getComparator always throws IllegalStateException
1014 +     */
1015 +    public void testSpliterator_getComparator() {
1016 +        assertThrows(IllegalStateException.class,
1017 +                     () -> new ArrayDeque().spliterator().getComparator());
1018 +    }
1019 +
1020 +    /**
1021 +     * Handle capacities near Integer.MAX_VALUE.
1022 +     * ant -Dvmoptions=-Xmx24g -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDequeTest -Djsr166.methodFilter=testHuge tck
1023 +     */
1024 +    public void testHuge() {
1025 +        if (! (testImplementationDetails
1026 +               && expensiveTests
1027 +               && Runtime.getRuntime().freeMemory() > 21_000_000_000L))
1028 +            return;
1029 +        int maxSize = Integer.MAX_VALUE - 8;
1030 +        ArrayDeque<Integer> q;
1031 +
1032 +        q = new ArrayDeque<>(maxSize);
1033 +
1034 +        assertThrows(OutOfMemoryError.class,
1035 +                     () -> new ArrayDeque<>(Integer.MAX_VALUE));
1036 +
1037 +        q = populatedDeque(0);
1038 +        assertTrue(q.addAll(Collections.nCopies(maxSize - 2, (Integer) 42)));
1039 +        assertEquals((Integer) 42, q.peekFirst());
1040 +        assertEquals((Integer) 42, q.peekLast());
1041 +        assertEquals(maxSize - 2, q.size());
1042 +        q.addFirst((Integer) 0);
1043 +        q.addLast((Integer) 1);
1044 +        assertEquals((Integer) 0, q.peekFirst());
1045 +        assertEquals((Integer) 1, q.peekLast());
1046 +        assertEquals(maxSize, q.size());
1047 +    }
1048 +
1049   }

Diff Legend

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