276 |
|
*/ |
277 |
|
public void testRemoveFirstOccurrence() { |
278 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
279 |
< |
for (int i = 1; i < SIZE; i+=2) { |
279 |
> |
for (int i = 1; i < SIZE; i += 2) { |
280 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
281 |
|
} |
282 |
< |
for (int i = 0; i < SIZE; i+=2) { |
282 |
> |
for (int i = 0; i < SIZE; i += 2) { |
283 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
284 |
|
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
285 |
|
} |
291 |
|
*/ |
292 |
|
public void testRemoveLastOccurrence() { |
293 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
294 |
< |
for (int i = 1; i < SIZE; i+=2) { |
294 |
> |
for (int i = 1; i < SIZE; i += 2) { |
295 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
296 |
|
} |
297 |
< |
for (int i = 0; i < SIZE; i+=2) { |
297 |
> |
for (int i = 0; i < SIZE; i += 2) { |
298 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
299 |
|
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
300 |
|
} |