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.12 by jsr166, Sun Nov 22 18:57:16 2009 UTC vs.
Revision 1.23 by jsr166, Fri May 27 19:26:42 2011 UTC

#	Line 1 | Line 1
1		/*
2		* Written by Doug Lea with assistance from members of JCP JSR-166
3		* Expert Group and released to the public domain, as explained at
4	<	* http://creativecommons.org/licenses/publicdomain
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		*/
6
7		import junit.framework.*;
8	+	import java.io.BufferedInputStream;
9	+	import java.io.BufferedOutputStream;
10	+	import java.io.ByteArrayInputStream;
11	+	import java.io.ByteArrayOutputStream;
12	+	import java.io.ObjectInputStream;
13	+	import java.io.ObjectOutputStream;
14		import java.util.*;
9	–	import java.util.concurrent.*;
15
16		public class ArrayDequeTest extends JSR166TestCase {
17		public static void main(String[] args) {
18	<	junit.textui.TestRunner.run (suite());
18	>	junit.textui.TestRunner.run(suite());
19		}
20
21		public static Test suite() {
#	Line 18 | Line 23 | public class ArrayDequeTest extends JSR1
23		}
24
25		/**
26	<	* Create a queue of given size containing consecutive
26	>	* Create a deque of given size containing consecutive
27		* Integers 0 ... n.
28		*/
29	<	private ArrayDeque populatedDeque(int n) {
30	<	ArrayDeque q = new ArrayDeque();
29	>	private ArrayDeque<Integer> populatedDeque(int n) {
30	>	ArrayDeque<Integer> q = new ArrayDeque<Integer>();
31		assertTrue(q.isEmpty());
32		for (int i = 0; i < n; ++i)
33		assertTrue(q.offerLast(new Integer(i)));
#	Line 32 | Line 37 | public class ArrayDequeTest extends JSR1
37		}
38
39		/**
40	<	* new queue is empty
40	>	* new deque is empty
41		*/
42		public void testConstructor1() {
43		assertEquals(0, new ArrayDeque().size());
#	Line 49 | Line 54 | public class ArrayDequeTest extends JSR1
54		}
55
56		/**
57	<	* Queue contains all elements of collection used to initialize
57	>	* Initializing from Collection of null elements throws NPE
58	>	*/
59	>	public void testConstructor4() {
60	>	try {
61	>	Integer[] ints = new Integer[SIZE];
62	>	ArrayDeque q = new ArrayDeque(Arrays.asList(ints));
63	>	shouldThrow();
64	>	} catch (NullPointerException success) {}
65	>	}
66
67	+	/**
68	+	* Initializing from Collection with some null elements throws NPE
69	+	*/
70	+	public void testConstructor5() {
71	+	try {
72	+	Integer[] ints = new Integer[SIZE];
73	+	for (int i = 0; i < SIZE-1; ++i)
74	+	ints[i] = new Integer(i);
75	+	ArrayDeque q = new ArrayDeque(Arrays.asList(ints));
76	+	shouldThrow();
77	+	} catch (NullPointerException success) {}
78	+	}
79	+
80	+	/**
81	+	* Deque contains all elements of collection used to initialize
82		*/
83		public void testConstructor6() {
84		Integer[] ints = new Integer[SIZE];
#	Line 102 | Line 130 | public class ArrayDequeTest extends JSR1
130		}
131
132		/**
133	<	* peekFirst returns element inserted with push
133	>	* peekFirst() returns element inserted with push
134		*/
135		public void testPush() {
136		ArrayDeque q = populatedDeque(3);
#	Line 112 | Line 140 | public class ArrayDequeTest extends JSR1
140		}
141
142		/**
143	<	*  pop removes next element, or throws NSEE if empty
143	>	* pop() removes next element, or throws NSEE if empty
144		*/
145		public void testPop() {
146		ArrayDeque q = populatedDeque(SIZE);
#	Line 128 | Line 156 | public class ArrayDequeTest extends JSR1
156		/**
157		* offer(null) throws NPE
158		*/
159	+	public void testOfferNull() {
160	+	try {
161	+	ArrayDeque q = new ArrayDeque();
162	+	q.offer(null);
163	+	shouldThrow();
164	+	} catch (NullPointerException success) {}
165	+	}
166	+
167	+	/**
168	+	* offerFirst(null) throws NPE
169	+	*/
170		public void testOfferFirstNull() {
171		try {
172		ArrayDeque q = new ArrayDeque();
#	Line 137 | Line 176 | public class ArrayDequeTest extends JSR1
176		}
177
178		/**
179	<	* OfferFirst succeeds
179	>	* offerLast(null) throws NPE
180	>	*/
181	>	public void testOfferLastNull() {
182	>	try {
183	>	ArrayDeque q = new ArrayDeque();
184	>	q.offerLast(null);
185	>	shouldThrow();
186	>	} catch (NullPointerException success) {}
187	>	}
188	>
189	>	/**
190	>	* offer(x) succeeds
191	>	*/
192	>	public void testOffer() {
193	>	ArrayDeque q = new ArrayDeque();
194	>	assertTrue(q.offer(zero));
195	>	assertTrue(q.offer(one));
196	>	assertSame(zero, q.peekFirst());
197	>	assertSame(one, q.peekLast());
198	>	}
199	>
200	>	/**
201	>	* offerFirst(x) succeeds
202		*/
203		public void testOfferFirst() {
204		ArrayDeque q = new ArrayDeque();
205	<	assertTrue(q.offerFirst(new Integer(0)));
206	<	assertTrue(q.offerFirst(new Integer(1)));
205	>	assertTrue(q.offerFirst(zero));
206	>	assertTrue(q.offerFirst(one));
207	>	assertSame(one, q.peekFirst());
208	>	assertSame(zero, q.peekLast());
209		}
210
211		/**
212	<	* OfferLast succeeds
212	>	* offerLast(x) succeeds
213		*/
214		public void testOfferLast() {
215		ArrayDeque q = new ArrayDeque();
216	<	assertTrue(q.offerLast(new Integer(0)));
217	<	assertTrue(q.offerLast(new Integer(1)));
216	>	assertTrue(q.offerLast(zero));
217	>	assertTrue(q.offerLast(one));
218	>	assertSame(zero, q.peekFirst());
219	>	assertSame(one, q.peekLast());
220	>	}
221	>
222	>	/**
223	>	* add(null) throws NPE
224	>	*/
225	>	public void testAddNull() {
226	>	try {
227	>	ArrayDeque q = new ArrayDeque();
228	>	q.add(null);
229	>	shouldThrow();
230	>	} catch (NullPointerException success) {}
231	>	}
232	>
233	>	/**
234	>	* addFirst(null) throws NPE
235	>	*/
236	>	public void testAddFirstNull() {
237	>	try {
238	>	ArrayDeque q = new ArrayDeque();
239	>	q.addFirst(null);
240	>	shouldThrow();
241	>	} catch (NullPointerException success) {}
242		}
243
244		/**
245	<	* add succeeds
245	>	* addLast(null) throws NPE
246	>	*/
247	>	public void testAddLastNull() {
248	>	try {
249	>	ArrayDeque q = new ArrayDeque();
250	>	q.addLast(null);
251	>	shouldThrow();
252	>	} catch (NullPointerException success) {}
253	>	}
254	>
255	>	/**
256	>	* add(x) succeeds
257		*/
258		public void testAdd() {
259		ArrayDeque q = new ArrayDeque();
260	<	for (int i = 0; i < SIZE; ++i) {
261	<	assertEquals(i, q.size());
262	<	assertTrue(q.add(new Integer(i)));
263	<	}
260	>	assertTrue(q.add(zero));
261	>	assertTrue(q.add(one));
262	>	assertSame(zero, q.peekFirst());
263	>	assertSame(one, q.peekLast());
264	>	}
265	>
266	>	/**
267	>	* addFirst(x) succeeds
268	>	*/
269	>	public void testAddFirst() {
270	>	ArrayDeque q = new ArrayDeque();
271	>	q.addFirst(zero);
272	>	q.addFirst(one);
273	>	assertSame(one, q.peekFirst());
274	>	assertSame(zero, q.peekLast());
275	>	}
276	>
277	>	/**
278	>	* addLast(x) succeeds
279	>	*/
280	>	public void testAddLast() {
281	>	ArrayDeque q = new ArrayDeque();
282	>	q.addLast(zero);
283	>	q.addLast(one);
284	>	assertSame(zero, q.peekFirst());
285	>	assertSame(one, q.peekLast());
286		}
287
288		/**
#	Line 177 | Line 297 | public class ArrayDequeTest extends JSR1
297		}
298
299		/**
300	<	* Queue contains all elements, in traversal order, of successful addAll
300	>	* addAll of a collection with null elements throws NPE
301	>	*/
302	>	public void testAddAll2() {
303	>	try {
304	>	ArrayDeque q = new ArrayDeque();
305	>	Integer[] ints = new Integer[SIZE];
306	>	q.addAll(Arrays.asList(ints));
307	>	shouldThrow();
308	>	} catch (NullPointerException success) {}
309	>	}
310	>
311	>	/**
312	>	* addAll of a collection with any null elements throws NPE after
313	>	* possibly adding some elements
314	>	*/
315	>	public void testAddAll3() {
316	>	try {
317	>	ArrayDeque q = new ArrayDeque();
318	>	Integer[] ints = new Integer[SIZE];
319	>	for (int i = 0; i < SIZE-1; ++i)
320	>	ints[i] = new Integer(i);
321	>	q.addAll(Arrays.asList(ints));
322	>	shouldThrow();
323	>	} catch (NullPointerException success) {}
324	>	}
325	>
326	>	/**
327	>	* Deque contains all elements, in traversal order, of successful addAll
328		*/
329		public void testAddAll5() {
330		Integer[] empty = new Integer[0];
#	Line 192 | Line 339 | public class ArrayDequeTest extends JSR1
339		}
340
341		/**
342	<	*  pollFirst succeeds unless empty
342	>	* pollFirst() succeeds unless empty
343		*/
344		public void testPollFirst() {
345		ArrayDeque q = populatedDeque(SIZE);
#	Line 203 | Line 350 | public class ArrayDequeTest extends JSR1
350		}
351
352		/**
353	<	*  pollLast succeeds unless empty
353	>	* pollLast() succeeds unless empty
354		*/
355		public void testPollLast() {
356		ArrayDeque q = populatedDeque(SIZE);
#	Line 214 | Line 361 | public class ArrayDequeTest extends JSR1
361		}
362
363		/**
364	<	*  poll succeeds unless empty
364	>	* poll() succeeds unless empty
365		*/
366		public void testPoll() {
367		ArrayDeque q = populatedDeque(SIZE);
#	Line 225 | Line 372 | public class ArrayDequeTest extends JSR1
372		}
373
374		/**
375	<	*  remove removes next element, or throws NSEE if empty
375	>	* remove() removes next element, or throws NSEE if empty
376		*/
377		public void testRemove() {
378		ArrayDeque q = populatedDeque(SIZE);
#	Line 239 | Line 386 | public class ArrayDequeTest extends JSR1
386		}
387
388		/**
389	<	*  peekFirst returns next element, or null if empty
389	>	* remove(x) removes x and returns true if present
390	>	*/
391	>	public void testRemoveElement() {
392	>	ArrayDeque q = populatedDeque(SIZE);
393	>	for (int i = 1; i < SIZE; i+=2) {
394	>	assertTrue(q.contains(i));
395	>	assertTrue(q.remove(i));
396	>	assertFalse(q.contains(i));
397	>	assertTrue(q.contains(i-1));
398	>	}
399	>	for (int i = 0; i < SIZE; i+=2) {
400	>	assertTrue(q.contains(i));
401	>	assertTrue(q.remove(i));
402	>	assertFalse(q.contains(i));
403	>	assertFalse(q.remove(i+1));
404	>	assertFalse(q.contains(i+1));
405	>	}
406	>	assertTrue(q.isEmpty());
407	>	}
408	>
409	>	/**
410	>	* peekFirst() returns next element, or null if empty
411		*/
412		public void testPeekFirst() {
413		ArrayDeque q = populatedDeque(SIZE);
#	Line 253 | Line 421 | public class ArrayDequeTest extends JSR1
421		}
422
423		/**
424	<	*  peek returns next element, or null if empty
424	>	* peek() returns next element, or null if empty
425		*/
426		public void testPeek() {
427		ArrayDeque q = populatedDeque(SIZE);
#	Line 267 | Line 435 | public class ArrayDequeTest extends JSR1
435		}
436
437		/**
438	<	*  peekLast returns next element, or null if empty
438	>	* peekLast() returns next element, or null if empty
439		*/
440		public void testPeekLast() {
441		ArrayDeque q = populatedDeque(SIZE);
#	Line 281 | Line 449 | public class ArrayDequeTest extends JSR1
449		}
450
451		/**
452	<	* getFirst returns next getFirst, or throws NSEE if empty
452	>	* element() returns first element, or throws NSEE if empty
453	>	*/
454	>	public void testElement() {
455	>	ArrayDeque q = populatedDeque(SIZE);
456	>	for (int i = 0; i < SIZE; ++i) {
457	>	assertEquals(i, q.element());
458	>	assertEquals(i, q.poll());
459	>	}
460	>	try {
461	>	q.element();
462	>	shouldThrow();
463	>	} catch (NoSuchElementException success) {}
464	>	}
465	>
466	>	/**
467	>	* getFirst() returns first element, or throws NSEE if empty
468		*/
469		public void testFirstElement() {
470		ArrayDeque q = populatedDeque(SIZE);
#	Line 296 | Line 479 | public class ArrayDequeTest extends JSR1
479		}
480
481		/**
482	<	*  getLast returns next element, or throws NSEE if empty
482	>	* getLast() returns last element, or throws NSEE if empty
483		*/
484		public void testLastElement() {
485		ArrayDeque q = populatedDeque(SIZE);
#	Line 311 | Line 494 | public class ArrayDequeTest extends JSR1
494		assertNull(q.peekLast());
495		}
496
314	–
497		/**
498	<	*  removeFirst removes next element, or throws NSEE if empty
498	>	* removeFirst() removes first element, or throws NSEE if empty
499		*/
500		public void testRemoveFirst() {
501		ArrayDeque q = populatedDeque(SIZE);
#	Line 324 | Line 506 | public class ArrayDequeTest extends JSR1
506		q.removeFirst();
507		shouldThrow();
508		} catch (NoSuchElementException success) {}
509	+	assertNull(q.peekFirst());
510	+	}
511	+
512	+	/**
513	+	* removeLast() removes last element, or throws NSEE if empty
514	+	*/
515	+	public void testRemoveLast() {
516	+	ArrayDeque q = populatedDeque(SIZE);
517	+	for (int i = SIZE - 1; i >= 0; --i) {
518	+	assertEquals(i, q.removeLast());
519	+	}
520	+	try {
521	+	q.removeLast();
522	+	shouldThrow();
523	+	} catch (NoSuchElementException success) {}
524	+	assertNull(q.peekLast());
525		}
526
527		/**
#	Line 427 | Line 625 | public class ArrayDequeTest extends JSR1
625		}
626
627		/**
628	<	*  toArray contains all elements
628	>	* toArray() contains all elements in FIFO order
629		*/
630		public void testToArray() {
631		ArrayDeque q = populatedDeque(SIZE);
632		Object[] o = q.toArray();
435	–	Arrays.sort(o);
633		for (int i = 0; i < o.length; i++)
634	<	assertEquals(o[i], q.pollFirst());
634	>	assertSame(o[i], q.pollFirst());
635		}
636
637		/**
638	<	*  toArray(a) contains all elements
638	>	* toArray(a) contains all elements in FIFO order
639		*/
640		public void testToArray2() {
641	<	ArrayDeque q = populatedDeque(SIZE);
641	>	ArrayDeque<Integer> q = populatedDeque(SIZE);
642		Integer[] ints = new Integer[SIZE];
643	<	ints = (Integer[])q.toArray(ints);
644	<	Arrays.sort(ints);
643	>	Integer[] array = q.toArray(ints);
644	>	assertSame(ints, array);
645		for (int i = 0; i < ints.length; i++)
646	<	assertEquals(ints[i], q.pollFirst());
646	>	assertSame(ints[i], q.remove());
647		}
648
649		/**
650	<	* toArray(null) throws NPE
650	>	* toArray(null) throws NullPointerException
651		*/
652	<	public void testToArray_BadArg() {
652	>	public void testToArray_NullArg() {
653		ArrayDeque l = new ArrayDeque();
654		l.add(new Object());
655		try {
656	<	Object o[] = l.toArray(null);
656	>	l.toArray(null);
657		shouldThrow();
658		} catch (NullPointerException success) {}
659		}
660
661		/**
662	<	* toArray with incompatable aray type throws CCE
662	>	* toArray(incompatible array type) throws ArrayStoreException
663		*/
664		public void testToArray1_BadArg() {
665		ArrayDeque l = new ArrayDeque();
666		l.add(new Integer(5));
667		try {
668	<	Object o[] = l.toArray(new String[10]);
668	>	l.toArray(new String[10]);
669		shouldThrow();
670		} catch (ArrayStoreException success) {}
671		}
672
673		/**
674	<	*  iterator iterates through all elements
674	>	* Iterator iterates through all elements
675		*/
676		public void testIterator() {
677		ArrayDeque q = populatedDeque(SIZE);
#	Line 488 | Line 685 | public class ArrayDequeTest extends JSR1
685		}
686
687		/**
688	<	*  iterator ordering is FIFO
688	>	* Iterator ordering is FIFO
689		*/
690		public void testIteratorOrdering() {
691		final ArrayDeque q = new ArrayDeque();
692	<	q.add(new Integer(1));
693	<	q.add(new Integer(2));
694	<	q.add(new Integer(3));
692	>	q.add(one);
693	>	q.add(two);
694	>	q.add(three);
695		int k = 0;
696		for (Iterator it = q.iterator(); it.hasNext();) {
697		assertEquals(++k, it.next());
#	Line 504 | Line 701 | public class ArrayDequeTest extends JSR1
701		}
702
703		/**
704	<	* iterator.remove removes current element
704	>	* iterator.remove() removes current element
705		*/
706	<	public void testIteratorRemove () {
706	>	public void testIteratorRemove() {
707		final ArrayDeque q = new ArrayDeque();
708		final Random rng = new Random();
709		for (int iters = 0; iters < 100; ++iters) {
#	Line 532 | Line 729 | public class ArrayDequeTest extends JSR1
729		}
730
731		/**
732	<	*  Descending iterator iterates through all elements
732	>	* Descending iterator iterates through all elements
733		*/
734		public void testDescendingIterator() {
735		ArrayDeque q = populatedDeque(SIZE);
#	Line 551 | Line 748 | public class ArrayDequeTest extends JSR1
748		}
749
750		/**
751	<	*  Descending iterator ordering is reverse FIFO
751	>	* Descending iterator ordering is reverse FIFO
752		*/
753		public void testDescendingIteratorOrdering() {
754		final ArrayDeque q = new ArrayDeque();
#	Line 572 | Line 769 | public class ArrayDequeTest extends JSR1
769		}
770
771		/**
772	<	* descendingIterator.remove removes current element
772	>	* descendingIterator.remove() removes current element
773		*/
774	<	public void testDescendingIteratorRemove () {
774	>	public void testDescendingIteratorRemove() {
775		final ArrayDeque q = new ArrayDeque();
776		final Random rng = new Random();
777		for (int iters = 0; iters < 100; ++iters) {
#	Line 599 | Line 796 | public class ArrayDequeTest extends JSR1
796		}
797		}
798
602	–
799		/**
800	<	* toString contains toStrings of elements
800	>	* toString() contains toStrings of elements
801		*/
802		public void testToString() {
803		ArrayDeque q = populatedDeque(SIZE);
804		String s = q.toString();
805		for (int i = 0; i < SIZE; ++i) {
806	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
806	>	assertTrue(s.contains(String.valueOf(i)));
807		}
808		}
809
810		/**
811	<	* peekFirst returns element inserted with addFirst
811	>	* A deserialized serialized deque has same elements in same order
812		*/
813	<	public void testAddFirst() {
814	<	ArrayDeque q = populatedDeque(3);
815	<	q.addFirst(four);
816	<	assertEquals(four,q.peekFirst());
817	<	}
813	>	public void testSerialization() throws Exception {
814	>	ArrayDeque q = populatedDeque(SIZE);
815	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
816	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
817	>	out.writeObject(q);
818	>	out.close();
819
820	<	/**
821	<	* peekLast returns element inserted with addLast
822	<	*/
823	<	public void testAddLast() {
824	<	ArrayDeque q = populatedDeque(3);
825	<	q.addLast(four);
629	<	assertEquals(four,q.peekLast());
820	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
821	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
822	>	ArrayDeque r = (ArrayDeque)in.readObject();
823	>	assertEquals(q.size(), r.size());
824	>	while (!q.isEmpty())
825	>	assertEquals(q.remove(), r.remove());
826		}
827
828		}

Diff Legend

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