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.15 by jsr166, Thu Nov 4 01:04:54 2010 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		/**
180		* addAll of a collection with null elements throws NPE
181		*/
#	Line 171 | Line 185 | public class TreeSubSetTest extends JSR1
185		Integer[] ints = new Integer[SIZE];
186		q.addAll(Arrays.asList(ints));
187		shouldThrow();
188	<	}
175	<	catch (NullPointerException success) {}
188	>	} catch (NullPointerException success) {}
189		}
190	+
191		/**
192		* addAll of a collection with any null elements throws NPE after
193		* possibly adding some elements
#	Line 186 | Line 200 | public class TreeSubSetTest extends JSR1
200		ints[i] = new Integer(i+SIZE);
201		q.addAll(Arrays.asList(ints));
202		shouldThrow();
203	<	}
190	<	catch (NullPointerException success) {}
203	>	} catch (NullPointerException success) {}
204		}
205
206		/**
207		* Set contains all elements of successful addAll
208		*/
209		public void testAddAll5() {
210	<	try {
211	<	Integer[] empty = new Integer[0];
212	<	Integer[] ints = new Integer[SIZE];
213	<	for (int i = 0; i < SIZE; ++i)
214	<	ints[i] = new Integer(SIZE-1- i);
215	<	NavigableSet q = set0();
216	<	assertFalse(q.addAll(Arrays.asList(empty)));
217	<	assertTrue(q.addAll(Arrays.asList(ints)));
218	<	for (int i = 0; i < SIZE; ++i)
206	<	assertEquals(new Integer(i), q.pollFirst());
207	<	}
208	<	finally {}
210	>	Integer[] empty = new Integer[0];
211	>	Integer[] ints = new Integer[SIZE];
212	>	for (int i = 0; i < SIZE; ++i)
213	>	ints[i] = new Integer(SIZE-1- i);
214	>	NavigableSet q = set0();
215	>	assertFalse(q.addAll(Arrays.asList(empty)));
216	>	assertTrue(q.addAll(Arrays.asList(ints)));
217	>	for (int i = 0; i < SIZE; ++i)
218	>	assertEquals(new Integer(i), q.pollFirst());
219		}
220
221		/**
#	Line 214 | Line 224 | public class TreeSubSetTest extends JSR1
224		public void testPoll() {
225		NavigableSet q = populatedSet(SIZE);
226		for (int i = 0; i < SIZE; ++i) {
227	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
227	>	assertEquals(i, q.pollFirst());
228		}
229	<	assertNull(q.pollFirst());
229	>	assertNull(q.pollFirst());
230		}
231
232		/**
#	Line 233 | Line 243 | public class TreeSubSetTest extends JSR1
243		}
244		assertTrue(q.isEmpty());
245		}
246	<
246	>
247		/**
248		* contains(x) reports true when elements added but not yet removed
249		*/
#	Line 254 | Line 264 | public class TreeSubSetTest extends JSR1
264		q.clear();
265		assertTrue(q.isEmpty());
266		assertEquals(0, q.size());
267	<	q.add(new Integer(1));
267	>	assertTrue(q.add(new Integer(1)));
268		assertFalse(q.isEmpty());
269		q.clear();
270		assertTrue(q.isEmpty());
#	Line 309 | Line 319 | public class TreeSubSetTest extends JSR1
319		}
320		}
321
322	<
322	>
323
324		/**
325		* lower returns preceding element
#	Line 327 | Line 337 | public class TreeSubSetTest extends JSR1
337
338		Object e4 = q.lower(zero);
339		assertNull(e4);
330	–
340		}
341
342		/**
#	Line 346 | Line 355 | public class TreeSubSetTest extends JSR1
355
356		Object e4 = q.higher(six);
357		assertNull(e4);
349	–
358		}
359
360		/**
#	Line 365 | Line 373 | public class TreeSubSetTest extends JSR1
373
374		Object e4 = q.floor(zero);
375		assertNull(e4);
368	–
376		}
377
378		/**
#	Line 384 | Line 391 | public class TreeSubSetTest extends JSR1
391
392		Object e4 = q.ceiling(six);
393		assertNull(e4);
387	–
394		}
395
396		/**
397	<	* toArray contains all elements
397	>	* toArray contains all elements in sorted order
398		*/
399		public void testToArray() {
400		NavigableSet q = populatedSet(SIZE);
401	<	Object[] o = q.toArray();
402	<	Arrays.sort(o);
403	<	for(int i = 0; i < o.length; i++)
398	<	assertEquals(o[i], q.pollFirst());
401	>	Object[] o = q.toArray();
402	>	for (int i = 0; i < o.length; i++)
403	>	assertSame(o[i], q.pollFirst());
404		}
405
406		/**
407	<	* toArray(a) contains all elements
407	>	* toArray(a) contains all elements in sorted order
408		*/
409		public void testToArray2() {
410		NavigableSet q = populatedSet(SIZE);
411	<	Integer[] ints = new Integer[SIZE];
412	<	ints = (Integer[])q.toArray(ints);
413	<	Arrays.sort(ints);
414	<	for(int i = 0; i < ints.length; i++)
410	<	assertEquals(ints[i], q.pollFirst());
411	>	Integer[] ints = new Integer[SIZE];
412	>	assertSame(ints, q.toArray(ints));
413	>	for (int i = 0; i < ints.length; i++)
414	>	assertSame(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 441 | Line 445 | public class TreeSubSetTest extends JSR1
445		/**
446		* iterator.remove removes current element
447		*/
448	<	public void testIteratorRemove () {
448	>	public void testIteratorRemove() {
449		final NavigableSet q = set0();
450		q.add(new Integer(2));
451		q.add(new Integer(1));
#	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	+	/**
671	+	* addAll of a collection with null elements throws NPE
672	+	*/
673	+	public void testDescendingAddAll2() {
674	+	try {
675	+	NavigableSet q = dset0();
676	+	Integer[] ints = new Integer[SIZE];
677	+	q.addAll(Arrays.asList(ints));
678	+	shouldThrow();
679	+	} catch (NullPointerException success) {}
680	+	}
681	+
682	+	/**
683	+	* addAll of a collection with any null elements throws NPE after
684	+	* possibly adding some elements
685	+	*/
686	+	public void testDescendingAddAll3() {
687	+	try {
688	+	NavigableSet q = dset0();
689	+	Integer[] ints = new Integer[SIZE];
690	+	for (int i = 0; i < SIZE-1; ++i)
691	+	ints[i] = new Integer(i+SIZE);
692	+	q.addAll(Arrays.asList(ints));
693	+	shouldThrow();
694	+	} catch (NullPointerException success) {}
695	+	}
696	+
697	+	/**
698	+	* Set contains all elements of successful addAll
699	+	*/
700	+	public void testDescendingAddAll5() {
701	+	Integer[] empty = new Integer[0];
702	+	Integer[] ints = new Integer[SIZE];
703	+	for (int i = 0; i < SIZE; ++i)
704	+	ints[i] = new Integer(SIZE-1- i);
705	+	NavigableSet q = dset0();
706	+	assertFalse(q.addAll(Arrays.asList(empty)));
707	+	assertTrue(q.addAll(Arrays.asList(ints)));
708	+	for (int i = 0; i < SIZE; ++i)
709	+	assertEquals(new Integer(i), q.pollFirst());
710	+	}
711	+
712	+	/**
713	+	* poll succeeds unless empty
714	+	*/
715	+	public void testDescendingPoll() {
716	+	NavigableSet q = populatedSet(SIZE);
717	+	for (int i = 0; i < SIZE; ++i) {
718	+	assertEquals(i, q.pollFirst());
719	+	}
720	+	assertNull(q.pollFirst());
721	+	}
722	+
723	+	/**
724	+	* remove(x) removes x and returns true if present
725	+	*/
726	+	public void testDescendingRemoveElement() {
727	+	NavigableSet q = populatedSet(SIZE);
728	+	for (int i = 1; i < SIZE; i+=2) {
729	+	assertTrue(q.remove(new Integer(i)));
730	+	}
731	+	for (int i = 0; i < SIZE; i+=2) {
732	+	assertTrue(q.remove(new Integer(i)));
733	+	assertFalse(q.remove(new Integer(i+1)));
734	+	}
735	+	assertTrue(q.isEmpty());
736	+	}
737	+
738	+	/**
739	+	* contains(x) reports true when elements added but not yet removed
740	+	*/
741	+	public void testDescendingContains() {
742	+	NavigableSet q = populatedSet(SIZE);
743	+	for (int i = 0; i < SIZE; ++i) {
744	+	assertTrue(q.contains(new Integer(i)));
745	+	q.pollFirst();
746	+	assertFalse(q.contains(new Integer(i)));
747	+	}
748	+	}
749	+
750	+	/**
751	+	* clear removes all elements
752	+	*/
753	+	public void testDescendingClear() {
754	+	NavigableSet q = populatedSet(SIZE);
755	+	q.clear();
756	+	assertTrue(q.isEmpty());
757	+	assertEquals(0, q.size());
758	+	assertTrue(q.add(new Integer(1)));
759	+	assertFalse(q.isEmpty());
760	+	q.clear();
761	+	assertTrue(q.isEmpty());
762	+	}
763	+
764	+	/**
765	+	* containsAll(c) is true when c contains a subset of elements
766	+	*/
767	+	public void testDescendingContainsAll() {
768	+	NavigableSet q = populatedSet(SIZE);
769	+	NavigableSet p = dset0();
770	+	for (int i = 0; i < SIZE; ++i) {
771	+	assertTrue(q.containsAll(p));
772	+	assertFalse(p.containsAll(q));
773	+	p.add(new Integer(i));
774	+	}
775	+	assertTrue(p.containsAll(q));
776	+	}
777	+
778	+	/**
779	+	* retainAll(c) retains only those elements of c and reports true if changed
780	+	*/
781	+	public void testDescendingRetainAll() {
782	+	NavigableSet q = populatedSet(SIZE);
783	+	NavigableSet p = populatedSet(SIZE);
784	+	for (int i = 0; i < SIZE; ++i) {
785	+	boolean changed = q.retainAll(p);
786	+	if (i == 0)
787	+	assertFalse(changed);
788	+	else
789	+	assertTrue(changed);
790	+
791	+	assertTrue(q.containsAll(p));
792	+	assertEquals(SIZE-i, q.size());
793	+	p.pollFirst();
794	+	}
795	+	}
796	+
797	+	/**
798	+	* removeAll(c) removes only those elements of c and reports true if changed
799	+	*/
800	+	public void testDescendingRemoveAll() {
801	+	for (int i = 1; i < SIZE; ++i) {
802	+	NavigableSet q = populatedSet(SIZE);
803	+	NavigableSet p = populatedSet(i);
804	+	assertTrue(q.removeAll(p));
805	+	assertEquals(SIZE-i, q.size());
806	+	for (int j = 0; j < i; ++j) {
807	+	Integer I = (Integer)(p.pollFirst());
808	+	assertFalse(q.contains(I));
809	+	}
810	+	}
811	+	}
812	+
813	+
814	+
815	+	/**
816	+	* lower returns preceding element
817	+	*/
818	+	public void testDescendingLower() {
819	+	NavigableSet q = dset5();
820	+	Object e1 = q.lower(m3);
821	+	assertEquals(m2, e1);
822	+
823	+	Object e2 = q.lower(m6);
824	+	assertEquals(m5, e2);
825	+
826	+	Object e3 = q.lower(m1);
827	+	assertNull(e3);
828	+
829	+	Object e4 = q.lower(zero);
830	+	assertNull(e4);
831	+	}
832	+
833	+	/**
834	+	* higher returns next element
835	+	*/
836	+	public void testDescendingHigher() {
837	+	NavigableSet q = dset5();
838	+	Object e1 = q.higher(m3);
839	+	assertEquals(m4, e1);
840	+
841	+	Object e2 = q.higher(zero);
842	+	assertEquals(m1, e2);
843	+
844	+	Object e3 = q.higher(m5);
845	+	assertNull(e3);
846	+
847	+	Object e4 = q.higher(m6);
848	+	assertNull(e4);
849	+	}
850	+
851	+	/**
852	+	* floor returns preceding element
853	+	*/
854	+	public void testDescendingFloor() {
855	+	NavigableSet q = dset5();
856	+	Object e1 = q.floor(m3);
857	+	assertEquals(m3, e1);
858	+
859	+	Object e2 = q.floor(m6);
860	+	assertEquals(m5, e2);
861	+
862	+	Object e3 = q.floor(m1);
863	+	assertEquals(m1, e3);
864	+
865	+	Object e4 = q.floor(zero);
866	+	assertNull(e4);
867	+	}
868	+
869	+	/**
870	+	* ceiling returns next element
871	+	*/
872	+	public void testDescendingCeiling() {
873	+	NavigableSet q = dset5();
874	+	Object e1 = q.ceiling(m3);
875	+	assertEquals(m3, e1);
876	+
877	+	Object e2 = q.ceiling(zero);
878	+	assertEquals(m1, e2);
879	+
880	+	Object e3 = q.ceiling(m5);
881	+	assertEquals(m5, e3);
882	+
883	+	Object e4 = q.ceiling(m6);
884	+	assertNull(e4);
885	+	}
886	+
887	+	/**
888	+	* toArray contains all elements
889	+	*/
890	+	public void testDescendingToArray() {
891	+	NavigableSet q = populatedSet(SIZE);
892	+	Object[] o = q.toArray();
893	+	Arrays.sort(o);
894	+	for (int i = 0; i < o.length; i++)
895	+	assertEquals(o[i], q.pollFirst());
896	+	}
897	+
898	+	/**
899	+	* toArray(a) contains all elements
900	+	*/
901	+	public void testDescendingToArray2() {
902	+	NavigableSet q = populatedSet(SIZE);
903	+	Integer[] ints = new Integer[SIZE];
904	+	assertSame(ints, q.toArray(ints));
905	+	Arrays.sort(ints);
906	+	for (int i = 0; i < ints.length; i++)
907	+	assertEquals(ints[i], q.pollFirst());
908	+	}
909	+
910	+	/**
911	+	* iterator iterates through all elements
912	+	*/
913	+	public void testDescendingIterator() {
914	+	NavigableSet q = populatedSet(SIZE);
915	+	int i = 0;
916	+	Iterator it = q.iterator();
917	+	while (it.hasNext()) {
918	+	assertTrue(q.contains(it.next()));
919	+	++i;
920	+	}
921	+	assertEquals(i, SIZE);
922	+	}
923	+
924	+	/**
925	+	* iterator of empty set has no elements
926	+	*/
927	+	public void testDescendingEmptyIterator() {
928	+	NavigableSet q = dset0();
929	+	int i = 0;
930	+	Iterator it = q.iterator();
931	+	while (it.hasNext()) {
932	+	assertTrue(q.contains(it.next()));
933	+	++i;
934	+	}
935	+	assertEquals(i, 0);
936	+	}
937	+
938	+	/**
939	+	* iterator.remove removes current element
940	+	*/
941	+	public void testDescendingIteratorRemove() {
942	+	final NavigableSet q = dset0();
943	+	q.add(new Integer(2));
944	+	q.add(new Integer(1));
945	+	q.add(new Integer(3));
946	+
947	+	Iterator it = q.iterator();
948	+	it.next();
949	+	it.remove();
950	+
951	+	it = q.iterator();
952	+	assertEquals(it.next(), 2);
953	+	assertEquals(it.next(), 3);
954	+	assertFalse(it.hasNext());
955	+	}
956	+
957	+
958	+	/**
959	+	* toString contains toStrings of elements
960	+	*/
961	+	public void testDescendingToString() {
962	+	NavigableSet q = populatedSet(SIZE);
963	+	String s = q.toString();
964	+	for (int i = 0; i < SIZE; ++i) {
965	+	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
966	+	}
967	+	}
968	+
969	+	/**
970	+	* A deserialized serialized set has same elements
971	+	*/
972	+	public void testDescendingSerialization() throws Exception {
973	+	NavigableSet q = populatedSet(SIZE);
974	+	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
975	+	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
976	+	out.writeObject(q);
977	+	out.close();
978	+
979	+	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
980	+	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
981	+	NavigableSet r = (NavigableSet)in.readObject();
982	+	assertEquals(q.size(), r.size());
983	+	while (!q.isEmpty())
984	+	assertEquals(q.pollFirst(), r.pollFirst());
985	+	}
986	+
987	+	/**
988	+	* subSet returns set with keys in requested range
989	+	*/
990	+	public void testDescendingSubSetContents() {
991	+	NavigableSet set = dset5();
992	+	SortedSet sm = set.subSet(m2, m4);
993	+	assertEquals(m2, sm.first());
994	+	assertEquals(m3, sm.last());
995	+	assertEquals(2, sm.size());
996	+	assertFalse(sm.contains(m1));
997	+	assertTrue(sm.contains(m2));
998	+	assertTrue(sm.contains(m3));
999	+	assertFalse(sm.contains(m4));
1000	+	assertFalse(sm.contains(m5));
1001	+	Iterator i = sm.iterator();
1002	+	Object k;
1003	+	k = (Integer)(i.next());
1004	+	assertEquals(m2, k);
1005	+	k = (Integer)(i.next());
1006	+	assertEquals(m3, k);
1007	+	assertFalse(i.hasNext());
1008	+	Iterator j = sm.iterator();
1009	+	j.next();
1010	+	j.remove();
1011	+	assertFalse(set.contains(m2));
1012	+	assertEquals(4, set.size());
1013	+	assertEquals(1, sm.size());
1014	+	assertEquals(m3, sm.first());
1015	+	assertEquals(m3, sm.last());
1016	+	assertTrue(sm.remove(m3));
1017	+	assertTrue(sm.isEmpty());
1018	+	assertEquals(3, set.size());
1019	+	}
1020	+
1021	+	public void testDescendingSubSetContents2() {
1022	+	NavigableSet set = dset5();
1023	+	SortedSet sm = set.subSet(m2, m3);
1024	+	assertEquals(1, sm.size());
1025	+	assertEquals(m2, sm.first());
1026	+	assertEquals(m2, sm.last());
1027	+	assertFalse(sm.contains(m1));
1028	+	assertTrue(sm.contains(m2));
1029	+	assertFalse(sm.contains(m3));
1030	+	assertFalse(sm.contains(m4));
1031	+	assertFalse(sm.contains(m5));
1032	+	Iterator i = sm.iterator();
1033	+	Object k;
1034	+	k = (Integer)(i.next());
1035	+	assertEquals(m2, k);
1036	+	assertFalse(i.hasNext());
1037	+	Iterator j = sm.iterator();
1038	+	j.next();
1039	+	j.remove();
1040	+	assertFalse(set.contains(m2));
1041	+	assertEquals(4, set.size());
1042	+	assertEquals(0, sm.size());
1043	+	assertTrue(sm.isEmpty());
1044	+	assertFalse(sm.remove(m3));
1045	+	assertEquals(4, set.size());
1046	+	}
1047	+
1048	+	/**
1049	+	* headSet returns set with keys in requested range
1050	+	*/
1051	+	public void testDescendingHeadSetContents() {
1052	+	NavigableSet set = dset5();
1053	+	SortedSet sm = set.headSet(m4);
1054	+	assertTrue(sm.contains(m1));
1055	+	assertTrue(sm.contains(m2));
1056	+	assertTrue(sm.contains(m3));
1057	+	assertFalse(sm.contains(m4));
1058	+	assertFalse(sm.contains(m5));
1059	+	Iterator i = sm.iterator();
1060	+	Object k;
1061	+	k = (Integer)(i.next());
1062	+	assertEquals(m1, k);
1063	+	k = (Integer)(i.next());
1064	+	assertEquals(m2, k);
1065	+	k = (Integer)(i.next());
1066	+	assertEquals(m3, k);
1067	+	assertFalse(i.hasNext());
1068	+	sm.clear();
1069	+	assertTrue(sm.isEmpty());
1070	+	assertEquals(2, set.size());
1071	+	assertEquals(m4, set.first());
1072	+	}
1073	+
1074	+	/**
1075	+	* tailSet returns set with keys in requested range
1076	+	*/
1077	+	public void testDescendingTailSetContents() {
1078	+	NavigableSet set = dset5();
1079	+	SortedSet sm = set.tailSet(m2);
1080	+	assertFalse(sm.contains(m1));
1081	+	assertTrue(sm.contains(m2));
1082	+	assertTrue(sm.contains(m3));
1083	+	assertTrue(sm.contains(m4));
1084	+	assertTrue(sm.contains(m5));
1085	+	Iterator i = sm.iterator();
1086	+	Object k;
1087	+	k = (Integer)(i.next());
1088	+	assertEquals(m2, k);
1089	+	k = (Integer)(i.next());
1090	+	assertEquals(m3, k);
1091	+	k = (Integer)(i.next());
1092	+	assertEquals(m4, k);
1093	+	k = (Integer)(i.next());
1094	+	assertEquals(m5, k);
1095	+	assertFalse(i.hasNext());
1096	+
1097	+	SortedSet ssm = sm.tailSet(m4);
1098	+	assertEquals(m4, ssm.first());
1099	+	assertEquals(m5, ssm.last());
1100	+	assertTrue(ssm.remove(m4));
1101	+	assertEquals(1, ssm.size());
1102	+	assertEquals(3, sm.size());
1103	+	assertEquals(4, set.size());
1104		}
1105
1106		}

Diff Legend

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