--- jsr166/src/test/tck/TreeSubSetTest.java	2009/11/02 20:28:32	1.4
+++ jsr166/src/test/tck/TreeSubSetTest.java	2009/11/16 04:57:10	1.5
@@ -35,9 +35,9 @@ public class TreeSubSetTest extends JSR1
         TreeSet q = new TreeSet();
         assertTrue(q.isEmpty());
 
-	for(int i = n-1; i >= 0; i-=2)
+	for (int i = n-1; i >= 0; i-=2)
 	    assertTrue(q.add(new Integer(i)));
-	for(int i = (n & 1); i < n; i+=2)
+	for (int i = (n & 1); i < n; i+=2)
 	    assertTrue(q.add(new Integer(i)));
         assertTrue(q.add(new Integer(-n)));
         assertTrue(q.add(new Integer(n)));
@@ -166,7 +166,7 @@ public class TreeSubSetTest extends JSR1
             q.add(new Object());
             shouldThrow();
         }
-        catch(ClassCastException success) {}
+        catch (ClassCastException success) {}
     }
 
 
@@ -413,7 +413,7 @@ public class TreeSubSetTest extends JSR1
         NavigableSet q = populatedSet(SIZE);
 	Object[] o = q.toArray();
         Arrays.sort(o);
-	for(int i = 0; i < o.length; i++)
+	for (int i = 0; i < o.length; i++)
 	    assertEquals(o[i], q.pollFirst());
     }
 
@@ -425,7 +425,7 @@ public class TreeSubSetTest extends JSR1
 	Integer[] ints = new Integer[SIZE];
 	ints = (Integer[])q.toArray(ints);
         Arrays.sort(ints);
-        for(int i = 0; i < ints.length; i++)
+        for (int i = 0; i < ints.length; i++)
             assertEquals(ints[i], q.pollFirst());
     }
 
@@ -436,7 +436,7 @@ public class TreeSubSetTest extends JSR1
         NavigableSet q = populatedSet(SIZE);
         int i = 0;
 	Iterator it = q.iterator();
-        while(it.hasNext()) {
+        while (it.hasNext()) {
             assertTrue(q.contains(it.next()));
             ++i;
         }
@@ -450,7 +450,7 @@ public class TreeSubSetTest extends JSR1
         NavigableSet q = set0();
         int i = 0;
 	Iterator it = q.iterator();
-        while(it.hasNext()) {
+        while (it.hasNext()) {
             assertTrue(q.contains(it.next()));
             ++i;
         }
@@ -505,7 +505,7 @@ public class TreeSubSetTest extends JSR1
             assertEquals(q.size(), r.size());
             while (!q.isEmpty())
                 assertEquals(q.pollFirst(), r.pollFirst());
-        } catch(Exception e){
+        } catch (Exception e){
             e.printStackTrace();
             unexpectedException();
         }
@@ -673,7 +673,7 @@ public class TreeSubSetTest extends JSR1
             q.add(new Object());
             shouldThrow();
         }
-        catch(ClassCastException success) {}
+        catch (ClassCastException success) {}
     }
 
 
@@ -920,7 +920,7 @@ public class TreeSubSetTest extends JSR1
         NavigableSet q = populatedSet(SIZE);
 	Object[] o = q.toArray();
         Arrays.sort(o);
-	for(int i = 0; i < o.length; i++)
+	for (int i = 0; i < o.length; i++)
 	    assertEquals(o[i], q.pollFirst());
     }
 
@@ -932,7 +932,7 @@ public class TreeSubSetTest extends JSR1
 	Integer[] ints = new Integer[SIZE];
 	ints = (Integer[])q.toArray(ints);
         Arrays.sort(ints);
-        for(int i = 0; i < ints.length; i++)
+        for (int i = 0; i < ints.length; i++)
             assertEquals(ints[i], q.pollFirst());
     }
 
@@ -943,7 +943,7 @@ public class TreeSubSetTest extends JSR1
         NavigableSet q = populatedSet(SIZE);
         int i = 0;
 	Iterator it = q.iterator();
-        while(it.hasNext()) {
+        while (it.hasNext()) {
             assertTrue(q.contains(it.next()));
             ++i;
         }
@@ -957,7 +957,7 @@ public class TreeSubSetTest extends JSR1
         NavigableSet q = dset0();
         int i = 0;
 	Iterator it = q.iterator();
-        while(it.hasNext()) {
+        while (it.hasNext()) {
             assertTrue(q.contains(it.next()));
             ++i;
         }
@@ -1012,7 +1012,7 @@ public class TreeSubSetTest extends JSR1
             assertEquals(q.size(), r.size());
             while (!q.isEmpty())
                 assertEquals(q.pollFirst(), r.pollFirst());
-        } catch(Exception e){
+        } catch (Exception e){
             e.printStackTrace();
             unexpectedException();
         }