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.7 by jsr166, Sat Nov 21 02:07:27 2009 UTC vs.
Revision 1.36 by jsr166, Sat Feb 28 18:18:56 2015 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.*;
8	<	import java.util.*;
9	<	import java.util.concurrent.*;
10	<	import java.io.*;
7	>	import java.util.Arrays;
8	>	import java.util.BitSet;
9	>	import java.util.Collection;
10	>	import java.util.Comparator;
11	>	import java.util.Iterator;
12	>	import java.util.NavigableSet;
13	>	import java.util.NoSuchElementException;
14	>	import java.util.Random;
15	>	import java.util.Set;
16	>	import java.util.SortedSet;
17	>	import java.util.TreeSet;
18	>
19	>	import junit.framework.Test;
20	>	import junit.framework.TestSuite;
21
22		public class TreeSetTest extends JSR166TestCase {
23		public static void main(String[] args) {
24	<	junit.textui.TestRunner.run (suite());
24	>	junit.textui.TestRunner.run(suite());
25		}
26		public static Test suite() {
27		return new TestSuite(TreeSetTest.class);
#	Line 19 | Line 29 | public class TreeSetTest extends JSR166T
29
30		static class MyReverseComparator implements Comparator {
31		public int compare(Object x, Object y) {
32	<	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;
32	>	return ((Comparable)y).compareTo(x);
33		}
34		}
35
#	Line 33 | Line 39 | public class TreeSetTest extends JSR166T
39		static final int SIZE = 20;
40
41		/**
42	<	* Create a set of given size containing consecutive
42	>	* Returns a new set of given size containing consecutive
43		* Integers 0 ... n.
44		*/
45	<	private TreeSet populatedSet(int n) {
46	<	TreeSet q = new TreeSet();
45	>	private TreeSet<Integer> populatedSet(int n) {
46	>	TreeSet<Integer> q = new TreeSet<Integer>();
47		assertTrue(q.isEmpty());
48	<	for (int i = n-1; i >= 0; i-=2)
48	>	for (int i = n-1; i >= 0; i -= 2)
49		assertTrue(q.add(new Integer(i)));
50	<	for (int i = (n & 1); i < n; i+=2)
50	>	for (int i = (n & 1); i < n; i += 2)
51		assertTrue(q.add(new Integer(i)));
52		assertFalse(q.isEmpty());
53		assertEquals(n, q.size());
#	Line 49 | Line 55 | public class TreeSetTest extends JSR166T
55		}
56
57		/**
58	<	* Create set of first 5 ints
58	>	* Returns a new set of first 5 ints.
59		*/
60		private TreeSet set5() {
61		TreeSet q = new TreeSet();
#	Line 75 | Line 81 | public class TreeSetTest extends JSR166T
81		*/
82		public void testConstructor3() {
83		try {
84	<	TreeSet q = new TreeSet((Collection)null);
84	>	new TreeSet((Collection)null);
85		shouldThrow();
86	<	}
81	<	catch (NullPointerException success) {}
86	>	} catch (NullPointerException success) {}
87		}
88
89		/**
#	Line 87 | Line 92 | public class TreeSetTest extends JSR166T
92		public void testConstructor4() {
93		try {
94		Integer[] ints = new Integer[SIZE];
95	<	TreeSet q = new TreeSet(Arrays.asList(ints));
95	>	new TreeSet(Arrays.asList(ints));
96		shouldThrow();
97	<	}
93	<	catch (NullPointerException success) {}
97	>	} catch (NullPointerException success) {}
98		}
99
100		/**
#	Line 101 | Line 105 | public class TreeSetTest extends JSR166T
105		Integer[] ints = new Integer[SIZE];
106		for (int i = 0; i < SIZE-1; ++i)
107		ints[i] = new Integer(i);
108	<	TreeSet q = new TreeSet(Arrays.asList(ints));
108	>	new TreeSet(Arrays.asList(ints));
109		shouldThrow();
110	<	}
107	<	catch (NullPointerException success) {}
110	>	} catch (NullPointerException success) {}
111		}
112
113		/**
114		* Set contains all elements of collection used to initialize
115		*/
116		public void testConstructor6() {
117	<	try {
118	<	Integer[] ints = new Integer[SIZE];
119	<	for (int i = 0; i < SIZE; ++i)
120	<	ints[i] = new Integer(i);
121	<	TreeSet q = new TreeSet(Arrays.asList(ints));
122	<	for (int i = 0; i < SIZE; ++i)
120	<	assertEquals(ints[i], q.pollFirst());
121	<	}
122	<	finally {}
117	>	Integer[] ints = new Integer[SIZE];
118	>	for (int i = 0; i < SIZE; ++i)
119	>	ints[i] = new Integer(i);
120	>	TreeSet q = new TreeSet(Arrays.asList(ints));
121	>	for (int i = 0; i < SIZE; ++i)
122	>	assertEquals(ints[i], q.pollFirst());
123		}
124
125		/**
126		* The comparator used in constructor is used
127		*/
128		public void testConstructor7() {
129	<	try {
130	<	MyReverseComparator cmp = new MyReverseComparator();
131	<	TreeSet q = new TreeSet(cmp);
132	<	assertEquals(cmp, q.comparator());
133	<	Integer[] ints = new Integer[SIZE];
134	<	for (int i = 0; i < SIZE; ++i)
135	<	ints[i] = new Integer(i);
136	<	q.addAll(Arrays.asList(ints));
137	<	for (int i = SIZE-1; i >= 0; --i)
138	<	assertEquals(ints[i], q.pollFirst());
139	<	}
140	<	finally {}
129	>	MyReverseComparator cmp = new MyReverseComparator();
130	>	TreeSet q = new TreeSet(cmp);
131	>	assertEquals(cmp, q.comparator());
132	>	Integer[] ints = new Integer[SIZE];
133	>	for (int i = 0; i < SIZE; ++i)
134	>	ints[i] = new Integer(i);
135	>	q.addAll(Arrays.asList(ints));
136	>	for (int i = SIZE-1; i >= 0; --i)
137	>	assertEquals(ints[i], q.pollFirst());
138		}
139
140		/**
#	Line 173 | Line 170 | public class TreeSetTest extends JSR166T
170		* add(null) throws NPE if nonempty
171		*/
172		public void testAddNull() {
173	+	TreeSet q = populatedSet(SIZE);
174		try {
177	–	TreeSet q = populatedSet(SIZE);
175		q.add(null);
176		shouldThrow();
177	<	} catch (NullPointerException success) { }
177	>	} catch (NullPointerException success) {}
178		}
179
180		/**
#	Line 202 | Line 199 | public class TreeSetTest extends JSR166T
199		* Add of non-Comparable throws CCE
200		*/
201		public void testAddNonComparable() {
202	+	TreeSet q = new TreeSet();
203		try {
206	–	TreeSet q = new TreeSet();
204		q.add(new Object());
205		q.add(new Object());
206		q.add(new Object());
207		shouldThrow();
208	<	}
212	<	catch (ClassCastException success) {}
208	>	} catch (ClassCastException success) {}
209		}
210
211		/**
212		* addAll(null) throws NPE
213		*/
214		public void testAddAll1() {
215	+	TreeSet q = new TreeSet();
216		try {
220	–	TreeSet q = new TreeSet();
217		q.addAll(null);
218		shouldThrow();
219	<	}
224	<	catch (NullPointerException success) {}
219	>	} catch (NullPointerException success) {}
220		}
221	+
222		/**
223		* addAll of a collection with null elements throws NPE
224		*/
225		public void testAddAll2() {
226	+	TreeSet q = new TreeSet();
227	+	Integer[] ints = new Integer[SIZE];
228		try {
231	–	TreeSet q = new TreeSet();
232	–	Integer[] ints = new Integer[SIZE];
229		q.addAll(Arrays.asList(ints));
230		shouldThrow();
231	<	}
236	<	catch (NullPointerException success) {}
231	>	} catch (NullPointerException success) {}
232		}
233	+
234		/**
235		* addAll of a collection with any null elements throws NPE after
236		* possibly adding some elements
237		*/
238		public void testAddAll3() {
239	+	TreeSet q = new TreeSet();
240	+	Integer[] ints = new Integer[SIZE];
241	+	for (int i = 0; i < SIZE-1; ++i)
242	+	ints[i] = new Integer(i);
243		try {
244	–	TreeSet q = new TreeSet();
245	–	Integer[] ints = new Integer[SIZE];
246	–	for (int i = 0; i < SIZE-1; ++i)
247	–	ints[i] = new Integer(i);
244		q.addAll(Arrays.asList(ints));
245		shouldThrow();
246	<	}
251	<	catch (NullPointerException success) {}
246	>	} catch (NullPointerException success) {}
247		}
248
249		/**
250		* Set contains all elements of successful addAll
251		*/
252		public void testAddAll5() {
253	<	try {
254	<	Integer[] empty = new Integer[0];
255	<	Integer[] ints = new Integer[SIZE];
256	<	for (int i = 0; i < SIZE; ++i)
257	<	ints[i] = new Integer(SIZE-1-i);
258	<	TreeSet q = new TreeSet();
259	<	assertFalse(q.addAll(Arrays.asList(empty)));
260	<	assertTrue(q.addAll(Arrays.asList(ints)));
261	<	for (int i = 0; i < SIZE; ++i)
267	<	assertEquals(new Integer(i), q.pollFirst());
268	<	}
269	<	finally {}
253	>	Integer[] empty = new Integer[0];
254	>	Integer[] ints = new Integer[SIZE];
255	>	for (int i = 0; i < SIZE; ++i)
256	>	ints[i] = new Integer(SIZE-1-i);
257	>	TreeSet q = new TreeSet();
258	>	assertFalse(q.addAll(Arrays.asList(empty)));
259	>	assertTrue(q.addAll(Arrays.asList(ints)));
260	>	for (int i = 0; i < SIZE; ++i)
261	>	assertEquals(new Integer(i), q.pollFirst());
262		}
263
264		/**
#	Line 275 | Line 267 | public class TreeSetTest extends JSR166T
267		public void testPollFirst() {
268		TreeSet q = populatedSet(SIZE);
269		for (int i = 0; i < SIZE; ++i) {
270	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
270	>	assertEquals(i, q.pollFirst());
271		}
272		assertNull(q.pollFirst());
273		}
#	Line 286 | Line 278 | public class TreeSetTest extends JSR166T
278		public void testPollLast() {
279		TreeSet q = populatedSet(SIZE);
280		for (int i = SIZE-1; i >= 0; --i) {
281	<	assertEquals(i, ((Integer)q.pollLast()).intValue());
281	>	assertEquals(i, q.pollLast());
282		}
283		assertNull(q.pollFirst());
284		}
285
294	–
286		/**
287		* remove(x) removes x and returns true if present
288		*/
289		public void testRemoveElement() {
290		TreeSet q = populatedSet(SIZE);
291	<	for (int i = 1; i < SIZE; i+=2) {
292	<	assertTrue(q.remove(new Integer(i)));
293	<	}
294	<	for (int i = 0; i < SIZE; i+=2) {
295	<	assertTrue(q.remove(new Integer(i)));
296	<	assertFalse(q.remove(new Integer(i+1)));
291	>	for (int i = 1; i < SIZE; i += 2) {
292	>	assertTrue(q.contains(i));
293	>	assertTrue(q.remove(i));
294	>	assertFalse(q.contains(i));
295	>	assertTrue(q.contains(i-1));
296	>	}
297	>	for (int i = 0; i < SIZE; i += 2) {
298	>	assertTrue(q.contains(i));
299	>	assertTrue(q.remove(i));
300	>	assertFalse(q.contains(i));
301	>	assertFalse(q.remove(i+1));
302	>	assertFalse(q.contains(i+1));
303		}
304		assertTrue(q.isEmpty());
305		}
#	Line 376 | Line 373 | public class TreeSetTest extends JSR166T
373		assertTrue(q.removeAll(p));
374		assertEquals(SIZE-i, q.size());
375		for (int j = 0; j < i; ++j) {
376	<	Integer I = (Integer)(p.pollFirst());
377	<	assertFalse(q.contains(I));
376	>	Integer x = (Integer)(p.pollFirst());
377	>	assertFalse(q.contains(x));
378		}
379		}
380		}
381
385	–
386	–
382		/**
383		* lower returns preceding element
384		*/
#	Line 400 | Line 395 | public class TreeSetTest extends JSR166T
395
396		Object e4 = q.lower(zero);
397		assertNull(e4);
403	–
398		}
399
400		/**
#	Line 419 | Line 413 | public class TreeSetTest extends JSR166T
413
414		Object e4 = q.higher(six);
415		assertNull(e4);
422	–
416		}
417
418		/**
#	Line 438 | Line 431 | public class TreeSetTest extends JSR166T
431
432		Object e4 = q.floor(zero);
433		assertNull(e4);
441	–
434		}
435
436		/**
#	Line 457 | Line 449 | public class TreeSetTest extends JSR166T
449
450		Object e4 = q.ceiling(six);
451		assertNull(e4);
460	–
452		}
453
454		/**
455	<	* toArray contains all elements
455	>	* toArray contains all elements in sorted order
456		*/
457		public void testToArray() {
458		TreeSet q = populatedSet(SIZE);
459		Object[] o = q.toArray();
469	–	Arrays.sort(o);
460		for (int i = 0; i < o.length; i++)
461	<	assertEquals(o[i], q.pollFirst());
461	>	assertSame(o[i], q.pollFirst());
462		}
463
464		/**
465	<	* toArray(a) contains all elements
465	>	* toArray(a) contains all elements in sorted order
466		*/
467		public void testToArray2() {
468	<	TreeSet q = populatedSet(SIZE);
468	>	TreeSet<Integer> q = populatedSet(SIZE);
469		Integer[] ints = new Integer[SIZE];
470	<	ints = (Integer[])q.toArray(ints);
471	<	Arrays.sort(ints);
470	>	Integer[] array = q.toArray(ints);
471	>	assertSame(ints, array);
472		for (int i = 0; i < ints.length; i++)
473	<	assertEquals(ints[i], q.pollFirst());
473	>	assertSame(ints[i], q.pollFirst());
474		}
475
476		/**
#	Line 488 | Line 478 | public class TreeSetTest extends JSR166T
478		*/
479		public void testIterator() {
480		TreeSet q = populatedSet(SIZE);
491	–	int i = 0;
481		Iterator it = q.iterator();
482	<	while (it.hasNext()) {
482	>	int i;
483	>	for (i = 0; it.hasNext(); i++)
484		assertTrue(q.contains(it.next()));
495	–	++i;
496	–	}
485		assertEquals(i, SIZE);
486	+	assertIteratorExhausted(it);
487		}
488
489		/**
490		* iterator of empty set has no elements
491		*/
492		public void testEmptyIterator() {
493	<	TreeSet q = new TreeSet();
505	<	int i = 0;
506	<	Iterator it = q.iterator();
507	<	while (it.hasNext()) {
508	<	assertTrue(q.contains(it.next()));
509	<	++i;
510	<	}
511	<	assertEquals(i, 0);
493	>	assertIteratorExhausted(new TreeSet().iterator());
494		}
495
496		/**
497		* iterator.remove removes current element
498		*/
499	<	public void testIteratorRemove () {
499	>	public void testIteratorRemove() {
500		final TreeSet q = new TreeSet();
501		q.add(new Integer(2));
502		q.add(new Integer(1));
#	Line 530 | Line 512 | public class TreeSetTest extends JSR166T
512		assertFalse(it.hasNext());
513		}
514
533	–
515		/**
516		* toString contains toStrings of elements
517		*/
#	Line 538 | Line 519 | public class TreeSetTest extends JSR166T
519		TreeSet q = populatedSet(SIZE);
520		String s = q.toString();
521		for (int i = 0; i < SIZE; ++i) {
522	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
522	>	assertTrue(s.contains(String.valueOf(i)));
523		}
524		}
525
526		/**
527		* A deserialized serialized set has same elements
528		*/
529	<	public void testSerialization() {
530	<	TreeSet q = populatedSet(SIZE);
531	<	try {
532	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
533	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
534	<	out.writeObject(q);
535	<	out.close();
536	<
537	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
538	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
539	<	TreeSet r = (TreeSet)in.readObject();
559	<	assertEquals(q.size(), r.size());
560	<	while (!q.isEmpty())
561	<	assertEquals(q.pollFirst(), r.pollFirst());
562	<	} catch (Exception e) {
563	<	e.printStackTrace();
564	<	unexpectedException();
529	>	public void testSerialization() throws Exception {
530	>	NavigableSet x = populatedSet(SIZE);
531	>	NavigableSet y = serialClone(x);
532	>
533	>	assertNotSame(x, y);
534	>	assertEquals(x.size(), y.size());
535	>	assertEquals(x, y);
536	>	assertEquals(y, x);
537	>	while (!x.isEmpty()) {
538	>	assertFalse(y.isEmpty());
539	>	assertEquals(x.pollFirst(), y.pollFirst());
540		}
541	+	assertTrue(y.isEmpty());
542		}
543
544		/**
#	Line 690 | Line 666 | public class TreeSetTest extends JSR166T
666		/**
667		* Subsets of subsets subdivide correctly
668		*/
669	<	public void testRecursiveSubSets() {
670	<	int setSize = 1000;
669	>	public void testRecursiveSubSets() throws Exception {
670	>	int setSize = expensiveTests ? 1000 : 100;
671		Class cl = TreeSet.class;
672
673		NavigableSet<Integer> set = newSet(cl);
#	Line 709 | Line 685 | public class TreeSetTest extends JSR166T
685		0, setSize - 1, true);
686		}
687
688	<	static NavigableSet<Integer> newSet(Class cl) {
689	<	NavigableSet<Integer> result = null;
690	<	try {
691	<	result = (NavigableSet<Integer>) cl.newInstance();
692	<	} catch (Exception e) {
693	<	fail();
694	<	}
695	<	assertEquals(result.size(), 0);
688	>	/**
689	>	* addAll is idempotent
690	>	*/
691	>	public void testAddAll_idempotent() throws Exception {
692	>	Set x = populatedSet(SIZE);
693	>	Set y = new TreeSet(x);
694	>	y.addAll(x);
695	>	assertEquals(x, y);
696	>	assertEquals(y, x);
697	>	}
698	>
699	>	static NavigableSet<Integer> newSet(Class cl) throws Exception {
700	>	NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance();
701	>	assertEquals(0, result.size());
702		assertFalse(result.iterator().hasNext());
703		return result;
704		}
#	Line 748 | Line 730 | public class TreeSetTest extends JSR166T
730		// Add entries till we're back to original size
731		while (set.size() < size) {
732		int element = min + rnd.nextInt(rangeSize);
733	<	assertTrue(element >= min && element<= max);
733	>	assertTrue(element >= min && element <= max);
734		put(set, element);
735		}
736		}
#	Line 773 | Line 755 | public class TreeSetTest extends JSR166T
755		// Add entries till we're back to original size
756		while (set.size() < size) {
757		int element = min - 5 + rnd.nextInt(rangeSize + 10);
758	<	if (element >= min && element<= max) {
758	>	if (element >= min && element <= max) {
759		put(set, element);
760		} else {
761		try {
762		set.add(element);
763	<	fail();
764	<	} catch (IllegalArgumentException e) {
783	<	// expected
784	<	}
763	>	shouldThrow();
764	>	} catch (IllegalArgumentException success) {}
765		}
766		}
767		}
#	Line 879 | Line 859 | public class TreeSetTest extends JSR166T
859		*/
860		void check(NavigableSet<Integer> set,
861		final int min, final int max, final boolean ascending) {
862	<	class ReferenceSet {
862	>	class ReferenceSet {
863		int lower(int element) {
864		return ascending ?
865		lowerAscending(element) : higherAscending(element);
#	Line 914 | Line 894 | public class TreeSetTest extends JSR166T
894		// BitSet should support this! Test would run much faster
895		while (element >= min) {
896		if (bs.get(element))
897	<	return(element);
897	>	return element;
898		element--;
899		}
900		return -1;
#	Line 949 | Line 929 | public class TreeSetTest extends JSR166T
929		if (bsContainsI)
930		size++;
931		}
932	<	assertEquals(set.size(), size);
932	>	assertEquals(size, set.size());
933
934		// Test contents using contains elementSet iterator
935		int size2 = 0;
#	Line 980 | Line 960 | public class TreeSetTest extends JSR166T
960		assertEq(rs.last(),  -1);
961		try {
962		set.first();
963	<	fail();
964	<	} catch (NoSuchElementException e) {
985	<	// expected
986	<	}
963	>	shouldThrow();
964	>	} catch (NoSuchElementException success) {}
965		try {
966		set.last();
967	<	fail();
968	<	} catch (NoSuchElementException e) {
991	<	// expected
992	<	}
967	>	shouldThrow();
968	>	} catch (NoSuchElementException success) {}
969		}
970		}
971

Diff Legend

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