ViewVC Help

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

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

Comparing jsr166/src/test/tck/ConcurrentSkipListSetTest.java (file contents):
Revision 1.1 by dl, Tue Dec 28 16:15:59 2004 UTC vs.
Revision 1.13 by jsr166, Wed Aug 25 00:07:03 2010 UTC

#	Line 11 | Line 11 | import java.io.*;
11
12		public class ConcurrentSkipListSetTest 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(ConcurrentSkipListSetTest.class);
17	>	return new TestSuite(ConcurrentSkipListSetTest.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 34 | Line 30 | public class ConcurrentSkipListSetTest e
30		private ConcurrentSkipListSet populatedSet(int n) {
31		ConcurrentSkipListSet q = new ConcurrentSkipListSet();
32		assertTrue(q.isEmpty());
33	<	for(int i = n-1; i >= 0; i-=2)
34	<	assertTrue(q.add(new Integer(i)));
35	<	for(int i = (n & 1); i < n; i+=2)
36	<	assertTrue(q.add(new Integer(i)));
33	>	for (int i = n-1; i >= 0; i-=2)
34	>	assertTrue(q.add(new Integer(i)));
35	>	for (int i = (n & 1); i < n; i+=2)
36	>	assertTrue(q.add(new Integer(i)));
37		assertFalse(q.isEmpty());
38	<	assertEquals(n, q.size());
38	>	assertEquals(n, q.size());
39		return q;
40		}
41
#	Line 54 | Line 50 | public class ConcurrentSkipListSetTest e
50		q.add(three);
51		q.add(four);
52		q.add(five);
53	<	assertEquals(5, q.size());
53	>	assertEquals(5, q.size());
54		return q;
55		}
56	<
56	>
57		/**
58		* A new set has unbounded capacity
59		*/
#	Line 72 | Line 68 | public class ConcurrentSkipListSetTest e
68		try {
69		ConcurrentSkipListSet q = new ConcurrentSkipListSet((Collection)null);
70		shouldThrow();
71	<	}
76	<	catch (NullPointerException success) {}
71	>	} catch (NullPointerException success) {}
72		}
73
74		/**
#	Line 84 | Line 79 | public class ConcurrentSkipListSetTest e
79		Integer[] ints = new Integer[SIZE];
80		ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints));
81		shouldThrow();
82	<	}
88	<	catch (NullPointerException success) {}
82	>	} catch (NullPointerException success) {}
83		}
84
85		/**
#	Line 98 | Line 92 | public class ConcurrentSkipListSetTest e
92		ints[i] = new Integer(i);
93		ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints));
94		shouldThrow();
95	<	}
102	<	catch (NullPointerException success) {}
95	>	} catch (NullPointerException success) {}
96		}
97
98		/**
99		* Set contains all elements of collection used to initialize
100		*/
101		public void testConstructor6() {
102	<	try {
103	<	Integer[] ints = new Integer[SIZE];
104	<	for (int i = 0; i < SIZE; ++i)
105	<	ints[i] = new Integer(i);
106	<	ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints));
107	<	for (int i = 0; i < SIZE; ++i)
115	<	assertEquals(ints[i], q.pollFirst());
116	<	}
117	<	finally {}
102	>	Integer[] ints = new Integer[SIZE];
103	>	for (int i = 0; i < SIZE; ++i)
104	>	ints[i] = new Integer(i);
105	>	ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints));
106	>	for (int i = 0; i < SIZE; ++i)
107	>	assertEquals(ints[i], q.pollFirst());
108		}
109
110		/**
111		* The comparator used in constructor is used
112		*/
113		public void testConstructor7() {
114	<	try {
115	<	MyReverseComparator cmp = new MyReverseComparator();
116	<	ConcurrentSkipListSet q = new ConcurrentSkipListSet(cmp);
117	<	assertEquals(cmp, q.comparator());
118	<	Integer[] ints = new Integer[SIZE];
119	<	for (int i = 0; i < SIZE; ++i)
120	<	ints[i] = new Integer(i);
121	<	q.addAll(Arrays.asList(ints));
122	<	for (int i = SIZE-1; i >= 0; --i)
133	<	assertEquals(ints[i], q.pollFirst());
134	<	}
135	<	finally {}
114	>	MyReverseComparator cmp = new MyReverseComparator();
115	>	ConcurrentSkipListSet q = new ConcurrentSkipListSet(cmp);
116	>	assertEquals(cmp, q.comparator());
117	>	Integer[] ints = new Integer[SIZE];
118	>	for (int i = 0; i < SIZE; ++i)
119	>	ints[i] = new Integer(i);
120	>	q.addAll(Arrays.asList(ints));
121	>	for (int i = SIZE-1; i >= 0; --i)
122	>	assertEquals(ints[i], q.pollFirst());
123		}
124
125		/**
#	Line 168 | Line 155 | public class ConcurrentSkipListSetTest e
155		* add(null) throws NPE
156		*/
157		public void testAddNull() {
158	<	try {
158	>	try {
159		ConcurrentSkipListSet q = new ConcurrentSkipListSet();
160		q.add(null);
161		shouldThrow();
162	<	} catch (NullPointerException success) { }
162	>	} catch (NullPointerException success) {}
163		}
164
165		/**
#	Line 203 | Line 190 | public class ConcurrentSkipListSetTest e
190		q.add(new Object());
191		q.add(new Object());
192		shouldThrow();
193	<	}
207	<	catch(ClassCastException success) {}
193	>	} catch (ClassCastException success) {}
194		}
195
196		/**
#	Line 215 | Line 201 | public class ConcurrentSkipListSetTest e
201		ConcurrentSkipListSet q = new ConcurrentSkipListSet();
202		q.addAll(null);
203		shouldThrow();
204	<	}
219	<	catch (NullPointerException success) {}
204	>	} catch (NullPointerException success) {}
205		}
206		/**
207		* addAll of a collection with null elements throws NPE
#	Line 227 | Line 212 | public class ConcurrentSkipListSetTest e
212		Integer[] ints = new Integer[SIZE];
213		q.addAll(Arrays.asList(ints));
214		shouldThrow();
215	<	}
231	<	catch (NullPointerException success) {}
215	>	} catch (NullPointerException success) {}
216		}
217		/**
218		* addAll of a collection with any null elements throws NPE after
#	Line 242 | Line 226 | public class ConcurrentSkipListSetTest e
226		ints[i] = new Integer(i);
227		q.addAll(Arrays.asList(ints));
228		shouldThrow();
229	<	}
246	<	catch (NullPointerException success) {}
229	>	} catch (NullPointerException success) {}
230		}
231
232		/**
233		* Set contains all elements of successful addAll
234		*/
235		public void testAddAll5() {
236	<	try {
237	<	Integer[] empty = new Integer[0];
238	<	Integer[] ints = new Integer[SIZE];
239	<	for (int i = 0; i < SIZE; ++i)
240	<	ints[i] = new Integer(SIZE-1-i);
241	<	ConcurrentSkipListSet q = new ConcurrentSkipListSet();
242	<	assertFalse(q.addAll(Arrays.asList(empty)));
243	<	assertTrue(q.addAll(Arrays.asList(ints)));
244	<	for (int i = 0; i < SIZE; ++i)
262	<	assertEquals(new Integer(i), q.pollFirst());
263	<	}
264	<	finally {}
236	>	Integer[] empty = new Integer[0];
237	>	Integer[] ints = new Integer[SIZE];
238	>	for (int i = 0; i < SIZE; ++i)
239	>	ints[i] = new Integer(SIZE-1-i);
240	>	ConcurrentSkipListSet q = new ConcurrentSkipListSet();
241	>	assertFalse(q.addAll(Arrays.asList(empty)));
242	>	assertTrue(q.addAll(Arrays.asList(ints)));
243	>	for (int i = 0; i < SIZE; ++i)
244	>	assertEquals(i, q.pollFirst());
245		}
246
247		/**
#	Line 270 | Line 250 | public class ConcurrentSkipListSetTest e
250		public void testPollFirst() {
251		ConcurrentSkipListSet q = populatedSet(SIZE);
252		for (int i = 0; i < SIZE; ++i) {
253	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
253	>	assertEquals(i, q.pollFirst());
254		}
255	<	assertNull(q.pollFirst());
255	>	assertNull(q.pollFirst());
256		}
257
258		/**
#	Line 281 | Line 261 | public class ConcurrentSkipListSetTest e
261		public void testPollLast() {
262		ConcurrentSkipListSet q = populatedSet(SIZE);
263		for (int i = SIZE-1; i >= 0; --i) {
264	<	assertEquals(i, ((Integer)q.pollLast()).intValue());
264	>	assertEquals(i, q.pollLast());
265		}
266	<	assertNull(q.pollFirst());
266	>	assertNull(q.pollFirst());
267		}
268
269
#	Line 301 | Line 281 | public class ConcurrentSkipListSetTest e
281		}
282		assertTrue(q.isEmpty());
283		}
284	<
284	>
285		/**
286		* contains(x) reports true when elements added but not yet removed
287		*/
#	Line 377 | Line 357 | public class ConcurrentSkipListSetTest e
357		}
358		}
359
360	<
360	>
361
362		/**
363		* lower returns preceding element
#	Line 395 | Line 375 | public class ConcurrentSkipListSetTest e
375
376		Object e4 = q.lower(zero);
377		assertNull(e4);
398	–
378		}
379
380		/**
#	Line 414 | Line 393 | public class ConcurrentSkipListSetTest e
393
394		Object e4 = q.higher(six);
395		assertNull(e4);
417	–
396		}
397
398		/**
#	Line 433 | Line 411 | public class ConcurrentSkipListSetTest e
411
412		Object e4 = q.floor(zero);
413		assertNull(e4);
436	–
414		}
415
416		/**
#	Line 452 | Line 429 | public class ConcurrentSkipListSetTest e
429
430		Object e4 = q.ceiling(six);
431		assertNull(e4);
455	–
432		}
433
434		/**
#	Line 460 | Line 436 | public class ConcurrentSkipListSetTest e
436		*/
437		public void testToArray() {
438		ConcurrentSkipListSet q = populatedSet(SIZE);
439	<	Object[] o = q.toArray();
439	>	Object[] o = q.toArray();
440		Arrays.sort(o);
441	<	for(int i = 0; i < o.length; i++)
442	<	assertEquals(o[i], q.pollFirst());
441	>	for (int i = 0; i < o.length; i++)
442	>	assertEquals(o[i], q.pollFirst());
443		}
444
445		/**
#	Line 471 | Line 447 | public class ConcurrentSkipListSetTest e
447		*/
448		public void testToArray2() {
449		ConcurrentSkipListSet q = populatedSet(SIZE);
450	<	Integer[] ints = new Integer[SIZE];
451	<	ints = (Integer[])q.toArray(ints);
450	>	Integer[] ints = new Integer[SIZE];
451	>	ints = (Integer[])q.toArray(ints);
452		Arrays.sort(ints);
453	<	for(int i = 0; i < ints.length; i++)
453	>	for (int i = 0; i < ints.length; i++)
454		assertEquals(ints[i], q.pollFirst());
455		}
456	<
456	>
457		/**
458		* iterator iterates through all elements
459		*/
460		public void testIterator() {
461		ConcurrentSkipListSet q = populatedSet(SIZE);
462		int i = 0;
463	<	Iterator it = q.iterator();
464	<	while(it.hasNext()) {
463	>	Iterator it = q.iterator();
464	>	while (it.hasNext()) {
465		assertTrue(q.contains(it.next()));
466		++i;
467		}
#	Line 498 | Line 474 | public class ConcurrentSkipListSetTest e
474		public void testEmptyIterator() {
475		ConcurrentSkipListSet q = new ConcurrentSkipListSet();
476		int i = 0;
477	<	Iterator it = q.iterator();
478	<	while(it.hasNext()) {
477	>	Iterator it = q.iterator();
478	>	while (it.hasNext()) {
479		assertTrue(q.contains(it.next()));
480		++i;
481		}
#	Line 509 | Line 485 | public class ConcurrentSkipListSetTest e
485		/**
486		* iterator.remove removes current element
487		*/
488	<	public void testIteratorRemove () {
488	>	public void testIteratorRemove() {
489		final ConcurrentSkipListSet q = new ConcurrentSkipListSet();
490		q.add(new Integer(2));
491		q.add(new Integer(1));
#	Line 535 | Line 511 | public class ConcurrentSkipListSetTest e
511		for (int i = 0; i < SIZE; ++i) {
512		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
513		}
514	<	}
514	>	}
515
516		/**
517	<	* A deserialized serialized set has same elements
517	>	* A deserialized serialized set has same elements
518		*/
519	<	public void testSerialization() {
519	>	public void testSerialization() throws Exception {
520		ConcurrentSkipListSet q = populatedSet(SIZE);
521	<	try {
522	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
523	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
524	<	out.writeObject(q);
525	<	out.close();
526	<
527	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
528	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
529	<	ConcurrentSkipListSet r = (ConcurrentSkipListSet)in.readObject();
530	<	assertEquals(q.size(), r.size());
531	<	while (!q.isEmpty())
556	<	assertEquals(q.pollFirst(), r.pollFirst());
557	<	} catch(Exception e){
558	<	e.printStackTrace();
559	<	unexpectedException();
560	<	}
521	>	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
522	>	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
523	>	out.writeObject(q);
524	>	out.close();
525	>
526	>	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
527	>	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
528	>	ConcurrentSkipListSet r = (ConcurrentSkipListSet)in.readObject();
529	>	assertEquals(q.size(), r.size());
530	>	while (!q.isEmpty())
531	>	assertEquals(q.pollFirst(), r.pollFirst());
532		}
533
534		/**
#	Line 679 | Line 650 | public class ConcurrentSkipListSetTest e
650		assertEquals(4, set.size());
651		}
652
653	+	Random rnd = new Random(666);
654	+	BitSet bs;
655	+
656	+	/**
657	+	* Subsets of subsets subdivide correctly
658	+	*/
659	+	public void testRecursiveSubSets() throws Exception {
660	+	int setSize = 1000;
661	+	Class cl = ConcurrentSkipListSet.class;
662	+
663	+	NavigableSet<Integer> set = newSet(cl);
664	+	bs = new BitSet(setSize);
665	+
666	+	populate(set, setSize);
667	+	check(set,                 0, setSize - 1, true);
668	+	check(set.descendingSet(), 0, setSize - 1, false);
669	+
670	+	mutateSet(set, 0, setSize - 1);
671	+	check(set,                 0, setSize - 1, true);
672	+	check(set.descendingSet(), 0, setSize - 1, false);
673	+
674	+	bashSubSet(set.subSet(0, true, setSize, false),
675	+	0, setSize - 1, true);
676	+	}
677	+
678	+	static NavigableSet<Integer> newSet(Class cl) throws Exception {
679	+	NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance();
680	+	assertEquals(result.size(), 0);
681	+	assertFalse(result.iterator().hasNext());
682	+	return result;
683	+	}
684	+
685	+	void populate(NavigableSet<Integer> set, int limit) {
686	+	for (int i = 0, n = 2 * limit / 3; i < n; i++) {
687	+	int element = rnd.nextInt(limit);
688	+	put(set, element);
689	+	}
690	+	}
691	+
692	+	void mutateSet(NavigableSet<Integer> set, int min, int max) {
693	+	int size = set.size();
694	+	int rangeSize = max - min + 1;
695	+
696	+	// Remove a bunch of entries directly
697	+	for (int i = 0, n = rangeSize / 2; i < n; i++) {
698	+	remove(set, min - 5 + rnd.nextInt(rangeSize + 10));
699	+	}
700	+
701	+	// Remove a bunch of entries with iterator
702	+	for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
703	+	if (rnd.nextBoolean()) {
704	+	bs.clear(it.next());
705	+	it.remove();
706	+	}
707	+	}
708	+
709	+	// Add entries till we're back to original size
710	+	while (set.size() < size) {
711	+	int element = min + rnd.nextInt(rangeSize);
712	+	assertTrue(element >= min && element<= max);
713	+	put(set, element);
714	+	}
715	+	}
716	+
717	+	void mutateSubSet(NavigableSet<Integer> set, int min, int max) {
718	+	int size = set.size();
719	+	int rangeSize = max - min + 1;
720	+
721	+	// Remove a bunch of entries directly
722	+	for (int i = 0, n = rangeSize / 2; i < n; i++) {
723	+	remove(set, min - 5 + rnd.nextInt(rangeSize + 10));
724	+	}
725	+
726	+	// Remove a bunch of entries with iterator
727	+	for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
728	+	if (rnd.nextBoolean()) {
729	+	bs.clear(it.next());
730	+	it.remove();
731	+	}
732	+	}
733	+
734	+	// Add entries till we're back to original size
735	+	while (set.size() < size) {
736	+	int element = min - 5 + rnd.nextInt(rangeSize + 10);
737	+	if (element >= min && element<= max) {
738	+	put(set, element);
739	+	} else {
740	+	try {
741	+	set.add(element);
742	+	shouldThrow();
743	+	} catch (IllegalArgumentException success) {}
744	+	}
745	+	}
746	+	}
747	+
748	+	void put(NavigableSet<Integer> set, int element) {
749	+	if (set.add(element))
750	+	bs.set(element);
751	+	}
752	+
753	+	void remove(NavigableSet<Integer> set, int element) {
754	+	if (set.remove(element))
755	+	bs.clear(element);
756	+	}
757	+
758	+	void bashSubSet(NavigableSet<Integer> set,
759	+	int min, int max, boolean ascending) {
760	+	check(set, min, max, ascending);
761	+	check(set.descendingSet(), min, max, !ascending);
762	+
763	+	mutateSubSet(set, min, max);
764	+	check(set, min, max, ascending);
765	+	check(set.descendingSet(), min, max, !ascending);
766	+
767	+	// Recurse
768	+	if (max - min < 2)
769	+	return;
770	+	int midPoint = (min + max) / 2;
771	+
772	+	// headSet - pick direction and endpoint inclusion randomly
773	+	boolean incl = rnd.nextBoolean();
774	+	NavigableSet<Integer> hm = set.headSet(midPoint, incl);
775	+	if (ascending) {
776	+	if (rnd.nextBoolean())
777	+	bashSubSet(hm, min, midPoint - (incl ? 0 : 1), true);
778	+	else
779	+	bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1),
780	+	false);
781	+	} else {
782	+	if (rnd.nextBoolean())
783	+	bashSubSet(hm, midPoint + (incl ? 0 : 1), max, false);
784	+	else
785	+	bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max,
786	+	true);
787	+	}
788	+
789	+	// tailSet - pick direction and endpoint inclusion randomly
790	+	incl = rnd.nextBoolean();
791	+	NavigableSet<Integer> tm = set.tailSet(midPoint,incl);
792	+	if (ascending) {
793	+	if (rnd.nextBoolean())
794	+	bashSubSet(tm, midPoint + (incl ? 0 : 1), max, true);
795	+	else
796	+	bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max,
797	+	false);
798	+	} else {
799	+	if (rnd.nextBoolean()) {
800	+	bashSubSet(tm, min, midPoint - (incl ? 0 : 1), false);
801	+	} else {
802	+	bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1),
803	+	true);
804	+	}
805	+	}
806	+
807	+	// subSet - pick direction and endpoint inclusion randomly
808	+	int rangeSize = max - min + 1;
809	+	int[] endpoints = new int[2];
810	+	endpoints[0] = min + rnd.nextInt(rangeSize);
811	+	endpoints[1] = min + rnd.nextInt(rangeSize);
812	+	Arrays.sort(endpoints);
813	+	boolean lowIncl = rnd.nextBoolean();
814	+	boolean highIncl = rnd.nextBoolean();
815	+	if (ascending) {
816	+	NavigableSet<Integer> sm = set.subSet(
817	+	endpoints[0], lowIncl, endpoints[1], highIncl);
818	+	if (rnd.nextBoolean())
819	+	bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1),
820	+	endpoints[1] - (highIncl ? 0 : 1), true);
821	+	else
822	+	bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1),
823	+	endpoints[1] - (highIncl ? 0 : 1), false);
824	+	} else {
825	+	NavigableSet<Integer> sm = set.subSet(
826	+	endpoints[1], highIncl, endpoints[0], lowIncl);
827	+	if (rnd.nextBoolean())
828	+	bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1),
829	+	endpoints[1] - (highIncl ? 0 : 1), false);
830	+	else
831	+	bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1),
832	+	endpoints[1] - (highIncl ? 0 : 1), true);
833	+	}
834	+	}
835	+
836	+	/**
837	+	* min and max are both inclusive.  If max < min, interval is empty.
838	+	*/
839	+	void check(NavigableSet<Integer> set,
840	+	final int min, final int max, final boolean ascending) {
841	+	class ReferenceSet {
842	+	int lower(int element) {
843	+	return ascending ?
844	+	lowerAscending(element) : higherAscending(element);
845	+	}
846	+	int floor(int element) {
847	+	return ascending ?
848	+	floorAscending(element) : ceilingAscending(element);
849	+	}
850	+	int ceiling(int element) {
851	+	return ascending ?
852	+	ceilingAscending(element) : floorAscending(element);
853	+	}
854	+	int higher(int element) {
855	+	return ascending ?
856	+	higherAscending(element) : lowerAscending(element);
857	+	}
858	+	int first() {
859	+	return ascending ? firstAscending() : lastAscending();
860	+	}
861	+	int last() {
862	+	return ascending ? lastAscending() : firstAscending();
863	+	}
864	+	int lowerAscending(int element) {
865	+	return floorAscending(element - 1);
866	+	}
867	+	int floorAscending(int element) {
868	+	if (element < min)
869	+	return -1;
870	+	else if (element > max)
871	+	element = max;
872	+
873	+	// BitSet should support this! Test would run much faster
874	+	while (element >= min) {
875	+	if (bs.get(element))
876	+	return(element);
877	+	element--;
878	+	}
879	+	return -1;
880	+	}
881	+	int ceilingAscending(int element) {
882	+	if (element < min)
883	+	element = min;
884	+	else if (element > max)
885	+	return -1;
886	+	int result = bs.nextSetBit(element);
887	+	return result > max ? -1 : result;
888	+	}
889	+	int higherAscending(int element) {
890	+	return ceilingAscending(element + 1);
891	+	}
892	+	private int firstAscending() {
893	+	int result = ceilingAscending(min);
894	+	return result > max ? -1 : result;
895	+	}
896	+	private int lastAscending() {
897	+	int result = floorAscending(max);
898	+	return result < min ? -1 : result;
899	+	}
900	+	}
901	+	ReferenceSet rs = new ReferenceSet();
902	+
903	+	// Test contents using containsElement
904	+	int size = 0;
905	+	for (int i = min; i <= max; i++) {
906	+	boolean bsContainsI = bs.get(i);
907	+	assertEquals(bsContainsI, set.contains(i));
908	+	if (bsContainsI)
909	+	size++;
910	+	}
911	+	assertEquals(set.size(), size);
912	+
913	+	// Test contents using contains elementSet iterator
914	+	int size2 = 0;
915	+	int previousElement = -1;
916	+	for (int element : set) {
917	+	assertTrue(bs.get(element));
918	+	size2++;
919	+	assertTrue(previousElement < 0 || (ascending ?
920	+	element - previousElement > 0 : element - previousElement < 0));
921	+	previousElement = element;
922	+	}
923	+	assertEquals(size2, size);
924	+
925	+	// Test navigation ops
926	+	for (int element = min - 1; element <= max + 1; element++) {
927	+	assertEq(set.lower(element), rs.lower(element));
928	+	assertEq(set.floor(element), rs.floor(element));
929	+	assertEq(set.higher(element), rs.higher(element));
930	+	assertEq(set.ceiling(element), rs.ceiling(element));
931	+	}
932	+
933	+	// Test extrema
934	+	if (set.size() != 0) {
935	+	assertEq(set.first(), rs.first());
936	+	assertEq(set.last(), rs.last());
937	+	} else {
938	+	assertEq(rs.first(), -1);
939	+	assertEq(rs.last(),  -1);
940	+	try {
941	+	set.first();
942	+	shouldThrow();
943	+	} catch (NoSuchElementException success) {}
944	+	try {
945	+	set.last();
946	+	shouldThrow();
947	+	} catch (NoSuchElementException success) {}
948	+	}
949	+	}
950	+
951	+	static void assertEq(Integer i, int j) {
952	+	if (i == null)
953	+	assertEquals(j, -1);
954	+	else
955	+	assertEquals((int) i, j);
956	+	}
957	+
958	+	static boolean eq(Integer i, int j) {
959	+	return i == null ? j == -1 : i == j;
960	+	}
961	+
962		}

Diff Legend

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