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; |
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 |
|
*/ |
1035 |
|
() -> new ArrayDeque<>(Integer.MAX_VALUE)); |
1036 |
|
|
1037 |
|
q = populatedDeque(0); |
1038 |
< |
q.addAll(Collections.nCopies(maxSize - 2, (Integer) 42)); |
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()); |