ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/TreeSetTest.java
(Generate patch)

Comparing jsr166/src/test/tck/TreeSetTest.java (file contents):
Revision 1.39 by jsr166, Fri May 15 18:21:19 2015 UTC vs.
Revision 1.40 by jsr166, Sat May 23 00:53:08 2015 UTC

# Line 101 | Line 101 | public class TreeSetTest extends JSR166T
101       */
102      public void testConstructor5() {
103          Integer[] ints = new Integer[SIZE];
104 <        for (int i = 0; i < SIZE-1; ++i)
104 >        for (int i = 0; i < SIZE - 1; ++i)
105              ints[i] = new Integer(i);
106          try {
107              new TreeSet(Arrays.asList(ints));
# Line 132 | 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 156 | 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 236 | Line 236 | public class TreeSetTest extends JSR166T
236      public void testAddAll3() {
237          TreeSet q = new TreeSet();
238          Integer[] ints = new Integer[SIZE];
239 <        for (int i = 0; i < SIZE-1; ++i)
239 >        for (int i = 0; i < SIZE - 1; ++i)
240              ints[i] = new Integer(i);
241          try {
242              q.addAll(Arrays.asList(ints));
# Line 251 | 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 275 | 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) {
278 >        for (int i = SIZE - 1; i >= 0; --i) {
279              assertEquals(i, q.pollLast());
280          }
281          assertNull(q.pollFirst());
# Line 356 | 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 369 | 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 x = (Integer)(p.pollFirst());
375                  assertFalse(q.contains(x));

Diff Legend

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