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.11 by jsr166, Tue Dec 1 09:43:19 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();
24	<	if (i < j) return 1;
25	<	if (i > j) return -1;
26	<	return 0;
22	>	return ((Comparable)y).compareTo(x);
23		}
24		}
25
#	Line 35 | Line 31 | public class TreeSubSetTest extends JSR1
31		TreeSet q = new TreeSet();
32		assertTrue(q.isEmpty());
33
34	<	for(int i = n-1; i >= 0; i-=2)
35	<	assertTrue(q.add(new Integer(i)));
36	<	for(int i = (n & 1); i < n; i+=2)
37	<	assertTrue(q.add(new Integer(i)));
34	>	for (int i = n-1; i >= 0; i-=2)
35	>	assertTrue(q.add(new Integer(i)));
36	>	for (int i = (n & 1); i < n; i+=2)
37	>	assertTrue(q.add(new Integer(i)));
38		assertTrue(q.add(new Integer(-n)));
39		assertTrue(q.add(new Integer(n)));
40	<	NavigableSet s = q.navigableSubSet(new Integer(0), new Integer(n));
40	>	NavigableSet s = q.subSet(new Integer(0), true, new Integer(n), false);
41		assertFalse(s.isEmpty());
42	<	assertEquals(n, s.size());
42	>	assertEquals(n, s.size());
43		return s;
44		}
45
#	Line 60 | Line 56 | public class TreeSubSetTest extends JSR1
56		q.add(five);
57		q.add(zero);
58		q.add(seven);
59	<	NavigableSet s = q.navigableSubSet(one, seven);
60	<	assertEquals(5, s.size());
59	>	NavigableSet s = q.subSet(one, true, seven, false);
60	>	assertEquals(5, s.size());
61		return s;
62		}
63
64	<	private static NavigableSet set0() {
65	<	TreeSet set = new TreeSet();
64	>	private NavigableSet dset5() {
65	>	TreeSet q = new TreeSet();
66	>	assertTrue(q.isEmpty());
67	>	q.add(m1);
68	>	q.add(m2);
69	>	q.add(m3);
70	>	q.add(m4);
71	>	q.add(m5);
72	>	NavigableSet s = q.descendingSet();
73	>	assertEquals(5, s.size());
74	>	return s;
75	>	}
76	>
77	>	private static NavigableSet set0() {
78	>	TreeSet set = new TreeSet();
79	>	assertTrue(set.isEmpty());
80	>	return set.tailSet(m1, false);
81	>	}
82	>
83	>	private static NavigableSet dset0() {
84	>	TreeSet set = new TreeSet();
85		assertTrue(set.isEmpty());
86	<	return set.navigableTailSet(m1);
86	>	return set;
87		}
88	<
88	>
89		/**
90		* A new set has unbounded capacity
91		*/
#	Line 85 | Line 100 | public class TreeSubSetTest extends JSR1
100		public void testEmpty() {
101		NavigableSet q = set0();
102		assertTrue(q.isEmpty());
103	<	q.add(new Integer(1));
103	>	assertTrue(q.add(new Integer(1)));
104		assertFalse(q.isEmpty());
105	<	q.add(new Integer(2));
105	>	assertTrue(q.add(new Integer(2)));
106		q.pollFirst();
107		q.pollFirst();
108		assertTrue(q.isEmpty());
#	Line 112 | Line 127 | public class TreeSubSetTest extends JSR1
127		* add(null) throws NPE
128		*/
129		public void testAddNull() {
130	<	try {
130	>	try {
131		NavigableSet q = set0();
132		q.add(null);
133		shouldThrow();
134	<	} catch (NullPointerException success) { }
134	>	} catch (NullPointerException success) {}
135		}
136
137		/**
#	Line 146 | Line 161 | public class TreeSubSetTest extends JSR1
161		q.add(new Object());
162		q.add(new Object());
163		shouldThrow();
164	<	}
150	<	catch(ClassCastException success) {}
164	>	} catch (ClassCastException success) {}
165		}
166
167
#	Line 159 | Line 173 | public class TreeSubSetTest extends JSR1
173		NavigableSet q = set0();
174		q.addAll(null);
175		shouldThrow();
176	<	}
163	<	catch (NullPointerException success) {}
176	>	} catch (NullPointerException success) {}
177		}
178		/**
179		* addAll of a collection with null elements throws NPE
#	Line 171 | Line 184 | public class TreeSubSetTest extends JSR1
184		Integer[] ints = new Integer[SIZE];
185		q.addAll(Arrays.asList(ints));
186		shouldThrow();
187	<	}
175	<	catch (NullPointerException success) {}
187	>	} catch (NullPointerException success) {}
188		}
189		/**
190		* addAll of a collection with any null elements throws NPE after
#	Line 186 | Line 198 | public class TreeSubSetTest extends JSR1
198		ints[i] = new Integer(i+SIZE);
199		q.addAll(Arrays.asList(ints));
200		shouldThrow();
201	<	}
190	<	catch (NullPointerException success) {}
201	>	} catch (NullPointerException success) {}
202		}
203
204		/**
205		* Set contains all elements of successful addAll
206		*/
207		public void testAddAll5() {
208	<	try {
209	<	Integer[] empty = new Integer[0];
210	<	Integer[] ints = new Integer[SIZE];
211	<	for (int i = 0; i < SIZE; ++i)
212	<	ints[i] = new Integer(SIZE-1- i);
213	<	NavigableSet q = set0();
214	<	assertFalse(q.addAll(Arrays.asList(empty)));
215	<	assertTrue(q.addAll(Arrays.asList(ints)));
216	<	for (int i = 0; i < SIZE; ++i)
206	<	assertEquals(new Integer(i), q.pollFirst());
207	<	}
208	<	finally {}
208	>	Integer[] empty = new Integer[0];
209	>	Integer[] ints = new Integer[SIZE];
210	>	for (int i = 0; i < SIZE; ++i)
211	>	ints[i] = new Integer(SIZE-1- i);
212	>	NavigableSet q = set0();
213	>	assertFalse(q.addAll(Arrays.asList(empty)));
214	>	assertTrue(q.addAll(Arrays.asList(ints)));
215	>	for (int i = 0; i < SIZE; ++i)
216	>	assertEquals(new Integer(i), q.pollFirst());
217		}
218
219		/**
#	Line 214 | Line 222 | public class TreeSubSetTest extends JSR1
222		public void testPoll() {
223		NavigableSet q = populatedSet(SIZE);
224		for (int i = 0; i < SIZE; ++i) {
225	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
225	>	assertEquals(i, q.pollFirst());
226		}
227	<	assertNull(q.pollFirst());
227	>	assertNull(q.pollFirst());
228		}
229
230		/**
#	Line 233 | Line 241 | public class TreeSubSetTest extends JSR1
241		}
242		assertTrue(q.isEmpty());
243		}
244	<
244	>
245		/**
246		* contains(x) reports true when elements added but not yet removed
247		*/
#	Line 254 | Line 262 | public class TreeSubSetTest extends JSR1
262		q.clear();
263		assertTrue(q.isEmpty());
264		assertEquals(0, q.size());
265	<	q.add(new Integer(1));
265	>	assertTrue(q.add(new Integer(1)));
266		assertFalse(q.isEmpty());
267		q.clear();
268		assertTrue(q.isEmpty());
#	Line 309 | Line 317 | public class TreeSubSetTest extends JSR1
317		}
318		}
319
320	<
320	>
321
322		/**
323		* lower returns preceding element
#	Line 327 | Line 335 | public class TreeSubSetTest extends JSR1
335
336		Object e4 = q.lower(zero);
337		assertNull(e4);
330	–
338		}
339
340		/**
#	Line 346 | Line 353 | public class TreeSubSetTest extends JSR1
353
354		Object e4 = q.higher(six);
355		assertNull(e4);
349	–
356		}
357
358		/**
#	Line 365 | Line 371 | public class TreeSubSetTest extends JSR1
371
372		Object e4 = q.floor(zero);
373		assertNull(e4);
368	–
374		}
375
376		/**
#	Line 384 | Line 389 | public class TreeSubSetTest extends JSR1
389
390		Object e4 = q.ceiling(six);
391		assertNull(e4);
387	–
392		}
393
394		/**
#	Line 392 | Line 396 | public class TreeSubSetTest extends JSR1
396		*/
397		public void testToArray() {
398		NavigableSet q = populatedSet(SIZE);
399	<	Object[] o = q.toArray();
399	>	Object[] o = q.toArray();
400		Arrays.sort(o);
401	<	for(int i = 0; i < o.length; i++)
402	<	assertEquals(o[i], q.pollFirst());
401	>	for (int i = 0; i < o.length; i++)
402	>	assertEquals(o[i], q.pollFirst());
403		}
404
405		/**
#	Line 403 | Line 407 | public class TreeSubSetTest extends JSR1
407		*/
408		public void testToArray2() {
409		NavigableSet q = populatedSet(SIZE);
410	<	Integer[] ints = new Integer[SIZE];
411	<	ints = (Integer[])q.toArray(ints);
410	>	Integer[] ints = new Integer[SIZE];
411	>	ints = (Integer[])q.toArray(ints);
412		Arrays.sort(ints);
413	<	for(int i = 0; i < ints.length; i++)
413	>	for (int i = 0; i < ints.length; i++)
414		assertEquals(ints[i], q.pollFirst());
415		}
416	<
416	>
417		/**
418		* iterator iterates through all elements
419		*/
420		public void testIterator() {
421		NavigableSet q = populatedSet(SIZE);
422		int i = 0;
423	<	Iterator it = q.iterator();
424	<	while(it.hasNext()) {
423	>	Iterator it = q.iterator();
424	>	while (it.hasNext()) {
425		assertTrue(q.contains(it.next()));
426		++i;
427		}
#	Line 430 | Line 434 | public class TreeSubSetTest extends JSR1
434		public void testEmptyIterator() {
435		NavigableSet q = set0();
436		int i = 0;
437	<	Iterator it = q.iterator();
438	<	while(it.hasNext()) {
437	>	Iterator it = q.iterator();
438	>	while (it.hasNext()) {
439		assertTrue(q.contains(it.next()));
440		++i;
441		}
#	Line 452 | Line 456 | public class TreeSubSetTest extends JSR1
456		it.remove();
457
458		it = q.iterator();
459	<	assertEquals(it.next(), new Integer(2));
460	<	assertEquals(it.next(), new Integer(3));
459	>	assertEquals(it.next(), 2);
460	>	assertEquals(it.next(), 3);
461		assertFalse(it.hasNext());
462		}
463
#	Line 467 | Line 471 | public class TreeSubSetTest extends JSR1
471		for (int i = 0; i < SIZE; ++i) {
472		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
473		}
474	<	}
474	>	}
475
476		/**
477	<	* A deserialized serialized set has same elements
477	>	* A deserialized serialized set has same elements
478		*/
479	<	public void testSerialization() {
479	>	public void testSerialization() throws Exception {
480		NavigableSet q = populatedSet(SIZE);
481	<	try {
482	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
483	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
484	<	out.writeObject(q);
485	<	out.close();
486	<
487	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
488	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
489	<	NavigableSet r = (NavigableSet)in.readObject();
490	<	assertEquals(q.size(), r.size());
491	<	while (!q.isEmpty())
488	<	assertEquals(q.pollFirst(), r.pollFirst());
489	<	} catch(Exception e){
490	<	e.printStackTrace();
491	<	unexpectedException();
492	<	}
481	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
482	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
483	>	out.writeObject(q);
484	>	out.close();
485	>
486	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
487	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
488	>	NavigableSet r = (NavigableSet)in.readObject();
489	>	assertEquals(q.size(), r.size());
490	>	while (!q.isEmpty())
491	>	assertEquals(q.pollFirst(), r.pollFirst());
492		}
493
494		/**
#	Line 609 | Line 608 | public class TreeSubSetTest extends JSR1
608		assertEquals(1, ssm.size());
609		assertEquals(3, sm.size());
610		assertEquals(4, set.size());
611	+	}
612	+
613	+	/**
614	+	* size changes when elements added and removed
615	+	*/
616	+	public void testDescendingSize() {
617	+	NavigableSet q = populatedSet(SIZE);
618	+	for (int i = 0; i < SIZE; ++i) {
619	+	assertEquals(SIZE-i, q.size());
620	+	q.pollFirst();
621	+	}
622	+	for (int i = 0; i < SIZE; ++i) {
623	+	assertEquals(i, q.size());
624	+	q.add(new Integer(i));
625	+	}
626	+	}
627	+
628	+	/**
629	+	* Add of comparable element succeeds
630	+	*/
631	+	public void testDescendingAdd() {
632	+	NavigableSet q = dset0();
633	+	assertTrue(q.add(m6));
634	+	}
635	+
636	+	/**
637	+	* Add of duplicate element fails
638	+	*/
639	+	public void testDescendingAddDup() {
640	+	NavigableSet q = dset0();
641	+	assertTrue(q.add(m6));
642	+	assertFalse(q.add(m6));
643	+	}
644	+
645	+	/**
646	+	* Add of non-Comparable throws CCE
647	+	*/
648	+	public void testDescendingAddNonComparable() {
649	+	try {
650	+	NavigableSet q = dset0();
651	+	q.add(new Object());
652	+	q.add(new Object());
653	+	q.add(new Object());
654	+	shouldThrow();
655	+	} catch (ClassCastException success) {}
656	+	}
657	+
658	+
659	+	/**
660	+	* addAll(null) throws NPE
661	+	*/
662	+	public void testDescendingAddAll1() {
663	+	try {
664	+	NavigableSet q = dset0();
665	+	q.addAll(null);
666	+	shouldThrow();
667	+	} catch (NullPointerException success) {}
668	+	}
669	+	/**
670	+	* addAll of a collection with null elements throws NPE
671	+	*/
672	+	public void testDescendingAddAll2() {
673	+	try {
674	+	NavigableSet q = dset0();
675	+	Integer[] ints = new Integer[SIZE];
676	+	q.addAll(Arrays.asList(ints));
677	+	shouldThrow();
678	+	} catch (NullPointerException success) {}
679	+	}
680	+	/**
681	+	* addAll of a collection with any null elements throws NPE after
682	+	* possibly adding some elements
683	+	*/
684	+	public void testDescendingAddAll3() {
685	+	try {
686	+	NavigableSet q = dset0();
687	+	Integer[] ints = new Integer[SIZE];
688	+	for (int i = 0; i < SIZE-1; ++i)
689	+	ints[i] = new Integer(i+SIZE);
690	+	q.addAll(Arrays.asList(ints));
691	+	shouldThrow();
692	+	} catch (NullPointerException success) {}
693	+	}
694	+
695	+	/**
696	+	* Set contains all elements of successful addAll
697	+	*/
698	+	public void testDescendingAddAll5() {
699	+	Integer[] empty = new Integer[0];
700	+	Integer[] ints = new Integer[SIZE];
701	+	for (int i = 0; i < SIZE; ++i)
702	+	ints[i] = new Integer(SIZE-1- i);
703	+	NavigableSet q = dset0();
704	+	assertFalse(q.addAll(Arrays.asList(empty)));
705	+	assertTrue(q.addAll(Arrays.asList(ints)));
706	+	for (int i = 0; i < SIZE; ++i)
707	+	assertEquals(new Integer(i), q.pollFirst());
708	+	}
709	+
710	+	/**
711	+	* poll succeeds unless empty
712	+	*/
713	+	public void testDescendingPoll() {
714	+	NavigableSet q = populatedSet(SIZE);
715	+	for (int i = 0; i < SIZE; ++i) {
716	+	assertEquals(i, q.pollFirst());
717	+	}
718	+	assertNull(q.pollFirst());
719	+	}
720	+
721	+	/**
722	+	* remove(x) removes x and returns true if present
723	+	*/
724	+	public void testDescendingRemoveElement() {
725	+	NavigableSet q = populatedSet(SIZE);
726	+	for (int i = 1; i < SIZE; i+=2) {
727	+	assertTrue(q.remove(new Integer(i)));
728	+	}
729	+	for (int i = 0; i < SIZE; i+=2) {
730	+	assertTrue(q.remove(new Integer(i)));
731	+	assertFalse(q.remove(new Integer(i+1)));
732	+	}
733	+	assertTrue(q.isEmpty());
734	+	}
735	+
736	+	/**
737	+	* contains(x) reports true when elements added but not yet removed
738	+	*/
739	+	public void testDescendingContains() {
740	+	NavigableSet q = populatedSet(SIZE);
741	+	for (int i = 0; i < SIZE; ++i) {
742	+	assertTrue(q.contains(new Integer(i)));
743	+	q.pollFirst();
744	+	assertFalse(q.contains(new Integer(i)));
745	+	}
746	+	}
747	+
748	+	/**
749	+	* clear removes all elements
750	+	*/
751	+	public void testDescendingClear() {
752	+	NavigableSet q = populatedSet(SIZE);
753	+	q.clear();
754	+	assertTrue(q.isEmpty());
755	+	assertEquals(0, q.size());
756	+	assertTrue(q.add(new Integer(1)));
757	+	assertFalse(q.isEmpty());
758	+	q.clear();
759	+	assertTrue(q.isEmpty());
760	+	}
761	+
762	+	/**
763	+	* containsAll(c) is true when c contains a subset of elements
764	+	*/
765	+	public void testDescendingContainsAll() {
766	+	NavigableSet q = populatedSet(SIZE);
767	+	NavigableSet p = dset0();
768	+	for (int i = 0; i < SIZE; ++i) {
769	+	assertTrue(q.containsAll(p));
770	+	assertFalse(p.containsAll(q));
771	+	p.add(new Integer(i));
772	+	}
773	+	assertTrue(p.containsAll(q));
774	+	}
775	+
776	+	/**
777	+	* retainAll(c) retains only those elements of c and reports true if changed
778	+	*/
779	+	public void testDescendingRetainAll() {
780	+	NavigableSet q = populatedSet(SIZE);
781	+	NavigableSet p = populatedSet(SIZE);
782	+	for (int i = 0; i < SIZE; ++i) {
783	+	boolean changed = q.retainAll(p);
784	+	if (i == 0)
785	+	assertFalse(changed);
786	+	else
787	+	assertTrue(changed);
788	+
789	+	assertTrue(q.containsAll(p));
790	+	assertEquals(SIZE-i, q.size());
791	+	p.pollFirst();
792	+	}
793	+	}
794	+
795	+	/**
796	+	* removeAll(c) removes only those elements of c and reports true if changed
797	+	*/
798	+	public void testDescendingRemoveAll() {
799	+	for (int i = 1; i < SIZE; ++i) {
800	+	NavigableSet q = populatedSet(SIZE);
801	+	NavigableSet p = populatedSet(i);
802	+	assertTrue(q.removeAll(p));
803	+	assertEquals(SIZE-i, q.size());
804	+	for (int j = 0; j < i; ++j) {
805	+	Integer I = (Integer)(p.pollFirst());
806	+	assertFalse(q.contains(I));
807	+	}
808	+	}
809	+	}
810	+
811	+
812	+
813	+	/**
814	+	* lower returns preceding element
815	+	*/
816	+	public void testDescendingLower() {
817	+	NavigableSet q = dset5();
818	+	Object e1 = q.lower(m3);
819	+	assertEquals(m2, e1);
820	+
821	+	Object e2 = q.lower(m6);
822	+	assertEquals(m5, e2);
823	+
824	+	Object e3 = q.lower(m1);
825	+	assertNull(e3);
826	+
827	+	Object e4 = q.lower(zero);
828	+	assertNull(e4);
829	+	}
830	+
831	+	/**
832	+	* higher returns next element
833	+	*/
834	+	public void testDescendingHigher() {
835	+	NavigableSet q = dset5();
836	+	Object e1 = q.higher(m3);
837	+	assertEquals(m4, e1);
838	+
839	+	Object e2 = q.higher(zero);
840	+	assertEquals(m1, e2);
841	+
842	+	Object e3 = q.higher(m5);
843	+	assertNull(e3);
844	+
845	+	Object e4 = q.higher(m6);
846	+	assertNull(e4);
847	+	}
848	+
849	+	/**
850	+	* floor returns preceding element
851	+	*/
852	+	public void testDescendingFloor() {
853	+	NavigableSet q = dset5();
854	+	Object e1 = q.floor(m3);
855	+	assertEquals(m3, e1);
856	+
857	+	Object e2 = q.floor(m6);
858	+	assertEquals(m5, e2);
859	+
860	+	Object e3 = q.floor(m1);
861	+	assertEquals(m1, e3);
862	+
863	+	Object e4 = q.floor(zero);
864	+	assertNull(e4);
865	+	}
866	+
867	+	/**
868	+	* ceiling returns next element
869	+	*/
870	+	public void testDescendingCeiling() {
871	+	NavigableSet q = dset5();
872	+	Object e1 = q.ceiling(m3);
873	+	assertEquals(m3, e1);
874	+
875	+	Object e2 = q.ceiling(zero);
876	+	assertEquals(m1, e2);
877	+
878	+	Object e3 = q.ceiling(m5);
879	+	assertEquals(m5, e3);
880	+
881	+	Object e4 = q.ceiling(m6);
882	+	assertNull(e4);
883	+	}
884	+
885	+	/**
886	+	* toArray contains all elements
887	+	*/
888	+	public void testDescendingToArray() {
889	+	NavigableSet q = populatedSet(SIZE);
890	+	Object[] o = q.toArray();
891	+	Arrays.sort(o);
892	+	for (int i = 0; i < o.length; i++)
893	+	assertEquals(o[i], q.pollFirst());
894	+	}
895	+
896	+	/**
897	+	* toArray(a) contains all elements
898	+	*/
899	+	public void testDescendingToArray2() {
900	+	NavigableSet q = populatedSet(SIZE);
901	+	Integer[] ints = new Integer[SIZE];
902	+	ints = (Integer[])q.toArray(ints);
903	+	Arrays.sort(ints);
904	+	for (int i = 0; i < ints.length; i++)
905	+	assertEquals(ints[i], q.pollFirst());
906	+	}
907	+
908	+	/**
909	+	* iterator iterates through all elements
910	+	*/
911	+	public void testDescendingIterator() {
912	+	NavigableSet q = populatedSet(SIZE);
913	+	int i = 0;
914	+	Iterator it = q.iterator();
915	+	while (it.hasNext()) {
916	+	assertTrue(q.contains(it.next()));
917	+	++i;
918	+	}
919	+	assertEquals(i, SIZE);
920	+	}
921	+
922	+	/**
923	+	* iterator of empty set has no elements
924	+	*/
925	+	public void testDescendingEmptyIterator() {
926	+	NavigableSet q = dset0();
927	+	int i = 0;
928	+	Iterator it = q.iterator();
929	+	while (it.hasNext()) {
930	+	assertTrue(q.contains(it.next()));
931	+	++i;
932	+	}
933	+	assertEquals(i, 0);
934	+	}
935	+
936	+	/**
937	+	* iterator.remove removes current element
938	+	*/
939	+	public void testDescendingIteratorRemove () {
940	+	final NavigableSet q = dset0();
941	+	q.add(new Integer(2));
942	+	q.add(new Integer(1));
943	+	q.add(new Integer(3));
944	+
945	+	Iterator it = q.iterator();
946	+	it.next();
947	+	it.remove();
948	+
949	+	it = q.iterator();
950	+	assertEquals(it.next(), 2);
951	+	assertEquals(it.next(), 3);
952	+	assertFalse(it.hasNext());
953	+	}
954	+
955	+
956	+	/**
957	+	* toString contains toStrings of elements
958	+	*/
959	+	public void testDescendingToString() {
960	+	NavigableSet q = populatedSet(SIZE);
961	+	String s = q.toString();
962	+	for (int i = 0; i < SIZE; ++i) {
963	+	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
964	+	}
965	+	}
966	+
967	+	/**
968	+	* A deserialized serialized set has same elements
969	+	*/
970	+	public void testDescendingSerialization() throws Exception {
971	+	NavigableSet q = populatedSet(SIZE);
972	+	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
973	+	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
974	+	out.writeObject(q);
975	+	out.close();
976	+
977	+	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
978	+	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
979	+	NavigableSet r = (NavigableSet)in.readObject();
980	+	assertEquals(q.size(), r.size());
981	+	while (!q.isEmpty())
982	+	assertEquals(q.pollFirst(), r.pollFirst());
983	+	}
984	+
985	+	/**
986	+	* subSet returns set with keys in requested range
987	+	*/
988	+	public void testDescendingSubSetContents() {
989	+	NavigableSet set = dset5();
990	+	SortedSet sm = set.subSet(m2, m4);
991	+	assertEquals(m2, sm.first());
992	+	assertEquals(m3, sm.last());
993	+	assertEquals(2, sm.size());
994	+	assertFalse(sm.contains(m1));
995	+	assertTrue(sm.contains(m2));
996	+	assertTrue(sm.contains(m3));
997	+	assertFalse(sm.contains(m4));
998	+	assertFalse(sm.contains(m5));
999	+	Iterator i = sm.iterator();
1000	+	Object k;
1001	+	k = (Integer)(i.next());
1002	+	assertEquals(m2, k);
1003	+	k = (Integer)(i.next());
1004	+	assertEquals(m3, k);
1005	+	assertFalse(i.hasNext());
1006	+	Iterator j = sm.iterator();
1007	+	j.next();
1008	+	j.remove();
1009	+	assertFalse(set.contains(m2));
1010	+	assertEquals(4, set.size());
1011	+	assertEquals(1, sm.size());
1012	+	assertEquals(m3, sm.first());
1013	+	assertEquals(m3, sm.last());
1014	+	assertTrue(sm.remove(m3));
1015	+	assertTrue(sm.isEmpty());
1016	+	assertEquals(3, set.size());
1017	+	}
1018	+
1019	+	public void testDescendingSubSetContents2() {
1020	+	NavigableSet set = dset5();
1021	+	SortedSet sm = set.subSet(m2, m3);
1022	+	assertEquals(1, sm.size());
1023	+	assertEquals(m2, sm.first());
1024	+	assertEquals(m2, sm.last());
1025	+	assertFalse(sm.contains(m1));
1026	+	assertTrue(sm.contains(m2));
1027	+	assertFalse(sm.contains(m3));
1028	+	assertFalse(sm.contains(m4));
1029	+	assertFalse(sm.contains(m5));
1030	+	Iterator i = sm.iterator();
1031	+	Object k;
1032	+	k = (Integer)(i.next());
1033	+	assertEquals(m2, k);
1034	+	assertFalse(i.hasNext());
1035	+	Iterator j = sm.iterator();
1036	+	j.next();
1037	+	j.remove();
1038	+	assertFalse(set.contains(m2));
1039	+	assertEquals(4, set.size());
1040	+	assertEquals(0, sm.size());
1041	+	assertTrue(sm.isEmpty());
1042	+	assertFalse(sm.remove(m3));
1043	+	assertEquals(4, set.size());
1044	+	}
1045	+
1046	+	/**
1047	+	* headSet returns set with keys in requested range
1048	+	*/
1049	+	public void testDescendingHeadSetContents() {
1050	+	NavigableSet set = dset5();
1051	+	SortedSet sm = set.headSet(m4);
1052	+	assertTrue(sm.contains(m1));
1053	+	assertTrue(sm.contains(m2));
1054	+	assertTrue(sm.contains(m3));
1055	+	assertFalse(sm.contains(m4));
1056	+	assertFalse(sm.contains(m5));
1057	+	Iterator i = sm.iterator();
1058	+	Object k;
1059	+	k = (Integer)(i.next());
1060	+	assertEquals(m1, k);
1061	+	k = (Integer)(i.next());
1062	+	assertEquals(m2, k);
1063	+	k = (Integer)(i.next());
1064	+	assertEquals(m3, k);
1065	+	assertFalse(i.hasNext());
1066	+	sm.clear();
1067	+	assertTrue(sm.isEmpty());
1068	+	assertEquals(2, set.size());
1069	+	assertEquals(m4, set.first());
1070	+	}
1071	+
1072	+	/**
1073	+	* tailSet returns set with keys in requested range
1074	+	*/
1075	+	public void testDescendingTailSetContents() {
1076	+	NavigableSet set = dset5();
1077	+	SortedSet sm = set.tailSet(m2);
1078	+	assertFalse(sm.contains(m1));
1079	+	assertTrue(sm.contains(m2));
1080	+	assertTrue(sm.contains(m3));
1081	+	assertTrue(sm.contains(m4));
1082	+	assertTrue(sm.contains(m5));
1083	+	Iterator i = sm.iterator();
1084	+	Object k;
1085	+	k = (Integer)(i.next());
1086	+	assertEquals(m2, k);
1087	+	k = (Integer)(i.next());
1088	+	assertEquals(m3, k);
1089	+	k = (Integer)(i.next());
1090	+	assertEquals(m4, k);
1091	+	k = (Integer)(i.next());
1092	+	assertEquals(m5, k);
1093	+	assertFalse(i.hasNext());
1094	+
1095	+	SortedSet ssm = sm.tailSet(m4);
1096	+	assertEquals(m4, ssm.first());
1097	+	assertEquals(m5, ssm.last());
1098	+	assertTrue(ssm.remove(m4));
1099	+	assertEquals(1, ssm.size());
1100	+	assertEquals(3, sm.size());
1101	+	assertEquals(4, set.size());
1102		}
1103
1104		}

Diff Legend

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