ViewVC Help

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

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

Comparing jsr166/src/test/tck/ConcurrentSkipListSubSetTest.java (file contents):
Revision 1.2 by dl, Tue Mar 22 01:30:22 2005 UTC vs.
Revision 1.24 by jsr166, Thu May 30 03:28:55 2013 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.util.*;
9	<	import java.util.concurrent.*;
10	<	import java.io.*;
8	>	import java.util.Arrays;
9	>	import java.util.BitSet;
10	>	import java.util.Collection;
11	>	import java.util.Comparator;
12	>	import java.util.Iterator;
13	>	import java.util.NavigableSet;
14	>	import java.util.NoSuchElementException;
15	>	import java.util.Random;
16	>	import java.util.Set;
17	>	import java.util.SortedSet;
18	>	import java.util.concurrent.ConcurrentSkipListSet;
19
20		public class ConcurrentSkipListSubSetTest extends JSR166TestCase {
21		public static void main(String[] args) {
22	<	junit.textui.TestRunner.run (suite());
22	>	junit.textui.TestRunner.run(suite());
23		}
24		public static Test suite() {
25	<	return new TestSuite(ConcurrentSkipListSubSetTest.class);
25	>	return new TestSuite(ConcurrentSkipListSubSetTest.class);
26		}
27
28	<	static class MyReverseComparator implements Comparator {
28	>	static class MyReverseComparator implements Comparator {
29		public int compare(Object x, Object y) {
30	<	int i = ((Integer)x).intValue();
23	<	int j = ((Integer)y).intValue();
24	<	if (i < j) return 1;
25	<	if (i > j) return -1;
26	<	return 0;
30	>	return ((Comparable)y).compareTo(x);
31		}
32		}
33
34		/**
35	<	* Create a set of given size containing consecutive
35	>	* Returns a new set of given size containing consecutive
36		* Integers 0 ... n.
37		*/
38	<	private NavigableSet populatedSet(int n) {
39	<	ConcurrentSkipListSet q = new ConcurrentSkipListSet();
38	>	private NavigableSet<Integer> populatedSet(int n) {
39	>	ConcurrentSkipListSet<Integer> q =
40	>	new ConcurrentSkipListSet<Integer>();
41		assertTrue(q.isEmpty());
42
43	<	for(int i = n-1; i >= 0; i-=2)
44	<	assertTrue(q.add(new Integer(i)));
45	<	for(int i = (n & 1); i < n; i+=2)
46	<	assertTrue(q.add(new Integer(i)));
43	>	for (int i = n-1; i >= 0; i-=2)
44	>	assertTrue(q.add(new Integer(i)));
45	>	for (int i = (n & 1); i < n; i+=2)
46	>	assertTrue(q.add(new Integer(i)));
47		assertTrue(q.add(new Integer(-n)));
48		assertTrue(q.add(new Integer(n)));
49	<	NavigableSet s = q.navigableSubSet(new Integer(0), new Integer(n));
49	>	NavigableSet s = q.subSet(new Integer(0), true, new Integer(n), false);
50		assertFalse(s.isEmpty());
51	<	assertEquals(n, s.size());
51	>	assertEquals(n, s.size());
52		return s;
53		}
54
55		/**
56	<	* Create set of first 5 ints
56	>	* Returns a new set of first 5 ints.
57		*/
58		private NavigableSet set5() {
59		ConcurrentSkipListSet q = new ConcurrentSkipListSet();
#	Line 60 | Line 65 | public class ConcurrentSkipListSubSetTes
65		q.add(five);
66		q.add(zero);
67		q.add(seven);
68	<	NavigableSet s = q.navigableSubSet(one, seven);
69	<	assertEquals(5, s.size());
68	>	NavigableSet s = q.subSet(one, true, seven, false);
69	>	assertEquals(5, s.size());
70		return s;
71		}
72
73	<	private static NavigableSet set0() {
74	<	ConcurrentSkipListSet set = new ConcurrentSkipListSet();
73	>	/**
74	>	* Returns a new set of first 5 negative ints.
75	>	*/
76	>	private NavigableSet dset5() {
77	>	ConcurrentSkipListSet q = new ConcurrentSkipListSet();
78	>	assertTrue(q.isEmpty());
79	>	q.add(m1);
80	>	q.add(m2);
81	>	q.add(m3);
82	>	q.add(m4);
83	>	q.add(m5);
84	>	NavigableSet s = q.descendingSet();
85	>	assertEquals(5, s.size());
86	>	return s;
87	>	}
88	>
89	>	private static NavigableSet set0() {
90	>	ConcurrentSkipListSet set = new ConcurrentSkipListSet();
91	>	assertTrue(set.isEmpty());
92	>	return set.tailSet(m1, true);
93	>	}
94	>
95	>	private static NavigableSet dset0() {
96	>	ConcurrentSkipListSet set = new ConcurrentSkipListSet();
97		assertTrue(set.isEmpty());
98	<	return set.navigableTailSet(m1);
98	>	return set;
99		}
100	<
100	>
101		/**
102		* A new set has unbounded capacity
103		*/
#	Line 78 | Line 105 | public class ConcurrentSkipListSubSetTes
105		assertEquals(0, set0().size());
106		}
107
81	–
108		/**
109		* isEmpty is true before add, false after
110		*/
#	Line 112 | Line 138 | public class ConcurrentSkipListSubSetTes
138		* add(null) throws NPE
139		*/
140		public void testAddNull() {
141	<	try {
141	>	try {
142		NavigableSet q = set0();
143		q.add(null);
144		shouldThrow();
145	<	} catch (NullPointerException success) { }
145	>	} catch (NullPointerException success) {}
146		}
147
148		/**
#	Line 146 | Line 172 | public class ConcurrentSkipListSubSetTes
172		q.add(new Object());
173		q.add(new Object());
174		shouldThrow();
175	<	}
150	<	catch(ClassCastException success) {}
175	>	} catch (ClassCastException success) {}
176		}
177
153	–
178		/**
179		* addAll(null) throws NPE
180		*/
#	Line 159 | Line 183 | public class ConcurrentSkipListSubSetTes
183		NavigableSet q = set0();
184		q.addAll(null);
185		shouldThrow();
186	<	}
163	<	catch (NullPointerException success) {}
186	>	} catch (NullPointerException success) {}
187		}
188	+
189		/**
190		* addAll of a collection with null elements throws NPE
191		*/
#	Line 171 | Line 195 | public class ConcurrentSkipListSubSetTes
195		Integer[] ints = new Integer[SIZE];
196		q.addAll(Arrays.asList(ints));
197		shouldThrow();
198	<	}
175	<	catch (NullPointerException success) {}
198	>	} catch (NullPointerException success) {}
199		}
200	+
201		/**
202		* addAll of a collection with any null elements throws NPE after
203		* possibly adding some elements
#	Line 186 | Line 210 | public class ConcurrentSkipListSubSetTes
210		ints[i] = new Integer(i+SIZE);
211		q.addAll(Arrays.asList(ints));
212		shouldThrow();
213	<	}
190	<	catch (NullPointerException success) {}
213	>	} catch (NullPointerException success) {}
214		}
215
216		/**
217		* Set contains all elements of successful addAll
218		*/
219		public void testAddAll5() {
220	<	try {
221	<	Integer[] empty = new Integer[0];
222	<	Integer[] ints = new Integer[SIZE];
223	<	for (int i = 0; i < SIZE; ++i)
224	<	ints[i] = new Integer(SIZE-1- i);
225	<	NavigableSet q = set0();
226	<	assertFalse(q.addAll(Arrays.asList(empty)));
227	<	assertTrue(q.addAll(Arrays.asList(ints)));
228	<	for (int i = 0; i < SIZE; ++i)
206	<	assertEquals(new Integer(i), q.pollFirst());
207	<	}
208	<	finally {}
220	>	Integer[] empty = new Integer[0];
221	>	Integer[] ints = new Integer[SIZE];
222	>	for (int i = 0; i < SIZE; ++i)
223	>	ints[i] = new Integer(SIZE-1- i);
224	>	NavigableSet q = set0();
225	>	assertFalse(q.addAll(Arrays.asList(empty)));
226	>	assertTrue(q.addAll(Arrays.asList(ints)));
227	>	for (int i = 0; i < SIZE; ++i)
228	>	assertEquals(new Integer(i), q.pollFirst());
229		}
230
231		/**
#	Line 214 | Line 234 | public class ConcurrentSkipListSubSetTes
234		public void testPoll() {
235		NavigableSet q = populatedSet(SIZE);
236		for (int i = 0; i < SIZE; ++i) {
237	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
237	>	assertEquals(i, q.pollFirst());
238		}
239	<	assertNull(q.pollFirst());
239	>	assertNull(q.pollFirst());
240		}
241
242		/**
#	Line 225 | Line 245 | public class ConcurrentSkipListSubSetTes
245		public void testRemoveElement() {
246		NavigableSet q = populatedSet(SIZE);
247		for (int i = 1; i < SIZE; i+=2) {
248	<	assertTrue(q.remove(new Integer(i)));
248	>	assertTrue(q.contains(i));
249	>	assertTrue(q.remove(i));
250	>	assertFalse(q.contains(i));
251	>	assertTrue(q.contains(i-1));
252		}
253		for (int i = 0; i < SIZE; i+=2) {
254	<	assertTrue(q.remove(new Integer(i)));
255	<	assertFalse(q.remove(new Integer(i+1)));
254	>	assertTrue(q.contains(i));
255	>	assertTrue(q.remove(i));
256	>	assertFalse(q.contains(i));
257	>	assertFalse(q.remove(i+1));
258	>	assertFalse(q.contains(i+1));
259		}
260		assertTrue(q.isEmpty());
261		}
262	<
262	>
263		/**
264		* contains(x) reports true when elements added but not yet removed
265		*/
#	Line 309 | Line 335 | public class ConcurrentSkipListSubSetTes
335		}
336		}
337
312	–
313	–
338		/**
339		* lower returns preceding element
340		*/
#	Line 327 | Line 351 | public class ConcurrentSkipListSubSetTes
351
352		Object e4 = q.lower(zero);
353		assertNull(e4);
330	–
354		}
355
356		/**
#	Line 346 | Line 369 | public class ConcurrentSkipListSubSetTes
369
370		Object e4 = q.higher(six);
371		assertNull(e4);
349	–
372		}
373
374		/**
#	Line 365 | Line 387 | public class ConcurrentSkipListSubSetTes
387
388		Object e4 = q.floor(zero);
389		assertNull(e4);
368	–
390		}
391
392		/**
#	Line 384 | Line 405 | public class ConcurrentSkipListSubSetTes
405
406		Object e4 = q.ceiling(six);
407		assertNull(e4);
387	–
408		}
409
410		/**
411	<	* toArray contains all elements
411	>	* toArray contains all elements in sorted order
412		*/
413		public void testToArray() {
414		NavigableSet q = populatedSet(SIZE);
415	<	Object[] o = q.toArray();
416	<	Arrays.sort(o);
417	<	for(int i = 0; i < o.length; i++)
398	<	assertEquals(o[i], q.pollFirst());
415	>	Object[] o = q.toArray();
416	>	for (int i = 0; i < o.length; i++)
417	>	assertSame(o[i], q.pollFirst());
418		}
419
420		/**
421	<	* toArray(a) contains all elements
421	>	* toArray(a) contains all elements in sorted order
422		*/
423		public void testToArray2() {
424	<	NavigableSet q = populatedSet(SIZE);
425	<	Integer[] ints = new Integer[SIZE];
426	<	ints = (Integer[])q.toArray(ints);
427	<	Arrays.sort(ints);
428	<	for(int i = 0; i < ints.length; i++)
429	<	assertEquals(ints[i], q.pollFirst());
424	>	NavigableSet<Integer> q = populatedSet(SIZE);
425	>	Integer[] ints = new Integer[SIZE];
426	>	Integer[] array = q.toArray(ints);
427	>	assertSame(ints, array);
428	>	for (int i = 0; i < ints.length; i++)
429	>	assertSame(ints[i], q.pollFirst());
430		}
431	<
431	>
432		/**
433		* iterator iterates through all elements
434		*/
435		public void testIterator() {
436		NavigableSet q = populatedSet(SIZE);
437		int i = 0;
438	<	Iterator it = q.iterator();
439	<	while(it.hasNext()) {
438	>	Iterator it = q.iterator();
439	>	while (it.hasNext()) {
440		assertTrue(q.contains(it.next()));
441		++i;
442		}
#	Line 430 | Line 449 | public class ConcurrentSkipListSubSetTes
449		public void testEmptyIterator() {
450		NavigableSet q = set0();
451		int i = 0;
452	<	Iterator it = q.iterator();
453	<	while(it.hasNext()) {
452	>	Iterator it = q.iterator();
453	>	while (it.hasNext()) {
454		assertTrue(q.contains(it.next()));
455		++i;
456		}
457	<	assertEquals(i, 0);
457	>	assertEquals(0, i);
458		}
459
460		/**
461		* iterator.remove removes current element
462		*/
463	<	public void testIteratorRemove () {
463	>	public void testIteratorRemove() {
464		final NavigableSet q = set0();
465		q.add(new Integer(2));
466		q.add(new Integer(1));
#	Line 457 | Line 476 | public class ConcurrentSkipListSubSetTes
476		assertFalse(it.hasNext());
477		}
478
460	–
479		/**
480		* toString contains toStrings of elements
481		*/
#	Line 465 | Line 483 | public class ConcurrentSkipListSubSetTes
483		NavigableSet q = populatedSet(SIZE);
484		String s = q.toString();
485		for (int i = 0; i < SIZE; ++i) {
486	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
486	>	assertTrue(s.contains(String.valueOf(i)));
487		}
488	<	}
488	>	}
489
490		/**
491	<	* A deserialized serialized set has same elements
491	>	* A deserialized serialized set has same elements
492		*/
493	<	public void testSerialization() {
494	<	NavigableSet q = populatedSet(SIZE);
495	<	try {
496	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
497	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
498	<	out.writeObject(q);
499	<	out.close();
500	<
501	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
502	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
503	<	NavigableSet r = (NavigableSet)in.readObject();
486	<	assertEquals(q.size(), r.size());
487	<	while (!q.isEmpty())
488	<	assertEquals(q.pollFirst(), r.pollFirst());
489	<	} catch(Exception e){
490	<	e.printStackTrace();
491	<	unexpectedException();
493	>	public void testSerialization() throws Exception {
494	>	NavigableSet x = populatedSet(SIZE);
495	>	NavigableSet y = serialClone(x);
496	>
497	>	assertNotSame(y, x);
498	>	assertEquals(x.size(), y.size());
499	>	assertEquals(x, y);
500	>	assertEquals(y, x);
501	>	while (!x.isEmpty()) {
502	>	assertFalse(y.isEmpty());
503	>	assertEquals(x.pollFirst(), y.pollFirst());
504		}
505	+	assertTrue(y.isEmpty());
506		}
507
508		/**
#	Line 609 | Line 622 | public class ConcurrentSkipListSubSetTes
622		assertEquals(1, ssm.size());
623		assertEquals(3, sm.size());
624		assertEquals(4, set.size());
625	+	}
626	+
627	+	/**
628	+	* size changes when elements added and removed
629	+	*/
630	+	public void testDescendingSize() {
631	+	NavigableSet q = populatedSet(SIZE);
632	+	for (int i = 0; i < SIZE; ++i) {
633	+	assertEquals(SIZE-i, q.size());
634	+	q.pollFirst();
635	+	}
636	+	for (int i = 0; i < SIZE; ++i) {
637	+	assertEquals(i, q.size());
638	+	q.add(new Integer(i));
639	+	}
640	+	}
641	+
642	+	/**
643	+	* add(null) throws NPE
644	+	*/
645	+	public void testDescendingAddNull() {
646	+	try {
647	+	NavigableSet q = dset0();
648	+	q.add(null);
649	+	shouldThrow();
650	+	} catch (NullPointerException success) {}
651	+	}
652	+
653	+	/**
654	+	* Add of comparable element succeeds
655	+	*/
656	+	public void testDescendingAdd() {
657	+	NavigableSet q = dset0();
658	+	assertTrue(q.add(m6));
659	+	}
660	+
661	+	/**
662	+	* Add of duplicate element fails
663	+	*/
664	+	public void testDescendingAddDup() {
665	+	NavigableSet q = dset0();
666	+	assertTrue(q.add(m6));
667	+	assertFalse(q.add(m6));
668	+	}
669	+
670	+	/**
671	+	* Add of non-Comparable throws CCE
672	+	*/
673	+	public void testDescendingAddNonComparable() {
674	+	try {
675	+	NavigableSet q = dset0();
676	+	q.add(new Object());
677	+	q.add(new Object());
678	+	q.add(new Object());
679	+	shouldThrow();
680	+	} catch (ClassCastException success) {}
681	+	}
682	+
683	+	/**
684	+	* addAll(null) throws NPE
685	+	*/
686	+	public void testDescendingAddAll1() {
687	+	try {
688	+	NavigableSet q = dset0();
689	+	q.addAll(null);
690	+	shouldThrow();
691	+	} catch (NullPointerException success) {}
692	+	}
693	+
694	+	/**
695	+	* addAll of a collection with null elements throws NPE
696	+	*/
697	+	public void testDescendingAddAll2() {
698	+	try {
699	+	NavigableSet q = dset0();
700	+	Integer[] ints = new Integer[SIZE];
701	+	q.addAll(Arrays.asList(ints));
702	+	shouldThrow();
703	+	} catch (NullPointerException success) {}
704	+	}
705	+
706	+	/**
707	+	* addAll of a collection with any null elements throws NPE after
708	+	* possibly adding some elements
709	+	*/
710	+	public void testDescendingAddAll3() {
711	+	try {
712	+	NavigableSet q = dset0();
713	+	Integer[] ints = new Integer[SIZE];
714	+	for (int i = 0; i < SIZE-1; ++i)
715	+	ints[i] = new Integer(i+SIZE);
716	+	q.addAll(Arrays.asList(ints));
717	+	shouldThrow();
718	+	} catch (NullPointerException success) {}
719	+	}
720	+
721	+	/**
722	+	* Set contains all elements of successful addAll
723	+	*/
724	+	public void testDescendingAddAll5() {
725	+	Integer[] empty = new Integer[0];
726	+	Integer[] ints = new Integer[SIZE];
727	+	for (int i = 0; i < SIZE; ++i)
728	+	ints[i] = new Integer(SIZE-1- i);
729	+	NavigableSet q = dset0();
730	+	assertFalse(q.addAll(Arrays.asList(empty)));
731	+	assertTrue(q.addAll(Arrays.asList(ints)));
732	+	for (int i = 0; i < SIZE; ++i)
733	+	assertEquals(new Integer(i), q.pollFirst());
734	+	}
735	+
736	+	/**
737	+	* poll succeeds unless empty
738	+	*/
739	+	public void testDescendingPoll() {
740	+	NavigableSet q = populatedSet(SIZE);
741	+	for (int i = 0; i < SIZE; ++i) {
742	+	assertEquals(i, q.pollFirst());
743	+	}
744	+	assertNull(q.pollFirst());
745	+	}
746	+
747	+	/**
748	+	* remove(x) removes x and returns true if present
749	+	*/
750	+	public void testDescendingRemoveElement() {
751	+	NavigableSet q = populatedSet(SIZE);
752	+	for (int i = 1; i < SIZE; i+=2) {
753	+	assertTrue(q.remove(new Integer(i)));
754	+	}
755	+	for (int i = 0; i < SIZE; i+=2) {
756	+	assertTrue(q.remove(new Integer(i)));
757	+	assertFalse(q.remove(new Integer(i+1)));
758	+	}
759	+	assertTrue(q.isEmpty());
760	+	}
761	+
762	+	/**
763	+	* contains(x) reports true when elements added but not yet removed
764	+	*/
765	+	public void testDescendingContains() {
766	+	NavigableSet q = populatedSet(SIZE);
767	+	for (int i = 0; i < SIZE; ++i) {
768	+	assertTrue(q.contains(new Integer(i)));
769	+	q.pollFirst();
770	+	assertFalse(q.contains(new Integer(i)));
771	+	}
772	+	}
773	+
774	+	/**
775	+	* clear removes all elements
776	+	*/
777	+	public void testDescendingClear() {
778	+	NavigableSet q = populatedSet(SIZE);
779	+	q.clear();
780	+	assertTrue(q.isEmpty());
781	+	assertEquals(0, q.size());
782	+	q.add(new Integer(1));
783	+	assertFalse(q.isEmpty());
784	+	q.clear();
785	+	assertTrue(q.isEmpty());
786	+	}
787	+
788	+	/**
789	+	* containsAll(c) is true when c contains a subset of elements
790	+	*/
791	+	public void testDescendingContainsAll() {
792	+	NavigableSet q = populatedSet(SIZE);
793	+	NavigableSet p = dset0();
794	+	for (int i = 0; i < SIZE; ++i) {
795	+	assertTrue(q.containsAll(p));
796	+	assertFalse(p.containsAll(q));
797	+	p.add(new Integer(i));
798	+	}
799	+	assertTrue(p.containsAll(q));
800	+	}
801	+
802	+	/**
803	+	* retainAll(c) retains only those elements of c and reports true if changed
804	+	*/
805	+	public void testDescendingRetainAll() {
806	+	NavigableSet q = populatedSet(SIZE);
807	+	NavigableSet p = populatedSet(SIZE);
808	+	for (int i = 0; i < SIZE; ++i) {
809	+	boolean changed = q.retainAll(p);
810	+	if (i == 0)
811	+	assertFalse(changed);
812	+	else
813	+	assertTrue(changed);
814	+
815	+	assertTrue(q.containsAll(p));
816	+	assertEquals(SIZE-i, q.size());
817	+	p.pollFirst();
818	+	}
819	+	}
820	+
821	+	/**
822	+	* removeAll(c) removes only those elements of c and reports true if changed
823	+	*/
824	+	public void testDescendingRemoveAll() {
825	+	for (int i = 1; i < SIZE; ++i) {
826	+	NavigableSet q = populatedSet(SIZE);
827	+	NavigableSet p = populatedSet(i);
828	+	assertTrue(q.removeAll(p));
829	+	assertEquals(SIZE-i, q.size());
830	+	for (int j = 0; j < i; ++j) {
831	+	Integer I = (Integer)(p.pollFirst());
832	+	assertFalse(q.contains(I));
833	+	}
834	+	}
835	+	}
836	+
837	+	/**
838	+	* lower returns preceding element
839	+	*/
840	+	public void testDescendingLower() {
841	+	NavigableSet q = dset5();
842	+	Object e1 = q.lower(m3);
843	+	assertEquals(m2, e1);
844	+
845	+	Object e2 = q.lower(m6);
846	+	assertEquals(m5, e2);
847	+
848	+	Object e3 = q.lower(m1);
849	+	assertNull(e3);
850	+
851	+	Object e4 = q.lower(zero);
852	+	assertNull(e4);
853	+	}
854	+
855	+	/**
856	+	* higher returns next element
857	+	*/
858	+	public void testDescendingHigher() {
859	+	NavigableSet q = dset5();
860	+	Object e1 = q.higher(m3);
861	+	assertEquals(m4, e1);
862	+
863	+	Object e2 = q.higher(zero);
864	+	assertEquals(m1, e2);
865	+
866	+	Object e3 = q.higher(m5);
867	+	assertNull(e3);
868	+
869	+	Object e4 = q.higher(m6);
870	+	assertNull(e4);
871	+	}
872	+
873	+	/**
874	+	* floor returns preceding element
875	+	*/
876	+	public void testDescendingFloor() {
877	+	NavigableSet q = dset5();
878	+	Object e1 = q.floor(m3);
879	+	assertEquals(m3, e1);
880	+
881	+	Object e2 = q.floor(m6);
882	+	assertEquals(m5, e2);
883	+
884	+	Object e3 = q.floor(m1);
885	+	assertEquals(m1, e3);
886	+
887	+	Object e4 = q.floor(zero);
888	+	assertNull(e4);
889	+	}
890	+
891	+	/**
892	+	* ceiling returns next element
893	+	*/
894	+	public void testDescendingCeiling() {
895	+	NavigableSet q = dset5();
896	+	Object e1 = q.ceiling(m3);
897	+	assertEquals(m3, e1);
898	+
899	+	Object e2 = q.ceiling(zero);
900	+	assertEquals(m1, e2);
901	+
902	+	Object e3 = q.ceiling(m5);
903	+	assertEquals(m5, e3);
904	+
905	+	Object e4 = q.ceiling(m6);
906	+	assertNull(e4);
907	+	}
908	+
909	+	/**
910	+	* toArray contains all elements
911	+	*/
912	+	public void testDescendingToArray() {
913	+	NavigableSet q = populatedSet(SIZE);
914	+	Object[] o = q.toArray();
915	+	Arrays.sort(o);
916	+	for (int i = 0; i < o.length; i++)
917	+	assertEquals(o[i], q.pollFirst());
918	+	}
919	+
920	+	/**
921	+	* toArray(a) contains all elements
922	+	*/
923	+	public void testDescendingToArray2() {
924	+	NavigableSet q = populatedSet(SIZE);
925	+	Integer[] ints = new Integer[SIZE];
926	+	assertSame(ints, q.toArray(ints));
927	+	Arrays.sort(ints);
928	+	for (int i = 0; i < ints.length; i++)
929	+	assertEquals(ints[i], q.pollFirst());
930	+	}
931	+
932	+	/**
933	+	* iterator iterates through all elements
934	+	*/
935	+	public void testDescendingIterator() {
936	+	NavigableSet q = populatedSet(SIZE);
937	+	int i = 0;
938	+	Iterator it = q.iterator();
939	+	while (it.hasNext()) {
940	+	assertTrue(q.contains(it.next()));
941	+	++i;
942	+	}
943	+	assertEquals(i, SIZE);
944	+	}
945	+
946	+	/**
947	+	* iterator of empty set has no elements
948	+	*/
949	+	public void testDescendingEmptyIterator() {
950	+	NavigableSet q = dset0();
951	+	int i = 0;
952	+	Iterator it = q.iterator();
953	+	while (it.hasNext()) {
954	+	assertTrue(q.contains(it.next()));
955	+	++i;
956	+	}
957	+	assertEquals(0, i);
958	+	}
959	+
960	+	/**
961	+	* iterator.remove removes current element
962	+	*/
963	+	public void testDescendingIteratorRemove() {
964	+	final NavigableSet q = dset0();
965	+	q.add(new Integer(2));
966	+	q.add(new Integer(1));
967	+	q.add(new Integer(3));
968	+
969	+	Iterator it = q.iterator();
970	+	it.next();
971	+	it.remove();
972	+
973	+	it = q.iterator();
974	+	assertEquals(it.next(), new Integer(2));
975	+	assertEquals(it.next(), new Integer(3));
976	+	assertFalse(it.hasNext());
977	+	}
978	+
979	+	/**
980	+	* toString contains toStrings of elements
981	+	*/
982	+	public void testDescendingToString() {
983	+	NavigableSet q = populatedSet(SIZE);
984	+	String s = q.toString();
985	+	for (int i = 0; i < SIZE; ++i) {
986	+	assertTrue(s.contains(String.valueOf(i)));
987	+	}
988	+	}
989	+
990	+	/**
991	+	* A deserialized serialized set has same elements
992	+	*/
993	+	public void testDescendingSerialization() throws Exception {
994	+	NavigableSet x = dset5();
995	+	NavigableSet y = serialClone(x);
996	+
997	+	assertNotSame(y, x);
998	+	assertEquals(x.size(), y.size());
999	+	assertEquals(x, y);
1000	+	assertEquals(y, x);
1001	+	while (!x.isEmpty()) {
1002	+	assertFalse(y.isEmpty());
1003	+	assertEquals(x.pollFirst(), y.pollFirst());
1004	+	}
1005	+	assertTrue(y.isEmpty());
1006	+	}
1007	+
1008	+	/**
1009	+	* subSet returns set with keys in requested range
1010	+	*/
1011	+	public void testDescendingSubSetContents() {
1012	+	NavigableSet set = dset5();
1013	+	SortedSet sm = set.subSet(m2, m4);
1014	+	assertEquals(m2, sm.first());
1015	+	assertEquals(m3, sm.last());
1016	+	assertEquals(2, sm.size());
1017	+	assertFalse(sm.contains(m1));
1018	+	assertTrue(sm.contains(m2));
1019	+	assertTrue(sm.contains(m3));
1020	+	assertFalse(sm.contains(m4));
1021	+	assertFalse(sm.contains(m5));
1022	+	Iterator i = sm.iterator();
1023	+	Object k;
1024	+	k = (Integer)(i.next());
1025	+	assertEquals(m2, k);
1026	+	k = (Integer)(i.next());
1027	+	assertEquals(m3, k);
1028	+	assertFalse(i.hasNext());
1029	+	Iterator j = sm.iterator();
1030	+	j.next();
1031	+	j.remove();
1032	+	assertFalse(set.contains(m2));
1033	+	assertEquals(4, set.size());
1034	+	assertEquals(1, sm.size());
1035	+	assertEquals(m3, sm.first());
1036	+	assertEquals(m3, sm.last());
1037	+	assertTrue(sm.remove(m3));
1038	+	assertTrue(sm.isEmpty());
1039	+	assertEquals(3, set.size());
1040	+	}
1041	+
1042	+	public void testDescendingSubSetContents2() {
1043	+	NavigableSet set = dset5();
1044	+	SortedSet sm = set.subSet(m2, m3);
1045	+	assertEquals(1, sm.size());
1046	+	assertEquals(m2, sm.first());
1047	+	assertEquals(m2, sm.last());
1048	+	assertFalse(sm.contains(m1));
1049	+	assertTrue(sm.contains(m2));
1050	+	assertFalse(sm.contains(m3));
1051	+	assertFalse(sm.contains(m4));
1052	+	assertFalse(sm.contains(m5));
1053	+	Iterator i = sm.iterator();
1054	+	Object k;
1055	+	k = (Integer)(i.next());
1056	+	assertEquals(m2, k);
1057	+	assertFalse(i.hasNext());
1058	+	Iterator j = sm.iterator();
1059	+	j.next();
1060	+	j.remove();
1061	+	assertFalse(set.contains(m2));
1062	+	assertEquals(4, set.size());
1063	+	assertEquals(0, sm.size());
1064	+	assertTrue(sm.isEmpty());
1065	+	assertFalse(sm.remove(m3));
1066	+	assertEquals(4, set.size());
1067	+	}
1068	+
1069	+	/**
1070	+	* headSet returns set with keys in requested range
1071	+	*/
1072	+	public void testDescendingHeadSetContents() {
1073	+	NavigableSet set = dset5();
1074	+	SortedSet sm = set.headSet(m4);
1075	+	assertTrue(sm.contains(m1));
1076	+	assertTrue(sm.contains(m2));
1077	+	assertTrue(sm.contains(m3));
1078	+	assertFalse(sm.contains(m4));
1079	+	assertFalse(sm.contains(m5));
1080	+	Iterator i = sm.iterator();
1081	+	Object k;
1082	+	k = (Integer)(i.next());
1083	+	assertEquals(m1, k);
1084	+	k = (Integer)(i.next());
1085	+	assertEquals(m2, k);
1086	+	k = (Integer)(i.next());
1087	+	assertEquals(m3, k);
1088	+	assertFalse(i.hasNext());
1089	+	sm.clear();
1090	+	assertTrue(sm.isEmpty());
1091	+	assertEquals(2, set.size());
1092	+	assertEquals(m4, set.first());
1093	+	}
1094	+
1095	+	/**
1096	+	* tailSet returns set with keys in requested range
1097	+	*/
1098	+	public void testDescendingTailSetContents() {
1099	+	NavigableSet set = dset5();
1100	+	SortedSet sm = set.tailSet(m2);
1101	+	assertFalse(sm.contains(m1));
1102	+	assertTrue(sm.contains(m2));
1103	+	assertTrue(sm.contains(m3));
1104	+	assertTrue(sm.contains(m4));
1105	+	assertTrue(sm.contains(m5));
1106	+	Iterator i = sm.iterator();
1107	+	Object k;
1108	+	k = (Integer)(i.next());
1109	+	assertEquals(m2, k);
1110	+	k = (Integer)(i.next());
1111	+	assertEquals(m3, k);
1112	+	k = (Integer)(i.next());
1113	+	assertEquals(m4, k);
1114	+	k = (Integer)(i.next());
1115	+	assertEquals(m5, k);
1116	+	assertFalse(i.hasNext());
1117	+
1118	+	SortedSet ssm = sm.tailSet(m4);
1119	+	assertEquals(m4, ssm.first());
1120	+	assertEquals(m5, ssm.last());
1121	+	assertTrue(ssm.remove(m4));
1122	+	assertEquals(1, ssm.size());
1123	+	assertEquals(3, sm.size());
1124	+	assertEquals(4, set.size());
1125		}
1126
1127		}

Diff Legend

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