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) { |
55 |
|
*/ |
56 |
|
public void testConstructor3() { |
57 |
|
try { |
58 |
< |
ConcurrentLinkedDeque q = new ConcurrentLinkedDeque((Collection)null); |
58 |
> |
new ConcurrentLinkedDeque((Collection)null); |
59 |
|
shouldThrow(); |
60 |
|
} catch (NullPointerException success) {} |
61 |
|
} |
66 |
|
public void testConstructor4() { |
67 |
|
try { |
68 |
|
Integer[] ints = new Integer[SIZE]; |
69 |
< |
ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); |
69 |
> |
new ConcurrentLinkedDeque(Arrays.asList(ints)); |
70 |
|
shouldThrow(); |
71 |
|
} catch (NullPointerException success) {} |
72 |
|
} |
79 |
|
Integer[] ints = new Integer[SIZE]; |
80 |
|
for (int i = 0; i < SIZE-1; ++i) |
81 |
|
ints[i] = new Integer(i); |
82 |
< |
ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); |
82 |
> |
new ConcurrentLinkedDeque(Arrays.asList(ints)); |
83 |
|
shouldThrow(); |
84 |
|
} catch (NullPointerException success) {} |
85 |
|
} |
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 |
|
} |
641 |
|
assertTrue(q.removeAll(p)); |
642 |
|
assertEquals(SIZE-i, q.size()); |
643 |
|
for (int j = 0; j < i; ++j) { |
644 |
< |
Integer I = (Integer)(p.remove()); |
645 |
< |
assertFalse(q.contains(I)); |
644 |
> |
Integer x = (Integer)(p.remove()); |
645 |
> |
assertFalse(q.contains(x)); |
646 |
|
} |
647 |
|
} |
648 |
|
} |
696 |
|
*/ |
697 |
|
public void testIterator() { |
698 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
696 |
– |
int i = 0; |
699 |
|
Iterator it = q.iterator(); |
700 |
< |
while (it.hasNext()) { |
700 |
> |
int i; |
701 |
> |
for (i = 0; it.hasNext(); i++) |
702 |
|
assertTrue(q.contains(it.next())); |
700 |
– |
++i; |
701 |
– |
} |
703 |
|
assertEquals(i, SIZE); |
704 |
+ |
assertIteratorExhausted(it); |
705 |
+ |
} |
706 |
+ |
|
707 |
+ |
/** |
708 |
+ |
* iterator of empty collection has no elements |
709 |
+ |
*/ |
710 |
+ |
public void testEmptyIterator() { |
711 |
+ |
Deque c = new ConcurrentLinkedDeque(); |
712 |
+ |
assertIteratorExhausted(c.iterator()); |
713 |
+ |
assertIteratorExhausted(c.descendingIterator()); |
714 |
|
} |
715 |
|
|
716 |
|
/** |
872 |
|
assertTrue(y.isEmpty()); |
873 |
|
} |
874 |
|
|
875 |
+ |
/** |
876 |
+ |
* contains(null) always return false. |
877 |
+ |
* remove(null) always throws NullPointerException. |
878 |
+ |
*/ |
879 |
+ |
public void testNeverContainsNull() { |
880 |
+ |
Deque<?>[] qs = { |
881 |
+ |
new ConcurrentLinkedDeque<Object>(), |
882 |
+ |
populatedDeque(2), |
883 |
+ |
}; |
884 |
+ |
|
885 |
+ |
for (Deque<?> q : qs) { |
886 |
+ |
assertFalse(q.contains(null)); |
887 |
+ |
try { |
888 |
+ |
assertFalse(q.remove(null)); |
889 |
+ |
shouldThrow(); |
890 |
+ |
} catch (NullPointerException success) {} |
891 |
+ |
try { |
892 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
893 |
+ |
shouldThrow(); |
894 |
+ |
} catch (NullPointerException success) {} |
895 |
+ |
try { |
896 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
897 |
+ |
shouldThrow(); |
898 |
+ |
} catch (NullPointerException success) {} |
899 |
+ |
} |
900 |
+ |
} |
901 |
|
} |