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.41 by jsr166, Sun Oct 16 20:44:18 2016 UTC vs.
Revision 1.46 by jsr166, Mon Oct 17 15:27:57 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 24 | Line 28 | public class ArrayDequeTest extends JSR1
28      public static Test suite() {
29          class Implementation implements CollectionImplementation {
30              public Class<?> klazz() { return ArrayDeque.class; }
31 <            public Collection emptyCollection() { return new ArrayDeque(); }
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; }
# Line 37 | Line 41 | public class ArrayDequeTest extends JSR1
41       * Returns a new deque of given size containing consecutive
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 <        assertEquals((Integer) 0, q.peekFirst());
79 <        assertEquals((Integer) (n - 1), q.peekLast());
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 921 | 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 937 | 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 +        assertEquals(0, characteristics
1005 +                     & (Spliterator.CONCURRENT
1006 +                        | Spliterator.DISTINCT
1007 +                        | Spliterator.IMMUTABLE
1008 +                        | Spliterator.SORTED));
1009 +    }
1010 +
1011 +    /**
1012 +     * Handle capacities near Integer.MAX_VALUE.
1013 +     * ant -Dvmoptions=-Xmx24g -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDequeTest -Djsr166.methodFilter=testHuge tck
1014 +     */
1015 +    public void testHuge() {
1016 +        if (! (testImplementationDetails
1017 +               && expensiveTests
1018 +               && Runtime.getRuntime().freeMemory() > 21_000_000_000L))
1019 +            return;
1020 +        int maxSize = Integer.MAX_VALUE - 8;
1021 +        ArrayDeque<Integer> q;
1022 +
1023 +        q = new ArrayDeque<>(maxSize);
1024 +
1025 +        assertThrows(OutOfMemoryError.class,
1026 +                     () -> new ArrayDeque<>(Integer.MAX_VALUE));
1027 +
1028 +        q = populatedDeque(0);
1029 +        q.addAll(Collections.nCopies(maxSize - 2, (Integer) 42));
1030 +        assertEquals((Integer) 42, q.peekFirst());
1031 +        assertEquals((Integer) 42, q.peekLast());
1032 +        assertEquals(maxSize - 2, q.size());
1033 +        q.addFirst((Integer) 0);
1034 +        q.addLast((Integer) 1);
1035 +        assertEquals((Integer) 0, q.peekFirst());
1036 +        assertEquals((Integer) 1, q.peekLast());
1037 +        assertEquals(maxSize, q.size());
1038 +    }
1039 +
1040   }

Diff Legend

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