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; |
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; } |
41 |
|
* Returns a new deque of given size containing consecutive |
42 |
|
* Integers 0 ... n - 1. |
43 |
|
*/ |
44 |
< |
private ArrayDeque<Integer> populatedDeque(int n) { |
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>(n - 1); break; |
54 |
< |
case 4: q = new ArrayDeque<Integer>(n); break; |
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 |
|
} |
62 |
|
break; |
63 |
|
case 1: |
64 |
|
q.addLast(42); |
65 |
< |
assertEquals((Integer) 42, q.removeLast()); |
65 |
> |
assertEquals((Integer) 42, q.removeFirst()); |
66 |
|
break; |
67 |
|
case 2: /* do nothing */ break; |
68 |
|
default: throw new AssertionError(); |
74 |
|
else |
75 |
|
for (int i = n; --i >= 0; ) |
76 |
|
q.addFirst((Integer) i); |
74 |
– |
assertFalse(q.isEmpty()); |
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 |
|
|
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() { |
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='-Xms28g -Xmx28g' -Djsr166.testImplementationDetails=true -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDequeTest -Djsr166.methodFilter=testHuge tck |
1023 |
+ |
*/ |
1024 |
+ |
public void testHuge() { |
1025 |
+ |
if (! (testImplementationDetails |
1026 |
+ |
&& expensiveTests |
1027 |
+ |
&& Runtime.getRuntime().maxMemory() > 24L * (1 << 30))) |
1028 |
+ |
return; |
1029 |
+ |
|
1030 |
+ |
ArrayDeque q; |
1031 |
+ |
Integer e = 42; |
1032 |
+ |
final int maxSize = Integer.MAX_VALUE - 8; |
1033 |
+ |
|
1034 |
+ |
assertThrows(OutOfMemoryError.class, |
1035 |
+ |
() -> new ArrayDeque<>(Integer.MAX_VALUE)); |
1036 |
+ |
|
1037 |
+ |
{ |
1038 |
+ |
q = new ArrayDeque<>(maxSize); |
1039 |
+ |
assertEquals(0, q.size()); |
1040 |
+ |
assertTrue(q.isEmpty()); |
1041 |
+ |
q = null; |
1042 |
+ |
} |
1043 |
+ |
|
1044 |
+ |
{ |
1045 |
+ |
q = new ArrayDeque(); |
1046 |
+ |
assertTrue(q.addAll(Collections.nCopies(maxSize - 2, e))); |
1047 |
+ |
assertEquals(e, q.peekFirst()); |
1048 |
+ |
assertEquals(e, q.peekLast()); |
1049 |
+ |
assertEquals(maxSize - 2, q.size()); |
1050 |
+ |
q.addFirst((Integer) 0); |
1051 |
+ |
q.addLast((Integer) 1); |
1052 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
1053 |
+ |
assertEquals((Integer) 1, q.peekLast()); |
1054 |
+ |
assertEquals(maxSize, q.size()); |
1055 |
+ |
|
1056 |
+ |
ArrayDeque qq = q; |
1057 |
+ |
ArrayDeque smallish = new ArrayDeque( |
1058 |
+ |
Collections.nCopies(Integer.MAX_VALUE - maxSize + 1, e)); |
1059 |
+ |
assertThrows( |
1060 |
+ |
IllegalStateException.class, |
1061 |
+ |
() -> qq.addAll(qq), |
1062 |
+ |
() -> qq.addAll(smallish), |
1063 |
+ |
() -> smallish.addAll(qq)); |
1064 |
+ |
} |
1065 |
+ |
} |
1066 |
+ |
|
1067 |
|
} |