75 |
|
*/ |
76 |
|
public void testConstructor5() { |
77 |
|
Integer[] ints = new Integer[SIZE]; |
78 |
< |
for (int i = 0; i < SIZE-1; ++i) |
78 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
79 |
|
ints[i] = new Integer(i); |
80 |
|
try { |
81 |
|
new ConcurrentLinkedDeque(Arrays.asList(ints)); |
115 |
|
public void testSize() { |
116 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
117 |
|
for (int i = 0; i < SIZE; ++i) { |
118 |
< |
assertEquals(SIZE-i, q.size()); |
118 |
> |
assertEquals(SIZE - i, q.size()); |
119 |
|
q.remove(); |
120 |
|
} |
121 |
|
for (int i = 0; i < SIZE; ++i) { |
331 |
|
public void testAddAll3() { |
332 |
|
ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); |
333 |
|
Integer[] ints = new Integer[SIZE]; |
334 |
< |
for (int i = 0; i < SIZE-1; ++i) |
334 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
335 |
|
ints[i] = new Integer(i); |
336 |
|
try { |
337 |
|
q.addAll(Arrays.asList(ints)); |
370 |
|
*/ |
371 |
|
public void testPollLast() { |
372 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
373 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
373 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
374 |
|
assertEquals(i, q.pollLast()); |
375 |
|
} |
376 |
|
assertNull(q.pollLast()); |
470 |
|
*/ |
471 |
|
public void testPeekLast() { |
472 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
473 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
473 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
474 |
|
assertEquals(i, q.peekLast()); |
475 |
|
assertEquals(i, q.pollLast()); |
476 |
|
assertTrue(q.peekLast() == null || |
499 |
|
*/ |
500 |
|
public void testLastElement() { |
501 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
502 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
502 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
503 |
|
assertEquals(i, q.getLast()); |
504 |
|
assertEquals(i, q.pollLast()); |
505 |
|
} |
624 |
|
assertTrue(changed); |
625 |
|
|
626 |
|
assertTrue(q.containsAll(p)); |
627 |
< |
assertEquals(SIZE-i, q.size()); |
627 |
> |
assertEquals(SIZE - i, q.size()); |
628 |
|
p.remove(); |
629 |
|
} |
630 |
|
} |
637 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
638 |
|
ConcurrentLinkedDeque p = populatedDeque(i); |
639 |
|
assertTrue(q.removeAll(p)); |
640 |
< |
assertEquals(SIZE-i, q.size()); |
640 |
> |
assertEquals(SIZE - i, q.size()); |
641 |
|
for (int j = 0; j < i; ++j) { |
642 |
|
Integer x = (Integer)(p.remove()); |
643 |
|
assertFalse(q.contains(x)); |