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 |
|
*/ |
8 |
|
|
9 |
< |
import junit.framework.*; |
10 |
< |
import java.util.*; |
11 |
< |
import java.util.concurrent.*; |
12 |
< |
import java.io.*; |
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 |
|
|
29 |
|
} |
30 |
|
|
31 |
|
/** |
32 |
< |
* Create 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) { |
842 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
843 |
|
String s = q.toString(); |
844 |
|
for (int i = 0; i < SIZE; ++i) { |
845 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
845 |
> |
assertTrue(s.contains(String.valueOf(i))); |
846 |
|
} |
847 |
|
} |
848 |
|
|
850 |
|
* A deserialized serialized deque has same elements in same order |
851 |
|
*/ |
852 |
|
public void testSerialization() throws Exception { |
853 |
< |
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
854 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
855 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
856 |
< |
out.writeObject(q); |
857 |
< |
out.close(); |
858 |
< |
|
859 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
860 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
861 |
< |
ConcurrentLinkedDeque r = (ConcurrentLinkedDeque)in.readObject(); |
862 |
< |
assertEquals(q.size(), r.size()); |
863 |
< |
while (!q.isEmpty()) |
864 |
< |
assertEquals(q.remove(), r.remove()); |
853 |
> |
Queue x = populatedDeque(SIZE); |
854 |
> |
Queue y = serialClone(x); |
855 |
> |
|
856 |
> |
assertNotSame(x, y); |
857 |
> |
assertEquals(x.size(), y.size()); |
858 |
> |
assertEquals(x.toString(), y.toString()); |
859 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
860 |
> |
while (!x.isEmpty()) { |
861 |
> |
assertFalse(y.isEmpty()); |
862 |
> |
assertEquals(x.remove(), y.remove()); |
863 |
> |
} |
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 |
|
} |