ViewVC Help

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

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

Comparing jsr166/src/test/tck/TreeSubSetTest.java (file contents):
Revision 1.1 by dl, Thu Mar 31 15:24:29 2005 UTC vs.
Revision 1.8 by jsr166, Sat Nov 21 02:07:27 2009 UTC

#	Line 11 | Line 11 | import java.io.*;
11
12		public class TreeSubSetTest extends JSR166TestCase {
13		public static void main(String[] args) {
14	<	junit.textui.TestRunner.run (suite());
14	>	junit.textui.TestRunner.run (suite());
15		}
16		public static Test suite() {
17	<	return new TestSuite(TreeSubSetTest.class);
17	>	return new TestSuite(TreeSubSetTest.class);
18		}
19
20	<	static class MyReverseComparator implements Comparator {
20	>	static class MyReverseComparator implements Comparator {
21		public int compare(Object x, Object y) {
22		int i = ((Integer)x).intValue();
23		int j = ((Integer)y).intValue();
#	Line 35 | Line 35 | public class TreeSubSetTest extends JSR1
35		TreeSet q = new TreeSet();
36		assertTrue(q.isEmpty());
37
38	<	for(int i = n-1; i >= 0; i-=2)
39	<	assertTrue(q.add(new Integer(i)));
40	<	for(int i = (n & 1); i < n; i+=2)
41	<	assertTrue(q.add(new Integer(i)));
38	>	for (int i = n-1; i >= 0; i-=2)
39	>	assertTrue(q.add(new Integer(i)));
40	>	for (int i = (n & 1); i < n; i+=2)
41	>	assertTrue(q.add(new Integer(i)));
42		assertTrue(q.add(new Integer(-n)));
43		assertTrue(q.add(new Integer(n)));
44	<	NavigableSet s = q.navigableSubSet(new Integer(0), new Integer(n));
44	>	NavigableSet s = q.subSet(new Integer(0), true, new Integer(n), false);
45		assertFalse(s.isEmpty());
46	<	assertEquals(n, s.size());
46	>	assertEquals(n, s.size());
47		return s;
48		}
49
#	Line 60 | Line 60 | public class TreeSubSetTest extends JSR1
60		q.add(five);
61		q.add(zero);
62		q.add(seven);
63	<	NavigableSet s = q.navigableSubSet(one, seven);
64	<	assertEquals(5, s.size());
63	>	NavigableSet s = q.subSet(one, true, seven, false);
64	>	assertEquals(5, s.size());
65		return s;
66		}
67
68	<	private static NavigableSet set0() {
69	<	TreeSet set = new TreeSet();
68	>	private NavigableSet dset5() {
69	>	TreeSet q = new TreeSet();
70	>	assertTrue(q.isEmpty());
71	>	q.add(m1);
72	>	q.add(m2);
73	>	q.add(m3);
74	>	q.add(m4);
75	>	q.add(m5);
76	>	NavigableSet s = q.descendingSet();
77	>	assertEquals(5, s.size());
78	>	return s;
79	>	}
80	>
81	>	private static NavigableSet set0() {
82	>	TreeSet set = new TreeSet();
83	>	assertTrue(set.isEmpty());
84	>	return set.tailSet(m1, false);
85	>	}
86	>
87	>	private static NavigableSet dset0() {
88	>	TreeSet set = new TreeSet();
89		assertTrue(set.isEmpty());
90	<	return set.navigableTailSet(m1);
90	>	return set;
91		}
92	<
92	>
93		/**
94		* A new set has unbounded capacity
95		*/
#	Line 112 | Line 131 | public class TreeSubSetTest extends JSR1
131		* add(null) throws NPE
132		*/
133		public void testAddNull() {
134	<	try {
134	>	try {
135		NavigableSet q = set0();
136		q.add(null);
137		shouldThrow();
138	<	} catch (NullPointerException success) { }
138	>	} catch (NullPointerException success) {}
139		}
140
141		/**
#	Line 146 | Line 165 | public class TreeSubSetTest extends JSR1
165		q.add(new Object());
166		q.add(new Object());
167		shouldThrow();
168	<	}
150	<	catch(ClassCastException success) {}
168	>	} catch (ClassCastException success) {}
169		}
170
171
#	Line 159 | Line 177 | public class TreeSubSetTest extends JSR1
177		NavigableSet q = set0();
178		q.addAll(null);
179		shouldThrow();
180	<	}
163	<	catch (NullPointerException success) {}
180	>	} catch (NullPointerException success) {}
181		}
182		/**
183		* addAll of a collection with null elements throws NPE
#	Line 171 | Line 188 | public class TreeSubSetTest extends JSR1
188		Integer[] ints = new Integer[SIZE];
189		q.addAll(Arrays.asList(ints));
190		shouldThrow();
191	<	}
175	<	catch (NullPointerException success) {}
191	>	} catch (NullPointerException success) {}
192		}
193		/**
194		* addAll of a collection with any null elements throws NPE after
#	Line 186 | Line 202 | public class TreeSubSetTest extends JSR1
202		ints[i] = new Integer(i+SIZE);
203		q.addAll(Arrays.asList(ints));
204		shouldThrow();
205	<	}
190	<	catch (NullPointerException success) {}
205	>	} catch (NullPointerException success) {}
206		}
207
208		/**
#	Line 216 | Line 231 | public class TreeSubSetTest extends JSR1
231		for (int i = 0; i < SIZE; ++i) {
232		assertEquals(i, ((Integer)q.pollFirst()).intValue());
233		}
234	<	assertNull(q.pollFirst());
234	>	assertNull(q.pollFirst());
235		}
236
237		/**
#	Line 233 | Line 248 | public class TreeSubSetTest extends JSR1
248		}
249		assertTrue(q.isEmpty());
250		}
251	<
251	>
252		/**
253		* contains(x) reports true when elements added but not yet removed
254		*/
#	Line 309 | Line 324 | public class TreeSubSetTest extends JSR1
324		}
325		}
326
327	<
327	>
328
329		/**
330		* lower returns preceding element
#	Line 392 | Line 407 | public class TreeSubSetTest extends JSR1
407		*/
408		public void testToArray() {
409		NavigableSet q = populatedSet(SIZE);
410	<	Object[] o = q.toArray();
410	>	Object[] o = q.toArray();
411		Arrays.sort(o);
412	<	for(int i = 0; i < o.length; i++)
413	<	assertEquals(o[i], q.pollFirst());
412	>	for (int i = 0; i < o.length; i++)
413	>	assertEquals(o[i], q.pollFirst());
414		}
415
416		/**
#	Line 403 | Line 418 | public class TreeSubSetTest extends JSR1
418		*/
419		public void testToArray2() {
420		NavigableSet q = populatedSet(SIZE);
421	<	Integer[] ints = new Integer[SIZE];
422	<	ints = (Integer[])q.toArray(ints);
421	>	Integer[] ints = new Integer[SIZE];
422	>	ints = (Integer[])q.toArray(ints);
423		Arrays.sort(ints);
424	<	for(int i = 0; i < ints.length; i++)
424	>	for (int i = 0; i < ints.length; i++)
425		assertEquals(ints[i], q.pollFirst());
426		}
427	<
427	>
428		/**
429		* iterator iterates through all elements
430		*/
431		public void testIterator() {
432		NavigableSet q = populatedSet(SIZE);
433		int i = 0;
434	<	Iterator it = q.iterator();
435	<	while(it.hasNext()) {
434	>	Iterator it = q.iterator();
435	>	while (it.hasNext()) {
436		assertTrue(q.contains(it.next()));
437		++i;
438		}
#	Line 430 | Line 445 | public class TreeSubSetTest extends JSR1
445		public void testEmptyIterator() {
446		NavigableSet q = set0();
447		int i = 0;
448	<	Iterator it = q.iterator();
449	<	while(it.hasNext()) {
448	>	Iterator it = q.iterator();
449	>	while (it.hasNext()) {
450		assertTrue(q.contains(it.next()));
451		++i;
452		}
#	Line 467 | Line 482 | public class TreeSubSetTest extends JSR1
482		for (int i = 0; i < SIZE; ++i) {
483		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
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() {
490	>	public void testSerialization() throws Exception {
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();
501	<	assertEquals(q.size(), r.size());
502	<	while (!q.isEmpty())
488	<	assertEquals(q.pollFirst(), r.pollFirst());
489	<	} catch(Exception e){
490	<	e.printStackTrace();
491	<	unexpectedException();
492	<	}
492	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
493	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
494	>	out.writeObject(q);
495	>	out.close();
496	>
497	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
498	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
499	>	NavigableSet r = (NavigableSet)in.readObject();
500	>	assertEquals(q.size(), r.size());
501	>	while (!q.isEmpty())
502	>	assertEquals(q.pollFirst(), r.pollFirst());
503		}
504
505		/**
#	Line 609 | Line 619 | public class TreeSubSetTest extends JSR1
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 of comparable element succeeds
641	+	*/
642	+	public void testDescendingAdd() {
643	+	NavigableSet q = dset0();
644	+	assertTrue(q.add(m6));
645	+	}
646	+
647	+	/**
648	+	* Add of duplicate element fails
649	+	*/
650	+	public void testDescendingAddDup() {
651	+	NavigableSet q = dset0();
652	+	assertTrue(q.add(m6));
653	+	assertFalse(q.add(m6));
654	+	}
655	+
656	+	/**
657	+	* Add of non-Comparable throws CCE
658	+	*/
659	+	public void testDescendingAddNonComparable() {
660	+	try {
661	+	NavigableSet q = dset0();
662	+	q.add(new Object());
663	+	q.add(new Object());
664	+	q.add(new Object());
665	+	shouldThrow();
666	+	} catch (ClassCastException success) {}
667	+	}
668	+
669	+
670	+	/**
671	+	* addAll(null) throws NPE
672	+	*/
673	+	public void testDescendingAddAll1() {
674	+	try {
675	+	NavigableSet q = dset0();
676	+	q.addAll(null);
677	+	shouldThrow();
678	+	} catch (NullPointerException success) {}
679	+	}
680	+	/**
681	+	* addAll of a collection with null elements throws NPE
682	+	*/
683	+	public void testDescendingAddAll2() {
684	+	try {
685	+	NavigableSet q = dset0();
686	+	Integer[] ints = new Integer[SIZE];
687	+	q.addAll(Arrays.asList(ints));
688	+	shouldThrow();
689	+	} catch (NullPointerException success) {}
690	+	}
691	+	/**
692	+	* addAll of a collection with any null elements throws NPE after
693	+	* possibly adding some elements
694	+	*/
695	+	public void testDescendingAddAll3() {
696	+	try {
697	+	NavigableSet q = dset0();
698	+	Integer[] ints = new Integer[SIZE];
699	+	for (int i = 0; i < SIZE-1; ++i)
700	+	ints[i] = new Integer(i+SIZE);
701	+	q.addAll(Arrays.asList(ints));
702	+	shouldThrow();
703	+	} catch (NullPointerException success) {}
704	+	}
705	+
706	+	/**
707	+	* Set contains all elements of successful addAll
708	+	*/
709	+	public void testDescendingAddAll5() {
710	+	Integer[] empty = new Integer[0];
711	+	Integer[] ints = new Integer[SIZE];
712	+	for (int i = 0; i < SIZE; ++i)
713	+	ints[i] = new Integer(SIZE-1- i);
714	+	NavigableSet q = dset0();
715	+	assertFalse(q.addAll(Arrays.asList(empty)));
716	+	assertTrue(q.addAll(Arrays.asList(ints)));
717	+	for (int i = 0; i < SIZE; ++i)
718	+	assertEquals(new Integer(i), q.pollFirst());
719	+	}
720	+
721	+	/**
722	+	* poll succeeds unless empty
723	+	*/
724	+	public void testDescendingPoll() {
725	+	NavigableSet q = populatedSet(SIZE);
726	+	for (int i = 0; i < SIZE; ++i) {
727	+	assertEquals(i, ((Integer)q.pollFirst()).intValue());
728	+	}
729	+	assertNull(q.pollFirst());
730	+	}
731	+
732	+	/**
733	+	* remove(x) removes x and returns true if present
734	+	*/
735	+	public void testDescendingRemoveElement() {
736	+	NavigableSet q = populatedSet(SIZE);
737	+	for (int i = 1; i < SIZE; i+=2) {
738	+	assertTrue(q.remove(new Integer(i)));
739	+	}
740	+	for (int i = 0; i < SIZE; i+=2) {
741	+	assertTrue(q.remove(new Integer(i)));
742	+	assertFalse(q.remove(new Integer(i+1)));
743	+	}
744	+	assertTrue(q.isEmpty());
745	+	}
746	+
747	+	/**
748	+	* contains(x) reports true when elements added but not yet removed
749	+	*/
750	+	public void testDescendingContains() {
751	+	NavigableSet q = populatedSet(SIZE);
752	+	for (int i = 0; i < SIZE; ++i) {
753	+	assertTrue(q.contains(new Integer(i)));
754	+	q.pollFirst();
755	+	assertFalse(q.contains(new Integer(i)));
756	+	}
757	+	}
758	+
759	+	/**
760	+	* clear removes all elements
761	+	*/
762	+	public void testDescendingClear() {
763	+	NavigableSet q = populatedSet(SIZE);
764	+	q.clear();
765	+	assertTrue(q.isEmpty());
766	+	assertEquals(0, q.size());
767	+	q.add(new Integer(1));
768	+	assertFalse(q.isEmpty());
769	+	q.clear();
770	+	assertTrue(q.isEmpty());
771	+	}
772	+
773	+	/**
774	+	* containsAll(c) is true when c contains a subset of elements
775	+	*/
776	+	public void testDescendingContainsAll() {
777	+	NavigableSet q = populatedSet(SIZE);
778	+	NavigableSet p = dset0();
779	+	for (int i = 0; i < SIZE; ++i) {
780	+	assertTrue(q.containsAll(p));
781	+	assertFalse(p.containsAll(q));
782	+	p.add(new Integer(i));
783	+	}
784	+	assertTrue(p.containsAll(q));
785	+	}
786	+
787	+	/**
788	+	* retainAll(c) retains only those elements of c and reports true if changed
789	+	*/
790	+	public void testDescendingRetainAll() {
791	+	NavigableSet q = populatedSet(SIZE);
792	+	NavigableSet p = populatedSet(SIZE);
793	+	for (int i = 0; i < SIZE; ++i) {
794	+	boolean changed = q.retainAll(p);
795	+	if (i == 0)
796	+	assertFalse(changed);
797	+	else
798	+	assertTrue(changed);
799	+
800	+	assertTrue(q.containsAll(p));
801	+	assertEquals(SIZE-i, q.size());
802	+	p.pollFirst();
803	+	}
804	+	}
805	+
806	+	/**
807	+	* removeAll(c) removes only those elements of c and reports true if changed
808	+	*/
809	+	public void testDescendingRemoveAll() {
810	+	for (int i = 1; i < SIZE; ++i) {
811	+	NavigableSet q = populatedSet(SIZE);
812	+	NavigableSet p = populatedSet(i);
813	+	assertTrue(q.removeAll(p));
814	+	assertEquals(SIZE-i, q.size());
815	+	for (int j = 0; j < i; ++j) {
816	+	Integer I = (Integer)(p.pollFirst());
817	+	assertFalse(q.contains(I));
818	+	}
819	+	}
820	+	}
821	+
822	+
823	+
824	+	/**
825	+	* lower returns preceding element
826	+	*/
827	+	public void testDescendingLower() {
828	+	NavigableSet q = dset5();
829	+	Object e1 = q.lower(m3);
830	+	assertEquals(m2, e1);
831	+
832	+	Object e2 = q.lower(m6);
833	+	assertEquals(m5, e2);
834	+
835	+	Object e3 = q.lower(m1);
836	+	assertNull(e3);
837	+
838	+	Object e4 = q.lower(zero);
839	+	assertNull(e4);
840	+
841	+	}
842	+
843	+	/**
844	+	* higher returns next element
845	+	*/
846	+	public void testDescendingHigher() {
847	+	NavigableSet q = dset5();
848	+	Object e1 = q.higher(m3);
849	+	assertEquals(m4, e1);
850	+
851	+	Object e2 = q.higher(zero);
852	+	assertEquals(m1, e2);
853	+
854	+	Object e3 = q.higher(m5);
855	+	assertNull(e3);
856	+
857	+	Object e4 = q.higher(m6);
858	+	assertNull(e4);
859	+
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	+	/**
882	+	* ceiling returns next element
883	+	*/
884	+	public void testDescendingCeiling() {
885	+	NavigableSet q = dset5();
886	+	Object e1 = q.ceiling(m3);
887	+	assertEquals(m3, e1);
888	+
889	+	Object e2 = q.ceiling(zero);
890	+	assertEquals(m1, e2);
891	+
892	+	Object e3 = q.ceiling(m5);
893	+	assertEquals(m5, e3);
894	+
895	+	Object e4 = q.ceiling(m6);
896	+	assertNull(e4);
897	+
898	+	}
899	+
900	+	/**
901	+	* toArray contains all elements
902	+	*/
903	+	public void testDescendingToArray() {
904	+	NavigableSet q = populatedSet(SIZE);
905	+	Object[] o = q.toArray();
906	+	Arrays.sort(o);
907	+	for (int i = 0; i < o.length; i++)
908	+	assertEquals(o[i], q.pollFirst());
909	+	}
910	+
911	+	/**
912	+	* toArray(a) contains all elements
913	+	*/
914	+	public void testDescendingToArray2() {
915	+	NavigableSet q = populatedSet(SIZE);
916	+	Integer[] ints = new Integer[SIZE];
917	+	ints = (Integer[])q.toArray(ints);
918	+	Arrays.sort(ints);
919	+	for (int i = 0; i < ints.length; i++)
920	+	assertEquals(ints[i], q.pollFirst());
921	+	}
922	+
923	+	/**
924	+	* iterator iterates through all elements
925	+	*/
926	+	public void testDescendingIterator() {
927	+	NavigableSet q = populatedSet(SIZE);
928	+	int i = 0;
929	+	Iterator it = q.iterator();
930	+	while (it.hasNext()) {
931	+	assertTrue(q.contains(it.next()));
932	+	++i;
933	+	}
934	+	assertEquals(i, SIZE);
935	+	}
936	+
937	+	/**
938	+	* iterator of empty set has no elements
939	+	*/
940	+	public void testDescendingEmptyIterator() {
941	+	NavigableSet q = dset0();
942	+	int i = 0;
943	+	Iterator it = q.iterator();
944	+	while (it.hasNext()) {
945	+	assertTrue(q.contains(it.next()));
946	+	++i;
947	+	}
948	+	assertEquals(i, 0);
949	+	}
950	+
951	+	/**
952	+	* iterator.remove removes current element
953	+	*/
954	+	public void testDescendingIteratorRemove () {
955	+	final NavigableSet q = dset0();
956	+	q.add(new Integer(2));
957	+	q.add(new Integer(1));
958	+	q.add(new Integer(3));
959	+
960	+	Iterator it = q.iterator();
961	+	it.next();
962	+	it.remove();
963	+
964	+	it = q.iterator();
965	+	assertEquals(it.next(), new Integer(2));
966	+	assertEquals(it.next(), new Integer(3));
967	+	assertFalse(it.hasNext());
968	+	}
969	+
970	+
971	+	/**
972	+	* toString contains toStrings of elements
973	+	*/
974	+	public void testDescendingToString() {
975	+	NavigableSet q = populatedSet(SIZE);
976	+	String s = q.toString();
977	+	for (int i = 0; i < SIZE; ++i) {
978	+	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
979	+	}
980	+	}
981	+
982	+	/**
983	+	* A deserialized serialized set has same elements
984	+	*/
985	+	public void testDescendingSerialization() throws Exception {
986	+	NavigableSet q = populatedSet(SIZE);
987	+	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
988	+	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
989	+	out.writeObject(q);
990	+	out.close();
991	+
992	+	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
993	+	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
994	+	NavigableSet r = (NavigableSet)in.readObject();
995	+	assertEquals(q.size(), r.size());
996	+	while (!q.isEmpty())
997	+	assertEquals(q.pollFirst(), r.pollFirst());
998	+	}
999	+
1000	+	/**
1001	+	* subSet returns set with keys in requested range
1002	+	*/
1003	+	public void testDescendingSubSetContents() {
1004	+	NavigableSet set = dset5();
1005	+	SortedSet sm = set.subSet(m2, m4);
1006	+	assertEquals(m2, sm.first());
1007	+	assertEquals(m3, sm.last());
1008	+	assertEquals(2, sm.size());
1009	+	assertFalse(sm.contains(m1));
1010	+	assertTrue(sm.contains(m2));
1011	+	assertTrue(sm.contains(m3));
1012	+	assertFalse(sm.contains(m4));
1013	+	assertFalse(sm.contains(m5));
1014	+	Iterator i = sm.iterator();
1015	+	Object k;
1016	+	k = (Integer)(i.next());
1017	+	assertEquals(m2, k);
1018	+	k = (Integer)(i.next());
1019	+	assertEquals(m3, k);
1020	+	assertFalse(i.hasNext());
1021	+	Iterator j = sm.iterator();
1022	+	j.next();
1023	+	j.remove();
1024	+	assertFalse(set.contains(m2));
1025	+	assertEquals(4, set.size());
1026	+	assertEquals(1, sm.size());
1027	+	assertEquals(m3, sm.first());
1028	+	assertEquals(m3, sm.last());
1029	+	assertTrue(sm.remove(m3));
1030	+	assertTrue(sm.isEmpty());
1031	+	assertEquals(3, set.size());
1032	+	}
1033	+
1034	+	public void testDescendingSubSetContents2() {
1035	+	NavigableSet set = dset5();
1036	+	SortedSet sm = set.subSet(m2, m3);
1037	+	assertEquals(1, sm.size());
1038	+	assertEquals(m2, sm.first());
1039	+	assertEquals(m2, sm.last());
1040	+	assertFalse(sm.contains(m1));
1041	+	assertTrue(sm.contains(m2));
1042	+	assertFalse(sm.contains(m3));
1043	+	assertFalse(sm.contains(m4));
1044	+	assertFalse(sm.contains(m5));
1045	+	Iterator i = sm.iterator();
1046	+	Object k;
1047	+	k = (Integer)(i.next());
1048	+	assertEquals(m2, k);
1049	+	assertFalse(i.hasNext());
1050	+	Iterator j = sm.iterator();
1051	+	j.next();
1052	+	j.remove();
1053	+	assertFalse(set.contains(m2));
1054	+	assertEquals(4, set.size());
1055	+	assertEquals(0, sm.size());
1056	+	assertTrue(sm.isEmpty());
1057	+	assertFalse(sm.remove(m3));
1058	+	assertEquals(4, set.size());
1059	+	}
1060	+
1061	+	/**
1062	+	* headSet returns set with keys in requested range
1063	+	*/
1064	+	public void testDescendingHeadSetContents() {
1065	+	NavigableSet set = dset5();
1066	+	SortedSet sm = set.headSet(m4);
1067	+	assertTrue(sm.contains(m1));
1068	+	assertTrue(sm.contains(m2));
1069	+	assertTrue(sm.contains(m3));
1070	+	assertFalse(sm.contains(m4));
1071	+	assertFalse(sm.contains(m5));
1072	+	Iterator i = sm.iterator();
1073	+	Object k;
1074	+	k = (Integer)(i.next());
1075	+	assertEquals(m1, k);
1076	+	k = (Integer)(i.next());
1077	+	assertEquals(m2, k);
1078	+	k = (Integer)(i.next());
1079	+	assertEquals(m3, k);
1080	+	assertFalse(i.hasNext());
1081	+	sm.clear();
1082	+	assertTrue(sm.isEmpty());
1083	+	assertEquals(2, set.size());
1084	+	assertEquals(m4, set.first());
1085	+	}
1086	+
1087	+	/**
1088	+	* tailSet returns set with keys in requested range
1089	+	*/
1090	+	public void testDescendingTailSetContents() {
1091	+	NavigableSet set = dset5();
1092	+	SortedSet sm = set.tailSet(m2);
1093	+	assertFalse(sm.contains(m1));
1094	+	assertTrue(sm.contains(m2));
1095	+	assertTrue(sm.contains(m3));
1096	+	assertTrue(sm.contains(m4));
1097	+	assertTrue(sm.contains(m5));
1098	+	Iterator i = sm.iterator();
1099	+	Object k;
1100	+	k = (Integer)(i.next());
1101	+	assertEquals(m2, k);
1102	+	k = (Integer)(i.next());
1103	+	assertEquals(m3, k);
1104	+	k = (Integer)(i.next());
1105	+	assertEquals(m4, k);
1106	+	k = (Integer)(i.next());
1107	+	assertEquals(m5, k);
1108	+	assertFalse(i.hasNext());
1109	+
1110	+	SortedSet ssm = sm.tailSet(m4);
1111	+	assertEquals(m4, ssm.first());
1112	+	assertEquals(m5, ssm.last());
1113	+	assertTrue(ssm.remove(m4));
1114	+	assertEquals(1, ssm.size());
1115	+	assertEquals(3, sm.size());
1116	+	assertEquals(4, set.size());
1117		}
1118
1119		}

Diff Legend

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