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.41 by jsr166, Sun May 24 01:23:17 2015 UTC vs.
Revision 1.45 by jsr166, Wed Jan 4 06:09:58 2017 UTC

#	Line 40 | Line 40 | public class TreeSetTest extends JSR166T
40
41		/**
42		* Returns a new set of given size containing consecutive
43	<	* Integers 0 ... n.
43	>	* Integers 0 ... n - 1.
44		*/
45		private TreeSet<Integer> populatedSet(int n) {
46	<	TreeSet<Integer> q = new TreeSet<Integer>();
46	>	TreeSet<Integer> q = new TreeSet<>();
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)
51		assertTrue(q.add(new Integer(i)));
#	Line 290 | Line 290 | public class TreeSetTest extends JSR166T
290		assertTrue(q.contains(i));
291		assertTrue(q.remove(i));
292		assertFalse(q.contains(i));
293	<	assertTrue(q.contains(i-1));
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));
299	>	assertFalse(q.remove(i + 1));
300	>	assertFalse(q.contains(i + 1));
301		}
302		assertTrue(q.isEmpty());
303		}
#	Line 695 | Line 695 | public class TreeSetTest extends JSR166T
695		}
696
697		static NavigableSet<Integer> newSet(Class cl) throws Exception {
698	<	NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance();
698	>	NavigableSet<Integer> result =
699	>	(NavigableSet<Integer>) cl.getConstructor().newInstance();
700		assertEquals(0, result.size());
701		assertFalse(result.iterator().hasNext());
702		return result;

Diff Legend

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