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.11 by jsr166, Sun Nov 22 18:57:17 2009 UTC vs.
Revision 1.17 by jsr166, Thu Nov 4 01:04:54 2010 UTC

#	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);
#	Line 208 | Line 208 | public class TreeSetTest extends JSR166T
208		shouldThrow();
209		} catch (NullPointerException success) {}
210		}
211	+
212		/**
213		* addAll of a collection with null elements throws NPE
214		*/
#	Line 219 | Line 220 | public class TreeSetTest extends JSR166T
220		shouldThrow();
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 380 | Line 382 | public class TreeSetTest extends JSR166T
382
383		Object e4 = q.lower(zero);
384		assertNull(e4);
383	–
385		}
386
387		/**
#	Line 399 | Line 400 | public class TreeSetTest extends JSR166T
400
401		Object e4 = q.higher(six);
402		assertNull(e4);
402	–
403		}
404
405		/**
#	Line 418 | Line 418 | public class TreeSetTest extends JSR166T
418
419		Object e4 = q.floor(zero);
420		assertNull(e4);
421	–
421		}
422
423		/**
#	Line 437 | Line 436 | public class TreeSetTest extends JSR166T
436
437		Object e4 = q.ceiling(six);
438		assertNull(e4);
440	–
439		}
440
441		/**
442	<	* toArray contains all elements
442	>	* toArray contains all elements in sorted order
443		*/
444		public void testToArray() {
445		TreeSet q = populatedSet(SIZE);
446		Object[] o = q.toArray();
449	–	Arrays.sort(o);
447		for (int i = 0; i < o.length; i++)
448	<	assertEquals(o[i], q.pollFirst());
448	>	assertSame(o[i], q.pollFirst());
449		}
450
451		/**
452	<	* toArray(a) contains all elements
452	>	* toArray(a) contains all elements in sorted order
453		*/
454		public void testToArray2() {
455		TreeSet q = populatedSet(SIZE);
456		Integer[] ints = new Integer[SIZE];
457	<	ints = (Integer[])q.toArray(ints);
461	<	Arrays.sort(ints);
457	>	assertSame(ints, q.toArray(ints));
458		for (int i = 0; i < ints.length; i++)
459	<	assertEquals(ints[i], q.pollFirst());
459	>	assertSame(ints[i], q.pollFirst());
460		}
461
462		/**
#	Line 494 | Line 490 | public class TreeSetTest extends JSR166T
490		/**
491		* iterator.remove removes current element
492		*/
493	<	public void testIteratorRemove () {
493	>	public void testIteratorRemove() {
494		final TreeSet q = new TreeSet();
495		q.add(new Integer(2));
496		q.add(new Integer(1));
#	Line 666 | Line 662 | public class TreeSetTest extends JSR166T
662		* Subsets of subsets subdivide correctly
663		*/
664		public void testRecursiveSubSets() throws Exception {
665	<	int setSize = 1000;
665	>	int setSize = expensiveTests ? 1000 : 100;
666		Class cl = TreeSet.class;
667
668		NavigableSet<Integer> set = newSet(cl);
#	Line 882 | Line 878 | public class TreeSetTest extends JSR166T
878		// BitSet should support this! Test would run much faster
879		while (element >= min) {
880		if (bs.get(element))
881	<	return(element);
881	>	return element;
882		element--;
883		}
884		return -1;

Diff Legend

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