ViewVC Help

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

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

Comparing jsr166/src/test/tck/ArrayBlockingQueueTest.java (file contents):
Revision 1.65 by jsr166, Sat Apr 25 04:55:30 2015 UTC vs.
Revision 1.99 by jsr166, Wed Jan 27 01:57:24 2021 UTC

#	Line 11 | Line 11 | import static java.util.concurrent.TimeU
11		import java.util.ArrayList;
12		import java.util.Arrays;
13		import java.util.Collection;
14	+	import java.util.Collections;
15		import java.util.Iterator;
16		import java.util.NoSuchElementException;
17		import java.util.Queue;
#	Line 19 | Line 20 | import java.util.concurrent.BlockingQueu
20		import java.util.concurrent.CountDownLatch;
21		import java.util.concurrent.Executors;
22		import java.util.concurrent.ExecutorService;
23	+	import java.util.concurrent.ThreadLocalRandom;
24
25		import junit.framework.Test;
26
27		public class ArrayBlockingQueueTest extends JSR166TestCase {
28
29	<	public static class Fair extends BlockingQueueTest {
30	<	protected BlockingQueue emptyCollection() {
31	<	return new ArrayBlockingQueue(SIZE, true);
29	>	public static void main(String[] args) {
30	>	main(suite(), args);
31	>	}
32	>
33	>	public static Test suite() {
34	>	class Implementation implements CollectionImplementation {
35	>	public Class<?> klazz() { return ArrayBlockingQueue.class; }
36	>	public Collection emptyCollection() {
37	>	boolean fair = randomBoolean();
38	>	return populatedQueue(0, SIZE, 2 * SIZE, fair);
39	>	}
40	>	public Object makeElement(int i) { return JSR166TestCase.itemFor(i); }
41	>	public boolean isConcurrent() { return true; }
42	>	public boolean permitsNulls() { return false; }
43		}
44	+
45	+	return newTestSuite(
46	+	ArrayBlockingQueueTest.class,
47	+	new Fair().testSuite(),
48	+	new NonFair().testSuite(),
49	+	CollectionTest.testSuite(new Implementation()));
50		}
51
52	<	public static class NonFair extends BlockingQueueTest {
53	<	protected BlockingQueue emptyCollection() {
54	<	return new ArrayBlockingQueue(SIZE, false);
52	>	public static class Fair extends BlockingQueueTest {
53	>	protected BlockingQueue<Item> emptyCollection() {
54	>	return populatedQueue(0, SIZE, 2 * SIZE, true);
55		}
56		}
57
58	<	public static void main(String[] args) {
59	<	main(suite(), args);
58	>	public static class NonFair extends BlockingQueueTest {
59	>	protected BlockingQueue<Item> emptyCollection() {
60	>	return populatedQueue(0, SIZE, 2 * SIZE, false);
61	>	}
62		}
63
64	<	public static Test suite() {
65	<	return newTestSuite(ArrayBlockingQueueTest.class,
66	<	new Fair().testSuite(),
67	<	new NonFair().testSuite());
64	>	/**
65	>	* Returns a new queue of given size containing consecutive
66	>	* Items 0 ... n - 1.
67	>	*/
68	>	static ArrayBlockingQueue<Item> populatedQueue(int n) {
69	>	return populatedQueue(n, n, n, false);
70		}
71
72		/**
73		* Returns a new queue of given size containing consecutive
74	<	* Integers 0 ... n.
74	>	* Items 0 ... n - 1, with given capacity range and fairness.
75		*/
76	<	private ArrayBlockingQueue<Integer> populatedQueue(int n) {
77	<	ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n);
76	>	static ArrayBlockingQueue<Item> populatedQueue(
77	>	int size, int minCapacity, int maxCapacity, boolean fair) {
78	>	ThreadLocalRandom rnd = ThreadLocalRandom.current();
79	>	int capacity = rnd.nextInt(minCapacity, maxCapacity + 1);
80	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(capacity);
81		assertTrue(q.isEmpty());
82	<	for (int i = 0; i < n; i++)
83	<	assertTrue(q.offer(new Integer(i)));
84	<	assertFalse(q.isEmpty());
85	<	assertEquals(0, q.remainingCapacity());
86	<	assertEquals(n, q.size());
82	>	// shuffle circular array elements so they wrap
83	>	{
84	>	int n = rnd.nextInt(capacity);
85	>	for (int i = 0; i < n; i++) q.add(fortytwo);
86	>	for (int i = 0; i < n; i++) q.remove();
87	>	}
88	>	for (int i = 0; i < size; i++)
89	>	mustOffer(q, i);
90	>	mustEqual(size == 0, q.isEmpty());
91	>	mustEqual(capacity - size, q.remainingCapacity());
92	>	mustEqual(size, q.size());
93	>	if (size > 0)
94	>	mustEqual(0, q.peek());
95		return q;
96		}
97
#	Line 65 | Line 99 | public class ArrayBlockingQueueTest exte
99		* A new queue has the indicated capacity
100		*/
101		public void testConstructor1() {
102	<	assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity());
102	>	mustEqual(SIZE, new ArrayBlockingQueue<Item>(SIZE).remainingCapacity());
103		}
104
105		/**
106	<	* Constructor throws IAE if capacity argument nonpositive
106	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
107		*/
108	<	public void testConstructor2() {
109	<	try {
110	<	new ArrayBlockingQueue(0);
111	<	shouldThrow();
112	<	} catch (IllegalArgumentException success) {}
108	>	public void testConstructor_nonPositiveCapacity() {
109	>	for (int i : new int[] { 0, -1, Integer.MIN_VALUE }) {
110	>	try {
111	>	new ArrayBlockingQueue<Item>(i);
112	>	shouldThrow();
113	>	} catch (IllegalArgumentException success) {}
114	>	for (boolean fair : new boolean[] { true, false }) {
115	>	try {
116	>	new ArrayBlockingQueue<Item>(i, fair);
117	>	shouldThrow();
118	>	} catch (IllegalArgumentException success) {}
119	>	}
120	>	}
121		}
122
123		/**
124		* Initializing from null Collection throws NPE
125		*/
126	<	public void testConstructor3() {
126	>	public void testConstructor_nullCollection() {
127		try {
128	<	new ArrayBlockingQueue(1, true, null);
128	>	new ArrayBlockingQueue<Item>(1, true, null);
129		shouldThrow();
130		} catch (NullPointerException success) {}
131		}
#	Line 92 | Line 134 | public class ArrayBlockingQueueTest exte
134		* Initializing from Collection of null elements throws NPE
135		*/
136		public void testConstructor4() {
137	<	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
137	>	Collection<Item> elements = Arrays.asList(new Item[SIZE]);
138		try {
139	<	new ArrayBlockingQueue(SIZE, false, elements);
139	>	new ArrayBlockingQueue<Item>(SIZE, false, elements);
140		shouldThrow();
141		} catch (NullPointerException success) {}
142		}
#	Line 103 | Line 145 | public class ArrayBlockingQueueTest exte
145		* Initializing from Collection with some null elements throws NPE
146		*/
147		public void testConstructor5() {
148	<	Integer[] ints = new Integer[SIZE];
149	<	for (int i = 0; i < SIZE-1; ++i)
108	<	ints[i] = i;
109	<	Collection<Integer> elements = Arrays.asList(ints);
148	>	Item[] items = new Item[2]; items[0] = zero;
149	>	Collection<Item> elements = Arrays.asList(items);
150		try {
151	<	new ArrayBlockingQueue(SIZE, false, elements);
151	>	new ArrayBlockingQueue<Item>(SIZE, false, elements);
152		shouldThrow();
153		} catch (NullPointerException success) {}
154		}
155
156		/**
157	<	* Initializing from too large collection throws IAE
157	>	* Initializing from too large collection throws IllegalArgumentException
158		*/
159	<	public void testConstructor6() {
160	<	Integer[] ints = new Integer[SIZE];
161	<	for (int i = 0; i < SIZE; ++i)
162	<	ints[i] = i;
123	<	Collection<Integer> elements = Arrays.asList(ints);
159	>	public void testConstructor_collectionTooLarge() {
160	>	// just barely fits - succeeds
161	>	new ArrayBlockingQueue<Object>(SIZE, false,
162	>	Collections.nCopies(SIZE, ""));
163		try {
164	<	new ArrayBlockingQueue(SIZE - 1, false, elements);
164	>	new ArrayBlockingQueue<Object>(SIZE - 1, false,
165	>	Collections.nCopies(SIZE, ""));
166		shouldThrow();
167		} catch (IllegalArgumentException success) {}
168		}
#	Line 131 | Line 171 | public class ArrayBlockingQueueTest exte
171		* Queue contains all elements of collection used to initialize
172		*/
173		public void testConstructor7() {
174	<	Integer[] ints = new Integer[SIZE];
175	<	for (int i = 0; i < SIZE; ++i)
176	<	ints[i] = i;
137	<	Collection<Integer> elements = Arrays.asList(ints);
138	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements);
174	>	Item[] items = defaultItems;
175	>	Collection<Item> elements = Arrays.asList(items);
176	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(SIZE, true, elements);
177		for (int i = 0; i < SIZE; ++i)
178	<	assertEquals(ints[i], q.poll());
178	>	mustEqual(items[i], q.poll());
179		}
180
181		/**
182		* Queue transitions from empty to full when elements added
183		*/
184		public void testEmptyFull() {
185	<	ArrayBlockingQueue q = new ArrayBlockingQueue(2);
185	>	BlockingQueue<Item> q = populatedQueue(0, 2, 2, false);
186		assertTrue(q.isEmpty());
187	<	assertEquals(2, q.remainingCapacity());
187	>	mustEqual(2, q.remainingCapacity());
188		q.add(one);
189		assertFalse(q.isEmpty());
190	<	q.add(two);
190	>	assertTrue(q.offer(two));
191		assertFalse(q.isEmpty());
192	<	assertEquals(0, q.remainingCapacity());
192	>	mustEqual(0, q.remainingCapacity());
193		assertFalse(q.offer(three));
194		}
195
#	Line 159 | Line 197 | public class ArrayBlockingQueueTest exte
197		* remainingCapacity decreases on add, increases on remove
198		*/
199		public void testRemainingCapacity() {
200	<	BlockingQueue q = populatedQueue(SIZE);
201	<	for (int i = 0; i < SIZE; ++i) {
202	<	assertEquals(i, q.remainingCapacity());
203	<	assertEquals(SIZE, q.size() + q.remainingCapacity());
204	<	assertEquals(i, q.remove());
200	>	int size = ThreadLocalRandom.current().nextInt(1, SIZE);
201	>	BlockingQueue<Item> q = populatedQueue(size, size, 2 * size, false);
202	>	int spare = q.remainingCapacity();
203	>	int capacity = spare + size;
204	>	for (int i = 0; i < size; i++) {
205	>	mustEqual(spare + i, q.remainingCapacity());
206	>	mustEqual(capacity, q.size() + q.remainingCapacity());
207	>	mustEqual(i, q.remove());
208		}
209	<	for (int i = 0; i < SIZE; ++i) {
210	<	assertEquals(SIZE-i, q.remainingCapacity());
211	<	assertEquals(SIZE, q.size() + q.remainingCapacity());
212	<	assertTrue(q.add(i));
209	>	for (int i = 0; i < size; i++) {
210	>	mustEqual(capacity - i, q.remainingCapacity());
211	>	mustEqual(capacity, q.size() + q.remainingCapacity());
212	>	mustAdd(q, i);
213		}
214		}
215
#	Line 176 | Line 217 | public class ArrayBlockingQueueTest exte
217		* Offer succeeds if not full; fails if full
218		*/
219		public void testOffer() {
220	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
220	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(1);
221		assertTrue(q.offer(zero));
222		assertFalse(q.offer(one));
223		}
224
225		/**
226	<	* add succeeds if not full; throws ISE if full
226	>	* add succeeds if not full; throws IllegalStateException if full
227		*/
228		public void testAdd() {
229	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
230	<	for (int i = 0; i < SIZE; ++i) {
231	<	assertTrue(q.add(new Integer(i)));
191	<	}
192	<	assertEquals(0, q.remainingCapacity());
229	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(SIZE);
230	>	for (int i = 0; i < SIZE; i++) assertTrue(q.add(itemFor(i)));
231	>	mustEqual(0, q.remainingCapacity());
232		try {
233	<	q.add(new Integer(SIZE));
233	>	q.add(itemFor(SIZE));
234		shouldThrow();
235		} catch (IllegalStateException success) {}
236		}
237
238		/**
239	<	* addAll(this) throws IAE
239	>	* addAll(this) throws IllegalArgumentException
240		*/
241		public void testAddAllSelf() {
242	<	ArrayBlockingQueue q = populatedQueue(SIZE);
242	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
243		try {
244		q.addAll(q);
245		shouldThrow();
#	Line 212 | Line 251 | public class ArrayBlockingQueueTest exte
251		* possibly adding some elements
252		*/
253		public void testAddAll3() {
254	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
255	<	Integer[] ints = new Integer[SIZE];
217	<	for (int i = 0; i < SIZE-1; ++i)
218	<	ints[i] = new Integer(i);
254	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(SIZE);
255	>	Item[] items = new Item[2]; items[0] = zero;
256		try {
257	<	q.addAll(Arrays.asList(ints));
257	>	q.addAll(Arrays.asList(items));
258		shouldThrow();
259		} catch (NullPointerException success) {}
260		}
261
262		/**
263	<	* addAll throws ISE if not enough room
263	>	* addAll throws IllegalStateException if not enough room
264		*/
265	<	public void testAddAll4() {
266	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
267	<	Integer[] ints = new Integer[SIZE];
268	<	for (int i = 0; i < SIZE; ++i)
269	<	ints[i] = new Integer(i);
265	>	public void testAddAll_insufficientSpace() {
266	>	int size = ThreadLocalRandom.current().nextInt(1, SIZE);
267	>	ArrayBlockingQueue<Item> q = populatedQueue(0, size, size, false);
268	>	// Just fits:
269	>	q.addAll(populatedQueue(size, size, 2 * size, false));
270	>	mustEqual(0, q.remainingCapacity());
271	>	mustEqual(size, q.size());
272	>	mustEqual(0, q.peek());
273		try {
274	<	q.addAll(Arrays.asList(ints));
274	>	q = populatedQueue(0, size, size, false);
275	>	q.addAll(Collections.nCopies(size + 1, fortytwo));
276		shouldThrow();
277		} catch (IllegalStateException success) {}
278		}
#	Line 240 | Line 281 | public class ArrayBlockingQueueTest exte
281		* Queue contains all elements, in traversal order, of successful addAll
282		*/
283		public void testAddAll5() {
284	<	Integer[] empty = new Integer[0];
285	<	Integer[] ints = new Integer[SIZE];
286	<	for (int i = 0; i < SIZE; ++i)
246	<	ints[i] = new Integer(i);
247	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
284	>	Item[] empty = new Item[0];
285	>	Item[] items = defaultItems;
286	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(SIZE);
287		assertFalse(q.addAll(Arrays.asList(empty)));
288	<	assertTrue(q.addAll(Arrays.asList(ints)));
288	>	assertTrue(q.addAll(Arrays.asList(items)));
289		for (int i = 0; i < SIZE; ++i)
290	<	assertEquals(ints[i], q.poll());
290	>	mustEqual(items[i], q.poll());
291		}
292
293		/**
294		* all elements successfully put are contained
295		*/
296		public void testPut() throws InterruptedException {
297	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
297	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(SIZE);
298		for (int i = 0; i < SIZE; ++i) {
299	<	Integer x = new Integer(i);
299	>	Item x = itemFor(i);
300		q.put(x);
301	<	assertTrue(q.contains(x));
301	>	mustContain(q, x);
302		}
303	<	assertEquals(0, q.remainingCapacity());
303	>	mustEqual(0, q.remainingCapacity());
304		}
305
306		/**
307		* put blocks interruptibly if full
308		*/
309		public void testBlockingPut() throws InterruptedException {
310	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
310	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(SIZE);
311		final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
312		Thread t = newStartedThread(new CheckedRunnable() {
313		public void realRun() throws InterruptedException {
314		for (int i = 0; i < SIZE; ++i)
315	<	q.put(i);
316	<	assertEquals(SIZE, q.size());
317	<	assertEquals(0, q.remainingCapacity());
315	>	q.put(itemFor(i));
316	>	mustEqual(SIZE, q.size());
317	>	mustEqual(0, q.remainingCapacity());
318
319		Thread.currentThread().interrupt();
320		try {
321	<	q.put(99);
321	>	q.put(ninetynine);
322		shouldThrow();
323		} catch (InterruptedException success) {}
324		assertFalse(Thread.interrupted());
325
326		pleaseInterrupt.countDown();
327		try {
328	<	q.put(99);
328	>	q.put(ninetynine);
329		shouldThrow();
330		} catch (InterruptedException success) {}
331		assertFalse(Thread.interrupted());
332		}});
333
334		await(pleaseInterrupt);
335	<	assertThreadStaysAlive(t);
335	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
336		t.interrupt();
337		awaitTermination(t);
338	<	assertEquals(SIZE, q.size());
339	<	assertEquals(0, q.remainingCapacity());
338	>	mustEqual(SIZE, q.size());
339	>	mustEqual(0, q.remainingCapacity());
340		}
341
342		/**
#	Line 305 | Line 344 | public class ArrayBlockingQueueTest exte
344		*/
345		public void testPutWithTake() throws InterruptedException {
346		final int capacity = 2;
347	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(capacity);
347	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(capacity);
348		final CountDownLatch pleaseTake = new CountDownLatch(1);
349		final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
350		Thread t = newStartedThread(new CheckedRunnable() {
351		public void realRun() throws InterruptedException {
352		for (int i = 0; i < capacity; i++)
353	<	q.put(i);
353	>	q.put(itemFor(i));
354		pleaseTake.countDown();
355	<	q.put(86);
355	>	q.put(eightysix);
356	>
357	>	Thread.currentThread().interrupt();
358	>	try {
359	>	q.put(ninetynine);
360	>	shouldThrow();
361	>	} catch (InterruptedException success) {}
362	>	assertFalse(Thread.interrupted());
363
364		pleaseInterrupt.countDown();
365		try {
366	<	q.put(99);
366	>	q.put(ninetynine);
367		shouldThrow();
368		} catch (InterruptedException success) {}
369		assertFalse(Thread.interrupted());
370		}});
371
372		await(pleaseTake);
373	<	assertEquals(0, q.remainingCapacity());
374	<	assertEquals(0, q.take());
373	>	mustEqual(0, q.remainingCapacity());
374	>	mustEqual(0, q.take());
375
376		await(pleaseInterrupt);
377	<	assertThreadStaysAlive(t);
377	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
378		t.interrupt();
379		awaitTermination(t);
380	<	assertEquals(0, q.remainingCapacity());
380	>	mustEqual(0, q.remainingCapacity());
381		}
382
383		/**
384		* timed offer times out if full and elements not taken
385		*/
386	<	public void testTimedOffer() throws InterruptedException {
387	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
386	>	public void testTimedOffer() {
387	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(2);
388		final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
389		Thread t = newStartedThread(new CheckedRunnable() {
390		public void realRun() throws InterruptedException {
391	<	q.put(new Object());
392	<	q.put(new Object());
391	>	q.put(one);
392	>	q.put(two);
393		long startTime = System.nanoTime();
394	<	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
394	>	assertFalse(q.offer(zero, timeoutMillis(), MILLISECONDS));
395		assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
396	+
397	+	Thread.currentThread().interrupt();
398	+	try {
399	+	q.offer(three, randomTimeout(), randomTimeUnit());
400	+	shouldThrow();
401	+	} catch (InterruptedException success) {}
402	+	assertFalse(Thread.interrupted());
403	+
404		pleaseInterrupt.countDown();
405		try {
406	<	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
406	>	q.offer(four, LONGER_DELAY_MS, MILLISECONDS);
407		shouldThrow();
408		} catch (InterruptedException success) {}
409	+	assertFalse(Thread.interrupted());
410		}});
411
412		await(pleaseInterrupt);
413	<	assertThreadStaysAlive(t);
413	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
414		t.interrupt();
415		awaitTermination(t);
416		}
#	Line 364 | Line 419 | public class ArrayBlockingQueueTest exte
419		* take retrieves elements in FIFO order
420		*/
421		public void testTake() throws InterruptedException {
422	<	ArrayBlockingQueue q = populatedQueue(SIZE);
422	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
423		for (int i = 0; i < SIZE; ++i) {
424	<	assertEquals(i, q.take());
424	>	mustEqual(i, q.take());
425		}
426		}
427
#	Line 374 | Line 429 | public class ArrayBlockingQueueTest exte
429		* Take removes existing elements until empty, then blocks interruptibly
430		*/
431		public void testBlockingTake() throws InterruptedException {
432	<	final ArrayBlockingQueue q = populatedQueue(SIZE);
432	>	final ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
433		final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
434		Thread t = newStartedThread(new CheckedRunnable() {
435		public void realRun() throws InterruptedException {
436	<	for (int i = 0; i < SIZE; ++i) {
382	<	assertEquals(i, q.take());
383	<	}
436	>	for (int i = 0; i < SIZE; i++) mustEqual(i, q.take());
437
438		Thread.currentThread().interrupt();
439		try {
#	Line 398 | Line 451 | public class ArrayBlockingQueueTest exte
451		}});
452
453		await(pleaseInterrupt);
454	<	assertThreadStaysAlive(t);
454	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
455		t.interrupt();
456		awaitTermination(t);
457		}
#	Line 407 | Line 460 | public class ArrayBlockingQueueTest exte
460		* poll succeeds unless empty
461		*/
462		public void testPoll() {
463	<	ArrayBlockingQueue q = populatedQueue(SIZE);
463	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
464		for (int i = 0; i < SIZE; ++i) {
465	<	assertEquals(i, q.poll());
465	>	mustEqual(i, q.poll());
466		}
467		assertNull(q.poll());
468		}
#	Line 418 | Line 471 | public class ArrayBlockingQueueTest exte
471		* timed poll with zero timeout succeeds when non-empty, else times out
472		*/
473		public void testTimedPoll0() throws InterruptedException {
474	<	ArrayBlockingQueue q = populatedQueue(SIZE);
474	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
475		for (int i = 0; i < SIZE; ++i) {
476	<	assertEquals(i, q.poll(0, MILLISECONDS));
476	>	mustEqual(i, q.poll(0, MILLISECONDS));
477		}
478		assertNull(q.poll(0, MILLISECONDS));
479		checkEmpty(q);
#	Line 430 | Line 483 | public class ArrayBlockingQueueTest exte
483		* timed poll with nonzero timeout succeeds when non-empty, else times out
484		*/
485		public void testTimedPoll() throws InterruptedException {
486	<	ArrayBlockingQueue q = populatedQueue(SIZE);
486	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
487		for (int i = 0; i < SIZE; ++i) {
488		long startTime = System.nanoTime();
489	<	assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
489	>	mustEqual(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
490		assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
491		}
492		long startTime = System.nanoTime();
#	Line 447 | Line 500 | public class ArrayBlockingQueueTest exte
500		* returning timeout status
501		*/
502		public void testInterruptedTimedPoll() throws InterruptedException {
503	<	final BlockingQueue<Integer> q = populatedQueue(SIZE);
504	<	final CountDownLatch aboutToWait = new CountDownLatch(1);
503	>	final BlockingQueue<Item> q = populatedQueue(SIZE);
504	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
505		Thread t = newStartedThread(new CheckedRunnable() {
506		public void realRun() throws InterruptedException {
507	<	for (int i = 0; i < SIZE; ++i) {
508	<	long t0 = System.nanoTime();
509	<	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
510	<	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
511	<	}
512	<	long t0 = System.nanoTime();
513	<	aboutToWait.countDown();
514	<	try {
515	<	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
516	<	shouldThrow();
517	<	} catch (InterruptedException success) {
518	<	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
519	<	}
507	>	for (int i = 0; i < SIZE; i++)
508	>	mustEqual(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
509	>
510	>	Thread.currentThread().interrupt();
511	>	try {
512	>	q.poll(randomTimeout(), randomTimeUnit());
513	>	shouldThrow();
514	>	} catch (InterruptedException success) {}
515	>	assertFalse(Thread.interrupted());
516	>
517	>	pleaseInterrupt.countDown();
518	>	try {
519	>	q.poll(LONGER_DELAY_MS, MILLISECONDS);
520	>	shouldThrow();
521	>	} catch (InterruptedException success) {}
522	>	assertFalse(Thread.interrupted());
523		}});
524
525	<	aboutToWait.await();
526	<	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
525	>	await(pleaseInterrupt);
526	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
527		t.interrupt();
528	<	awaitTermination(t, MEDIUM_DELAY_MS);
528	>	awaitTermination(t);
529		checkEmpty(q);
530		}
531
#	Line 477 | Line 533 | public class ArrayBlockingQueueTest exte
533		* peek returns next element, or null if empty
534		*/
535		public void testPeek() {
536	<	ArrayBlockingQueue q = populatedQueue(SIZE);
536	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
537		for (int i = 0; i < SIZE; ++i) {
538	<	assertEquals(i, q.peek());
539	<	assertEquals(i, q.poll());
538	>	mustEqual(i, q.peek());
539	>	mustEqual(i, q.poll());
540		assertTrue(q.peek() == null ||
541		!q.peek().equals(i));
542		}
#	Line 491 | Line 547 | public class ArrayBlockingQueueTest exte
547		* element returns next element, or throws NSEE if empty
548		*/
549		public void testElement() {
550	<	ArrayBlockingQueue q = populatedQueue(SIZE);
550	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
551		for (int i = 0; i < SIZE; ++i) {
552	<	assertEquals(i, q.element());
553	<	assertEquals(i, q.poll());
552	>	mustEqual(i, q.element());
553	>	mustEqual(i, q.poll());
554		}
555		try {
556		q.element();
#	Line 506 | Line 562 | public class ArrayBlockingQueueTest exte
562		* remove removes next element, or throws NSEE if empty
563		*/
564		public void testRemove() {
565	<	ArrayBlockingQueue q = populatedQueue(SIZE);
565	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
566		for (int i = 0; i < SIZE; ++i) {
567	<	assertEquals(i, q.remove());
567	>	mustEqual(i, q.remove());
568		}
569		try {
570		q.remove();
#	Line 520 | Line 576 | public class ArrayBlockingQueueTest exte
576		* contains(x) reports true when elements added but not yet removed
577		*/
578		public void testContains() {
579	<	ArrayBlockingQueue q = populatedQueue(SIZE);
580	<	for (int i = 0; i < SIZE; ++i) {
581	<	assertTrue(q.contains(new Integer(i)));
582	<	assertEquals(i, q.poll());
583	<	assertFalse(q.contains(new Integer(i)));
579	>	int size = ThreadLocalRandom.current().nextInt(1, SIZE);
580	>	ArrayBlockingQueue<Item> q = populatedQueue(size, size, 2 * size, false);
581	>	assertFalse(q.contains(null));
582	>	for (int i = 0; i < size; ++i) {
583	>	mustContain(q, i);
584	>	mustEqual(i, q.poll());
585	>	mustNotContain(q, i);
586		}
587		}
588
#	Line 532 | Line 590 | public class ArrayBlockingQueueTest exte
590		* clear removes all elements
591		*/
592		public void testClear() {
593	<	ArrayBlockingQueue q = populatedQueue(SIZE);
593	>	int size = ThreadLocalRandom.current().nextInt(1, 5);
594	>	ArrayBlockingQueue<Item> q = populatedQueue(size, size, 2 * size, false);
595	>	int capacity = size + q.remainingCapacity();
596		q.clear();
597		assertTrue(q.isEmpty());
598	<	assertEquals(0, q.size());
599	<	assertEquals(SIZE, q.remainingCapacity());
598	>	mustEqual(0, q.size());
599	>	mustEqual(capacity, q.remainingCapacity());
600		q.add(one);
601		assertFalse(q.isEmpty());
602	<	assertTrue(q.contains(one));
602	>	mustContain(q, one);
603		q.clear();
604		assertTrue(q.isEmpty());
605		}
#	Line 548 | Line 608 | public class ArrayBlockingQueueTest exte
608		* containsAll(c) is true when c contains a subset of elements
609		*/
610		public void testContainsAll() {
611	<	ArrayBlockingQueue q = populatedQueue(SIZE);
612	<	ArrayBlockingQueue p = new ArrayBlockingQueue(SIZE);
611	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
612	>	ArrayBlockingQueue<Item> p = new ArrayBlockingQueue<>(SIZE);
613		for (int i = 0; i < SIZE; ++i) {
614		assertTrue(q.containsAll(p));
615		assertFalse(p.containsAll(q));
616	<	p.add(new Integer(i));
616	>	mustAdd(p, i);
617		}
618		assertTrue(p.containsAll(q));
619		}
#	Line 562 | Line 622 | public class ArrayBlockingQueueTest exte
622		* retainAll(c) retains only those elements of c and reports true if changed
623		*/
624		public void testRetainAll() {
625	<	ArrayBlockingQueue q = populatedQueue(SIZE);
626	<	ArrayBlockingQueue p = populatedQueue(SIZE);
625	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
626	>	ArrayBlockingQueue<Item> p = populatedQueue(SIZE);
627		for (int i = 0; i < SIZE; ++i) {
628		boolean changed = q.retainAll(p);
629		if (i == 0)
#	Line 572 | Line 632 | public class ArrayBlockingQueueTest exte
632		assertTrue(changed);
633
634		assertTrue(q.containsAll(p));
635	<	assertEquals(SIZE-i, q.size());
635	>	mustEqual(SIZE - i, q.size());
636		p.remove();
637		}
638		}
#	Line 582 | Line 642 | public class ArrayBlockingQueueTest exte
642		*/
643		public void testRemoveAll() {
644		for (int i = 1; i < SIZE; ++i) {
645	<	ArrayBlockingQueue q = populatedQueue(SIZE);
646	<	ArrayBlockingQueue p = populatedQueue(i);
645	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
646	>	ArrayBlockingQueue<Item> p = populatedQueue(i);
647		assertTrue(q.removeAll(p));
648	<	assertEquals(SIZE-i, q.size());
648	>	mustEqual(SIZE - i, q.size());
649		for (int j = 0; j < i; ++j) {
650	<	Integer x = (Integer)(p.remove());
651	<	assertFalse(q.contains(x));
650	>	Item x = p.remove();
651	>	mustNotContain(q, x);
652		}
653		}
654		}
655
656	<	void checkToArray(ArrayBlockingQueue q) {
656	>	void checkToArray(ArrayBlockingQueue<Item> q) {
657		int size = q.size();
658	<	Object[] o = q.toArray();
659	<	assertEquals(size, o.length);
660	<	Iterator it = q.iterator();
658	>	Object[] a1 = q.toArray();
659	>	mustEqual(size, a1.length);
660	>	Item[] a2 = q.toArray(new Item[0]);
661	>	mustEqual(size, a2.length);
662	>	Item[] a3 = q.toArray(new Item[Math.max(0, size - 1)]);
663	>	mustEqual(size, a3.length);
664	>	Item[] a4 = new Item[size];
665	>	assertSame(a4, q.toArray(a4));
666	>	Item[] a5 = new Item[size + 1];
667	>	Arrays.fill(a5, fortytwo);
668	>	assertSame(a5, q.toArray(a5));
669	>	Item[] a6 = new Item[size + 2];
670	>	Arrays.fill(a6, fortytwo);
671	>	assertSame(a6, q.toArray(a6));
672	>	Object[][] as = { a1, a2, a3, a4, a5, a6 };
673	>	for (Object[] a : as) {
674	>	if (a.length > size) assertNull(a[size]);
675	>	if (a.length > size + 1) mustEqual(fortytwo, a[size + 1]);
676	>	}
677	>	Iterator<? extends Item> it = q.iterator();
678	>	Item s = q.peek();
679		for (int i = 0; i < size; i++) {
680	<	Integer x = (Integer) it.next();
681	<	assertEquals((Integer)o[0] + i, (int) x);
682	<	assertSame(o[i], x);
680	>	Item x = (Item) it.next();
681	>	mustEqual(s.value + i, x);
682	>	for (Object[] a : as)
683	>	mustEqual(a[i], x);
684		}
685		}
686
687		/**
688	<	* toArray() contains all elements in FIFO order
688	>	* toArray() and toArray(a) contain all elements in FIFO order
689		*/
690		public void testToArray() {
691	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
692	<	for (int i = 0; i < SIZE; i++) {
691	>	final ThreadLocalRandom rnd = ThreadLocalRandom.current();
692	>	final int size = rnd.nextInt(6);
693	>	final int capacity = Math.max(1, size + rnd.nextInt(size + 1));
694	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(capacity);
695	>	for (int i = 0; i < size; i++) {
696		checkToArray(q);
697	<	q.add(i);
697	>	mustAdd(q, i);
698		}
699		// Provoke wraparound
700	<	for (int i = 0; i < SIZE; i++) {
701	<	checkToArray(q);
620	<	assertEquals(i, q.poll());
700	>	int added = size * 2;
701	>	for (int i = 0; i < added; i++) {
702		checkToArray(q);
703	<	q.add(SIZE+i);
703	>	mustEqual(i, q.poll());
704	>	q.add(new Item(size + i));
705		}
624	–	for (int i = 0; i < SIZE; i++) {
625	–	checkToArray(q);
626	–	assertEquals(SIZE+i, q.poll());
627	–	}
628	–	}
629	–
630	–	void checkToArray2(ArrayBlockingQueue q) {
631	–	int size = q.size();
632	–	Integer[] a1 = size == 0 ? null : new Integer[size-1];
633	–	Integer[] a2 = new Integer[size];
634	–	Integer[] a3 = new Integer[size+2];
635	–	if (size > 0) Arrays.fill(a1, 42);
636	–	Arrays.fill(a2, 42);
637	–	Arrays.fill(a3, 42);
638	–	Integer[] b1 = size == 0 ? null : (Integer[]) q.toArray(a1);
639	–	Integer[] b2 = (Integer[]) q.toArray(a2);
640	–	Integer[] b3 = (Integer[]) q.toArray(a3);
641	–	assertSame(a2, b2);
642	–	assertSame(a3, b3);
643	–	Iterator it = q.iterator();
706		for (int i = 0; i < size; i++) {
707	<	Integer x = (Integer) it.next();
708	<	assertSame(b1[i], x);
647	<	assertEquals(b1[0] + i, (int) x);
648	<	assertSame(b2[i], x);
649	<	assertSame(b3[i], x);
650	<	}
651	<	assertNull(a3[size]);
652	<	assertEquals(42, (int) a3[size+1]);
653	<	if (size > 0) {
654	<	assertNotSame(a1, b1);
655	<	assertEquals(size, b1.length);
656	<	for (int i = 0; i < a1.length; i++) {
657	<	assertEquals(42, (int) a1[i]);
658	<	}
659	<	}
660	<	}
661	<
662	<	/**
663	<	* toArray(a) contains all elements in FIFO order
664	<	*/
665	<	public void testToArray2() {
666	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
667	<	for (int i = 0; i < SIZE; i++) {
668	<	checkToArray2(q);
669	<	q.add(i);
670	<	}
671	<	// Provoke wraparound
672	<	for (int i = 0; i < SIZE; i++) {
673	<	checkToArray2(q);
674	<	assertEquals(i, q.poll());
675	<	checkToArray2(q);
676	<	q.add(SIZE+i);
677	<	}
678	<	for (int i = 0; i < SIZE; i++) {
679	<	checkToArray2(q);
680	<	assertEquals(SIZE+i, q.poll());
707	>	checkToArray(q);
708	>	mustEqual((added + i), q.poll());
709		}
710		}
711
712		/**
713		* toArray(incompatible array type) throws ArrayStoreException
714		*/
715	<	public void testToArray1_BadArg() {
716	<	ArrayBlockingQueue q = populatedQueue(SIZE);
715	>	public void testToArray_incompatibleArrayType() {
716	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
717		try {
718		q.toArray(new String[10]);
719		shouldThrow();
720		} catch (ArrayStoreException success) {}
721	+	try {
722	+	q.toArray(new String[0]);
723	+	shouldThrow();
724	+	} catch (ArrayStoreException success) {}
725		}
726
727		/**
728		* iterator iterates through all elements
729		*/
730		public void testIterator() throws InterruptedException {
731	<	ArrayBlockingQueue q = populatedQueue(SIZE);
732	<	Iterator it = q.iterator();
731	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
732	>	Iterator<? extends Item> it = q.iterator();
733		int i;
734		for (i = 0; it.hasNext(); i++)
735	<	assertTrue(q.contains(it.next()));
736	<	assertEquals(i, SIZE);
735	>	mustContain(q, it.next());
736	>	mustEqual(i, SIZE);
737		assertIteratorExhausted(it);
738
739		it = q.iterator();
740		for (i = 0; it.hasNext(); i++)
741	<	assertEquals(it.next(), q.take());
742	<	assertEquals(i, SIZE);
741	>	mustEqual(it.next(), q.take());
742	>	mustEqual(i, SIZE);
743		assertIteratorExhausted(it);
744		}
745
#	Line 715 | Line 747 | public class ArrayBlockingQueueTest exte
747		* iterator of empty collection has no elements
748		*/
749		public void testEmptyIterator() {
750	<	assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator());
750	>	assertIteratorExhausted(new ArrayBlockingQueue<>(SIZE).iterator());
751		}
752
753		/**
754		* iterator.remove removes current element
755		*/
756		public void testIteratorRemove() {
757	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
757	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(3);
758		q.add(two);
759		q.add(one);
760		q.add(three);
761
762	<	Iterator it = q.iterator();
762	>	Iterator<? extends Item> it = q.iterator();
763		it.next();
764		it.remove();
765
#	Line 741 | Line 773 | public class ArrayBlockingQueueTest exte
773		* iterator ordering is FIFO
774		*/
775		public void testIteratorOrdering() {
776	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
776	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(3);
777		q.add(one);
778		q.add(two);
779		q.add(three);
#	Line 749 | Line 781 | public class ArrayBlockingQueueTest exte
781		assertEquals("queue should be full", 0, q.remainingCapacity());
782
783		int k = 0;
784	<	for (Iterator it = q.iterator(); it.hasNext();) {
785	<	assertEquals(++k, it.next());
784	>	for (Iterator<? extends Item> it = q.iterator(); it.hasNext();) {
785	>	mustEqual(++k, it.next());
786		}
787	<	assertEquals(3, k);
787	>	mustEqual(3, k);
788		}
789
790		/**
791		* Modifications do not cause iterators to fail
792		*/
793		public void testWeaklyConsistentIteration() {
794	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
794	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(3);
795		q.add(one);
796		q.add(two);
797		q.add(three);
798	<	for (Iterator it = q.iterator(); it.hasNext();) {
798	>	for (Iterator<? extends Item> it = q.iterator(); it.hasNext();) {
799		q.remove();
800		it.next();
801		}
802	<	assertEquals(0, q.size());
802	>	mustEqual(0, q.size());
803		}
804
805		/**
806		* toString contains toStrings of elements
807		*/
808		public void testToString() {
809	<	ArrayBlockingQueue q = populatedQueue(SIZE);
809	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
810		String s = q.toString();
811		for (int i = 0; i < SIZE; ++i) {
812		assertTrue(s.contains(String.valueOf(i)));
#	Line 785 | Line 817 | public class ArrayBlockingQueueTest exte
817		* offer transfers elements across Executor tasks
818		*/
819		public void testOfferInExecutor() {
820	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
820	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(2);
821		q.add(one);
822		q.add(two);
791	–	ExecutorService executor = Executors.newFixedThreadPool(2);
823		final CheckedBarrier threadsStarted = new CheckedBarrier(2);
824	<	executor.execute(new CheckedRunnable() {
825	<	public void realRun() throws InterruptedException {
826	<	assertFalse(q.offer(three));
827	<	threadsStarted.await();
828	<	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
829	<	assertEquals(0, q.remainingCapacity());
830	<	}});
831	<
832	<	executor.execute(new CheckedRunnable() {
833	<	public void realRun() throws InterruptedException {
834	<	threadsStarted.await();
835	<	assertEquals(0, q.remainingCapacity());
836	<	assertSame(one, q.take());
837	<	}});
838	<
839	<	joinPool(executor);
824	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
825	>	try (PoolCleaner cleaner = cleaner(executor)) {
826	>	executor.execute(new CheckedRunnable() {
827	>	public void realRun() throws InterruptedException {
828	>	assertFalse(q.offer(three));
829	>	threadsStarted.await();
830	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
831	>	mustEqual(0, q.remainingCapacity());
832	>	}});
833	>
834	>	executor.execute(new CheckedRunnable() {
835	>	public void realRun() throws InterruptedException {
836	>	threadsStarted.await();
837	>	mustEqual(0, q.remainingCapacity());
838	>	assertSame(one, q.take());
839	>	}});
840	>	}
841		}
842
843		/**
844		* timed poll retrieves elements across Executor threads
845		*/
846		public void testPollInExecutor() {
847	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
847	>	final ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(2);
848		final CheckedBarrier threadsStarted = new CheckedBarrier(2);
849	<	ExecutorService executor = Executors.newFixedThreadPool(2);
850	<	executor.execute(new CheckedRunnable() {
851	<	public void realRun() throws InterruptedException {
852	<	assertNull(q.poll());
853	<	threadsStarted.await();
854	<	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
855	<	checkEmpty(q);
856	<	}});
857	<
858	<	executor.execute(new CheckedRunnable() {
859	<	public void realRun() throws InterruptedException {
860	<	threadsStarted.await();
861	<	q.put(one);
862	<	}});
863	<
864	<	joinPool(executor);
849	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
850	>	try (PoolCleaner cleaner = cleaner(executor)) {
851	>	executor.execute(new CheckedRunnable() {
852	>	public void realRun() throws InterruptedException {
853	>	assertNull(q.poll());
854	>	threadsStarted.await();
855	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
856	>	checkEmpty(q);
857	>	}});
858	>
859	>	executor.execute(new CheckedRunnable() {
860	>	public void realRun() throws InterruptedException {
861	>	threadsStarted.await();
862	>	q.put(one);
863	>	}});
864	>	}
865		}
866
867		/**
868	<	* A deserialized serialized queue has same elements in same order
868	>	* A deserialized/reserialized queue has same elements in same order
869		*/
870		public void testSerialization() throws Exception {
871	<	Queue x = populatedQueue(SIZE);
872	<	Queue y = serialClone(x);
871	>	Queue<Item> x = populatedQueue(SIZE);
872	>	Queue<Item> y = serialClone(x);
873
874		assertNotSame(x, y);
875	<	assertEquals(x.size(), y.size());
876	<	assertEquals(x.toString(), y.toString());
875	>	mustEqual(x.size(), y.size());
876	>	mustEqual(x.toString(), y.toString());
877		assertTrue(Arrays.equals(x.toArray(), y.toArray()));
878		while (!x.isEmpty()) {
879		assertFalse(y.isEmpty());
880	<	assertEquals(x.remove(), y.remove());
880	>	mustEqual(x.remove(), y.remove());
881		}
882		assertTrue(y.isEmpty());
883		}
#	Line 854 | Line 886 | public class ArrayBlockingQueueTest exte
886		* drainTo(c) empties queue into another collection c
887		*/
888		public void testDrainTo() {
889	<	ArrayBlockingQueue q = populatedQueue(SIZE);
890	<	ArrayList l = new ArrayList();
889	>	ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
890	>	ArrayList<Item> l = new ArrayList<>();
891		q.drainTo(l);
892	<	assertEquals(0, q.size());
893	<	assertEquals(SIZE, l.size());
892	>	mustEqual(0, q.size());
893	>	mustEqual(SIZE, l.size());
894		for (int i = 0; i < SIZE; ++i)
895	<	assertEquals(l.get(i), new Integer(i));
895	>	mustEqual(l.get(i), i);
896		q.add(zero);
897		q.add(one);
898		assertFalse(q.isEmpty());
899	<	assertTrue(q.contains(zero));
900	<	assertTrue(q.contains(one));
899	>	mustContain(q, zero);
900	>	mustContain(q, one);
901		l.clear();
902		q.drainTo(l);
903	<	assertEquals(0, q.size());
904	<	assertEquals(2, l.size());
903	>	mustEqual(0, q.size());
904	>	mustEqual(2, l.size());
905		for (int i = 0; i < 2; ++i)
906	<	assertEquals(l.get(i), new Integer(i));
906	>	mustEqual(l.get(i), i);
907		}
908
909		/**
910		* drainTo empties full queue, unblocking a waiting put.
911		*/
912		public void testDrainToWithActivePut() throws InterruptedException {
913	<	final ArrayBlockingQueue q = populatedQueue(SIZE);
913	>	final ArrayBlockingQueue<Item> q = populatedQueue(SIZE);
914		Thread t = new Thread(new CheckedRunnable() {
915		public void realRun() throws InterruptedException {
916	<	q.put(new Integer(SIZE+1));
916	>	q.put(new Item(SIZE + 1));
917		}});
918
919		t.start();
920	<	ArrayList l = new ArrayList();
920	>	ArrayList<Item> l = new ArrayList<>();
921		q.drainTo(l);
922		assertTrue(l.size() >= SIZE);
923		for (int i = 0; i < SIZE; ++i)
924	<	assertEquals(l.get(i), new Integer(i));
924	>	mustEqual(l.get(i), i);
925		t.join();
926		assertTrue(q.size() + l.size() >= SIZE);
927		}
#	Line 898 | Line 930 | public class ArrayBlockingQueueTest exte
930		* drainTo(c, n) empties first min(n, size) elements of queue into c
931		*/
932		public void testDrainToN() {
933	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
933	>	ArrayBlockingQueue<Item> q = new ArrayBlockingQueue<>(SIZE * 2);
934		for (int i = 0; i < SIZE + 2; ++i) {
935		for (int j = 0; j < SIZE; j++)
936	<	assertTrue(q.offer(new Integer(j)));
937	<	ArrayList l = new ArrayList();
936	>	mustOffer(q, j);
937	>	ArrayList<Item> l = new ArrayList<>();
938		q.drainTo(l, i);
939		int k = (i < SIZE) ? i : SIZE;
940	<	assertEquals(k, l.size());
941	<	assertEquals(SIZE-k, q.size());
940	>	mustEqual(k, l.size());
941	>	mustEqual(SIZE - k, q.size());
942		for (int j = 0; j < k; ++j)
943	<	assertEquals(l.get(j), new Integer(j));
943	>	mustEqual(l.get(j), j);
944		do {} while (q.poll() != null);
945		}
946		}
#	Line 918 | Line 950 | public class ArrayBlockingQueueTest exte
950		*/
951		public void testNeverContainsNull() {
952		Collection<?>[] qs = {
953	<	new ArrayBlockingQueue<Object>(10),
954	<	populatedQueue(2),
953	>	populatedQueue(0, 1, 10, false),
954	>	populatedQueue(2, 2, 10, true),
955		};
956
957		for (Collection<?> q : qs) {

Diff Legend

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