ViewVC Help

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

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

Comparing jsr166/src/test/tck/LinkedBlockingDequeTest.java (file contents):
Revision 1.43 by jsr166, Tue Oct 25 20:29:12 2011 UTC vs.
Revision 1.60 by jsr166, Sun May 24 01:42:14 2015 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 static java.util.concurrent.TimeUnit.MILLISECONDS;
8	>
9		import java.util.ArrayList;
10	+	import java.util.Arrays;
11		import java.util.Collection;
12	+	import java.util.Deque;
13		import java.util.Iterator;
14		import java.util.NoSuchElementException;
15		import java.util.Queue;
#	Line 17 | Line 19 | import java.util.concurrent.CountDownLat
19		import java.util.concurrent.Executors;
20		import java.util.concurrent.ExecutorService;
21		import java.util.concurrent.LinkedBlockingDeque;
22	<	import static java.util.concurrent.TimeUnit.MILLISECONDS;
22	>
23	>	import junit.framework.Test;
24
25		public class LinkedBlockingDequeTest extends JSR166TestCase {
26
#	Line 34 | Line 37 | public class LinkedBlockingDequeTest ext
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 44 | Line 47 | public class LinkedBlockingDequeTest ext
47		}
48
49		/**
50	<	* Create a deque of given size containing consecutive
50	>	* Returns a new deque of given size containing consecutive
51		* Integers 0 ... n.
52		*/
53		private LinkedBlockingDeque<Integer> populatedDeque(int n) {
#	Line 79 | Line 82 | public class LinkedBlockingDequeTest ext
82		public void testSize() {
83		LinkedBlockingDeque q = populatedDeque(SIZE);
84		for (int i = 0; i < SIZE; ++i) {
85	<	assertEquals(SIZE-i, q.size());
85	>	assertEquals(SIZE - i, q.size());
86		q.removeFirst();
87		}
88		for (int i = 0; i < SIZE; ++i) {
#	Line 144 | Line 147 | public class LinkedBlockingDequeTest ext
147		*/
148		public void testPollLast() {
149		LinkedBlockingDeque q = populatedDeque(SIZE);
150	<	for (int i = SIZE-1; i >= 0; --i) {
150	>	for (int i = SIZE - 1; i >= 0; --i) {
151		assertEquals(i, q.pollLast());
152		}
153		assertNull(q.pollLast());
#	Line 183 | Line 186 | public class LinkedBlockingDequeTest ext
186		*/
187		public void testPeekLast() {
188		LinkedBlockingDeque q = populatedDeque(SIZE);
189	<	for (int i = SIZE-1; i >= 0; --i) {
189	>	for (int i = SIZE - 1; i >= 0; --i) {
190		assertEquals(i, q.peekLast());
191		assertEquals(i, q.pollLast());
192		assertTrue(q.peekLast() == null ||
#	Line 213 | Line 216 | public class LinkedBlockingDequeTest ext
216		*/
217		public void testLastElement() {
218		LinkedBlockingDeque q = populatedDeque(SIZE);
219	<	for (int i = SIZE-1; i >= 0; --i) {
219	>	for (int i = SIZE - 1; i >= 0; --i) {
220		assertEquals(i, q.getLast());
221		assertEquals(i, q.pollLast());
222		}
#	Line 273 | Line 276 | public class LinkedBlockingDequeTest ext
276		*/
277		public void testRemoveFirstOccurrence() {
278		LinkedBlockingDeque q = populatedDeque(SIZE);
279	<	for (int i = 1; i < SIZE; i+=2) {
279	>	for (int i = 1; i < SIZE; i += 2) {
280		assertTrue(q.removeFirstOccurrence(new Integer(i)));
281		}
282	<	for (int i = 0; i < SIZE; i+=2) {
282	>	for (int i = 0; i < SIZE; i += 2) {
283		assertTrue(q.removeFirstOccurrence(new Integer(i)));
284	<	assertFalse(q.removeFirstOccurrence(new Integer(i+1)));
284	>	assertFalse(q.removeFirstOccurrence(new Integer(i + 1)));
285		}
286		assertTrue(q.isEmpty());
287		}
#	Line 288 | Line 291 | public class LinkedBlockingDequeTest ext
291		*/
292		public void testRemoveLastOccurrence() {
293		LinkedBlockingDeque q = populatedDeque(SIZE);
294	<	for (int i = 1; i < SIZE; i+=2) {
294	>	for (int i = 1; i < SIZE; i += 2) {
295		assertTrue(q.removeLastOccurrence(new Integer(i)));
296		}
297	<	for (int i = 0; i < SIZE; i+=2) {
297	>	for (int i = 0; i < SIZE; i += 2) {
298		assertTrue(q.removeLastOccurrence(new Integer(i)));
299	<	assertFalse(q.removeLastOccurrence(new Integer(i+1)));
299	>	assertFalse(q.removeLastOccurrence(new Integer(i + 1)));
300		}
301		assertTrue(q.isEmpty());
302		}
#	Line 364 | Line 367 | public class LinkedBlockingDequeTest ext
367		*/
368		public void testConstructor5() {
369		Integer[] ints = new Integer[SIZE];
370	<	for (int i = 0; i < SIZE-1; ++i)
370	>	for (int i = 0; i < SIZE - 1; ++i)
371		ints[i] = i;
372		Collection<Integer> elements = Arrays.asList(ints);
373		try {
#	Line 404 | Line 407 | public class LinkedBlockingDequeTest ext
407		* remainingCapacity decreases on add, increases on remove
408		*/
409		public void testRemainingCapacity() {
410	<	LinkedBlockingDeque q = populatedDeque(SIZE);
410	>	BlockingQueue q = populatedDeque(SIZE);
411		for (int i = 0; i < SIZE; ++i) {
412		assertEquals(i, q.remainingCapacity());
413	<	assertEquals(SIZE-i, q.size());
414	<	q.remove();
413	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
414	>	assertEquals(i, q.remove());
415		}
416		for (int i = 0; i < SIZE; ++i) {
417	<	assertEquals(SIZE-i, q.remainingCapacity());
418	<	assertEquals(i, q.size());
419	<	q.add(new Integer(i));
417	>	assertEquals(SIZE - i, q.remainingCapacity());
418	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
419	>	assertTrue(q.add(i));
420		}
421		}
422
#	Line 421 | Line 424 | public class LinkedBlockingDequeTest ext
424		* push(null) throws NPE
425		*/
426		public void testPushNull() {
427	+	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
428		try {
425	–	LinkedBlockingDeque q = new LinkedBlockingDeque(1);
429		q.push(null);
430		shouldThrow();
431		} catch (NullPointerException success) {}
#	Line 432 | Line 435 | public class LinkedBlockingDequeTest ext
435		* push succeeds if not full; throws ISE if full
436		*/
437		public void testPush() {
438	+	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
439	+	for (int i = 0; i < SIZE; ++i) {
440	+	Integer x = new Integer(i);
441	+	q.push(x);
442	+	assertEquals(x, q.peek());
443	+	}
444	+	assertEquals(0, q.remainingCapacity());
445		try {
436	–	LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
437	–	for (int i = 0; i < SIZE; ++i) {
438	–	Integer I = new Integer(i);
439	–	q.push(I);
440	–	assertEquals(I, q.peek());
441	–	}
442	–	assertEquals(0, q.remainingCapacity());
446		q.push(new Integer(SIZE));
447		shouldThrow();
448		} catch (IllegalStateException success) {}
#	Line 510 | Line 513 | public class LinkedBlockingDequeTest ext
513		public void testAddAll3() {
514		LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
515		Integer[] ints = new Integer[SIZE];
516	<	for (int i = 0; i < SIZE-1; ++i)
516	>	for (int i = 0; i < SIZE - 1; ++i)
517		ints[i] = new Integer(i);
518		Collection<Integer> elements = Arrays.asList(ints);
519		try {
#	Line 555 | Line 558 | public class LinkedBlockingDequeTest ext
558		public void testPut() throws InterruptedException {
559		LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
560		for (int i = 0; i < SIZE; ++i) {
561	<	Integer I = new Integer(i);
562	<	q.put(I);
563	<	assertTrue(q.contains(I));
561	>	Integer x = new Integer(i);
562	>	q.put(x);
563	>	assertTrue(q.contains(x));
564		}
565		assertEquals(0, q.remainingCapacity());
566		}
#	Line 622 | Line 625 | public class LinkedBlockingDequeTest ext
625		}});
626
627		await(pleaseTake);
628	<	assertEquals(q.remainingCapacity(), 0);
628	>	assertEquals(0, q.remainingCapacity());
629		assertEquals(0, q.take());
630
631		await(pleaseInterrupt);
632		assertThreadStaysAlive(t);
633		t.interrupt();
634		awaitTermination(t);
635	<	assertEquals(q.remainingCapacity(), 0);
635	>	assertEquals(0, q.remainingCapacity());
636		}
637
638		/**
#	Line 787 | Line 790 | public class LinkedBlockingDequeTest ext
790		public void testPutFirst() throws InterruptedException {
791		LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
792		for (int i = 0; i < SIZE; ++i) {
793	<	Integer I = new Integer(i);
794	<	q.putFirst(I);
795	<	assertTrue(q.contains(I));
793	>	Integer x = new Integer(i);
794	>	q.putFirst(x);
795	>	assertTrue(q.contains(x));
796		}
797		assertEquals(0, q.remainingCapacity());
798		}
#	Line 854 | Line 857 | public class LinkedBlockingDequeTest ext
857		}});
858
859		await(pleaseTake);
860	<	assertEquals(q.remainingCapacity(), 0);
860	>	assertEquals(0, q.remainingCapacity());
861		assertEquals(capacity - 1, q.take());
862
863		await(pleaseInterrupt);
864		assertThreadStaysAlive(t);
865		t.interrupt();
866		awaitTermination(t);
867	<	assertEquals(q.remainingCapacity(), 0);
867	>	assertEquals(0, q.remainingCapacity());
868		}
869
870		/**
#	Line 1064 | Line 1067 | public class LinkedBlockingDequeTest ext
1067
1068		pleaseInterrupt.countDown();
1069		try {
1070	<	q.pollFirst(SMALL_DELAY_MS, MILLISECONDS);
1070	>	q.pollFirst(LONG_DELAY_MS, MILLISECONDS);
1071		shouldThrow();
1072		} catch (InterruptedException success) {}
1073		assertFalse(Thread.interrupted());
#	Line 1134 | Line 1137 | public class LinkedBlockingDequeTest ext
1137		public void testPutLast() throws InterruptedException {
1138		LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE);
1139		for (int i = 0; i < SIZE; ++i) {
1140	<	Integer I = new Integer(i);
1141	<	q.putLast(I);
1142	<	assertTrue(q.contains(I));
1140	>	Integer x = new Integer(i);
1141	>	q.putLast(x);
1142	>	assertTrue(q.contains(x));
1143		}
1144		assertEquals(0, q.remainingCapacity());
1145		}
#	Line 1201 | Line 1204 | public class LinkedBlockingDequeTest ext
1204		}});
1205
1206		await(pleaseTake);
1207	<	assertEquals(q.remainingCapacity(), 0);
1207	>	assertEquals(0, q.remainingCapacity());
1208		assertEquals(0, q.take());
1209
1210		await(pleaseInterrupt);
1211		assertThreadStaysAlive(t);
1212		t.interrupt();
1213		awaitTermination(t);
1214	<	assertEquals(q.remainingCapacity(), 0);
1214	>	assertEquals(0, q.remainingCapacity());
1215		}
1216
1217		/**
#	Line 1243 | Line 1246 | public class LinkedBlockingDequeTest ext
1246		public void testTakeLast() throws InterruptedException {
1247		LinkedBlockingDeque q = populatedDeque(SIZE);
1248		for (int i = 0; i < SIZE; ++i) {
1249	<	assertEquals(SIZE-i-1, q.takeLast());
1249	>	assertEquals(SIZE - i - 1, q.takeLast());
1250		}
1251		}
1252
#	Line 1256 | Line 1259 | public class LinkedBlockingDequeTest ext
1259		Thread t = newStartedThread(new CheckedRunnable() {
1260		public void realRun() throws InterruptedException {
1261		for (int i = 0; i < SIZE; ++i) {
1262	<	assertEquals(SIZE-i-1, q.takeLast());
1262	>	assertEquals(SIZE - i - 1, q.takeLast());
1263		}
1264
1265		Thread.currentThread().interrupt();
#	Line 1286 | Line 1289 | public class LinkedBlockingDequeTest ext
1289		public void testTimedPollLast0() throws InterruptedException {
1290		LinkedBlockingDeque q = populatedDeque(SIZE);
1291		for (int i = 0; i < SIZE; ++i) {
1292	<	assertEquals(SIZE-i-1, q.pollLast(0, MILLISECONDS));
1292	>	assertEquals(SIZE - i - 1, q.pollLast(0, MILLISECONDS));
1293		}
1294		assertNull(q.pollLast(0, MILLISECONDS));
1295		}
#	Line 1298 | Line 1301 | public class LinkedBlockingDequeTest ext
1301		LinkedBlockingDeque q = populatedDeque(SIZE);
1302		for (int i = 0; i < SIZE; ++i) {
1303		long startTime = System.nanoTime();
1304	<	assertEquals(SIZE-i-1, q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1304	>	assertEquals(SIZE - i - 1, q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1305		assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
1306		}
1307		long startTime = System.nanoTime();
#	Line 1317 | Line 1320 | public class LinkedBlockingDequeTest ext
1320		public void realRun() throws InterruptedException {
1321		LinkedBlockingDeque q = populatedDeque(SIZE);
1322		for (int i = 0; i < SIZE; ++i) {
1323	<	assertEquals(SIZE-i-1, q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1323	>	assertEquals(SIZE - i - 1,
1324	>	q.pollLast(LONG_DELAY_MS, MILLISECONDS));
1325		}
1326
1327		Thread.currentThread().interrupt();
#	Line 1455 | Line 1459 | public class LinkedBlockingDequeTest ext
1459		assertTrue(changed);
1460
1461		assertTrue(q.containsAll(p));
1462	<	assertEquals(SIZE-i, q.size());
1462	>	assertEquals(SIZE - i, q.size());
1463		p.remove();
1464		}
1465		}
#	Line 1468 | Line 1472 | public class LinkedBlockingDequeTest ext
1472		LinkedBlockingDeque q = populatedDeque(SIZE);
1473		LinkedBlockingDeque p = populatedDeque(i);
1474		assertTrue(q.removeAll(p));
1475	<	assertEquals(SIZE-i, q.size());
1475	>	assertEquals(SIZE - i, q.size());
1476		for (int j = 0; j < i; ++j) {
1477	<	Integer I = (Integer)(p.remove());
1478	<	assertFalse(q.contains(I));
1477	>	Integer x = (Integer)(p.remove());
1478	>	assertFalse(q.contains(x));
1479		}
1480		}
1481		}
#	Line 1515 | Line 1519 | public class LinkedBlockingDequeTest ext
1519		public void testIterator() throws InterruptedException {
1520		LinkedBlockingDeque q = populatedDeque(SIZE);
1521		Iterator it = q.iterator();
1522	<	while (it.hasNext()) {
1522	>	int i;
1523	>	for (i = 0; it.hasNext(); i++)
1524	>	assertTrue(q.contains(it.next()));
1525	>	assertEquals(i, SIZE);
1526	>	assertIteratorExhausted(it);
1527	>
1528	>	it = q.iterator();
1529	>	for (i = 0; it.hasNext(); i++)
1530		assertEquals(it.next(), q.take());
1531	<	}
1531	>	assertEquals(i, SIZE);
1532	>	assertIteratorExhausted(it);
1533	>	}
1534	>
1535	>	/**
1536	>	* iterator of empty collection has no elements
1537	>	*/
1538	>	public void testEmptyIterator() {
1539	>	Deque c = new LinkedBlockingDeque();
1540	>	assertIteratorExhausted(c.iterator());
1541	>	assertIteratorExhausted(c.descendingIterator());
1542		}
1543
1544		/**
#	Line 1700 | Line 1721 | public class LinkedBlockingDequeTest ext
1721		Queue x = populatedDeque(SIZE);
1722		Queue y = serialClone(x);
1723
1724	<	assertTrue(x != y);
1724	>	assertNotSame(y, x);
1725		assertEquals(x.size(), y.size());
1726		assertEquals(x.toString(), y.toString());
1727		assertTrue(Arrays.equals(x.toArray(), y.toArray()));
#	Line 1718 | Line 1739 | public class LinkedBlockingDequeTest ext
1739		LinkedBlockingDeque q = populatedDeque(SIZE);
1740		ArrayList l = new ArrayList();
1741		q.drainTo(l);
1742	<	assertEquals(q.size(), 0);
1743	<	assertEquals(l.size(), SIZE);
1742	>	assertEquals(0, q.size());
1743	>	assertEquals(SIZE, l.size());
1744		for (int i = 0; i < SIZE; ++i)
1745		assertEquals(l.get(i), new Integer(i));
1746		q.add(zero);
#	Line 1729 | Line 1750 | public class LinkedBlockingDequeTest ext
1750		assertTrue(q.contains(one));
1751		l.clear();
1752		q.drainTo(l);
1753	<	assertEquals(q.size(), 0);
1754	<	assertEquals(l.size(), 2);
1753	>	assertEquals(0, q.size());
1754	>	assertEquals(2, l.size());
1755		for (int i = 0; i < 2; ++i)
1756		assertEquals(l.get(i), new Integer(i));
1757		}
#	Line 1742 | Line 1763 | public class LinkedBlockingDequeTest ext
1763		final LinkedBlockingDeque q = populatedDeque(SIZE);
1764		Thread t = new Thread(new CheckedRunnable() {
1765		public void realRun() throws InterruptedException {
1766	<	q.put(new Integer(SIZE+1));
1766	>	q.put(new Integer(SIZE + 1));
1767		}});
1768
1769		t.start();
#	Line 1766 | Line 1787 | public class LinkedBlockingDequeTest ext
1787		ArrayList l = new ArrayList();
1788		q.drainTo(l, i);
1789		int k = (i < SIZE) ? i : SIZE;
1790	<	assertEquals(l.size(), k);
1791	<	assertEquals(q.size(), SIZE-k);
1790	>	assertEquals(k, l.size());
1791	>	assertEquals(SIZE - k, q.size());
1792		for (int j = 0; j < k; ++j)
1793		assertEquals(l.get(j), new Integer(j));
1794	<	while (q.poll() != null) ;
1794	>	do {} while (q.poll() != null);
1795	>	}
1796	>	}
1797	>
1798	>	/**
1799	>	* remove(null), contains(null) always return false
1800	>	*/
1801	>	public void testNeverContainsNull() {
1802	>	Deque<?>[] qs = {
1803	>	new LinkedBlockingDeque<Object>(),
1804	>	populatedDeque(2),
1805	>	};
1806	>
1807	>	for (Deque<?> q : qs) {
1808	>	assertFalse(q.contains(null));
1809	>	assertFalse(q.remove(null));
1810	>	assertFalse(q.removeFirstOccurrence(null));
1811	>	assertFalse(q.removeLastOccurrence(null));
1812		}
1813		}
1814

Diff Legend

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