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.9 by jsr166, Sat Nov 21 10:29:50 2009 UTC vs.
Revision 1.42 by jsr166, Sun May 24 01:42:14 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	>	main(suite(), args);
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		} catch (NullPointerException success) {}
87		}
#	Line 85 | Line 91 | public class TreeSetTest extends JSR166T
91		*/
92		public void testConstructor4() {
93		try {
94	<	Integer[] ints = new Integer[SIZE];
89	<	TreeSet q = new TreeSet(Arrays.asList(ints));
94	>	new TreeSet(Arrays.asList(new Integer[SIZE]));
95		shouldThrow();
96		} catch (NullPointerException success) {}
97		}
#	Line 95 | Line 100 | public class TreeSetTest extends JSR166T
100		* Initializing from Collection with some null elements throws NPE
101		*/
102		public void testConstructor5() {
103	+	Integer[] ints = new Integer[SIZE];
104	+	for (int i = 0; i < SIZE - 1; ++i)
105	+	ints[i] = new Integer(i);
106		try {
107	<	Integer[] ints = new Integer[SIZE];
100	<	for (int i = 0; i < SIZE-1; ++i)
101	<	ints[i] = new Integer(i);
102	<	TreeSet q = new TreeSet(Arrays.asList(ints));
107	>	new TreeSet(Arrays.asList(ints));
108		shouldThrow();
109		} catch (NullPointerException success) {}
110		}
#	Line 127 | Line 132 | public class TreeSetTest extends JSR166T
132		for (int i = 0; i < SIZE; ++i)
133		ints[i] = new Integer(i);
134		q.addAll(Arrays.asList(ints));
135	<	for (int i = SIZE-1; i >= 0; --i)
135	>	for (int i = SIZE - 1; i >= 0; --i)
136		assertEquals(ints[i], q.pollFirst());
137		}
138
#	Line 151 | Line 156 | public class TreeSetTest extends JSR166T
156		public void testSize() {
157		TreeSet q = populatedSet(SIZE);
158		for (int i = 0; i < SIZE; ++i) {
159	<	assertEquals(SIZE-i, q.size());
159	>	assertEquals(SIZE - i, q.size());
160		q.pollFirst();
161		}
162		for (int i = 0; i < SIZE; ++i) {
#	Line 164 | Line 169 | public class TreeSetTest extends JSR166T
169		* add(null) throws NPE if nonempty
170		*/
171		public void testAddNull() {
172	+	TreeSet q = populatedSet(SIZE);
173		try {
168	–	TreeSet q = populatedSet(SIZE);
174		q.add(null);
175		shouldThrow();
176		} catch (NullPointerException success) {}
#	Line 193 | Line 198 | public class TreeSetTest extends JSR166T
198		* Add of non-Comparable throws CCE
199		*/
200		public void testAddNonComparable() {
201	+	TreeSet q = new TreeSet();
202		try {
197	–	TreeSet q = new TreeSet();
198	–	q.add(new Object());
203		q.add(new Object());
204		q.add(new Object());
205		shouldThrow();
#	Line 206 | Line 210 | public class TreeSetTest extends JSR166T
210		* addAll(null) throws NPE
211		*/
212		public void testAddAll1() {
213	+	TreeSet q = new TreeSet();
214		try {
210	–	TreeSet q = new TreeSet();
215		q.addAll(null);
216		shouldThrow();
217		} catch (NullPointerException success) {}
218		}
219	+
220		/**
221		* addAll of a collection with null elements throws NPE
222		*/
223		public void testAddAll2() {
224	+	TreeSet q = new TreeSet();
225	+	Integer[] ints = new Integer[SIZE];
226		try {
220	–	TreeSet q = new TreeSet();
221	–	Integer[] ints = new Integer[SIZE];
227		q.addAll(Arrays.asList(ints));
228		shouldThrow();
229		} catch (NullPointerException success) {}
230		}
231	+
232		/**
233		* addAll of a collection with any null elements throws NPE after
234		* possibly adding some elements
235		*/
236		public void testAddAll3() {
237	+	TreeSet q = new TreeSet();
238	+	Integer[] ints = new Integer[SIZE];
239	+	for (int i = 0; i < SIZE - 1; ++i)
240	+	ints[i] = new Integer(i);
241		try {
232	–	TreeSet q = new TreeSet();
233	–	Integer[] ints = new Integer[SIZE];
234	–	for (int i = 0; i < SIZE-1; ++i)
235	–	ints[i] = new Integer(i);
242		q.addAll(Arrays.asList(ints));
243		shouldThrow();
244		} catch (NullPointerException success) {}
#	Line 245 | Line 251 | public class TreeSetTest extends JSR166T
251		Integer[] empty = new Integer[0];
252		Integer[] ints = new Integer[SIZE];
253		for (int i = 0; i < SIZE; ++i)
254	<	ints[i] = new Integer(SIZE-1-i);
254	>	ints[i] = new Integer(SIZE - 1 - i);
255		TreeSet q = new TreeSet();
256		assertFalse(q.addAll(Arrays.asList(empty)));
257		assertTrue(q.addAll(Arrays.asList(ints)));
#	Line 259 | Line 265 | public class TreeSetTest extends JSR166T
265		public void testPollFirst() {
266		TreeSet q = populatedSet(SIZE);
267		for (int i = 0; i < SIZE; ++i) {
268	<	assertEquals(i, ((Integer)q.pollFirst()).intValue());
268	>	assertEquals(i, q.pollFirst());
269		}
270		assertNull(q.pollFirst());
271		}
#	Line 269 | Line 275 | public class TreeSetTest extends JSR166T
275		*/
276		public void testPollLast() {
277		TreeSet q = populatedSet(SIZE);
278	<	for (int i = SIZE-1; i >= 0; --i) {
279	<	assertEquals(i, ((Integer)q.pollLast()).intValue());
278	>	for (int i = SIZE - 1; i >= 0; --i) {
279	>	assertEquals(i, q.pollLast());
280		}
281		assertNull(q.pollFirst());
282		}
283
278	–
284		/**
285		* remove(x) removes x and returns true if present
286		*/
287		public void testRemoveElement() {
288		TreeSet q = populatedSet(SIZE);
289	<	for (int i = 1; i < SIZE; i+=2) {
290	<	assertTrue(q.remove(new Integer(i)));
291	<	}
292	<	for (int i = 0; i < SIZE; i+=2) {
293	<	assertTrue(q.remove(new Integer(i)));
294	<	assertFalse(q.remove(new Integer(i+1)));
289	>	for (int i = 1; i < SIZE; i += 2) {
290	>	assertTrue(q.contains(i));
291	>	assertTrue(q.remove(i));
292	>	assertFalse(q.contains(i));
293	>	assertTrue(q.contains(i - 1));
294	>	}
295	>	for (int i = 0; i < SIZE; i += 2) {
296	>	assertTrue(q.contains(i));
297	>	assertTrue(q.remove(i));
298	>	assertFalse(q.contains(i));
299	>	assertFalse(q.remove(i + 1));
300	>	assertFalse(q.contains(i + 1));
301		}
302		assertTrue(q.isEmpty());
303		}
#	Line 345 | Line 356 | public class TreeSetTest extends JSR166T
356		assertTrue(changed);
357
358		assertTrue(q.containsAll(p));
359	<	assertEquals(SIZE-i, q.size());
359	>	assertEquals(SIZE - i, q.size());
360		p.pollFirst();
361		}
362		}
#	Line 358 | Line 369 | public class TreeSetTest extends JSR166T
369		TreeSet q = populatedSet(SIZE);
370		TreeSet p = populatedSet(i);
371		assertTrue(q.removeAll(p));
372	<	assertEquals(SIZE-i, q.size());
372	>	assertEquals(SIZE - i, q.size());
373		for (int j = 0; j < i; ++j) {
374	<	Integer I = (Integer)(p.pollFirst());
375	<	assertFalse(q.contains(I));
374	>	Integer x = (Integer)(p.pollFirst());
375	>	assertFalse(q.contains(x));
376		}
377		}
378		}
379
369	–
370	–
380		/**
381		* lower returns preceding element
382		*/
#	Line 384 | Line 393 | public class TreeSetTest extends JSR166T
393
394		Object e4 = q.lower(zero);
395		assertNull(e4);
387	–
396		}
397
398		/**
#	Line 403 | Line 411 | public class TreeSetTest extends JSR166T
411
412		Object e4 = q.higher(six);
413		assertNull(e4);
406	–
414		}
415
416		/**
#	Line 422 | Line 429 | public class TreeSetTest extends JSR166T
429
430		Object e4 = q.floor(zero);
431		assertNull(e4);
425	–
432		}
433
434		/**
#	Line 441 | Line 447 | public class TreeSetTest extends JSR166T
447
448		Object e4 = q.ceiling(six);
449		assertNull(e4);
444	–
450		}
451
452		/**
453	<	* toArray contains all elements
453	>	* toArray contains all elements in sorted order
454		*/
455		public void testToArray() {
456		TreeSet q = populatedSet(SIZE);
457		Object[] o = q.toArray();
453	–	Arrays.sort(o);
458		for (int i = 0; i < o.length; i++)
459	<	assertEquals(o[i], q.pollFirst());
459	>	assertSame(o[i], q.pollFirst());
460		}
461
462		/**
463	<	* toArray(a) contains all elements
463	>	* toArray(a) contains all elements in sorted order
464		*/
465		public void testToArray2() {
466	<	TreeSet q = populatedSet(SIZE);
466	>	TreeSet<Integer> q = populatedSet(SIZE);
467		Integer[] ints = new Integer[SIZE];
468	<	ints = (Integer[])q.toArray(ints);
469	<	Arrays.sort(ints);
468	>	Integer[] array = q.toArray(ints);
469	>	assertSame(ints, array);
470		for (int i = 0; i < ints.length; i++)
471	<	assertEquals(ints[i], q.pollFirst());
471	>	assertSame(ints[i], q.pollFirst());
472		}
473
474		/**
#	Line 472 | Line 476 | public class TreeSetTest extends JSR166T
476		*/
477		public void testIterator() {
478		TreeSet q = populatedSet(SIZE);
475	–	int i = 0;
479		Iterator it = q.iterator();
480	<	while (it.hasNext()) {
480	>	int i;
481	>	for (i = 0; it.hasNext(); i++)
482		assertTrue(q.contains(it.next()));
479	–	++i;
480	–	}
483		assertEquals(i, SIZE);
484	+	assertIteratorExhausted(it);
485		}
486
487		/**
488		* iterator of empty set has no elements
489		*/
490		public void testEmptyIterator() {
491	<	TreeSet q = new TreeSet();
489	<	int i = 0;
490	<	Iterator it = q.iterator();
491	<	while (it.hasNext()) {
492	<	assertTrue(q.contains(it.next()));
493	<	++i;
494	<	}
495	<	assertEquals(i, 0);
491	>	assertIteratorExhausted(new TreeSet().iterator());
492		}
493
494		/**
495		* iterator.remove removes current element
496		*/
497	<	public void testIteratorRemove () {
497	>	public void testIteratorRemove() {
498		final TreeSet q = new TreeSet();
499		q.add(new Integer(2));
500		q.add(new Integer(1));
#	Line 514 | Line 510 | public class TreeSetTest extends JSR166T
510		assertFalse(it.hasNext());
511		}
512
517	–
513		/**
514		* toString contains toStrings of elements
515		*/
#	Line 522 | Line 517 | public class TreeSetTest extends JSR166T
517		TreeSet q = populatedSet(SIZE);
518		String s = q.toString();
519		for (int i = 0; i < SIZE; ++i) {
520	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
520	>	assertTrue(s.contains(String.valueOf(i)));
521		}
522		}
523
#	Line 530 | Line 525 | public class TreeSetTest extends JSR166T
525		* A deserialized serialized set has same elements
526		*/
527		public void testSerialization() throws Exception {
528	<	TreeSet q = populatedSet(SIZE);
529	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
530	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
531	<	out.writeObject(q);
532	<	out.close();
533	<
534	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
535	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
536	<	TreeSet r = (TreeSet)in.readObject();
537	<	assertEquals(q.size(), r.size());
538	<	while (!q.isEmpty())
539	<	assertEquals(q.pollFirst(), r.pollFirst());
528	>	NavigableSet x = populatedSet(SIZE);
529	>	NavigableSet y = serialClone(x);
530	>
531	>	assertNotSame(x, y);
532	>	assertEquals(x.size(), y.size());
533	>	assertEquals(x, y);
534	>	assertEquals(y, x);
535	>	while (!x.isEmpty()) {
536	>	assertFalse(y.isEmpty());
537	>	assertEquals(x.pollFirst(), y.pollFirst());
538	>	}
539	>	assertTrue(y.isEmpty());
540		}
541
542		/**
#	Line 669 | Line 664 | public class TreeSetTest extends JSR166T
664		/**
665		* Subsets of subsets subdivide correctly
666		*/
667	<	public void testRecursiveSubSets() {
668	<	int setSize = 1000;
667	>	public void testRecursiveSubSets() throws Exception {
668	>	int setSize = expensiveTests ? 1000 : 100;
669		Class cl = TreeSet.class;
670
671		NavigableSet<Integer> set = newSet(cl);
#	Line 688 | Line 683 | public class TreeSetTest extends JSR166T
683		0, setSize - 1, true);
684		}
685
686	<	static NavigableSet<Integer> newSet(Class cl) {
687	<	NavigableSet<Integer> result = null;
688	<	try {
689	<	result = (NavigableSet<Integer>) cl.newInstance();
690	<	} catch (Exception e) {
691	<	fail();
692	<	}
693	<	assertEquals(result.size(), 0);
686	>	/**
687	>	* addAll is idempotent
688	>	*/
689	>	public void testAddAll_idempotent() throws Exception {
690	>	Set x = populatedSet(SIZE);
691	>	Set y = new TreeSet(x);
692	>	y.addAll(x);
693	>	assertEquals(x, y);
694	>	assertEquals(y, x);
695	>	}
696	>
697	>	static NavigableSet<Integer> newSet(Class cl) throws Exception {
698	>	NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance();
699	>	assertEquals(0, result.size());
700		assertFalse(result.iterator().hasNext());
701		return result;
702		}
#	Line 727 | Line 728 | public class TreeSetTest extends JSR166T
728		// Add entries till we're back to original size
729		while (set.size() < size) {
730		int element = min + rnd.nextInt(rangeSize);
731	<	assertTrue(element >= min && element<= max);
731	>	assertTrue(element >= min && element <= max);
732		put(set, element);
733		}
734		}
#	Line 752 | Line 753 | public class TreeSetTest extends JSR166T
753		// Add entries till we're back to original size
754		while (set.size() < size) {
755		int element = min - 5 + rnd.nextInt(rangeSize + 10);
756	<	if (element >= min && element<= max) {
756	>	if (element >= min && element <= max) {
757		put(set, element);
758		} else {
759		try {
760		set.add(element);
761	<	fail();
762	<	} catch (IllegalArgumentException e) {
762	<	// expected
763	<	}
761	>	shouldThrow();
762	>	} catch (IllegalArgumentException success) {}
763		}
764		}
765		}
#	Line 858 | Line 857 | public class TreeSetTest extends JSR166T
857		*/
858		void check(NavigableSet<Integer> set,
859		final int min, final int max, final boolean ascending) {
860	<	class ReferenceSet {
860	>	class ReferenceSet {
861		int lower(int element) {
862		return ascending ?
863		lowerAscending(element) : higherAscending(element);
#	Line 893 | Line 892 | public class TreeSetTest extends JSR166T
892		// BitSet should support this! Test would run much faster
893		while (element >= min) {
894		if (bs.get(element))
895	<	return(element);
895	>	return element;
896		element--;
897		}
898		return -1;
#	Line 904 | Line 903 | public class TreeSetTest extends JSR166T
903		else if (element > max)
904		return -1;
905		int result = bs.nextSetBit(element);
906	<	return result > max ? -1 : result;
906	>	return (result > max) ? -1 : result;
907		}
908		int higherAscending(int element) {
909		return ceilingAscending(element + 1);
910		}
911		private int firstAscending() {
912		int result = ceilingAscending(min);
913	<	return result > max ? -1 : result;
913	>	return (result > max) ? -1 : result;
914		}
915		private int lastAscending() {
916		int result = floorAscending(max);
917	<	return result < min ? -1 : result;
917	>	return (result < min) ? -1 : result;
918		}
919		}
920		ReferenceSet rs = new ReferenceSet();
#	Line 928 | Line 927 | public class TreeSetTest extends JSR166T
927		if (bsContainsI)
928		size++;
929		}
930	<	assertEquals(set.size(), size);
930	>	assertEquals(size, set.size());
931
932		// Test contents using contains elementSet iterator
933		int size2 = 0;
#	Line 959 | Line 958 | public class TreeSetTest extends JSR166T
958		assertEq(rs.last(),  -1);
959		try {
960		set.first();
961	<	fail();
962	<	} catch (NoSuchElementException e) {
964	<	// expected
965	<	}
961	>	shouldThrow();
962	>	} catch (NoSuchElementException success) {}
963		try {
964		set.last();
965	<	fail();
966	<	} catch (NoSuchElementException e) {
970	<	// expected
971	<	}
965	>	shouldThrow();
966	>	} catch (NoSuchElementException success) {}
967		}
968		}
969
#	Line 980 | Line 975 | public class TreeSetTest extends JSR166T
975		}
976
977		static boolean eq(Integer i, int j) {
978	<	return i == null ? j == -1 : i == j;
978	>	return (i == null) ? j == -1 : i == j;
979		}
980
981		}

Diff Legend

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