ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/ArrayDequeTest.java

Comparing jsr166/src/test/tck/ArrayDequeTest.java (file contents):
Revision 1.25 by jsr166, Tue Feb 21 01:54:03 2012 UTC vs.
Revision 1.43 by jsr166, Mon Oct 17 00:59:53 2016 UTC

#	Line 4 | Line 4
4		* http://creativecommons.org/publicdomain/zero/1.0/
5		*/
6
7	–	import junit.framework.*;
8	–	import java.util.Arrays;
7		import java.util.ArrayDeque;
8	+	import java.util.Arrays;
9		import java.util.Collection;
10	+	import java.util.Collections;
11		import java.util.Deque;
12		import java.util.Iterator;
13		import java.util.NoSuchElementException;
14		import java.util.Queue;
15		import java.util.Random;
16	+	import java.util.concurrent.ThreadLocalRandom;
17	+
18	+	import junit.framework.Test;
19	+	import junit.framework.TestSuite;
20
21		public class ArrayDequeTest extends JSR166TestCase {
22		public static void main(String[] args) {
23	<	junit.textui.TestRunner.run(suite());
23	>	main(suite(), args);
24		}
25
26		public static Test suite() {
27	<	return new TestSuite(ArrayDequeTest.class);
27	>	class Implementation implements CollectionImplementation {
28	>	public Class<?> klazz() { return ArrayDeque.class; }
29	>	public Collection emptyCollection() { return new ArrayDeque(); }
30	>	public Object makeElement(int i) { return i; }
31	>	public boolean isConcurrent() { return false; }
32	>	public boolean permitsNulls() { return false; }
33	>	}
34	>	return newTestSuite(ArrayDequeTest.class,
35	>	CollectionTest.testSuite(new Implementation()));
36		}
37
38		/**
39	<	* Creates a deque of given size containing consecutive
40	<	* Integers 0 ... n.
39	>	* Returns a new deque of given size containing consecutive
40	>	* Integers 0 ... n - 1.
41		*/
42		private ArrayDeque<Integer> populatedDeque(int n) {
43	<	ArrayDeque<Integer> q = new ArrayDeque<Integer>();
43	>	// Randomize various aspects of memory layout, including
44	>	// filled-to-capacity and wraparound.
45	>	final ArrayDeque<Integer> q;
46	>	ThreadLocalRandom rnd = ThreadLocalRandom.current();
47	>	switch (rnd.nextInt(6)) {
48	>	case 0: q = new ArrayDeque<Integer>();      break;
49	>	case 1: q = new ArrayDeque<Integer>(0);     break;
50	>	case 2: q = new ArrayDeque<Integer>(1);     break;
51	>	case 3: q = new ArrayDeque<Integer>(Math.max(0, n - 1)); break;
52	>	case 4: q = new ArrayDeque<Integer>(n);     break;
53	>	case 5: q = new ArrayDeque<Integer>(n + 1); break;
54	>	default: throw new AssertionError();
55	>	}
56	>	switch (rnd.nextInt(3)) {
57	>	case 0:
58	>	q.addFirst(42);
59	>	assertEquals((Integer) 42, q.removeLast());
60	>	break;
61	>	case 1:
62	>	q.addLast(42);
63	>	assertEquals((Integer) 42, q.removeFirst());
64	>	break;
65	>	case 2: /* do nothing */ break;
66	>	default: throw new AssertionError();
67	>	}
68		assertTrue(q.isEmpty());
69	<	for (int i = 0; i < n; ++i)
70	<	assertTrue(q.offerLast(new Integer(i)));
71	<	assertFalse(q.isEmpty());
69	>	if (rnd.nextBoolean())
70	>	for (int i = 0; i < n; i++)
71	>	assertTrue(q.offerLast((Integer) i));
72	>	else
73	>	for (int i = n; --i >= 0; )
74	>	q.addFirst((Integer) i);
75		assertEquals(n, q.size());
76	+	if (n > 0) {
77	+	assertFalse(q.isEmpty());
78	+	assertEquals((Integer) 0, q.peekFirst());
79	+	assertEquals((Integer) (n - 1), q.peekLast());
80	+	}
81		return q;
82		}
83
#	Line 49 | Line 93 | public class ArrayDequeTest extends JSR1
93		*/
94		public void testConstructor3() {
95		try {
96	<	ArrayDeque q = new ArrayDeque((Collection)null);
96	>	new ArrayDeque((Collection)null);
97		shouldThrow();
98		} catch (NullPointerException success) {}
99		}
#	Line 59 | Line 103 | public class ArrayDequeTest extends JSR1
103		*/
104		public void testConstructor4() {
105		try {
106	<	Integer[] ints = new Integer[SIZE];
63	<	ArrayDeque q = new ArrayDeque(Arrays.asList(ints));
106	>	new ArrayDeque(Arrays.asList(new Integer[SIZE]));
107		shouldThrow();
108		} catch (NullPointerException success) {}
109		}
#	Line 69 | Line 112 | public class ArrayDequeTest extends JSR1
112		* Initializing from Collection with some null elements throws NPE
113		*/
114		public void testConstructor5() {
115	+	Integer[] ints = new Integer[SIZE];
116	+	for (int i = 0; i < SIZE - 1; ++i)
117	+	ints[i] = new Integer(i);
118		try {
119	<	Integer[] ints = new Integer[SIZE];
74	<	for (int i = 0; i < SIZE-1; ++i)
75	<	ints[i] = new Integer(i);
76	<	ArrayDeque q = new ArrayDeque(Arrays.asList(ints));
119	>	new ArrayDeque(Arrays.asList(ints));
120		shouldThrow();
121		} catch (NullPointerException success) {}
122		}
#	Line 110 | Line 153 | public class ArrayDequeTest extends JSR1
153		public void testSize() {
154		ArrayDeque q = populatedDeque(SIZE);
155		for (int i = 0; i < SIZE; ++i) {
156	<	assertEquals(SIZE-i, q.size());
156	>	assertEquals(SIZE - i, q.size());
157		q.removeFirst();
158		}
159		for (int i = 0; i < SIZE; ++i) {
#	Line 123 | Line 166 | public class ArrayDequeTest extends JSR1
166		* push(null) throws NPE
167		*/
168		public void testPushNull() {
169	+	ArrayDeque q = new ArrayDeque(1);
170		try {
127	–	ArrayDeque q = new ArrayDeque(1);
171		q.push(null);
172		shouldThrow();
173		} catch (NullPointerException success) {}
#	Line 158 | Line 201 | public class ArrayDequeTest extends JSR1
201		* offer(null) throws NPE
202		*/
203		public void testOfferNull() {
204	+	ArrayDeque q = new ArrayDeque();
205		try {
162	–	ArrayDeque q = new ArrayDeque();
206		q.offer(null);
207		shouldThrow();
208		} catch (NullPointerException success) {}
#	Line 169 | Line 212 | public class ArrayDequeTest extends JSR1
212		* offerFirst(null) throws NPE
213		*/
214		public void testOfferFirstNull() {
215	+	ArrayDeque q = new ArrayDeque();
216		try {
173	–	ArrayDeque q = new ArrayDeque();
217		q.offerFirst(null);
218		shouldThrow();
219		} catch (NullPointerException success) {}
#	Line 180 | Line 223 | public class ArrayDequeTest extends JSR1
223		* offerLast(null) throws NPE
224		*/
225		public void testOfferLastNull() {
226	+	ArrayDeque q = new ArrayDeque();
227		try {
184	–	ArrayDeque q = new ArrayDeque();
228		q.offerLast(null);
229		shouldThrow();
230		} catch (NullPointerException success) {}
#	Line 224 | Line 267 | public class ArrayDequeTest extends JSR1
267		* add(null) throws NPE
268		*/
269		public void testAddNull() {
270	+	ArrayDeque q = new ArrayDeque();
271		try {
228	–	ArrayDeque q = new ArrayDeque();
272		q.add(null);
273		shouldThrow();
274		} catch (NullPointerException success) {}
#	Line 235 | Line 278 | public class ArrayDequeTest extends JSR1
278		* addFirst(null) throws NPE
279		*/
280		public void testAddFirstNull() {
281	+	ArrayDeque q = new ArrayDeque();
282		try {
239	–	ArrayDeque q = new ArrayDeque();
283		q.addFirst(null);
284		shouldThrow();
285		} catch (NullPointerException success) {}
#	Line 246 | Line 289 | public class ArrayDequeTest extends JSR1
289		* addLast(null) throws NPE
290		*/
291		public void testAddLastNull() {
292	+	ArrayDeque q = new ArrayDeque();
293		try {
250	–	ArrayDeque q = new ArrayDeque();
294		q.addLast(null);
295		shouldThrow();
296		} catch (NullPointerException success) {}
#	Line 290 | Line 333 | public class ArrayDequeTest extends JSR1
333		* addAll(null) throws NPE
334		*/
335		public void testAddAll1() {
336	+	ArrayDeque q = new ArrayDeque();
337		try {
294	–	ArrayDeque q = new ArrayDeque();
338		q.addAll(null);
339		shouldThrow();
340		} catch (NullPointerException success) {}
#	Line 301 | Line 344 | public class ArrayDequeTest extends JSR1
344		* addAll of a collection with null elements throws NPE
345		*/
346		public void testAddAll2() {
347	+	ArrayDeque q = new ArrayDeque();
348		try {
349	<	ArrayDeque q = new ArrayDeque();
306	<	Integer[] ints = new Integer[SIZE];
307	<	q.addAll(Arrays.asList(ints));
349	>	q.addAll(Arrays.asList(new Integer[SIZE]));
350		shouldThrow();
351		} catch (NullPointerException success) {}
352		}
#	Line 314 | Line 356 | public class ArrayDequeTest extends JSR1
356		* possibly adding some elements
357		*/
358		public void testAddAll3() {
359	+	ArrayDeque q = new ArrayDeque();
360	+	Integer[] ints = new Integer[SIZE];
361	+	for (int i = 0; i < SIZE - 1; ++i)
362	+	ints[i] = new Integer(i);
363		try {
318	–	ArrayDeque q = new ArrayDeque();
319	–	Integer[] ints = new Integer[SIZE];
320	–	for (int i = 0; i < SIZE-1; ++i)
321	–	ints[i] = new Integer(i);
364		q.addAll(Arrays.asList(ints));
365		shouldThrow();
366		} catch (NullPointerException success) {}
#	Line 355 | Line 397 | public class ArrayDequeTest extends JSR1
397		*/
398		public void testPollLast() {
399		ArrayDeque q = populatedDeque(SIZE);
400	<	for (int i = SIZE-1; i >= 0; --i) {
400	>	for (int i = SIZE - 1; i >= 0; --i) {
401		assertEquals(i, q.pollLast());
402		}
403		assertNull(q.pollLast());
#	Line 391 | Line 433 | public class ArrayDequeTest extends JSR1
433		*/
434		public void testRemoveElement() {
435		ArrayDeque q = populatedDeque(SIZE);
436	<	for (int i = 1; i < SIZE; i+=2) {
436	>	for (int i = 1; i < SIZE; i += 2) {
437		assertTrue(q.contains(i));
438		assertTrue(q.remove(i));
439		assertFalse(q.contains(i));
440	<	assertTrue(q.contains(i-1));
440	>	assertTrue(q.contains(i - 1));
441		}
442	<	for (int i = 0; i < SIZE; i+=2) {
442	>	for (int i = 0; i < SIZE; i += 2) {
443		assertTrue(q.contains(i));
444		assertTrue(q.remove(i));
445		assertFalse(q.contains(i));
446	<	assertFalse(q.remove(i+1));
447	<	assertFalse(q.contains(i+1));
446	>	assertFalse(q.remove(i + 1));
447	>	assertFalse(q.contains(i + 1));
448		}
449		assertTrue(q.isEmpty());
450		}
#	Line 440 | Line 482 | public class ArrayDequeTest extends JSR1
482		*/
483		public void testPeekLast() {
484		ArrayDeque q = populatedDeque(SIZE);
485	<	for (int i = SIZE-1; i >= 0; --i) {
485	>	for (int i = SIZE - 1; i >= 0; --i) {
486		assertEquals(i, q.peekLast());
487		assertEquals(i, q.pollLast());
488		assertTrue(q.peekLast() == null ||
#	Line 484 | Line 526 | public class ArrayDequeTest extends JSR1
526		*/
527		public void testLastElement() {
528		ArrayDeque q = populatedDeque(SIZE);
529	<	for (int i = SIZE-1; i >= 0; --i) {
529	>	for (int i = SIZE - 1; i >= 0; --i) {
530		assertEquals(i, q.getLast());
531		assertEquals(i, q.pollLast());
532		}
#	Line 530 | Line 572 | public class ArrayDequeTest extends JSR1
572		*/
573		public void testRemoveFirstOccurrence() {
574		ArrayDeque q = populatedDeque(SIZE);
575	<	for (int i = 1; i < SIZE; i+=2) {
575	>	assertFalse(q.removeFirstOccurrence(null));
576	>	for (int i = 1; i < SIZE; i += 2) {
577		assertTrue(q.removeFirstOccurrence(new Integer(i)));
578		}
579	<	for (int i = 0; i < SIZE; i+=2) {
579	>	for (int i = 0; i < SIZE; i += 2) {
580		assertTrue(q.removeFirstOccurrence(new Integer(i)));
581	<	assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
581	>	assertFalse(q.removeFirstOccurrence(new Integer(i + 1)));
582		}
583		assertTrue(q.isEmpty());
584	+	assertFalse(q.removeFirstOccurrence(null));
585	+	assertFalse(q.removeFirstOccurrence(42));
586	+	q = new ArrayDeque();
587	+	assertFalse(q.removeFirstOccurrence(null));
588	+	assertFalse(q.removeFirstOccurrence(42));
589		}
590
591		/**
#	Line 545 | Line 593 | public class ArrayDequeTest extends JSR1
593		*/
594		public void testRemoveLastOccurrence() {
595		ArrayDeque q = populatedDeque(SIZE);
596	<	for (int i = 1; i < SIZE; i+=2) {
596	>	assertFalse(q.removeLastOccurrence(null));
597	>	for (int i = 1; i < SIZE; i += 2) {
598		assertTrue(q.removeLastOccurrence(new Integer(i)));
599		}
600	<	for (int i = 0; i < SIZE; i+=2) {
600	>	for (int i = 0; i < SIZE; i += 2) {
601		assertTrue(q.removeLastOccurrence(new Integer(i)));
602	<	assertFalse(q.removeLastOccurrence(new Integer(i+1)));
602	>	assertFalse(q.removeLastOccurrence(new Integer(i + 1)));
603		}
604		assertTrue(q.isEmpty());
605	+	assertFalse(q.removeLastOccurrence(null));
606	+	assertFalse(q.removeLastOccurrence(42));
607	+	q = new ArrayDeque();
608	+	assertFalse(q.removeLastOccurrence(null));
609	+	assertFalse(q.removeLastOccurrence(42));
610		}
611
612		/**
#	Line 605 | Line 659 | public class ArrayDequeTest extends JSR1
659		boolean changed = q.retainAll(p);
660		assertEquals(changed, (i > 0));
661		assertTrue(q.containsAll(p));
662	<	assertEquals(SIZE-i, q.size());
662	>	assertEquals(SIZE - i, q.size());
663		p.removeFirst();
664		}
665		}
#	Line 618 | Line 672 | public class ArrayDequeTest extends JSR1
672		ArrayDeque q = populatedDeque(SIZE);
673		ArrayDeque p = populatedDeque(i);
674		assertTrue(q.removeAll(p));
675	<	assertEquals(SIZE-i, q.size());
675	>	assertEquals(SIZE - i, q.size());
676		for (int j = 0; j < i; ++j) {
677		assertFalse(q.contains(p.removeFirst()));
678		}
679		}
680		}
681
682	+	void checkToArray(ArrayDeque q) {
683	+	int size = q.size();
684	+	Object[] o = q.toArray();
685	+	assertEquals(size, o.length);
686	+	Iterator it = q.iterator();
687	+	for (int i = 0; i < size; i++) {
688	+	Integer x = (Integer) it.next();
689	+	assertEquals((Integer)o[0] + i, (int) x);
690	+	assertSame(o[i], x);
691	+	}
692	+	}
693	+
694		/**
695		* toArray() contains all elements in FIFO order
696		*/
697		public void testToArray() {
698	<	ArrayDeque q = populatedDeque(SIZE);
699	<	Object[] o = q.toArray();
700	<	for (int i = 0; i < o.length; i++)
701	<	assertSame(o[i], q.pollFirst());
698	>	ArrayDeque q = new ArrayDeque();
699	>	for (int i = 0; i < SIZE; i++) {
700	>	checkToArray(q);
701	>	q.addLast(i);
702	>	}
703	>	// Provoke wraparound
704	>	for (int i = 0; i < SIZE; i++) {
705	>	checkToArray(q);
706	>	assertEquals(i, q.poll());
707	>	q.addLast(SIZE + i);
708	>	}
709	>	for (int i = 0; i < SIZE; i++) {
710	>	checkToArray(q);
711	>	assertEquals(SIZE + i, q.poll());
712	>	}
713	>	}
714	>
715	>	void checkToArray2(ArrayDeque q) {
716	>	int size = q.size();
717	>	Integer[] a1 = (size == 0) ? null : new Integer[size - 1];
718	>	Integer[] a2 = new Integer[size];
719	>	Integer[] a3 = new Integer[size + 2];
720	>	if (size > 0) Arrays.fill(a1, 42);
721	>	Arrays.fill(a2, 42);
722	>	Arrays.fill(a3, 42);
723	>	Integer[] b1 = (size == 0) ? null : (Integer[]) q.toArray(a1);
724	>	Integer[] b2 = (Integer[]) q.toArray(a2);
725	>	Integer[] b3 = (Integer[]) q.toArray(a3);
726	>	assertSame(a2, b2);
727	>	assertSame(a3, b3);
728	>	Iterator it = q.iterator();
729	>	for (int i = 0; i < size; i++) {
730	>	Integer x = (Integer) it.next();
731	>	assertSame(b1[i], x);
732	>	assertEquals(b1[0] + i, (int) x);
733	>	assertSame(b2[i], x);
734	>	assertSame(b3[i], x);
735	>	}
736	>	assertNull(a3[size]);
737	>	assertEquals(42, (int) a3[size + 1]);
738	>	if (size > 0) {
739	>	assertNotSame(a1, b1);
740	>	assertEquals(size, b1.length);
741	>	for (int i = 0; i < a1.length; i++) {
742	>	assertEquals(42, (int) a1[i]);
743	>	}
744	>	}
745		}
746
747		/**
748		* toArray(a) contains all elements in FIFO order
749		*/
750		public void testToArray2() {
751	<	ArrayDeque<Integer> q = populatedDeque(SIZE);
752	<	Integer[] ints = new Integer[SIZE];
753	<	Integer[] array = q.toArray(ints);
754	<	assertSame(ints, array);
755	<	for (int i = 0; i < ints.length; i++)
756	<	assertSame(ints[i], q.remove());
751	>	ArrayDeque q = new ArrayDeque();
752	>	for (int i = 0; i < SIZE; i++) {
753	>	checkToArray2(q);
754	>	q.addLast(i);
755	>	}
756	>	// Provoke wraparound
757	>	for (int i = 0; i < SIZE; i++) {
758	>	checkToArray2(q);
759	>	assertEquals(i, q.poll());
760	>	q.addLast(SIZE + i);
761	>	}
762	>	for (int i = 0; i < SIZE; i++) {
763	>	checkToArray2(q);
764	>	assertEquals(SIZE + i, q.poll());
765	>	}
766		}
767
768		/**
#	Line 676 | Line 794 | public class ArrayDequeTest extends JSR1
794		*/
795		public void testIterator() {
796		ArrayDeque q = populatedDeque(SIZE);
679	–	int i = 0;
797		Iterator it = q.iterator();
798	<	while (it.hasNext()) {
798	>	int i;
799	>	for (i = 0; it.hasNext(); i++)
800		assertTrue(q.contains(it.next()));
683	–	++i;
684	–	}
801		assertEquals(i, SIZE);
802	+	assertIteratorExhausted(it);
803	+	}
804	+
805	+	/**
806	+	* iterator of empty collection has no elements
807	+	*/
808	+	public void testEmptyIterator() {
809	+	Deque c = new ArrayDeque();
810	+	assertIteratorExhausted(c.iterator());
811	+	assertIteratorExhausted(c.descendingIterator());
812		}
813
814		/**
#	Line 709 | Line 835 | public class ArrayDequeTest extends JSR1
835		final Random rng = new Random();
836		for (int iters = 0; iters < 100; ++iters) {
837		int max = rng.nextInt(5) + 2;
838	<	int split = rng.nextInt(max-1) + 1;
838	>	int split = rng.nextInt(max - 1) + 1;
839		for (int j = 1; j <= max; ++j)
840		q.add(new Integer(j));
841		Iterator it = q.iterator();
842		for (int j = 1; j <= split; ++j)
843		assertEquals(it.next(), new Integer(j));
844		it.remove();
845	<	assertEquals(it.next(), new Integer(split+1));
845	>	assertEquals(it.next(), new Integer(split + 1));
846		for (int j = 1; j <= split; ++j)
847		q.remove(new Integer(j));
848		it = q.iterator();
849	<	for (int j = split+1; j <= max; ++j) {
849	>	for (int j = split + 1; j <= max; ++j) {
850		assertEquals(it.next(), new Integer(j));
851		it.remove();
852		}
#	Line 777 | Line 903 | public class ArrayDequeTest extends JSR1
903		final Random rng = new Random();
904		for (int iters = 0; iters < 100; ++iters) {
905		int max = rng.nextInt(5) + 2;
906	<	int split = rng.nextInt(max-1) + 1;
906	>	int split = rng.nextInt(max - 1) + 1;
907		for (int j = max; j >= 1; --j)
908		q.add(new Integer(j));
909		Iterator it = q.descendingIterator();
910		for (int j = 1; j <= split; ++j)
911		assertEquals(it.next(), new Integer(j));
912		it.remove();
913	<	assertEquals(it.next(), new Integer(split+1));
913	>	assertEquals(it.next(), new Integer(split + 1));
914		for (int j = 1; j <= split; ++j)
915		q.remove(new Integer(j));
916		it = q.descendingIterator();
917	<	for (int j = split+1; j <= max; ++j) {
917	>	for (int j = split + 1; j <= max; ++j) {
918		assertEquals(it.next(), new Integer(j));
919		it.remove();
920		}
#	Line 815 | Line 941 | public class ArrayDequeTest extends JSR1
941		Queue x = populatedDeque(SIZE);
942		Queue y = serialClone(x);
943
944	<	assertTrue(x != y);
944	>	assertNotSame(y, x);
945		assertEquals(x.size(), y.size());
946		assertEquals(x.toString(), y.toString());
947		assertTrue(Arrays.equals(x.toArray(), y.toArray()));
#	Line 826 | Line 952 | public class ArrayDequeTest extends JSR1
952		assertTrue(y.isEmpty());
953		}
954
955	+	/**
956	+	* A cloned deque has same elements in same order
957	+	*/
958	+	public void testClone() throws Exception {
959	+	ArrayDeque<Integer> x = populatedDeque(SIZE);
960	+	ArrayDeque<Integer> y = x.clone();
961	+
962	+	assertNotSame(y, x);
963	+	assertEquals(x.size(), y.size());
964	+	assertEquals(x.toString(), y.toString());
965	+	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
966	+	while (!x.isEmpty()) {
967	+	assertFalse(y.isEmpty());
968	+	assertEquals(x.remove(), y.remove());
969	+	}
970	+	assertTrue(y.isEmpty());
971	+	}
972	+
973	+	/**
974	+	* remove(null), contains(null) always return false
975	+	*/
976	+	public void testNeverContainsNull() {
977	+	Deque<?>[] qs = {
978	+	new ArrayDeque<Object>(),
979	+	populatedDeque(2),
980	+	};
981	+
982	+	for (Deque<?> q : qs) {
983	+	assertFalse(q.contains(null));
984	+	assertFalse(q.remove(null));
985	+	assertFalse(q.removeFirstOccurrence(null));
986	+	assertFalse(q.removeLastOccurrence(null));
987	+	}
988	+	}
989	+
990	+	/**
991	+	* Handle capacities near Integer.MAX_VALUE.
992	+	* ant -Dvmoptions=-Xmx24g -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDequeTest -Djsr166.methodFilter=testHuge tck
993	+	*/
994	+	public void testHuge() {
995	+	if (! (testImplementationDetails
996	+	&& expensiveTests
997	+	&& Runtime.getRuntime().freeMemory() > 21_000_000_000L))
998	+	return;
999	+	int maxSize = Integer.MAX_VALUE - 8;
1000	+	ArrayDeque<Integer> q;
1001	+
1002	+	q = new ArrayDeque<>(maxSize);
1003	+
1004	+	assertThrows(OutOfMemoryError.class,
1005	+	() -> new ArrayDeque<>(Integer.MAX_VALUE));
1006	+
1007	+	q = populatedDeque(0);
1008	+	q.addAll(Collections.nCopies(maxSize - 2, (Integer) 42));
1009	+	assertEquals((Integer) 42, q.peekFirst());
1010	+	assertEquals((Integer) 42, q.peekLast());
1011	+	assertEquals(maxSize - 2, q.size());
1012	+	q.addFirst((Integer) 0);
1013	+	q.addLast((Integer) 1);
1014	+	assertEquals((Integer) 0, q.peekFirst());
1015	+	assertEquals((Integer) 1, q.peekLast());
1016	+	assertEquals(maxSize, q.size());
1017	+	}
1018	+
1019		}

Diff Legend

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