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; |
41 |
|
* Integers 0 ... n - 1. |
42 |
|
*/ |
43 |
|
private ArrayDeque<Integer> populatedDeque(int n) { |
44 |
< |
ArrayDeque<Integer> q = new ArrayDeque<Integer>(); |
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 |
< |
assertEquals((Integer) 0, q.peekFirst()); |
78 |
< |
assertEquals((Integer) (n - 1), q.peekLast()); |
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 |
|
|
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()) { |
968 |
+ |
assertFalse(y.isEmpty()); |
969 |
+ |
assertEquals(x.remove(), y.remove()); |
970 |
+ |
} |
971 |
+ |
assertTrue(y.isEmpty()); |
972 |
+ |
} |
973 |
+ |
|
974 |
+ |
/** |
975 |
|
* remove(null), contains(null) always return false |
976 |
|
*/ |
977 |
|
public void testNeverContainsNull() { |
988 |
|
} |
989 |
|
} |
990 |
|
|
991 |
+ |
/** |
992 |
+ |
* Handle capacities near Integer.MAX_VALUE. |
993 |
+ |
* ant -Dvmoptions=-Xmx24g -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDequeTest -Djsr166.methodFilter=testHuge tck |
994 |
+ |
*/ |
995 |
+ |
public void testHuge() { |
996 |
+ |
if (! (testImplementationDetails |
997 |
+ |
&& expensiveTests |
998 |
+ |
&& Runtime.getRuntime().freeMemory() > 21_000_000_000L)) |
999 |
+ |
return; |
1000 |
+ |
int maxSize = Integer.MAX_VALUE - 8; |
1001 |
+ |
ArrayDeque<Integer> q; |
1002 |
+ |
|
1003 |
+ |
q = new ArrayDeque<>(maxSize); |
1004 |
+ |
|
1005 |
+ |
assertThrows(OutOfMemoryError.class, |
1006 |
+ |
() -> new ArrayDeque<>(Integer.MAX_VALUE)); |
1007 |
+ |
|
1008 |
+ |
q = populatedDeque(0); |
1009 |
+ |
q.addAll(Collections.nCopies(maxSize - 2, (Integer) 42)); |
1010 |
+ |
assertEquals((Integer) 42, q.peekFirst()); |
1011 |
+ |
assertEquals((Integer) 42, q.peekLast()); |
1012 |
+ |
assertEquals(maxSize - 2, q.size()); |
1013 |
+ |
q.addFirst((Integer) 0); |
1014 |
+ |
q.addLast((Integer) 1); |
1015 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
1016 |
+ |
assertEquals((Integer) 1, q.peekLast()); |
1017 |
+ |
assertEquals(maxSize, q.size()); |
1018 |
+ |
} |
1019 |
+ |
|
1020 |
|
} |