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.30 by jsr166, Sat Feb 28 18:10:55 2015 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 {
139	<	NavigableSet q = set0();
138	>	NavigableSet q = set0();
139	>	try {
140		q.add(null);
141		shouldThrow();
142	<	} catch (NullPointerException success) { }
142	>	} catch (NullPointerException success) {}
143		}
144
145		/**
#	Line 140 | Line 163 | public class ConcurrentSkipListSubSetTes
163		* Add of non-Comparable throws CCE
164		*/
165		public void testAddNonComparable() {
166	+	NavigableSet q = set0();
167		try {
144	–	NavigableSet q = set0();
168		q.add(new Object());
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		*/
178		public void testAddAll1() {
179	+	NavigableSet q = set0();
180		try {
159	–	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		*/
189		public void testAddAll2() {
190	+	NavigableSet q = set0();
191	+	Integer[] ints = new Integer[SIZE];
192		try {
170	–	NavigableSet q = set0();
171	–	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
201		*/
202		public void testAddAll3() {
203	+	NavigableSet q = set0();
204	+	Integer[] ints = new Integer[SIZE];
205	+	for (int i = 0; i < SIZE-1; ++i)
206	+	ints[i] = new Integer(i+SIZE);
207		try {
183	–	NavigableSet q = set0();
184	–	Integer[] ints = new Integer[SIZE];
185	–	for (int i = 0; i < SIZE-1; ++i)
186	–	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 224 | Line 241 | public class ConcurrentSkipListSubSetTes
241		*/
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)));
244	>	for (int i = 1; i < SIZE; i += 2) {
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)));
250	>	for (int i = 0; i < SIZE; i += 2) {
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 303 | Line 326 | public class ConcurrentSkipListSubSetTes
326		assertTrue(q.removeAll(p));
327		assertEquals(SIZE-i, q.size());
328		for (int j = 0; j < i; ++j) {
329	<	Integer I = (Integer)(p.pollFirst());
330	<	assertFalse(q.contains(I));
329	>	Integer x = (Integer)(p.pollFirst());
330	>	assertFalse(q.contains(x));
331		}
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()) {
434	>	Iterator it = q.iterator();
435	>	int i;
436	>	for (i = 0; it.hasNext(); i++)
437		assertTrue(q.contains(it.next()));
422	–	++i;
423	–	}
438		assertEquals(i, SIZE);
439	+	assertIteratorExhausted(it);
440		}
441
442		/**
443		* iterator of empty set has no elements
444		*/
445		public void testEmptyIterator() {
446	<	NavigableSet q = set0();
432	<	int i = 0;
433	<	Iterator it = q.iterator();
434	<	while(it.hasNext()) {
435	<	assertTrue(q.contains(it.next()));
436	<	++i;
437	<	}
438	<	assertEquals(i, 0);
446	>	assertIteratorExhausted(set0().iterator());
447		}
448
449		/**
450		* iterator.remove removes current element
451		*/
452	<	public void testIteratorRemove () {
452	>	public void testIteratorRemove() {
453		final NavigableSet q = set0();
454		q.add(new Integer(2));
455		q.add(new Integer(1));
#	Line 457 | Line 465 | public class ConcurrentSkipListSubSetTes
465		assertFalse(it.hasNext());
466		}
467
460	–
468		/**
469		* toString contains toStrings of elements
470		*/
#	Line 465 | Line 472 | public class ConcurrentSkipListSubSetTes
472		NavigableSet q = populatedSet(SIZE);
473		String s = q.toString();
474		for (int i = 0; i < SIZE; ++i) {
475	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
475	>	assertTrue(s.contains(String.valueOf(i)));
476		}
477	<	}
477	>	}
478
479		/**
480	<	* A deserialized serialized set has same elements
480	>	* A deserialized serialized set has same elements
481		*/
482	<	public void testSerialization() {
483	<	NavigableSet q = populatedSet(SIZE);
484	<	try {
485	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
486	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
487	<	out.writeObject(q);
488	<	out.close();
489	<
490	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
491	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
492	<	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();
482	>	public void testSerialization() throws Exception {
483	>	NavigableSet x = populatedSet(SIZE);
484	>	NavigableSet y = serialClone(x);
485	>
486	>	assertNotSame(y, x);
487	>	assertEquals(x.size(), y.size());
488	>	assertEquals(x, y);
489	>	assertEquals(y, x);
490	>	while (!x.isEmpty()) {
491	>	assertFalse(y.isEmpty());
492	>	assertEquals(x.pollFirst(), y.pollFirst());
493		}
494	+	assertTrue(y.isEmpty());
495		}
496
497		/**
#	Line 609 | Line 611 | public class ConcurrentSkipListSubSetTes
611		assertEquals(1, ssm.size());
612		assertEquals(3, sm.size());
613		assertEquals(4, set.size());
614	+	}
615	+
616	+	/**
617	+	* size changes when elements added and removed
618	+	*/
619	+	public void testDescendingSize() {
620	+	NavigableSet q = populatedSet(SIZE);
621	+	for (int i = 0; i < SIZE; ++i) {
622	+	assertEquals(SIZE-i, q.size());
623	+	q.pollFirst();
624	+	}
625	+	for (int i = 0; i < SIZE; ++i) {
626	+	assertEquals(i, q.size());
627	+	q.add(new Integer(i));
628	+	}
629	+	}
630	+
631	+	/**
632	+	* add(null) throws NPE
633	+	*/
634	+	public void testDescendingAddNull() {
635	+	NavigableSet q = dset0();
636	+	try {
637	+	q.add(null);
638	+	shouldThrow();
639	+	} catch (NullPointerException success) {}
640	+	}
641	+
642	+	/**
643	+	* Add of comparable element succeeds
644	+	*/
645	+	public void testDescendingAdd() {
646	+	NavigableSet q = dset0();
647	+	assertTrue(q.add(m6));
648	+	}
649	+
650	+	/**
651	+	* Add of duplicate element fails
652	+	*/
653	+	public void testDescendingAddDup() {
654	+	NavigableSet q = dset0();
655	+	assertTrue(q.add(m6));
656	+	assertFalse(q.add(m6));
657	+	}
658	+
659	+	/**
660	+	* Add of non-Comparable throws CCE
661	+	*/
662	+	public void testDescendingAddNonComparable() {
663	+	NavigableSet q = dset0();
664	+	try {
665	+	q.add(new Object());
666	+	q.add(new Object());
667	+	q.add(new Object());
668	+	shouldThrow();
669	+	} catch (ClassCastException success) {}
670	+	}
671	+
672	+	/**
673	+	* addAll(null) throws NPE
674	+	*/
675	+	public void testDescendingAddAll1() {
676	+	NavigableSet q = dset0();
677	+	try {
678	+	q.addAll(null);
679	+	shouldThrow();
680	+	} catch (NullPointerException success) {}
681	+	}
682	+
683	+	/**
684	+	* addAll of a collection with null elements throws NPE
685	+	*/
686	+	public void testDescendingAddAll2() {
687	+	NavigableSet q = dset0();
688	+	Integer[] ints = new Integer[SIZE];
689	+	try {
690	+	q.addAll(Arrays.asList(ints));
691	+	shouldThrow();
692	+	} catch (NullPointerException success) {}
693	+	}
694	+
695	+	/**
696	+	* addAll of a collection with any null elements throws NPE after
697	+	* possibly adding some elements
698	+	*/
699	+	public void testDescendingAddAll3() {
700	+	NavigableSet q = dset0();
701	+	Integer[] ints = new Integer[SIZE];
702	+	for (int i = 0; i < SIZE-1; ++i)
703	+	ints[i] = new Integer(i+SIZE);
704	+	try {
705	+	q.addAll(Arrays.asList(ints));
706	+	shouldThrow();
707	+	} catch (NullPointerException success) {}
708	+	}
709	+
710	+	/**
711	+	* Set contains all elements of successful addAll
712	+	*/
713	+	public void testDescendingAddAll5() {
714	+	Integer[] empty = new Integer[0];
715	+	Integer[] ints = new Integer[SIZE];
716	+	for (int i = 0; i < SIZE; ++i)
717	+	ints[i] = new Integer(SIZE-1- i);
718	+	NavigableSet q = dset0();
719	+	assertFalse(q.addAll(Arrays.asList(empty)));
720	+	assertTrue(q.addAll(Arrays.asList(ints)));
721	+	for (int i = 0; i < SIZE; ++i)
722	+	assertEquals(new Integer(i), q.pollFirst());
723	+	}
724	+
725	+	/**
726	+	* poll succeeds unless empty
727	+	*/
728	+	public void testDescendingPoll() {
729	+	NavigableSet q = populatedSet(SIZE);
730	+	for (int i = 0; i < SIZE; ++i) {
731	+	assertEquals(i, q.pollFirst());
732	+	}
733	+	assertNull(q.pollFirst());
734	+	}
735	+
736	+	/**
737	+	* remove(x) removes x and returns true if present
738	+	*/
739	+	public void testDescendingRemoveElement() {
740	+	NavigableSet q = populatedSet(SIZE);
741	+	for (int i = 1; i < SIZE; i += 2) {
742	+	assertTrue(q.remove(new Integer(i)));
743	+	}
744	+	for (int i = 0; i < SIZE; i += 2 ) {
745	+	assertTrue(q.remove(new Integer(i)));
746	+	assertFalse(q.remove(new Integer(i+1)));
747	+	}
748	+	assertTrue(q.isEmpty());
749	+	}
750	+
751	+	/**
752	+	* contains(x) reports true when elements added but not yet removed
753	+	*/
754	+	public void testDescendingContains() {
755	+	NavigableSet q = populatedSet(SIZE);
756	+	for (int i = 0; i < SIZE; ++i) {
757	+	assertTrue(q.contains(new Integer(i)));
758	+	q.pollFirst();
759	+	assertFalse(q.contains(new Integer(i)));
760	+	}
761	+	}
762	+
763	+	/**
764	+	* clear removes all elements
765	+	*/
766	+	public void testDescendingClear() {
767	+	NavigableSet q = populatedSet(SIZE);
768	+	q.clear();
769	+	assertTrue(q.isEmpty());
770	+	assertEquals(0, q.size());
771	+	q.add(new Integer(1));
772	+	assertFalse(q.isEmpty());
773	+	q.clear();
774	+	assertTrue(q.isEmpty());
775	+	}
776	+
777	+	/**
778	+	* containsAll(c) is true when c contains a subset of elements
779	+	*/
780	+	public void testDescendingContainsAll() {
781	+	NavigableSet q = populatedSet(SIZE);
782	+	NavigableSet p = dset0();
783	+	for (int i = 0; i < SIZE; ++i) {
784	+	assertTrue(q.containsAll(p));
785	+	assertFalse(p.containsAll(q));
786	+	p.add(new Integer(i));
787	+	}
788	+	assertTrue(p.containsAll(q));
789	+	}
790	+
791	+	/**
792	+	* retainAll(c) retains only those elements of c and reports true if changed
793	+	*/
794	+	public void testDescendingRetainAll() {
795	+	NavigableSet q = populatedSet(SIZE);
796	+	NavigableSet p = populatedSet(SIZE);
797	+	for (int i = 0; i < SIZE; ++i) {
798	+	boolean changed = q.retainAll(p);
799	+	if (i == 0)
800	+	assertFalse(changed);
801	+	else
802	+	assertTrue(changed);
803	+
804	+	assertTrue(q.containsAll(p));
805	+	assertEquals(SIZE-i, q.size());
806	+	p.pollFirst();
807	+	}
808	+	}
809	+
810	+	/**
811	+	* removeAll(c) removes only those elements of c and reports true if changed
812	+	*/
813	+	public void testDescendingRemoveAll() {
814	+	for (int i = 1; i < SIZE; ++i) {
815	+	NavigableSet q = populatedSet(SIZE);
816	+	NavigableSet p = populatedSet(i);
817	+	assertTrue(q.removeAll(p));
818	+	assertEquals(SIZE-i, q.size());
819	+	for (int j = 0; j < i; ++j) {
820	+	Integer x = (Integer)(p.pollFirst());
821	+	assertFalse(q.contains(x));
822	+	}
823	+	}
824	+	}
825	+
826	+	/**
827	+	* lower returns preceding element
828	+	*/
829	+	public void testDescendingLower() {
830	+	NavigableSet q = dset5();
831	+	Object e1 = q.lower(m3);
832	+	assertEquals(m2, e1);
833	+
834	+	Object e2 = q.lower(m6);
835	+	assertEquals(m5, e2);
836	+
837	+	Object e3 = q.lower(m1);
838	+	assertNull(e3);
839	+
840	+	Object e4 = q.lower(zero);
841	+	assertNull(e4);
842	+	}
843	+
844	+	/**
845	+	* higher returns next element
846	+	*/
847	+	public void testDescendingHigher() {
848	+	NavigableSet q = dset5();
849	+	Object e1 = q.higher(m3);
850	+	assertEquals(m4, e1);
851	+
852	+	Object e2 = q.higher(zero);
853	+	assertEquals(m1, e2);
854	+
855	+	Object e3 = q.higher(m5);
856	+	assertNull(e3);
857	+
858	+	Object e4 = q.higher(m6);
859	+	assertNull(e4);
860	+	}
861	+
862	+	/**
863	+	* floor returns preceding element
864	+	*/
865	+	public void testDescendingFloor() {
866	+	NavigableSet q = dset5();
867	+	Object e1 = q.floor(m3);
868	+	assertEquals(m3, e1);
869	+
870	+	Object e2 = q.floor(m6);
871	+	assertEquals(m5, e2);
872	+
873	+	Object e3 = q.floor(m1);
874	+	assertEquals(m1, e3);
875	+
876	+	Object e4 = q.floor(zero);
877	+	assertNull(e4);
878	+	}
879	+
880	+	/**
881	+	* ceiling returns next element
882	+	*/
883	+	public void testDescendingCeiling() {
884	+	NavigableSet q = dset5();
885	+	Object e1 = q.ceiling(m3);
886	+	assertEquals(m3, e1);
887	+
888	+	Object e2 = q.ceiling(zero);
889	+	assertEquals(m1, e2);
890	+
891	+	Object e3 = q.ceiling(m5);
892	+	assertEquals(m5, e3);
893	+
894	+	Object e4 = q.ceiling(m6);
895	+	assertNull(e4);
896	+	}
897	+
898	+	/**
899	+	* toArray contains all elements
900	+	*/
901	+	public void testDescendingToArray() {
902	+	NavigableSet q = populatedSet(SIZE);
903	+	Object[] o = q.toArray();
904	+	Arrays.sort(o);
905	+	for (int i = 0; i < o.length; i++)
906	+	assertEquals(o[i], q.pollFirst());
907	+	}
908	+
909	+	/**
910	+	* toArray(a) contains all elements
911	+	*/
912	+	public void testDescendingToArray2() {
913	+	NavigableSet q = populatedSet(SIZE);
914	+	Integer[] ints = new Integer[SIZE];
915	+	assertSame(ints, q.toArray(ints));
916	+	Arrays.sort(ints);
917	+	for (int i = 0; i < ints.length; i++)
918	+	assertEquals(ints[i], q.pollFirst());
919	+	}
920	+
921	+	/**
922	+	* iterator iterates through all elements
923	+	*/
924	+	public void testDescendingIterator() {
925	+	NavigableSet q = populatedSet(SIZE);
926	+	int i = 0;
927	+	Iterator it = q.iterator();
928	+	while (it.hasNext()) {
929	+	assertTrue(q.contains(it.next()));
930	+	++i;
931	+	}
932	+	assertEquals(i, SIZE);
933	+	}
934	+
935	+	/**
936	+	* iterator of empty set has no elements
937	+	*/
938	+	public void testDescendingEmptyIterator() {
939	+	NavigableSet q = dset0();
940	+	int i = 0;
941	+	Iterator it = q.iterator();
942	+	while (it.hasNext()) {
943	+	assertTrue(q.contains(it.next()));
944	+	++i;
945	+	}
946	+	assertEquals(0, i);
947	+	}
948	+
949	+	/**
950	+	* iterator.remove removes current element
951	+	*/
952	+	public void testDescendingIteratorRemove() {
953	+	final NavigableSet q = dset0();
954	+	q.add(new Integer(2));
955	+	q.add(new Integer(1));
956	+	q.add(new Integer(3));
957	+
958	+	Iterator it = q.iterator();
959	+	it.next();
960	+	it.remove();
961	+
962	+	it = q.iterator();
963	+	assertEquals(it.next(), new Integer(2));
964	+	assertEquals(it.next(), new Integer(3));
965	+	assertFalse(it.hasNext());
966	+	}
967	+
968	+	/**
969	+	* toString contains toStrings of elements
970	+	*/
971	+	public void testDescendingToString() {
972	+	NavigableSet q = populatedSet(SIZE);
973	+	String s = q.toString();
974	+	for (int i = 0; i < SIZE; ++i) {
975	+	assertTrue(s.contains(String.valueOf(i)));
976	+	}
977	+	}
978	+
979	+	/**
980	+	* A deserialized serialized set has same elements
981	+	*/
982	+	public void testDescendingSerialization() throws Exception {
983	+	NavigableSet x = dset5();
984	+	NavigableSet y = serialClone(x);
985	+
986	+	assertNotSame(y, x);
987	+	assertEquals(x.size(), y.size());
988	+	assertEquals(x, y);
989	+	assertEquals(y, x);
990	+	while (!x.isEmpty()) {
991	+	assertFalse(y.isEmpty());
992	+	assertEquals(x.pollFirst(), y.pollFirst());
993	+	}
994	+	assertTrue(y.isEmpty());
995	+	}
996	+
997	+	/**
998	+	* subSet returns set with keys in requested range
999	+	*/
1000	+	public void testDescendingSubSetContents() {
1001	+	NavigableSet set = dset5();
1002	+	SortedSet sm = set.subSet(m2, m4);
1003	+	assertEquals(m2, sm.first());
1004	+	assertEquals(m3, sm.last());
1005	+	assertEquals(2, sm.size());
1006	+	assertFalse(sm.contains(m1));
1007	+	assertTrue(sm.contains(m2));
1008	+	assertTrue(sm.contains(m3));
1009	+	assertFalse(sm.contains(m4));
1010	+	assertFalse(sm.contains(m5));
1011	+	Iterator i = sm.iterator();
1012	+	Object k;
1013	+	k = (Integer)(i.next());
1014	+	assertEquals(m2, k);
1015	+	k = (Integer)(i.next());
1016	+	assertEquals(m3, k);
1017	+	assertFalse(i.hasNext());
1018	+	Iterator j = sm.iterator();
1019	+	j.next();
1020	+	j.remove();
1021	+	assertFalse(set.contains(m2));
1022	+	assertEquals(4, set.size());
1023	+	assertEquals(1, sm.size());
1024	+	assertEquals(m3, sm.first());
1025	+	assertEquals(m3, sm.last());
1026	+	assertTrue(sm.remove(m3));
1027	+	assertTrue(sm.isEmpty());
1028	+	assertEquals(3, set.size());
1029	+	}
1030	+
1031	+	public void testDescendingSubSetContents2() {
1032	+	NavigableSet set = dset5();
1033	+	SortedSet sm = set.subSet(m2, m3);
1034	+	assertEquals(1, sm.size());
1035	+	assertEquals(m2, sm.first());
1036	+	assertEquals(m2, sm.last());
1037	+	assertFalse(sm.contains(m1));
1038	+	assertTrue(sm.contains(m2));
1039	+	assertFalse(sm.contains(m3));
1040	+	assertFalse(sm.contains(m4));
1041	+	assertFalse(sm.contains(m5));
1042	+	Iterator i = sm.iterator();
1043	+	Object k;
1044	+	k = (Integer)(i.next());
1045	+	assertEquals(m2, k);
1046	+	assertFalse(i.hasNext());
1047	+	Iterator j = sm.iterator();
1048	+	j.next();
1049	+	j.remove();
1050	+	assertFalse(set.contains(m2));
1051	+	assertEquals(4, set.size());
1052	+	assertEquals(0, sm.size());
1053	+	assertTrue(sm.isEmpty());
1054	+	assertFalse(sm.remove(m3));
1055	+	assertEquals(4, set.size());
1056	+	}
1057	+
1058	+	/**
1059	+	* headSet returns set with keys in requested range
1060	+	*/
1061	+	public void testDescendingHeadSetContents() {
1062	+	NavigableSet set = dset5();
1063	+	SortedSet sm = set.headSet(m4);
1064	+	assertTrue(sm.contains(m1));
1065	+	assertTrue(sm.contains(m2));
1066	+	assertTrue(sm.contains(m3));
1067	+	assertFalse(sm.contains(m4));
1068	+	assertFalse(sm.contains(m5));
1069	+	Iterator i = sm.iterator();
1070	+	Object k;
1071	+	k = (Integer)(i.next());
1072	+	assertEquals(m1, k);
1073	+	k = (Integer)(i.next());
1074	+	assertEquals(m2, k);
1075	+	k = (Integer)(i.next());
1076	+	assertEquals(m3, k);
1077	+	assertFalse(i.hasNext());
1078	+	sm.clear();
1079	+	assertTrue(sm.isEmpty());
1080	+	assertEquals(2, set.size());
1081	+	assertEquals(m4, set.first());
1082	+	}
1083	+
1084	+	/**
1085	+	* tailSet returns set with keys in requested range
1086	+	*/
1087	+	public void testDescendingTailSetContents() {
1088	+	NavigableSet set = dset5();
1089	+	SortedSet sm = set.tailSet(m2);
1090	+	assertFalse(sm.contains(m1));
1091	+	assertTrue(sm.contains(m2));
1092	+	assertTrue(sm.contains(m3));
1093	+	assertTrue(sm.contains(m4));
1094	+	assertTrue(sm.contains(m5));
1095	+	Iterator i = sm.iterator();
1096	+	Object k;
1097	+	k = (Integer)(i.next());
1098	+	assertEquals(m2, k);
1099	+	k = (Integer)(i.next());
1100	+	assertEquals(m3, k);
1101	+	k = (Integer)(i.next());
1102	+	assertEquals(m4, k);
1103	+	k = (Integer)(i.next());
1104	+	assertEquals(m5, k);
1105	+	assertFalse(i.hasNext());
1106	+
1107	+	SortedSet ssm = sm.tailSet(m4);
1108	+	assertEquals(m4, ssm.first());
1109	+	assertEquals(m5, ssm.last());
1110	+	assertTrue(ssm.remove(m4));
1111	+	assertEquals(1, ssm.size());
1112	+	assertEquals(3, sm.size());
1113	+	assertEquals(4, set.size());
1114		}
1115
1116		}

Diff Legend

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