--- jsr166/src/test/tck/TreeSubSetTest.java 2006/04/20 20:35:00 1.3 +++ jsr166/src/test/tck/TreeSubSetTest.java 2009/11/02 20:28:32 1.4 @@ -11,13 +11,13 @@ import java.io.*; public class TreeSubSetTest extends JSR166TestCase { public static void main(String[] args) { - junit.textui.TestRunner.run (suite()); + junit.textui.TestRunner.run (suite()); } public static Test suite() { return new TestSuite(TreeSubSetTest.class); } - static class MyReverseComparator implements Comparator { + static class MyReverseComparator implements Comparator { public int compare(Object x, Object y) { int i = ((Integer)x).intValue(); int j = ((Integer)y).intValue(); @@ -78,18 +78,18 @@ public class TreeSubSetTest extends JSR1 return s; } - private static NavigableSet set0() { + private static NavigableSet set0() { TreeSet set = new TreeSet(); assertTrue(set.isEmpty()); return set.tailSet(m1, false); } - private static NavigableSet dset0() { + private static NavigableSet dset0() { TreeSet set = new TreeSet(); assertTrue(set.isEmpty()); return set; } - + /** * A new set has unbounded capacity */ @@ -135,7 +135,7 @@ public class TreeSubSetTest extends JSR1 NavigableSet q = set0(); q.add(null); shouldThrow(); - } catch (NullPointerException success) { } + } catch (NullPointerException success) { } } /** @@ -252,7 +252,7 @@ public class TreeSubSetTest extends JSR1 } assertTrue(q.isEmpty()); } - + /** * contains(x) reports true when elements added but not yet removed */ @@ -328,7 +328,7 @@ public class TreeSubSetTest extends JSR1 } } - + /** * lower returns preceding element @@ -428,7 +428,7 @@ public class TreeSubSetTest extends JSR1 for(int i = 0; i < ints.length; i++) assertEquals(ints[i], q.pollFirst()); } - + /** * iterator iterates through all elements */ @@ -486,10 +486,10 @@ public class TreeSubSetTest extends JSR1 for (int i = 0; i < SIZE; ++i) { assertTrue(s.indexOf(String.valueOf(i)) >= 0); } - } + } /** - * A deserialized serialized set has same elements + * A deserialized serialized set has same elements */ public void testSerialization() { NavigableSet q = populatedSet(SIZE); @@ -503,7 +503,7 @@ public class TreeSubSetTest extends JSR1 ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); NavigableSet r = (NavigableSet)in.readObject(); assertEquals(q.size(), r.size()); - while (!q.isEmpty()) + while (!q.isEmpty()) assertEquals(q.pollFirst(), r.pollFirst()); } catch(Exception e){ e.printStackTrace(); @@ -759,7 +759,7 @@ public class TreeSubSetTest extends JSR1 } assertTrue(q.isEmpty()); } - + /** * contains(x) reports true when elements added but not yet removed */ @@ -835,7 +835,7 @@ public class TreeSubSetTest extends JSR1 } } - + /** * lower returns preceding element @@ -935,7 +935,7 @@ public class TreeSubSetTest extends JSR1 for(int i = 0; i < ints.length; i++) assertEquals(ints[i], q.pollFirst()); } - + /** * iterator iterates through all elements */ @@ -993,10 +993,10 @@ public class TreeSubSetTest extends JSR1 for (int i = 0; i < SIZE; ++i) { assertTrue(s.indexOf(String.valueOf(i)) >= 0); } - } + } /** - * A deserialized serialized set has same elements + * A deserialized serialized set has same elements */ public void testDescendingSerialization() { NavigableSet q = populatedSet(SIZE); @@ -1010,7 +1010,7 @@ public class TreeSubSetTest extends JSR1 ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); NavigableSet r = (NavigableSet)in.readObject(); assertEquals(q.size(), r.size()); - while (!q.isEmpty()) + while (!q.isEmpty()) assertEquals(q.pollFirst(), r.pollFirst()); } catch(Exception e){ e.printStackTrace();