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

Diff Legend

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