/* * Written by Doug Lea and Martin Buchholz with assistance from * members of JCP JSR-166 Expert Group and released to the public * domain, as explained at * http://creativecommons.org/publicdomain/zero/1.0/ */ import java.util.ArrayDeque; import java.util.Collections; import java.util.Spliterator; import junit.framework.Test; public class ArrayDeque8Test extends JSR166TestCase { public static void main(String[] args) { main(suite(), args); } public static Test suite() { return newTestSuite(ArrayDeque8Test.class); } /** * Spliterator.getComparator always throws IllegalStateException */ public void testSpliterator_getComparator() { assertThrows(IllegalStateException.class, () -> new ArrayDeque().spliterator().getComparator()); } /** * Spliterator characteristics are as advertised */ public void testSpliterator_characteristics() { ArrayDeque q = new ArrayDeque(); Spliterator s = q.spliterator(); int characteristics = s.characteristics(); int required = Spliterator.NONNULL | Spliterator.ORDERED | Spliterator.SIZED | Spliterator.SUBSIZED; mustEqual(required, characteristics & required); assertTrue(s.hasCharacteristics(required)); mustEqual(0, characteristics & (Spliterator.CONCURRENT | Spliterator.DISTINCT | Spliterator.IMMUTABLE | Spliterator.SORTED)); } /** * Handle capacities near Integer.MAX_VALUE. * ant -Dvmoptions='-Xms28g -Xmx28g' -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDeque8Test -Djsr166.methodFilter=testHugeCapacity tck */ public void testHugeCapacity() { if (! (testImplementationDetails && expensiveTests && Runtime.getRuntime().maxMemory() > 24L * (1 << 30))) return; final Item e = fortytwo; final int maxArraySize = Integer.MAX_VALUE - 8; assertThrows(OutOfMemoryError.class, () -> new ArrayDeque(Integer.MAX_VALUE)); { ArrayDeque q = new ArrayDeque(maxArraySize - 1); mustEqual(0, q.size()); assertTrue(q.isEmpty()); q = null; } { ArrayDeque q = new ArrayDeque(); assertTrue(q.addAll(Collections.nCopies(maxArraySize - 3, e))); mustEqual(e, q.peekFirst()); mustEqual(e, q.peekLast()); mustEqual(maxArraySize - 3, q.size()); q.addFirst(zero); q.addLast(one); mustEqual(zero, q.peekFirst()); mustEqual(one, q.peekLast()); mustEqual(maxArraySize - 1, q.size()); ArrayDeque smallish = new ArrayDeque( Collections.nCopies(Integer.MAX_VALUE - q.size() + 1, e)); assertThrows( IllegalStateException.class, () -> q.addAll(q), () -> q.addAll(smallish), () -> smallish.addAll(q)); } } }