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.47 by jsr166, Fri May 27 20:07:24 2011 UTC vs.
Revision 1.57 by jsr166, Sun Nov 23 22:27:06 2014 UTC

#	Line 7 | Line 7
7		*/
8
9		import junit.framework.*;
10	<	import java.util.*;
11	<	import java.util.concurrent.*;
10	>	import java.util.Arrays;
11	>	import java.util.ArrayList;
12	>	import java.util.Collection;
13	>	import java.util.Iterator;
14	>	import java.util.NoSuchElementException;
15	>	import java.util.Queue;
16	>	import java.util.concurrent.ArrayBlockingQueue;
17	>	import java.util.concurrent.BlockingQueue;
18	>	import java.util.concurrent.CountDownLatch;
19	>	import java.util.concurrent.Executors;
20	>	import java.util.concurrent.ExecutorService;
21		import static java.util.concurrent.TimeUnit.MILLISECONDS;
13	–	import java.io.*;
22
23		public class ArrayBlockingQueueTest extends JSR166TestCase {
24
25		public static class Fair extends BlockingQueueTest {
26		protected BlockingQueue emptyCollection() {
27	<	return new ArrayBlockingQueue(20, true);
27	>	return new ArrayBlockingQueue(SIZE, true);
28		}
29		}
30
31		public static class NonFair extends BlockingQueueTest {
32		protected BlockingQueue emptyCollection() {
33	<	return new ArrayBlockingQueue(20, false);
33	>	return new ArrayBlockingQueue(SIZE, false);
34		}
35		}
36
#	Line 37 | Line 45 | public class ArrayBlockingQueueTest exte
45		}
46
47		/**
48	<	* Create a queue of given size containing consecutive
48	>	* Returns a new queue of given size containing consecutive
49		* Integers 0 ... n.
50		*/
51		private ArrayBlockingQueue<Integer> populatedQueue(int n) {
#	Line 63 | Line 71 | public class ArrayBlockingQueueTest exte
71		*/
72		public void testConstructor2() {
73		try {
74	<	ArrayBlockingQueue q = new ArrayBlockingQueue(0);
74	>	new ArrayBlockingQueue(0);
75		shouldThrow();
76		} catch (IllegalArgumentException success) {}
77		}
#	Line 73 | Line 81 | public class ArrayBlockingQueueTest exte
81		*/
82		public void testConstructor3() {
83		try {
84	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null);
84	>	new ArrayBlockingQueue(1, true, null);
85		shouldThrow();
86		} catch (NullPointerException success) {}
87		}
#	Line 82 | Line 90 | public class ArrayBlockingQueueTest exte
90		* Initializing from Collection of null elements throws NPE
91		*/
92		public void testConstructor4() {
93	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
94		try {
95	<	Integer[] ints = new Integer[SIZE];
87	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
95	>	new ArrayBlockingQueue(SIZE, false, elements);
96		shouldThrow();
97		} catch (NullPointerException success) {}
98		}
#	Line 93 | Line 101 | public class ArrayBlockingQueueTest exte
101		* Initializing from Collection with some null elements throws NPE
102		*/
103		public void testConstructor5() {
104	+	Integer[] ints = new Integer[SIZE];
105	+	for (int i = 0; i < SIZE-1; ++i)
106	+	ints[i] = i;
107	+	Collection<Integer> elements = Arrays.asList(ints);
108		try {
109	<	Integer[] ints = new Integer[SIZE];
98	<	for (int i = 0; i < SIZE-1; ++i)
99	<	ints[i] = new Integer(i);
100	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
109	>	new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
110		shouldThrow();
111		} catch (NullPointerException success) {}
112		}
#	Line 106 | Line 115 | public class ArrayBlockingQueueTest exte
115		* Initializing from too large collection throws IAE
116		*/
117		public void testConstructor6() {
118	+	Integer[] ints = new Integer[SIZE];
119	+	for (int i = 0; i < SIZE; ++i)
120	+	ints[i] = i;
121	+	Collection<Integer> elements = Arrays.asList(ints);
122		try {
123	<	Integer[] ints = new Integer[SIZE];
111	<	for (int i = 0; i < SIZE; ++i)
112	<	ints[i] = new Integer(i);
113	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints));
123	>	new ArrayBlockingQueue(SIZE - 1, false, elements);
124		shouldThrow();
125		} catch (IllegalArgumentException success) {}
126		}
#	Line 121 | Line 131 | public class ArrayBlockingQueueTest exte
131		public void testConstructor7() {
132		Integer[] ints = new Integer[SIZE];
133		for (int i = 0; i < SIZE; ++i)
134	<	ints[i] = new Integer(i);
135	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints));
134	>	ints[i] = i;
135	>	Collection<Integer> elements = Arrays.asList(ints);
136	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements);
137		for (int i = 0; i < SIZE; ++i)
138		assertEquals(ints[i], q.poll());
139		}
#	Line 160 | Line 171 | public class ArrayBlockingQueueTest exte
171		}
172
173		/**
163	–	* offer(null) throws NPE
164	–	*/
165	–	public void testOfferNull() {
166	–	try {
167	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
168	–	q.offer(null);
169	–	shouldThrow();
170	–	} catch (NullPointerException success) {}
171	–	}
172	–
173	–	/**
174	–	* add(null) throws NPE
175	–	*/
176	–	public void testAddNull() {
177	–	try {
178	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
179	–	q.add(null);
180	–	shouldThrow();
181	–	} catch (NullPointerException success) {}
182	–	}
183	–
184	–	/**
174		* Offer succeeds if not full; fails if full
175		*/
176		public void testOffer() {
#	Line 206 | Line 195 | public class ArrayBlockingQueueTest exte
195		}
196
197		/**
209	–	* addAll(null) throws NPE
210	–	*/
211	–	public void testAddAll1() {
212	–	try {
213	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
214	–	q.addAll(null);
215	–	shouldThrow();
216	–	} catch (NullPointerException success) {}
217	–	}
218	–
219	–	/**
198		* addAll(this) throws IAE
199		*/
200		public void testAddAllSelf() {
#	Line 228 | Line 206 | public class ArrayBlockingQueueTest exte
206		}
207
208		/**
231	–	* addAll of a collection with null elements throws NPE
232	–	*/
233	–	public void testAddAll2() {
234	–	try {
235	–	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
236	–	Integer[] ints = new Integer[SIZE];
237	–	q.addAll(Arrays.asList(ints));
238	–	shouldThrow();
239	–	} catch (NullPointerException success) {}
240	–	}
241	–
242	–	/**
209		* addAll of a collection with any null elements throws NPE after
210		* possibly adding some elements
211		*/
#	Line 284 | Line 250 | public class ArrayBlockingQueueTest exte
250		}
251
252		/**
287	–	* put(null) throws NPE
288	–	*/
289	–	public void testPutNull() throws InterruptedException {
290	–	try {
291	–	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
292	–	q.put(null);
293	–	shouldThrow();
294	–	} catch (NullPointerException success) {}
295	–	}
296	–
297	–	/**
253		* all elements successfully put are contained
254		*/
255		public void testPut() throws InterruptedException {
#	Line 367 | Line 322 | public class ArrayBlockingQueueTest exte
322		}});
323
324		await(pleaseTake);
325	<	assertEquals(q.remainingCapacity(), 0);
325	>	assertEquals(0, q.remainingCapacity());
326		assertEquals(0, q.take());
327
328		await(pleaseInterrupt);
329		assertThreadStaysAlive(t);
330		t.interrupt();
331		awaitTermination(t);
332	<	assertEquals(q.remainingCapacity(), 0);
332	>	assertEquals(0, q.remainingCapacity());
333		}
334
335		/**
#	Line 560 | Line 515 | public class ArrayBlockingQueueTest exte
515		}
516
517		/**
563	–	* remove(x) removes x and returns true if present
564	–	*/
565	–	public void testRemoveElement() {
566	–	ArrayBlockingQueue q = populatedQueue(SIZE);
567	–	for (int i = 1; i < SIZE; i+=2) {
568	–	assertTrue(q.remove(new Integer(i)));
569	–	}
570	–	for (int i = 0; i < SIZE; i+=2) {
571	–	assertTrue(q.remove(new Integer(i)));
572	–	assertFalse(q.remove(new Integer(i+1)));
573	–	}
574	–	assertTrue(q.isEmpty());
575	–	}
576	–
577	–	/**
518		* contains(x) reports true when elements added but not yet removed
519		*/
520		public void testContains() {
#	Line 651 | Line 591 | public class ArrayBlockingQueueTest exte
591		}
592		}
593
594	<	/**
595	<	* toArray contains all elements in FIFO order
656	<	*/
657	<	public void testToArray() {
658	<	ArrayBlockingQueue q = populatedQueue(SIZE);
594	>	void checkToArray(ArrayBlockingQueue q) {
595	>	int size = q.size();
596		Object[] o = q.toArray();
597	<	for (int i = 0; i < o.length; i++)
598	<	assertSame(o[i], q.poll());
597	>	assertEquals(size, o.length);
598	>	Iterator it = q.iterator();
599	>	for (int i = 0; i < size; i++) {
600	>	Integer x = (Integer) it.next();
601	>	assertEquals((Integer)o[0] + i, (int) x);
602	>	assertSame(o[i], x);
603	>	}
604		}
605
606		/**
607	<	* toArray(a) contains all elements in FIFO order
607	>	* toArray() contains all elements in FIFO order
608		*/
609	<	public void testToArray2() {
610	<	ArrayBlockingQueue<Integer> q = populatedQueue(SIZE);
611	<	Integer[] ints = new Integer[SIZE];
612	<	Integer[] array = q.toArray(ints);
613	<	assertSame(ints, array);
614	<	for (int i = 0; i < ints.length; i++)
615	<	assertSame(ints[i], q.poll());
609	>	public void testToArray() {
610	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
611	>	for (int i = 0; i < SIZE; i++) {
612	>	checkToArray(q);
613	>	q.add(i);
614	>	}
615	>	// Provoke wraparound
616	>	for (int i = 0; i < SIZE; i++) {
617	>	checkToArray(q);
618	>	assertEquals(i, q.poll());
619	>	checkToArray(q);
620	>	q.add(SIZE+i);
621	>	}
622	>	for (int i = 0; i < SIZE; i++) {
623	>	checkToArray(q);
624	>	assertEquals(SIZE+i, q.poll());
625	>	}
626	>	}
627	>
628	>	void checkToArray2(ArrayBlockingQueue q) {
629	>	int size = q.size();
630	>	Integer[] a1 = size == 0 ? null : new Integer[size-1];
631	>	Integer[] a2 = new Integer[size];
632	>	Integer[] a3 = new Integer[size+2];
633	>	if (size > 0) Arrays.fill(a1, 42);
634	>	Arrays.fill(a2, 42);
635	>	Arrays.fill(a3, 42);
636	>	Integer[] b1 = size == 0 ? null : (Integer[]) q.toArray(a1);
637	>	Integer[] b2 = (Integer[]) q.toArray(a2);
638	>	Integer[] b3 = (Integer[]) q.toArray(a3);
639	>	assertSame(a2, b2);
640	>	assertSame(a3, b3);
641	>	Iterator it = q.iterator();
642	>	for (int i = 0; i < size; i++) {
643	>	Integer x = (Integer) it.next();
644	>	assertSame(b1[i], x);
645	>	assertEquals(b1[0] + i, (int) x);
646	>	assertSame(b2[i], x);
647	>	assertSame(b3[i], x);
648	>	}
649	>	assertNull(a3[size]);
650	>	assertEquals(42, (int) a3[size+1]);
651	>	if (size > 0) {
652	>	assertNotSame(a1, b1);
653	>	assertEquals(size, b1.length);
654	>	for (int i = 0; i < a1.length; i++) {
655	>	assertEquals(42, (int) a1[i]);
656	>	}
657	>	}
658		}
659
660		/**
661	<	* toArray(null) throws NullPointerException
661	>	* toArray(a) contains all elements in FIFO order
662		*/
663	<	public void testToArray_NullArg() {
664	<	ArrayBlockingQueue q = populatedQueue(SIZE);
665	<	try {
666	<	q.toArray(null);
667	<	shouldThrow();
668	<	} catch (NullPointerException success) {}
663	>	public void testToArray2() {
664	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
665	>	for (int i = 0; i < SIZE; i++) {
666	>	checkToArray2(q);
667	>	q.add(i);
668	>	}
669	>	// Provoke wraparound
670	>	for (int i = 0; i < SIZE; i++) {
671	>	checkToArray2(q);
672	>	assertEquals(i, q.poll());
673	>	checkToArray2(q);
674	>	q.add(SIZE+i);
675	>	}
676	>	for (int i = 0; i < SIZE; i++) {
677	>	checkToArray2(q);
678	>	assertEquals(SIZE+i, q.poll());
679	>	}
680		}
681
682		/**
#	Line 824 | Line 819 | public class ArrayBlockingQueueTest exte
819		* A deserialized serialized queue has same elements in same order
820		*/
821		public void testSerialization() throws Exception {
822	<	ArrayBlockingQueue q = populatedQueue(SIZE);
823	<
829	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
830	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
831	<	out.writeObject(q);
832	<	out.close();
833	<
834	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
835	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
836	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
837	<	assertEquals(q.size(), r.size());
838	<	while (!q.isEmpty())
839	<	assertEquals(q.remove(), r.remove());
840	<	}
841	<
842	<	/**
843	<	* drainTo(null) throws NPE
844	<	*/
845	<	public void testDrainToNull() {
846	<	ArrayBlockingQueue q = populatedQueue(SIZE);
847	<	try {
848	<	q.drainTo(null);
849	<	shouldThrow();
850	<	} catch (NullPointerException success) {}
851	<	}
822	>	Queue x = populatedQueue(SIZE);
823	>	Queue y = serialClone(x);
824
825	<	/**
826	<	* drainTo(this) throws IAE
827	<	*/
828	<	public void testDrainToSelf() {
829	<	ArrayBlockingQueue q = populatedQueue(SIZE);
830	<	try {
831	<	q.drainTo(q);
832	<	shouldThrow();
833	<	} catch (IllegalArgumentException success) {}
825	>	assertNotSame(x, y);
826	>	assertEquals(x.size(), y.size());
827	>	assertEquals(x.toString(), y.toString());
828	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
829	>	while (!x.isEmpty()) {
830	>	assertFalse(y.isEmpty());
831	>	assertEquals(x.remove(), y.remove());
832	>	}
833	>	assertTrue(y.isEmpty());
834		}
835
836		/**
#	Line 868 | Line 840 | public class ArrayBlockingQueueTest exte
840		ArrayBlockingQueue q = populatedQueue(SIZE);
841		ArrayList l = new ArrayList();
842		q.drainTo(l);
843	<	assertEquals(q.size(), 0);
844	<	assertEquals(l.size(), SIZE);
843	>	assertEquals(0, q.size());
844	>	assertEquals(SIZE, l.size());
845		for (int i = 0; i < SIZE; ++i)
846		assertEquals(l.get(i), new Integer(i));
847		q.add(zero);
#	Line 879 | Line 851 | public class ArrayBlockingQueueTest exte
851		assertTrue(q.contains(one));
852		l.clear();
853		q.drainTo(l);
854	<	assertEquals(q.size(), 0);
855	<	assertEquals(l.size(), 2);
854	>	assertEquals(0, q.size());
855	>	assertEquals(2, l.size());
856		for (int i = 0; i < 2; ++i)
857		assertEquals(l.get(i), new Integer(i));
858		}
#	Line 906 | Line 878 | public class ArrayBlockingQueueTest exte
878		}
879
880		/**
909	–	* drainTo(null, n) throws NPE
910	–	*/
911	–	public void testDrainToNullN() {
912	–	ArrayBlockingQueue q = populatedQueue(SIZE);
913	–	try {
914	–	q.drainTo(null, 0);
915	–	shouldThrow();
916	–	} catch (NullPointerException success) {}
917	–	}
918	–
919	–	/**
920	–	* drainTo(this, n) throws IAE
921	–	*/
922	–	public void testDrainToSelfN() {
923	–	ArrayBlockingQueue q = populatedQueue(SIZE);
924	–	try {
925	–	q.drainTo(q, 0);
926	–	shouldThrow();
927	–	} catch (IllegalArgumentException success) {}
928	–	}
929	–
930	–	/**
881		* drainTo(c, n) empties first min(n, size) elements of queue into c
882		*/
883		public void testDrainToN() {
#	Line 938 | Line 888 | public class ArrayBlockingQueueTest exte
888		ArrayList l = new ArrayList();
889		q.drainTo(l, i);
890		int k = (i < SIZE) ? i : SIZE;
891	<	assertEquals(l.size(), k);
892	<	assertEquals(q.size(), SIZE-k);
891	>	assertEquals(k, l.size());
892	>	assertEquals(SIZE-k, q.size());
893		for (int j = 0; j < k; ++j)
894		assertEquals(l.get(j), new Integer(j));
895		while (q.poll() != null) ;
896		}
897		}
898
899	+	/**
900	+	* remove(null), contains(null) always return false
901	+	*/
902	+	public void testNeverContainsNull() {
903	+	Collection<?>[] qs = {
904	+	new ArrayBlockingQueue<Object>(10),
905	+	populatedQueue(2),
906	+	};
907	+
908	+	for (Collection<?> q : qs) {
909	+	assertFalse(q.contains(null));
910	+	assertFalse(q.remove(null));
911	+	}
912	+	}
913		}

Diff Legend

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