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.48 by jsr166, Mon May 30 22:43:20 2011 UTC vs.
Revision 1.67 by jsr166, Sun May 24 01:23:17 2015 UTC

#	Line 6 | Line 6
6		* Pat Fisher, Mike Judd.
7		*/
8
9	<	import junit.framework.*;
10	<	import java.util.Arrays;
9	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
10	>
11		import java.util.ArrayList;
12	+	import java.util.Arrays;
13		import java.util.Collection;
14		import java.util.Iterator;
15		import java.util.NoSuchElementException;
16	+	import java.util.Queue;
17		import java.util.concurrent.ArrayBlockingQueue;
18		import java.util.concurrent.BlockingQueue;
19		import java.util.concurrent.CountDownLatch;
20		import java.util.concurrent.Executors;
21		import java.util.concurrent.ExecutorService;
22	<	import static java.util.concurrent.TimeUnit.MILLISECONDS;
23	<	import java.io.*;
22	>
23	>	import junit.framework.Test;
24
25		public class ArrayBlockingQueueTest extends JSR166TestCase {
26
27		public static class Fair extends BlockingQueueTest {
28		protected BlockingQueue emptyCollection() {
29	<	return new ArrayBlockingQueue(20, true);
29	>	return new ArrayBlockingQueue(SIZE, true);
30		}
31		}
32
33		public static class NonFair extends BlockingQueueTest {
34		protected BlockingQueue emptyCollection() {
35	<	return new ArrayBlockingQueue(20, false);
35	>	return new ArrayBlockingQueue(SIZE, false);
36		}
37		}
38
39		public static void main(String[] args) {
40	<	junit.textui.TestRunner.run(suite());
40	>	main(suite(), args);
41		}
42
43		public static Test suite() {
#	Line 45 | Line 47 | public class ArrayBlockingQueueTest exte
47		}
48
49		/**
50	<	* Create a queue of given size containing consecutive
50	>	* Returns a new queue of given size containing consecutive
51		* Integers 0 ... n.
52		*/
53		private ArrayBlockingQueue<Integer> populatedQueue(int n) {
#	Line 102 | Line 104 | public class ArrayBlockingQueueTest exte
104		*/
105		public void testConstructor5() {
106		Integer[] ints = new Integer[SIZE];
107	<	for (int i = 0; i < SIZE-1; ++i)
107	>	for (int i = 0; i < SIZE - 1; ++i)
108		ints[i] = i;
109		Collection<Integer> elements = Arrays.asList(ints);
110		try {
111	<	new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
111	>	new ArrayBlockingQueue(SIZE, false, elements);
112		shouldThrow();
113		} catch (NullPointerException success) {}
114		}
#	Line 157 | Line 159 | public class ArrayBlockingQueueTest exte
159		* remainingCapacity decreases on add, increases on remove
160		*/
161		public void testRemainingCapacity() {
162	<	ArrayBlockingQueue q = populatedQueue(SIZE);
162	>	BlockingQueue q = populatedQueue(SIZE);
163		for (int i = 0; i < SIZE; ++i) {
164		assertEquals(i, q.remainingCapacity());
165	<	assertEquals(SIZE-i, q.size());
166	<	q.remove();
165	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
166	>	assertEquals(i, q.remove());
167		}
168		for (int i = 0; i < SIZE; ++i) {
169	<	assertEquals(SIZE-i, q.remainingCapacity());
170	<	assertEquals(i, q.size());
171	<	q.add(new Integer(i));
169	>	assertEquals(SIZE - i, q.remainingCapacity());
170	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
171	>	assertTrue(q.add(i));
172		}
173		}
174
#	Line 183 | Line 185 | public class ArrayBlockingQueueTest exte
185		* add succeeds if not full; throws ISE if full
186		*/
187		public void testAdd() {
188	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
189	+	for (int i = 0; i < SIZE; ++i) {
190	+	assertTrue(q.add(new Integer(i)));
191	+	}
192	+	assertEquals(0, q.remainingCapacity());
193		try {
187	–	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
188	–	for (int i = 0; i < SIZE; ++i) {
189	–	assertTrue(q.add(new Integer(i)));
190	–	}
191	–	assertEquals(0, q.remainingCapacity());
194		q.add(new Integer(SIZE));
195		shouldThrow();
196		} catch (IllegalStateException success) {}
#	Line 198 | Line 200 | public class ArrayBlockingQueueTest exte
200		* addAll(this) throws IAE
201		*/
202		public void testAddAllSelf() {
203	+	ArrayBlockingQueue q = populatedQueue(SIZE);
204		try {
202	–	ArrayBlockingQueue q = populatedQueue(SIZE);
205		q.addAll(q);
206		shouldThrow();
207		} catch (IllegalArgumentException success) {}
#	Line 210 | Line 212 | public class ArrayBlockingQueueTest exte
212		* possibly adding some elements
213		*/
214		public void testAddAll3() {
215	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
216	+	Integer[] ints = new Integer[SIZE];
217	+	for (int i = 0; i < SIZE - 1; ++i)
218	+	ints[i] = new Integer(i);
219		try {
214	–	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
215	–	Integer[] ints = new Integer[SIZE];
216	–	for (int i = 0; i < SIZE-1; ++i)
217	–	ints[i] = new Integer(i);
220		q.addAll(Arrays.asList(ints));
221		shouldThrow();
222		} catch (NullPointerException success) {}
#	Line 224 | Line 226 | public class ArrayBlockingQueueTest exte
226		* addAll throws ISE if not enough room
227		*/
228		public void testAddAll4() {
229	+	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
230	+	Integer[] ints = new Integer[SIZE];
231	+	for (int i = 0; i < SIZE; ++i)
232	+	ints[i] = new Integer(i);
233		try {
228	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
229	–	Integer[] ints = new Integer[SIZE];
230	–	for (int i = 0; i < SIZE; ++i)
231	–	ints[i] = new Integer(i);
234		q.addAll(Arrays.asList(ints));
235		shouldThrow();
236		} catch (IllegalStateException success) {}
#	Line 255 | Line 257 | public class ArrayBlockingQueueTest exte
257		public void testPut() throws InterruptedException {
258		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
259		for (int i = 0; i < SIZE; ++i) {
260	<	Integer I = new Integer(i);
261	<	q.put(I);
262	<	assertTrue(q.contains(I));
260	>	Integer x = new Integer(i);
261	>	q.put(x);
262	>	assertTrue(q.contains(x));
263		}
264		assertEquals(0, q.remainingCapacity());
265		}
#	Line 322 | Line 324 | public class ArrayBlockingQueueTest exte
324		}});
325
326		await(pleaseTake);
327	<	assertEquals(q.remainingCapacity(), 0);
327	>	assertEquals(0, q.remainingCapacity());
328		assertEquals(0, q.take());
329
330		await(pleaseInterrupt);
331		assertThreadStaysAlive(t);
332		t.interrupt();
333		awaitTermination(t);
334	<	assertEquals(q.remainingCapacity(), 0);
334	>	assertEquals(0, q.remainingCapacity());
335		}
336
337		/**
#	Line 515 | Line 517 | public class ArrayBlockingQueueTest exte
517		}
518
519		/**
518	–	* remove(x) removes x and returns true if present
519	–	*/
520	–	public void testRemoveElement() {
521	–	ArrayBlockingQueue q = populatedQueue(SIZE);
522	–	for (int i = 1; i < SIZE; i+=2) {
523	–	assertTrue(q.remove(new Integer(i)));
524	–	}
525	–	for (int i = 0; i < SIZE; i+=2) {
526	–	assertTrue(q.remove(new Integer(i)));
527	–	assertFalse(q.remove(new Integer(i+1)));
528	–	}
529	–	assertTrue(q.isEmpty());
530	–	}
531	–
532	–	/**
520		* contains(x) reports true when elements added but not yet removed
521		*/
522		public void testContains() {
#	Line 585 | Line 572 | public class ArrayBlockingQueueTest exte
572		assertTrue(changed);
573
574		assertTrue(q.containsAll(p));
575	<	assertEquals(SIZE-i, q.size());
575	>	assertEquals(SIZE - i, q.size());
576		p.remove();
577		}
578		}
#	Line 598 | Line 585 | public class ArrayBlockingQueueTest exte
585		ArrayBlockingQueue q = populatedQueue(SIZE);
586		ArrayBlockingQueue p = populatedQueue(i);
587		assertTrue(q.removeAll(p));
588	<	assertEquals(SIZE-i, q.size());
588	>	assertEquals(SIZE - i, q.size());
589		for (int j = 0; j < i; ++j) {
590	<	Integer I = (Integer)(p.remove());
591	<	assertFalse(q.contains(I));
590	>	Integer x = (Integer)(p.remove());
591	>	assertFalse(q.contains(x));
592		}
593		}
594		}
595
596	+	void checkToArray(ArrayBlockingQueue q) {
597	+	int size = q.size();
598	+	Object[] o = q.toArray();
599	+	assertEquals(size, o.length);
600	+	Iterator it = q.iterator();
601	+	for (int i = 0; i < size; i++) {
602	+	Integer x = (Integer) it.next();
603	+	assertEquals((Integer)o[0] + i, (int) x);
604	+	assertSame(o[i], x);
605	+	}
606	+	}
607	+
608		/**
609	<	* toArray contains all elements in FIFO order
609	>	* toArray() contains all elements in FIFO order
610		*/
611		public void testToArray() {
612	<	ArrayBlockingQueue q = populatedQueue(SIZE);
613	<	Object[] o = q.toArray();
614	<	for (int i = 0; i < o.length; i++)
615	<	assertSame(o[i], q.poll());
612	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
613	>	for (int i = 0; i < SIZE; i++) {
614	>	checkToArray(q);
615	>	q.add(i);
616	>	}
617	>	// Provoke wraparound
618	>	for (int i = 0; i < SIZE; i++) {
619	>	checkToArray(q);
620	>	assertEquals(i, q.poll());
621	>	checkToArray(q);
622	>	q.add(SIZE + i);
623	>	}
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();
644	>	for (int i = 0; i < size; i++) {
645	>	Integer x = (Integer) it.next();
646	>	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<Integer> q = populatedQueue(SIZE);
667	<	Integer[] ints = new Integer[SIZE];
668	<	Integer[] array = q.toArray(ints);
669	<	assertSame(ints, array);
670	<	for (int i = 0; i < ints.length; i++)
671	<	assertSame(ints[i], q.poll());
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());
681	>	}
682		}
683
684		/**
#	Line 645 | Line 698 | public class ArrayBlockingQueueTest exte
698		public void testIterator() throws InterruptedException {
699		ArrayBlockingQueue q = populatedQueue(SIZE);
700		Iterator it = q.iterator();
701	<	while (it.hasNext()) {
701	>	int i;
702	>	for (i = 0; it.hasNext(); i++)
703	>	assertTrue(q.contains(it.next()));
704	>	assertEquals(i, SIZE);
705	>	assertIteratorExhausted(it);
706	>
707	>	it = q.iterator();
708	>	for (i = 0; it.hasNext(); i++)
709		assertEquals(it.next(), q.take());
710	<	}
710	>	assertEquals(i, SIZE);
711	>	assertIteratorExhausted(it);
712	>	}
713	>
714	>	/**
715	>	* iterator of empty collection has no elements
716	>	*/
717	>	public void testEmptyIterator() {
718	>	assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator());
719		}
720
721		/**
#	Line 768 | Line 836 | public class ArrayBlockingQueueTest exte
836		* A deserialized serialized queue has same elements in same order
837		*/
838		public void testSerialization() throws Exception {
839	<	ArrayBlockingQueue q = populatedQueue(SIZE);
839	>	Queue x = populatedQueue(SIZE);
840	>	Queue y = serialClone(x);
841
842	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
843	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
844	<	out.writeObject(q);
845	<	out.close();
846	<
847	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
848	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
849	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
850	<	assertEquals(q.size(), r.size());
782	<	while (!q.isEmpty())
783	<	assertEquals(q.remove(), r.remove());
842	>	assertNotSame(x, y);
843	>	assertEquals(x.size(), y.size());
844	>	assertEquals(x.toString(), y.toString());
845	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
846	>	while (!x.isEmpty()) {
847	>	assertFalse(y.isEmpty());
848	>	assertEquals(x.remove(), y.remove());
849	>	}
850	>	assertTrue(y.isEmpty());
851		}
852
853		/**
#	Line 790 | Line 857 | public class ArrayBlockingQueueTest exte
857		ArrayBlockingQueue q = populatedQueue(SIZE);
858		ArrayList l = new ArrayList();
859		q.drainTo(l);
860	<	assertEquals(q.size(), 0);
861	<	assertEquals(l.size(), SIZE);
860	>	assertEquals(0, q.size());
861	>	assertEquals(SIZE, l.size());
862		for (int i = 0; i < SIZE; ++i)
863		assertEquals(l.get(i), new Integer(i));
864		q.add(zero);
#	Line 801 | Line 868 | public class ArrayBlockingQueueTest exte
868		assertTrue(q.contains(one));
869		l.clear();
870		q.drainTo(l);
871	<	assertEquals(q.size(), 0);
872	<	assertEquals(l.size(), 2);
871	>	assertEquals(0, q.size());
872	>	assertEquals(2, l.size());
873		for (int i = 0; i < 2; ++i)
874		assertEquals(l.get(i), new Integer(i));
875		}
#	Line 814 | Line 881 | public class ArrayBlockingQueueTest exte
881		final ArrayBlockingQueue q = populatedQueue(SIZE);
882		Thread t = new Thread(new CheckedRunnable() {
883		public void realRun() throws InterruptedException {
884	<	q.put(new Integer(SIZE+1));
884	>	q.put(new Integer(SIZE + 1));
885		}});
886
887		t.start();
#	Line 831 | Line 898 | public class ArrayBlockingQueueTest exte
898		* drainTo(c, n) empties first min(n, size) elements of queue into c
899		*/
900		public void testDrainToN() {
901	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
901	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE * 2);
902		for (int i = 0; i < SIZE + 2; ++i) {
903		for (int j = 0; j < SIZE; j++)
904		assertTrue(q.offer(new Integer(j)));
905		ArrayList l = new ArrayList();
906		q.drainTo(l, i);
907		int k = (i < SIZE) ? i : SIZE;
908	<	assertEquals(l.size(), k);
909	<	assertEquals(q.size(), SIZE-k);
908	>	assertEquals(k, l.size());
909	>	assertEquals(SIZE - k, q.size());
910		for (int j = 0; j < k; ++j)
911		assertEquals(l.get(j), new Integer(j));
912	<	while (q.poll() != null) ;
912	>	do {} while (q.poll() != null);
913		}
914		}
915
916	+	/**
917	+	* remove(null), contains(null) always return false
918	+	*/
919	+	public void testNeverContainsNull() {
920	+	Collection<?>[] qs = {
921	+	new ArrayBlockingQueue<Object>(10),
922	+	populatedQueue(2),
923	+	};
924	+
925	+	for (Collection<?> q : qs) {
926	+	assertFalse(q.contains(null));
927	+	assertFalse(q.remove(null));
928	+	}
929	+	}
930		}

Diff Legend

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