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

Comparing jsr166/src/test/tck/ConcurrentSkipListSetTest.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 97 | Line 97 | public class ConcurrentSkipListSetTest e
97       */
98      public void testConstructor5() {
99          Integer[] ints = new Integer[SIZE];
100 <        for (int i = 0; i < SIZE-1; ++i)
100 >        for (int i = 0; i < SIZE - 1; ++i)
101              ints[i] = new Integer(i);
102          try {
103              new ConcurrentSkipListSet(Arrays.asList(ints));
# Line 128 | Line 128 | public class ConcurrentSkipListSetTest e
128          for (int i = 0; i < SIZE; ++i)
129              ints[i] = new Integer(i);
130          q.addAll(Arrays.asList(ints));
131 <        for (int i = SIZE-1; i >= 0; --i)
131 >        for (int i = SIZE - 1; i >= 0; --i)
132              assertEquals(ints[i], q.pollFirst());
133      }
134  
# Line 152 | Line 152 | public class ConcurrentSkipListSetTest e
152      public void testSize() {
153          ConcurrentSkipListSet q = populatedSet(SIZE);
154          for (int i = 0; i < SIZE; ++i) {
155 <            assertEquals(SIZE-i, q.size());
155 >            assertEquals(SIZE - i, q.size());
156              q.pollFirst();
157          }
158          for (int i = 0; i < SIZE; ++i) {
# Line 232 | Line 232 | public class ConcurrentSkipListSetTest e
232      public void testAddAll3() {
233          ConcurrentSkipListSet q = new ConcurrentSkipListSet();
234          Integer[] ints = new Integer[SIZE];
235 <        for (int i = 0; i < SIZE-1; ++i)
235 >        for (int i = 0; i < SIZE - 1; ++i)
236              ints[i] = new Integer(i);
237          try {
238              q.addAll(Arrays.asList(ints));
# Line 247 | Line 247 | public class ConcurrentSkipListSetTest e
247          Integer[] empty = new Integer[0];
248          Integer[] ints = new Integer[SIZE];
249          for (int i = 0; i < SIZE; ++i)
250 <            ints[i] = new Integer(SIZE-1-i);
250 >            ints[i] = new Integer(SIZE - 1 - i);
251          ConcurrentSkipListSet q = new ConcurrentSkipListSet();
252          assertFalse(q.addAll(Arrays.asList(empty)));
253          assertTrue(q.addAll(Arrays.asList(ints)));
# Line 271 | Line 271 | public class ConcurrentSkipListSetTest e
271       */
272      public void testPollLast() {
273          ConcurrentSkipListSet q = populatedSet(SIZE);
274 <        for (int i = SIZE-1; i >= 0; --i) {
274 >        for (int i = SIZE - 1; i >= 0; --i) {
275              assertEquals(i, q.pollLast());
276          }
277          assertNull(q.pollFirst());
# Line 352 | Line 352 | public class ConcurrentSkipListSetTest e
352                  assertTrue(changed);
353  
354              assertTrue(q.containsAll(p));
355 <            assertEquals(SIZE-i, q.size());
355 >            assertEquals(SIZE - i, q.size());
356              p.pollFirst();
357          }
358      }
# Line 365 | Line 365 | public class ConcurrentSkipListSetTest e
365              ConcurrentSkipListSet q = populatedSet(SIZE);
366              ConcurrentSkipListSet p = populatedSet(i);
367              assertTrue(q.removeAll(p));
368 <            assertEquals(SIZE-i, q.size());
368 >            assertEquals(SIZE - i, q.size());
369              for (int j = 0; j < i; ++j) {
370                  Integer x = (Integer)(p.pollFirst());
371                  assertFalse(q.contains(x));

Diff Legend

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