72 |
|
*/ |
73 |
|
public void testConstructor5() { |
74 |
|
Integer[] ints = new Integer[SIZE]; |
75 |
< |
for (int i = 0; i < SIZE-1; ++i) |
75 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
76 |
|
ints[i] = new Integer(i); |
77 |
|
try { |
78 |
|
new ConcurrentLinkedQueue(Arrays.asList(ints)); |
112 |
|
public void testSize() { |
113 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
114 |
|
for (int i = 0; i < SIZE; ++i) { |
115 |
< |
assertEquals(SIZE-i, q.size()); |
115 |
> |
assertEquals(SIZE - i, q.size()); |
116 |
|
q.remove(); |
117 |
|
} |
118 |
|
for (int i = 0; i < SIZE; ++i) { |
203 |
|
public void testAddAll3() { |
204 |
|
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
205 |
|
Integer[] ints = new Integer[SIZE]; |
206 |
< |
for (int i = 0; i < SIZE-1; ++i) |
206 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
207 |
|
ints[i] = new Integer(i); |
208 |
|
try { |
209 |
|
q.addAll(Arrays.asList(ints)); |
355 |
|
assertTrue(changed); |
356 |
|
|
357 |
|
assertTrue(q.containsAll(p)); |
358 |
< |
assertEquals(SIZE-i, q.size()); |
358 |
> |
assertEquals(SIZE - i, q.size()); |
359 |
|
p.remove(); |
360 |
|
} |
361 |
|
} |
368 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
369 |
|
ConcurrentLinkedQueue p = populatedQueue(i); |
370 |
|
assertTrue(q.removeAll(p)); |
371 |
< |
assertEquals(SIZE-i, q.size()); |
371 |
> |
assertEquals(SIZE - i, q.size()); |
372 |
|
for (int j = 0; j < i; ++j) { |
373 |
|
Integer x = (Integer)(p.remove()); |
374 |
|
assertFalse(q.contains(x)); |