ViewVC Help

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

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

Comparing jsr166/src/test/tck/TreeSetTest.java (file contents):
Revision 1.1 by dl, Tue Dec 28 16:15:59 2004 UTC vs.
Revision 1.20 by jsr166, Tue Mar 15 19:47:07 2011 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.*;
#	Line 11 | Line 11 | import java.io.*;
11
12		public class TreeSetTest 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(TreeSetTest.class);
17	>	return new TestSuite(TreeSetTest.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 36 | Line 32 | public class TreeSetTest extends JSR166T
32		* Create a set of given size containing consecutive
33		* Integers 0 ... n.
34		*/
35	<	private TreeSet populatedSet(int n) {
36	<	TreeSet q = new TreeSet();
35	>	private TreeSet<Integer> populatedSet(int n) {
36	>	TreeSet<Integer> q = new TreeSet<Integer>();
37		assertTrue(q.isEmpty());
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		assertFalse(q.isEmpty());
43	<	assertEquals(n, q.size());
43	>	assertEquals(n, q.size());
44		return q;
45		}
46
#	Line 59 | Line 55 | public class TreeSetTest extends JSR166T
55		q.add(three);
56		q.add(four);
57		q.add(five);
58	<	assertEquals(5, q.size());
58	>	assertEquals(5, q.size());
59		return q;
60		}
61	<
61	>
62		/**
63		* A new set has unbounded capacity
64		*/
#	Line 77 | Line 73 | public class TreeSetTest extends JSR166T
73		try {
74		TreeSet q = new TreeSet((Collection)null);
75		shouldThrow();
76	<	}
81	<	catch (NullPointerException success) {}
76	>	} catch (NullPointerException success) {}
77		}
78
79		/**
#	Line 89 | Line 84 | public class TreeSetTest extends JSR166T
84		Integer[] ints = new Integer[SIZE];
85		TreeSet q = new TreeSet(Arrays.asList(ints));
86		shouldThrow();
87	<	}
93	<	catch (NullPointerException success) {}
87	>	} catch (NullPointerException success) {}
88		}
89
90		/**
#	Line 103 | Line 97 | public class TreeSetTest extends JSR166T
97		ints[i] = new Integer(i);
98		TreeSet q = new TreeSet(Arrays.asList(ints));
99		shouldThrow();
100	<	}
107	<	catch (NullPointerException success) {}
100	>	} catch (NullPointerException success) {}
101		}
102
103		/**
104		* Set contains all elements of collection used to initialize
105		*/
106		public void testConstructor6() {
107	<	try {
108	<	Integer[] ints = new Integer[SIZE];
109	<	for (int i = 0; i < SIZE; ++i)
110	<	ints[i] = new Integer(i);
111	<	TreeSet q = new TreeSet(Arrays.asList(ints));
112	<	for (int i = 0; i < SIZE; ++i)
120	<	assertEquals(ints[i], q.pollFirst());
121	<	}
122	<	finally {}
107	>	Integer[] ints = new Integer[SIZE];
108	>	for (int i = 0; i < SIZE; ++i)
109	>	ints[i] = new Integer(i);
110	>	TreeSet q = new TreeSet(Arrays.asList(ints));
111	>	for (int i = 0; i < SIZE; ++i)
112	>	assertEquals(ints[i], q.pollFirst());
113		}
114
115		/**
116		* The comparator used in constructor is used
117		*/
118		public void testConstructor7() {
119	<	try {
120	<	MyReverseComparator cmp = new MyReverseComparator();
121	<	TreeSet q = new TreeSet(cmp);
122	<	assertEquals(cmp, q.comparator());
123	<	Integer[] ints = new Integer[SIZE];
124	<	for (int i = 0; i < SIZE; ++i)
125	<	ints[i] = new Integer(i);
126	<	q.addAll(Arrays.asList(ints));
127	<	for (int i = SIZE-1; i >= 0; --i)
138	<	assertEquals(ints[i], q.pollFirst());
139	<	}
140	<	finally {}
119	>	MyReverseComparator cmp = new MyReverseComparator();
120	>	TreeSet q = new TreeSet(cmp);
121	>	assertEquals(cmp, q.comparator());
122	>	Integer[] ints = new Integer[SIZE];
123	>	for (int i = 0; i < SIZE; ++i)
124	>	ints[i] = new Integer(i);
125	>	q.addAll(Arrays.asList(ints));
126	>	for (int i = SIZE-1; i >= 0; --i)
127	>	assertEquals(ints[i], q.pollFirst());
128		}
129
130		/**
#	Line 173 | Line 160 | public class TreeSetTest extends JSR166T
160		* add(null) throws NPE if nonempty
161		*/
162		public void testAddNull() {
163	<	try {
163	>	try {
164		TreeSet q = populatedSet(SIZE);
165		q.add(null);
166		shouldThrow();
167	<	} catch (NullPointerException success) { }
167	>	} catch (NullPointerException success) {}
168		}
169
170		/**
#	Line 208 | Line 195 | public class TreeSetTest extends JSR166T
195		q.add(new Object());
196		q.add(new Object());
197		shouldThrow();
198	<	}
212	<	catch(ClassCastException success) {}
198	>	} catch (ClassCastException success) {}
199		}
200
201		/**
#	Line 220 | Line 206 | public class TreeSetTest extends JSR166T
206		TreeSet q = new TreeSet();
207		q.addAll(null);
208		shouldThrow();
209	<	}
224	<	catch (NullPointerException success) {}
209	>	} catch (NullPointerException success) {}
210		}
211	+
212		/**
213		* addAll of a collection with null elements throws NPE
214		*/
#	Line 232 | Line 218 | public class TreeSetTest extends JSR166T
218		Integer[] ints = new Integer[SIZE];
219		q.addAll(Arrays.asList(ints));
220		shouldThrow();
221	<	}
236	<	catch (NullPointerException success) {}
221	>	} catch (NullPointerException success) {}
222		}
223	+
224		/**
225		* addAll of a collection with any null elements throws NPE after
226		* possibly adding some elements
#	Line 247 | Line 233 | public class TreeSetTest extends JSR166T
233		ints[i] = new Integer(i);
234		q.addAll(Arrays.asList(ints));
235		shouldThrow();
236	<	}
251	<	catch (NullPointerException success) {}
236	>	} catch (NullPointerException success) {}
237		}
238
239		/**
240		* Set contains all elements of successful addAll
241		*/
242		public void testAddAll5() {
243	<	try {
244	<	Integer[] empty = new Integer[0];
245	<	Integer[] ints = new Integer[SIZE];
246	<	for (int i = 0; i < SIZE; ++i)
247	<	ints[i] = new Integer(SIZE-1-i);
248	<	TreeSet q = new TreeSet();
249	<	assertFalse(q.addAll(Arrays.asList(empty)));
250	<	assertTrue(q.addAll(Arrays.asList(ints)));
251	<	for (int i = 0; i < SIZE; ++i)
267	<	assertEquals(new Integer(i), q.pollFirst());
268	<	}
269	<	finally {}
243	>	Integer[] empty = new Integer[0];
244	>	Integer[] ints = new Integer[SIZE];
245	>	for (int i = 0; i < SIZE; ++i)
246	>	ints[i] = new Integer(SIZE-1-i);
247	>	TreeSet q = new TreeSet();
248	>	assertFalse(q.addAll(Arrays.asList(empty)));
249	>	assertTrue(q.addAll(Arrays.asList(ints)));
250	>	for (int i = 0; i < SIZE; ++i)
251	>	assertEquals(new Integer(i), q.pollFirst());
252		}
253
254		/**
#	Line 275 | Line 257 | public class TreeSetTest extends JSR166T
257		public void testPollFirst() {
258		TreeSet q = populatedSet(SIZE);
259		for (int i = 0; i < SIZE; ++i) {
260	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
260	>	assertEquals(i, q.pollFirst());
261		}
262	<	assertNull(q.pollFirst());
262	>	assertNull(q.pollFirst());
263		}
264
265		/**
#	Line 286 | Line 268 | public class TreeSetTest extends JSR166T
268		public void testPollLast() {
269		TreeSet q = populatedSet(SIZE);
270		for (int i = SIZE-1; i >= 0; --i) {
271	<	assertEquals(i, ((Integer)q.pollLast()).intValue());
271	>	assertEquals(i, q.pollLast());
272		}
273	<	assertNull(q.pollFirst());
273	>	assertNull(q.pollFirst());
274		}
275
276
#	Line 298 | Line 280 | public class TreeSetTest extends JSR166T
280		public void testRemoveElement() {
281		TreeSet q = populatedSet(SIZE);
282		for (int i = 1; i < SIZE; i+=2) {
283	<	assertTrue(q.remove(new Integer(i)));
283	>	assertTrue(q.contains(i));
284	>	assertTrue(q.remove(i));
285	>	assertFalse(q.contains(i));
286	>	assertTrue(q.contains(i-1));
287		}
288		for (int i = 0; i < SIZE; i+=2) {
289	<	assertTrue(q.remove(new Integer(i)));
290	<	assertFalse(q.remove(new Integer(i+1)));
289	>	assertTrue(q.contains(i));
290	>	assertTrue(q.remove(i));
291	>	assertFalse(q.contains(i));
292	>	assertFalse(q.remove(i+1));
293	>	assertFalse(q.contains(i+1));
294		}
295		assertTrue(q.isEmpty());
296		}
297	<
297	>
298		/**
299		* contains(x) reports true when elements added but not yet removed
300		*/
#	Line 382 | Line 370 | public class TreeSetTest extends JSR166T
370		}
371		}
372
373	<
373	>
374
375		/**
376		* lower returns preceding element
#	Line 400 | Line 388 | public class TreeSetTest extends JSR166T
388
389		Object e4 = q.lower(zero);
390		assertNull(e4);
403	–
391		}
392
393		/**
#	Line 419 | Line 406 | public class TreeSetTest extends JSR166T
406
407		Object e4 = q.higher(six);
408		assertNull(e4);
422	–
409		}
410
411		/**
#	Line 438 | Line 424 | public class TreeSetTest extends JSR166T
424
425		Object e4 = q.floor(zero);
426		assertNull(e4);
441	–
427		}
428
429		/**
#	Line 457 | Line 442 | public class TreeSetTest extends JSR166T
442
443		Object e4 = q.ceiling(six);
444		assertNull(e4);
460	–
445		}
446
447		/**
448	<	* toArray contains all elements
448	>	* toArray contains all elements in sorted order
449		*/
450		public void testToArray() {
451		TreeSet q = populatedSet(SIZE);
452	<	Object[] o = q.toArray();
453	<	Arrays.sort(o);
454	<	for(int i = 0; i < o.length; i++)
471	<	assertEquals(o[i], q.pollFirst());
452	>	Object[] o = q.toArray();
453	>	for (int i = 0; i < o.length; i++)
454	>	assertSame(o[i], q.pollFirst());
455		}
456
457		/**
458	<	* toArray(a) contains all elements
458	>	* toArray(a) contains all elements in sorted order
459		*/
460		public void testToArray2() {
461	<	TreeSet q = populatedSet(SIZE);
462	<	Integer[] ints = new Integer[SIZE];
463	<	ints = (Integer[])q.toArray(ints);
464	<	Arrays.sort(ints);
465	<	for(int i = 0; i < ints.length; i++)
466	<	assertEquals(ints[i], q.pollFirst());
461	>	TreeSet<Integer> q = populatedSet(SIZE);
462	>	Integer[] ints = new Integer[SIZE];
463	>	Integer[] array = q.toArray(ints);
464	>	assertSame(ints, array);
465	>	for (int i = 0; i < ints.length; i++)
466	>	assertSame(ints[i], q.pollFirst());
467		}
468	<
468	>
469		/**
470		* iterator iterates through all elements
471		*/
472		public void testIterator() {
473		TreeSet q = populatedSet(SIZE);
474		int i = 0;
475	<	Iterator it = q.iterator();
476	<	while(it.hasNext()) {
475	>	Iterator it = q.iterator();
476	>	while (it.hasNext()) {
477		assertTrue(q.contains(it.next()));
478		++i;
479		}
#	Line 503 | Line 486 | public class TreeSetTest extends JSR166T
486		public void testEmptyIterator() {
487		TreeSet q = new TreeSet();
488		int i = 0;
489	<	Iterator it = q.iterator();
490	<	while(it.hasNext()) {
489	>	Iterator it = q.iterator();
490	>	while (it.hasNext()) {
491		assertTrue(q.contains(it.next()));
492		++i;
493		}
#	Line 514 | Line 497 | public class TreeSetTest extends JSR166T
497		/**
498		* iterator.remove removes current element
499		*/
500	<	public void testIteratorRemove () {
500	>	public void testIteratorRemove() {
501		final TreeSet q = new TreeSet();
502		q.add(new Integer(2));
503		q.add(new Integer(1));
#	Line 540 | Line 523 | public class TreeSetTest extends JSR166T
523		for (int i = 0; i < SIZE; ++i) {
524		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
525		}
526	<	}
526	>	}
527
528		/**
529	<	* A deserialized serialized set has same elements
529	>	* A deserialized serialized set has same elements
530		*/
531	<	public void testSerialization() {
531	>	public void testSerialization() throws Exception {
532		TreeSet q = populatedSet(SIZE);
533	<	try {
534	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
535	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
536	<	out.writeObject(q);
537	<	out.close();
538	<
539	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
540	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
541	<	TreeSet r = (TreeSet)in.readObject();
542	<	assertEquals(q.size(), r.size());
543	<	while (!q.isEmpty())
561	<	assertEquals(q.pollFirst(), r.pollFirst());
562	<	} catch(Exception e){
563	<	e.printStackTrace();
564	<	unexpectedException();
565	<	}
533	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
534	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
535	>	out.writeObject(q);
536	>	out.close();
537	>
538	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
539	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
540	>	TreeSet r = (TreeSet)in.readObject();
541	>	assertEquals(q.size(), r.size());
542	>	while (!q.isEmpty())
543	>	assertEquals(q.pollFirst(), r.pollFirst());
544		}
545
546		/**
#	Line 684 | Line 662 | public class TreeSetTest extends JSR166T
662		assertEquals(4, set.size());
663		}
664
665	+	Random rnd = new Random(666);
666	+	BitSet bs;
667	+
668	+	/**
669	+	* Subsets of subsets subdivide correctly
670	+	*/
671	+	public void testRecursiveSubSets() throws Exception {
672	+	int setSize = expensiveTests ? 1000 : 100;
673	+	Class cl = TreeSet.class;
674	+
675	+	NavigableSet<Integer> set = newSet(cl);
676	+	bs = new BitSet(setSize);
677	+
678	+	populate(set, setSize);
679	+	check(set,                 0, setSize - 1, true);
680	+	check(set.descendingSet(), 0, setSize - 1, false);
681	+
682	+	mutateSet(set, 0, setSize - 1);
683	+	check(set,                 0, setSize - 1, true);
684	+	check(set.descendingSet(), 0, setSize - 1, false);
685	+
686	+	bashSubSet(set.subSet(0, true, setSize, false),
687	+	0, setSize - 1, true);
688	+	}
689	+
690	+	static NavigableSet<Integer> newSet(Class cl) throws Exception {
691	+	NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance();
692	+	assertEquals(result.size(), 0);
693	+	assertFalse(result.iterator().hasNext());
694	+	return result;
695	+	}
696	+
697	+	void populate(NavigableSet<Integer> set, int limit) {
698	+	for (int i = 0, n = 2 * limit / 3; i < n; i++) {
699	+	int element = rnd.nextInt(limit);
700	+	put(set, element);
701	+	}
702	+	}
703	+
704	+	void mutateSet(NavigableSet<Integer> set, int min, int max) {
705	+	int size = set.size();
706	+	int rangeSize = max - min + 1;
707	+
708	+	// Remove a bunch of entries directly
709	+	for (int i = 0, n = rangeSize / 2; i < n; i++) {
710	+	remove(set, min - 5 + rnd.nextInt(rangeSize + 10));
711	+	}
712	+
713	+	// Remove a bunch of entries with iterator
714	+	for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
715	+	if (rnd.nextBoolean()) {
716	+	bs.clear(it.next());
717	+	it.remove();
718	+	}
719	+	}
720	+
721	+	// Add entries till we're back to original size
722	+	while (set.size() < size) {
723	+	int element = min + rnd.nextInt(rangeSize);
724	+	assertTrue(element >= min && element<= max);
725	+	put(set, element);
726	+	}
727	+	}
728	+
729	+	void mutateSubSet(NavigableSet<Integer> set, int min, int max) {
730	+	int size = set.size();
731	+	int rangeSize = max - min + 1;
732	+
733	+	// Remove a bunch of entries directly
734	+	for (int i = 0, n = rangeSize / 2; i < n; i++) {
735	+	remove(set, min - 5 + rnd.nextInt(rangeSize + 10));
736	+	}
737	+
738	+	// Remove a bunch of entries with iterator
739	+	for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
740	+	if (rnd.nextBoolean()) {
741	+	bs.clear(it.next());
742	+	it.remove();
743	+	}
744	+	}
745	+
746	+	// Add entries till we're back to original size
747	+	while (set.size() < size) {
748	+	int element = min - 5 + rnd.nextInt(rangeSize + 10);
749	+	if (element >= min && element<= max) {
750	+	put(set, element);
751	+	} else {
752	+	try {
753	+	set.add(element);
754	+	shouldThrow();
755	+	} catch (IllegalArgumentException success) {}
756	+	}
757	+	}
758	+	}
759	+
760	+	void put(NavigableSet<Integer> set, int element) {
761	+	if (set.add(element))
762	+	bs.set(element);
763	+	}
764	+
765	+	void remove(NavigableSet<Integer> set, int element) {
766	+	if (set.remove(element))
767	+	bs.clear(element);
768	+	}
769	+
770	+	void bashSubSet(NavigableSet<Integer> set,
771	+	int min, int max, boolean ascending) {
772	+	check(set, min, max, ascending);
773	+	check(set.descendingSet(), min, max, !ascending);
774	+
775	+	mutateSubSet(set, min, max);
776	+	check(set, min, max, ascending);
777	+	check(set.descendingSet(), min, max, !ascending);
778	+
779	+	// Recurse
780	+	if (max - min < 2)
781	+	return;
782	+	int midPoint = (min + max) / 2;
783	+
784	+	// headSet - pick direction and endpoint inclusion randomly
785	+	boolean incl = rnd.nextBoolean();
786	+	NavigableSet<Integer> hm = set.headSet(midPoint, incl);
787	+	if (ascending) {
788	+	if (rnd.nextBoolean())
789	+	bashSubSet(hm, min, midPoint - (incl ? 0 : 1), true);
790	+	else
791	+	bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1),
792	+	false);
793	+	} else {
794	+	if (rnd.nextBoolean())
795	+	bashSubSet(hm, midPoint + (incl ? 0 : 1), max, false);
796	+	else
797	+	bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max,
798	+	true);
799	+	}
800	+
801	+	// tailSet - pick direction and endpoint inclusion randomly
802	+	incl = rnd.nextBoolean();
803	+	NavigableSet<Integer> tm = set.tailSet(midPoint,incl);
804	+	if (ascending) {
805	+	if (rnd.nextBoolean())
806	+	bashSubSet(tm, midPoint + (incl ? 0 : 1), max, true);
807	+	else
808	+	bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max,
809	+	false);
810	+	} else {
811	+	if (rnd.nextBoolean()) {
812	+	bashSubSet(tm, min, midPoint - (incl ? 0 : 1), false);
813	+	} else {
814	+	bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1),
815	+	true);
816	+	}
817	+	}
818	+
819	+	// subSet - pick direction and endpoint inclusion randomly
820	+	int rangeSize = max - min + 1;
821	+	int[] endpoints = new int[2];
822	+	endpoints[0] = min + rnd.nextInt(rangeSize);
823	+	endpoints[1] = min + rnd.nextInt(rangeSize);
824	+	Arrays.sort(endpoints);
825	+	boolean lowIncl = rnd.nextBoolean();
826	+	boolean highIncl = rnd.nextBoolean();
827	+	if (ascending) {
828	+	NavigableSet<Integer> sm = set.subSet(
829	+	endpoints[0], lowIncl, endpoints[1], highIncl);
830	+	if (rnd.nextBoolean())
831	+	bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1),
832	+	endpoints[1] - (highIncl ? 0 : 1), true);
833	+	else
834	+	bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1),
835	+	endpoints[1] - (highIncl ? 0 : 1), false);
836	+	} else {
837	+	NavigableSet<Integer> sm = set.subSet(
838	+	endpoints[1], highIncl, endpoints[0], lowIncl);
839	+	if (rnd.nextBoolean())
840	+	bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1),
841	+	endpoints[1] - (highIncl ? 0 : 1), false);
842	+	else
843	+	bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1),
844	+	endpoints[1] - (highIncl ? 0 : 1), true);
845	+	}
846	+	}
847	+
848	+	/**
849	+	* min and max are both inclusive.  If max < min, interval is empty.
850	+	*/
851	+	void check(NavigableSet<Integer> set,
852	+	final int min, final int max, final boolean ascending) {
853	+	class ReferenceSet {
854	+	int lower(int element) {
855	+	return ascending ?
856	+	lowerAscending(element) : higherAscending(element);
857	+	}
858	+	int floor(int element) {
859	+	return ascending ?
860	+	floorAscending(element) : ceilingAscending(element);
861	+	}
862	+	int ceiling(int element) {
863	+	return ascending ?
864	+	ceilingAscending(element) : floorAscending(element);
865	+	}
866	+	int higher(int element) {
867	+	return ascending ?
868	+	higherAscending(element) : lowerAscending(element);
869	+	}
870	+	int first() {
871	+	return ascending ? firstAscending() : lastAscending();
872	+	}
873	+	int last() {
874	+	return ascending ? lastAscending() : firstAscending();
875	+	}
876	+	int lowerAscending(int element) {
877	+	return floorAscending(element - 1);
878	+	}
879	+	int floorAscending(int element) {
880	+	if (element < min)
881	+	return -1;
882	+	else if (element > max)
883	+	element = max;
884	+
885	+	// BitSet should support this! Test would run much faster
886	+	while (element >= min) {
887	+	if (bs.get(element))
888	+	return element;
889	+	element--;
890	+	}
891	+	return -1;
892	+	}
893	+	int ceilingAscending(int element) {
894	+	if (element < min)
895	+	element = min;
896	+	else if (element > max)
897	+	return -1;
898	+	int result = bs.nextSetBit(element);
899	+	return result > max ? -1 : result;
900	+	}
901	+	int higherAscending(int element) {
902	+	return ceilingAscending(element + 1);
903	+	}
904	+	private int firstAscending() {
905	+	int result = ceilingAscending(min);
906	+	return result > max ? -1 : result;
907	+	}
908	+	private int lastAscending() {
909	+	int result = floorAscending(max);
910	+	return result < min ? -1 : result;
911	+	}
912	+	}
913	+	ReferenceSet rs = new ReferenceSet();
914	+
915	+	// Test contents using containsElement
916	+	int size = 0;
917	+	for (int i = min; i <= max; i++) {
918	+	boolean bsContainsI = bs.get(i);
919	+	assertEquals(bsContainsI, set.contains(i));
920	+	if (bsContainsI)
921	+	size++;
922	+	}
923	+	assertEquals(set.size(), size);
924	+
925	+	// Test contents using contains elementSet iterator
926	+	int size2 = 0;
927	+	int previousElement = -1;
928	+	for (int element : set) {
929	+	assertTrue(bs.get(element));
930	+	size2++;
931	+	assertTrue(previousElement < 0 || (ascending ?
932	+	element - previousElement > 0 : element - previousElement < 0));
933	+	previousElement = element;
934	+	}
935	+	assertEquals(size2, size);
936	+
937	+	// Test navigation ops
938	+	for (int element = min - 1; element <= max + 1; element++) {
939	+	assertEq(set.lower(element), rs.lower(element));
940	+	assertEq(set.floor(element), rs.floor(element));
941	+	assertEq(set.higher(element), rs.higher(element));
942	+	assertEq(set.ceiling(element), rs.ceiling(element));
943	+	}
944	+
945	+	// Test extrema
946	+	if (set.size() != 0) {
947	+	assertEq(set.first(), rs.first());
948	+	assertEq(set.last(), rs.last());
949	+	} else {
950	+	assertEq(rs.first(), -1);
951	+	assertEq(rs.last(),  -1);
952	+	try {
953	+	set.first();
954	+	shouldThrow();
955	+	} catch (NoSuchElementException success) {}
956	+	try {
957	+	set.last();
958	+	shouldThrow();
959	+	} catch (NoSuchElementException success) {}
960	+	}
961	+	}
962	+
963	+	static void assertEq(Integer i, int j) {
964	+	if (i == null)
965	+	assertEquals(j, -1);
966	+	else
967	+	assertEquals((int) i, j);
968	+	}
969	+
970	+	static boolean eq(Integer i, int j) {
971	+	return i == null ? j == -1 : i == j;
972	+	}
973	+
974		}

Diff Legend

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