1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
431 |
|
public void testRemoveElement() { |
432 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
433 |
|
for (int i = 1; i < SIZE; i+=2) { |
434 |
< |
assertTrue(q.remove(new Integer(i))); |
434 |
> |
assertTrue(q.contains(i)); |
435 |
> |
assertTrue(q.remove(i)); |
436 |
> |
assertFalse(q.contains(i)); |
437 |
> |
assertTrue(q.contains(i-1)); |
438 |
|
} |
439 |
|
for (int i = 0; i < SIZE; i+=2) { |
440 |
< |
assertTrue(q.remove(new Integer(i))); |
441 |
< |
assertFalse(q.remove(new Integer(i+1))); |
440 |
> |
assertTrue(q.contains(i)); |
441 |
> |
assertTrue(q.remove(i)); |
442 |
> |
assertFalse(q.contains(i)); |
443 |
> |
assertFalse(q.remove(i+1)); |
444 |
> |
assertFalse(q.contains(i+1)); |
445 |
|
} |
446 |
|
assertTrue(q.isEmpty()); |
447 |
|
} |
835 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
836 |
|
String s = q.toString(); |
837 |
|
for (int i = 0; i < SIZE; ++i) { |
838 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
838 |
> |
assertTrue(s.contains(String.valueOf(i))); |
839 |
|
} |
840 |
|
} |
841 |
|
|