662 |
|
*/ |
663 |
|
public void testToArray() { |
664 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
665 |
< |
Object[] o = q.toArray(); |
666 |
< |
for (int i = 0; i < o.length; i++) |
667 |
< |
assertSame(o[i], q.poll()); |
665 |
> |
Object[] a = q.toArray(); |
666 |
> |
assertSame(Object[].class, a.getClass()); |
667 |
> |
for (Object o : a) |
668 |
> |
assertSame(o, q.poll()); |
669 |
> |
assertTrue(q.isEmpty()); |
670 |
|
} |
671 |
|
|
672 |
|
/** |
677 |
|
Integer[] ints = new Integer[SIZE]; |
678 |
|
Integer[] array = q.toArray(ints); |
679 |
|
assertSame(ints, array); |
680 |
< |
for (int i = 0; i < ints.length; i++) |
681 |
< |
assertSame(ints[i], q.poll()); |
680 |
> |
for (Integer o : ints) |
681 |
> |
assertSame(o, q.poll()); |
682 |
> |
assertTrue(q.isEmpty()); |
683 |
|
} |
684 |
|
|
685 |
|
/** |
912 |
|
} |
913 |
|
} |
914 |
|
|
915 |
+ |
void runAsync(Runnable r1, Runnable r2) { |
916 |
+ |
boolean b = ThreadLocalRandom.current().nextBoolean(); |
917 |
+ |
CompletableFuture<Void> f1 = CompletableFuture.runAsync(b ? r1 : r2); |
918 |
+ |
CompletableFuture<Void> f2 = CompletableFuture.runAsync(b ? r2 : r1); |
919 |
+ |
f1.join(); |
920 |
+ |
f2.join(); |
921 |
+ |
} |
922 |
+ |
|
923 |
|
/** |
924 |
|
* Non-traversing Deque operations are linearizable. |
925 |
|
* https://bugs.openjdk.java.net/browse/JDK-8188900 |
943 |
|
x, nulls.sum(), zeros.sum())); |
944 |
|
}; |
945 |
|
|
946 |
< |
Runnable adder = () -> { |
936 |
< |
d.addFirst(0); |
937 |
< |
d.addLast(42); |
938 |
< |
}; |
946 |
> |
Runnable adder = () -> { d.addFirst(0); d.addLast(42); }; |
947 |
|
|
948 |
< |
boolean b = rnd.nextBoolean(); |
941 |
< |
Runnable r1 = b ? getter : adder; |
942 |
< |
Runnable r2 = b ? adder : getter; |
943 |
< |
CompletableFuture<Void> f1 = CompletableFuture.runAsync(r1); |
944 |
< |
CompletableFuture<Void> f2 = CompletableFuture.runAsync(r2); |
945 |
< |
f1.join(); |
946 |
< |
f2.join(); |
948 |
> |
runAsync(getter, adder); |
949 |
|
} |
950 |
|
} |
951 |
|
|
970 |
|
x, nulls.sum(), zeros.sum())); |
971 |
|
}; |
972 |
|
|
973 |
< |
Runnable adder = () -> { |
974 |
< |
d.addLast(0); |
975 |
< |
d.addFirst(42); |
976 |
< |
}; |
973 |
> |
Runnable adder = () -> { d.addLast(0); d.addFirst(42); }; |
974 |
> |
|
975 |
> |
runAsync(getter, adder); |
976 |
> |
} |
977 |
> |
} |
978 |
> |
|
979 |
> |
<T> T chooseRandomly(T... choices) { |
980 |
> |
return choices[ThreadLocalRandom.current().nextInt(choices.length)]; |
981 |
> |
} |
982 |
> |
|
983 |
> |
/** |
984 |
> |
* Non-traversing Deque operations (that return null) are linearizable. |
985 |
> |
* Don't return null when the deque is observably never empty. |
986 |
> |
* https://bugs.openjdk.java.net/browse/JDK-8189387 |
987 |
> |
* ant -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ConcurrentLinkedDequeTest -Djsr166.methodFilter=testBug8189387 tck |
988 |
> |
*/ |
989 |
> |
public void testBug8189387() { |
990 |
> |
final ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
991 |
> |
Object x = new Object(); |
992 |
> |
for (int n = expensiveTests ? 100_000 : 10; n--> 0; ) { |
993 |
> |
ConcurrentLinkedDeque<Object> d = new ConcurrentLinkedDeque<>(); |
994 |
> |
Runnable add = chooseRandomly( |
995 |
> |
() -> d.addFirst(x), |
996 |
> |
() -> d.offerFirst(x), |
997 |
> |
() -> d.addLast(x), |
998 |
> |
() -> d.offerLast(x)); |
999 |
> |
|
1000 |
> |
Runnable get = chooseRandomly( |
1001 |
> |
() -> assertFalse(d.isEmpty()), |
1002 |
> |
() -> assertSame(x, d.peekFirst()), |
1003 |
> |
() -> assertSame(x, d.peekLast()), |
1004 |
> |
() -> assertSame(x, d.pollFirst()), |
1005 |
> |
() -> assertSame(x, d.pollLast())); |
1006 |
> |
|
1007 |
> |
Runnable addRemove = chooseRandomly( |
1008 |
> |
() -> { d.addFirst(x); d.pollLast(); }, |
1009 |
> |
() -> { d.offerFirst(x); d.removeFirst(); }, |
1010 |
> |
() -> { d.offerLast(x); d.removeLast(); }, |
1011 |
> |
() -> { d.addLast(x); d.pollFirst(); }); |
1012 |
|
|
1013 |
< |
boolean b = rnd.nextBoolean(); |
1014 |
< |
Runnable r1 = b ? getter : adder; |
978 |
< |
Runnable r2 = b ? adder : getter; |
979 |
< |
CompletableFuture<Void> f1 = CompletableFuture.runAsync(r1); |
980 |
< |
CompletableFuture<Void> f2 = CompletableFuture.runAsync(r2); |
981 |
< |
f1.join(); |
982 |
< |
f2.join(); |
1013 |
> |
add.run(); |
1014 |
> |
runAsync(get, addRemove); |
1015 |
|
} |
1016 |
|
} |
1017 |
|
} |