6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
– |
import junit.framework.*; |
9 |
|
import java.util.Arrays; |
10 |
|
import java.util.Collection; |
11 |
+ |
import java.util.Deque; |
12 |
|
import java.util.Iterator; |
13 |
|
import java.util.NoSuchElementException; |
14 |
|
import java.util.Queue; |
15 |
|
import java.util.Random; |
16 |
|
import java.util.concurrent.ConcurrentLinkedDeque; |
17 |
|
|
18 |
+ |
import junit.framework.Test; |
19 |
+ |
import junit.framework.TestSuite; |
20 |
+ |
|
21 |
|
public class ConcurrentLinkedDequeTest extends JSR166TestCase { |
22 |
|
|
23 |
|
public static void main(String[] args) { |
29 |
|
} |
30 |
|
|
31 |
|
/** |
32 |
< |
* Creates a deque of given size containing consecutive |
32 |
> |
* Returns a new deque of given size containing consecutive |
33 |
|
* Integers 0 ... n. |
34 |
|
*/ |
35 |
|
private ConcurrentLinkedDeque<Integer> populatedDeque(int n) { |
437 |
|
*/ |
438 |
|
public void testRemoveElement() { |
439 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
440 |
< |
for (int i = 1; i < SIZE; i+=2) { |
440 |
> |
for (int i = 1; i < SIZE; i += 2) { |
441 |
|
assertTrue(q.contains(i)); |
442 |
|
assertTrue(q.remove(i)); |
443 |
|
assertFalse(q.contains(i)); |
444 |
|
assertTrue(q.contains(i-1)); |
445 |
|
} |
446 |
< |
for (int i = 0; i < SIZE; i+=2) { |
446 |
> |
for (int i = 0; i < SIZE; i += 2) { |
447 |
|
assertTrue(q.contains(i)); |
448 |
|
assertTrue(q.remove(i)); |
449 |
|
assertFalse(q.contains(i)); |
547 |
|
*/ |
548 |
|
public void testRemoveFirstOccurrence() { |
549 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
550 |
< |
for (int i = 1; i < SIZE; i+=2) { |
550 |
> |
for (int i = 1; i < SIZE; i += 2) { |
551 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
552 |
|
} |
553 |
< |
for (int i = 0; i < SIZE; i+=2) { |
553 |
> |
for (int i = 0; i < SIZE; i += 2) { |
554 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
555 |
|
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
556 |
|
} |
562 |
|
*/ |
563 |
|
public void testRemoveLastOccurrence() { |
564 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
565 |
< |
for (int i = 1; i < SIZE; i+=2) { |
565 |
> |
for (int i = 1; i < SIZE; i += 2) { |
566 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
567 |
|
} |
568 |
< |
for (int i = 0; i < SIZE; i+=2) { |
568 |
> |
for (int i = 0; i < SIZE; i += 2) { |
569 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
570 |
|
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
571 |
|
} |
853 |
|
Queue x = populatedDeque(SIZE); |
854 |
|
Queue y = serialClone(x); |
855 |
|
|
856 |
< |
assertTrue(x != y); |
856 |
> |
assertNotSame(x, y); |
857 |
|
assertEquals(x.size(), y.size()); |
858 |
|
assertEquals(x.toString(), y.toString()); |
859 |
|
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
864 |
|
assertTrue(y.isEmpty()); |
865 |
|
} |
866 |
|
|
867 |
+ |
/** |
868 |
+ |
* contains(null) always return false. |
869 |
+ |
* remove(null) always throws NullPointerException. |
870 |
+ |
*/ |
871 |
+ |
public void testNeverContainsNull() { |
872 |
+ |
Deque<?>[] qs = { |
873 |
+ |
new ConcurrentLinkedDeque<Object>(), |
874 |
+ |
populatedDeque(2), |
875 |
+ |
}; |
876 |
+ |
|
877 |
+ |
for (Deque<?> q : qs) { |
878 |
+ |
assertFalse(q.contains(null)); |
879 |
+ |
try { |
880 |
+ |
assertFalse(q.remove(null)); |
881 |
+ |
shouldThrow(); |
882 |
+ |
} catch (NullPointerException success) {} |
883 |
+ |
try { |
884 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
885 |
+ |
shouldThrow(); |
886 |
+ |
} catch (NullPointerException success) {} |
887 |
+ |
try { |
888 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
889 |
+ |
shouldThrow(); |
890 |
+ |
} catch (NullPointerException success) {} |
891 |
+ |
} |
892 |
+ |
} |
893 |
|
} |