5 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
6 |
|
*/ |
7 |
|
|
8 |
+ |
import static java.util.concurrent.TimeUnit.HOURS; |
9 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
|
|
11 |
|
import java.util.ArrayList; |
12 |
+ |
import java.util.Arrays; |
13 |
|
import java.util.Collection; |
14 |
|
import java.util.Collections; |
15 |
|
import java.util.Deque; |
19 |
|
import java.util.NoSuchElementException; |
20 |
|
import java.util.Queue; |
21 |
|
import java.util.Spliterator; |
22 |
+ |
import java.util.concurrent.BlockingDeque; |
23 |
+ |
import java.util.concurrent.BlockingQueue; |
24 |
|
import java.util.concurrent.CountDownLatch; |
25 |
|
import java.util.concurrent.Executors; |
26 |
|
import java.util.concurrent.ExecutorService; |
53 |
|
impl); |
54 |
|
} |
55 |
|
|
56 |
+ |
Object bomb() { |
57 |
+ |
return new Object() { |
58 |
+ |
public boolean equals(Object x) { throw new AssertionError(); } |
59 |
+ |
public int hashCode() { throw new AssertionError(); } |
60 |
+ |
}; |
61 |
+ |
} |
62 |
+ |
|
63 |
|
/** Checks properties of empty collections. */ |
64 |
< |
public void testEmptyMeansEmpty() { |
64 |
> |
public void testEmptyMeansEmpty() throws InterruptedException { |
65 |
|
Collection c = impl.emptyCollection(); |
66 |
+ |
emptyMeansEmpty(c); |
67 |
+ |
|
68 |
+ |
if (c instanceof java.io.Serializable) |
69 |
+ |
emptyMeansEmpty(serialClone(c)); |
70 |
+ |
|
71 |
+ |
Collection clone = cloneableClone(c); |
72 |
+ |
if (clone != null) |
73 |
+ |
emptyMeansEmpty(clone); |
74 |
+ |
} |
75 |
+ |
|
76 |
+ |
void emptyMeansEmpty(Collection c) throws InterruptedException { |
77 |
|
assertTrue(c.isEmpty()); |
78 |
|
assertEquals(0, c.size()); |
79 |
|
assertEquals("[]", c.toString()); |
98 |
|
assertSame(3, a[2]); |
99 |
|
} |
100 |
|
assertIteratorExhausted(c.iterator()); |
101 |
< |
Consumer alwaysThrows = (e) -> { throw new AssertionError(); }; |
101 |
> |
Consumer alwaysThrows = e -> { throw new AssertionError(); }; |
102 |
|
c.forEach(alwaysThrows); |
103 |
|
c.iterator().forEachRemaining(alwaysThrows); |
104 |
|
c.spliterator().forEachRemaining(alwaysThrows); |
105 |
|
assertFalse(c.spliterator().tryAdvance(alwaysThrows)); |
106 |
< |
if (Queue.class.isAssignableFrom(impl.klazz())) { |
106 |
> |
if (c.spliterator().hasCharacteristics(Spliterator.SIZED)) |
107 |
> |
assertEquals(0, c.spliterator().estimateSize()); |
108 |
> |
assertFalse(c.contains(bomb())); |
109 |
> |
assertFalse(c.remove(bomb())); |
110 |
> |
if (c instanceof Queue) { |
111 |
|
Queue q = (Queue) c; |
112 |
|
assertNull(q.peek()); |
113 |
|
assertNull(q.poll()); |
114 |
|
} |
115 |
< |
if (Deque.class.isAssignableFrom(impl.klazz())) { |
115 |
> |
if (c instanceof Deque) { |
116 |
|
Deque d = (Deque) c; |
117 |
|
assertNull(d.peekFirst()); |
118 |
|
assertNull(d.peekLast()); |
119 |
|
assertNull(d.pollFirst()); |
120 |
|
assertNull(d.pollLast()); |
121 |
|
assertIteratorExhausted(d.descendingIterator()); |
122 |
+ |
d.descendingIterator().forEachRemaining(alwaysThrows); |
123 |
+ |
assertFalse(d.removeFirstOccurrence(bomb())); |
124 |
+ |
assertFalse(d.removeLastOccurrence(bomb())); |
125 |
+ |
} |
126 |
+ |
if (c instanceof BlockingQueue) { |
127 |
+ |
BlockingQueue q = (BlockingQueue) c; |
128 |
+ |
assertNull(q.poll(0L, MILLISECONDS)); |
129 |
+ |
} |
130 |
+ |
if (c instanceof BlockingDeque) { |
131 |
+ |
BlockingDeque q = (BlockingDeque) c; |
132 |
+ |
assertNull(q.pollFirst(0L, MILLISECONDS)); |
133 |
+ |
assertNull(q.pollLast(0L, MILLISECONDS)); |
134 |
|
} |
135 |
|
} |
136 |
|
|
137 |
< |
public void testNullPointerExceptions() { |
137 |
> |
public void testNullPointerExceptions() throws InterruptedException { |
138 |
|
Collection c = impl.emptyCollection(); |
139 |
|
assertThrows( |
140 |
|
NullPointerException.class, |
154 |
|
NullPointerException.class, |
155 |
|
() -> c.add(null)); |
156 |
|
} |
157 |
< |
if (!impl.permitsNulls() |
120 |
< |
&& Queue.class.isAssignableFrom(impl.klazz())) { |
157 |
> |
if (!impl.permitsNulls() && c instanceof Queue) { |
158 |
|
Queue q = (Queue) c; |
159 |
|
assertThrows( |
160 |
|
NullPointerException.class, |
161 |
|
() -> q.offer(null)); |
162 |
|
} |
163 |
< |
if (!impl.permitsNulls() |
127 |
< |
&& Deque.class.isAssignableFrom(impl.klazz())) { |
163 |
> |
if (!impl.permitsNulls() && c instanceof Deque) { |
164 |
|
Deque d = (Deque) c; |
165 |
|
assertThrows( |
166 |
|
NullPointerException.class, |
171 |
|
() -> d.push(null), |
172 |
|
() -> d.descendingIterator().forEachRemaining(null)); |
173 |
|
} |
174 |
+ |
if (c instanceof BlockingQueue) { |
175 |
+ |
BlockingQueue q = (BlockingQueue) c; |
176 |
+ |
assertThrows( |
177 |
+ |
NullPointerException.class, |
178 |
+ |
() -> { |
179 |
+ |
try { q.offer(null, 1L, HOURS); } |
180 |
+ |
catch (InterruptedException ex) { |
181 |
+ |
throw new AssertionError(ex); |
182 |
+ |
}}, |
183 |
+ |
() -> { |
184 |
+ |
try { q.put(null); } |
185 |
+ |
catch (InterruptedException ex) { |
186 |
+ |
throw new AssertionError(ex); |
187 |
+ |
}}); |
188 |
+ |
} |
189 |
+ |
if (c instanceof BlockingDeque) { |
190 |
+ |
BlockingDeque q = (BlockingDeque) c; |
191 |
+ |
assertThrows( |
192 |
+ |
NullPointerException.class, |
193 |
+ |
() -> { |
194 |
+ |
try { q.offerFirst(null, 1L, HOURS); } |
195 |
+ |
catch (InterruptedException ex) { |
196 |
+ |
throw new AssertionError(ex); |
197 |
+ |
}}, |
198 |
+ |
() -> { |
199 |
+ |
try { q.offerLast(null, 1L, HOURS); } |
200 |
+ |
catch (InterruptedException ex) { |
201 |
+ |
throw new AssertionError(ex); |
202 |
+ |
}}, |
203 |
+ |
() -> { |
204 |
+ |
try { q.putFirst(null); } |
205 |
+ |
catch (InterruptedException ex) { |
206 |
+ |
throw new AssertionError(ex); |
207 |
+ |
}}, |
208 |
+ |
() -> { |
209 |
+ |
try { q.putLast(null); } |
210 |
+ |
catch (InterruptedException ex) { |
211 |
+ |
throw new AssertionError(ex); |
212 |
+ |
}}); |
213 |
+ |
} |
214 |
|
} |
215 |
|
|
216 |
|
public void testNoSuchElementExceptions() { |
219 |
|
NoSuchElementException.class, |
220 |
|
() -> c.iterator().next()); |
221 |
|
|
222 |
< |
if (Queue.class.isAssignableFrom(impl.klazz())) { |
222 |
> |
if (c instanceof Queue) { |
223 |
|
Queue q = (Queue) c; |
224 |
|
assertThrows( |
225 |
|
NoSuchElementException.class, |
226 |
|
() -> q.element(), |
227 |
|
() -> q.remove()); |
228 |
|
} |
229 |
< |
if (Deque.class.isAssignableFrom(impl.klazz())) { |
229 |
> |
if (c instanceof Deque) { |
230 |
|
Deque d = (Deque) c; |
231 |
|
assertThrows( |
232 |
|
NoSuchElementException.class, |
241 |
|
|
242 |
|
public void testRemoveIf() { |
243 |
|
Collection c = impl.emptyCollection(); |
244 |
+ |
boolean ordered = |
245 |
+ |
c.spliterator().hasCharacteristics(Spliterator.ORDERED); |
246 |
|
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
247 |
|
int n = rnd.nextInt(6); |
248 |
|
for (int i = 0; i < n; i++) c.add(impl.makeElement(i)); |
249 |
|
AtomicReference threwAt = new AtomicReference(null); |
250 |
< |
ArrayList survivors = new ArrayList(c); |
250 |
> |
List orig = rnd.nextBoolean() |
251 |
> |
? new ArrayList(c) |
252 |
> |
: Arrays.asList(c.toArray()); |
253 |
> |
|
254 |
> |
// Merely creating an iterator can change ArrayBlockingQueue behavior |
255 |
> |
Iterator it = rnd.nextBoolean() ? c.iterator() : null; |
256 |
> |
|
257 |
> |
ArrayList survivors = new ArrayList(); |
258 |
|
ArrayList accepts = new ArrayList(); |
259 |
|
ArrayList rejects = new ArrayList(); |
260 |
< |
Predicate randomPredicate = (e) -> { |
260 |
> |
|
261 |
> |
Predicate randomPredicate = e -> { |
262 |
|
assertNull(threwAt.get()); |
263 |
|
switch (rnd.nextInt(3)) { |
264 |
|
case 0: accepts.add(e); return true; |
268 |
|
} |
269 |
|
}; |
270 |
|
try { |
271 |
< |
boolean modified = c.removeIf(randomPredicate); |
272 |
< |
if (!modified) { |
271 |
> |
try { |
272 |
> |
boolean modified = c.removeIf(randomPredicate); |
273 |
|
assertNull(threwAt.get()); |
274 |
< |
assertEquals(n, rejects.size()); |
275 |
< |
assertEquals(0, accepts.size()); |
274 |
> |
assertEquals(modified, accepts.size() > 0); |
275 |
> |
assertEquals(modified, rejects.size() != n); |
276 |
> |
assertEquals(accepts.size() + rejects.size(), n); |
277 |
> |
if (ordered) { |
278 |
> |
assertEquals(rejects, |
279 |
> |
Arrays.asList(c.toArray())); |
280 |
> |
} else { |
281 |
> |
assertEquals(new HashSet(rejects), |
282 |
> |
new HashSet(Arrays.asList(c.toArray()))); |
283 |
> |
} |
284 |
> |
} catch (ArithmeticException ok) { |
285 |
> |
assertNotNull(threwAt.get()); |
286 |
> |
assertTrue(c.contains(threwAt.get())); |
287 |
> |
} |
288 |
> |
if (it != null && impl.isConcurrent()) |
289 |
> |
// check for weakly consistent iterator |
290 |
> |
while (it.hasNext()) assertTrue(orig.contains(it.next())); |
291 |
> |
switch (rnd.nextInt(4)) { |
292 |
> |
case 0: survivors.addAll(c); break; |
293 |
> |
case 1: survivors.addAll(Arrays.asList(c.toArray())); break; |
294 |
> |
case 2: c.forEach(e -> survivors.add(e)); break; |
295 |
> |
case 3: for (Object e : c) survivors.add(e); break; |
296 |
> |
} |
297 |
> |
assertTrue(orig.containsAll(accepts)); |
298 |
> |
assertTrue(orig.containsAll(rejects)); |
299 |
> |
assertTrue(orig.containsAll(survivors)); |
300 |
> |
assertTrue(orig.containsAll(c)); |
301 |
> |
assertTrue(c.containsAll(rejects)); |
302 |
> |
assertTrue(c.containsAll(survivors)); |
303 |
> |
assertTrue(survivors.containsAll(rejects)); |
304 |
> |
if (threwAt.get() == null) { |
305 |
> |
assertEquals(n - accepts.size(), c.size()); |
306 |
> |
for (Object x : accepts) assertFalse(c.contains(x)); |
307 |
> |
} else { |
308 |
> |
// Two acceptable behaviors: entire removeIf call is one |
309 |
> |
// transaction, or each element processed is one transaction. |
310 |
> |
assertTrue(n == c.size() || n == c.size() + accepts.size()); |
311 |
> |
int k = 0; |
312 |
> |
for (Object x : accepts) if (c.contains(x)) k++; |
313 |
> |
assertTrue(k == accepts.size() || k == 0); |
314 |
|
} |
315 |
< |
} catch (ArithmeticException ok) {} |
192 |
< |
survivors.removeAll(accepts); |
193 |
< |
if (n - accepts.size() != c.size()) { |
315 |
> |
} catch (Throwable ex) { |
316 |
|
System.err.println(impl.klazz()); |
317 |
< |
System.err.println(c); |
318 |
< |
System.err.println(accepts); |
319 |
< |
System.err.println(rejects); |
320 |
< |
System.err.println(survivors); |
321 |
< |
System.err.println(threwAt.get()); |
322 |
< |
} |
323 |
< |
assertEquals(n - accepts.size(), c.size()); |
324 |
< |
assertTrue(c.containsAll(survivors)); |
325 |
< |
assertTrue(survivors.containsAll(rejects)); |
326 |
< |
for (Object x : accepts) assertFalse(c.contains(x)); |
327 |
< |
if (threwAt.get() == null) |
206 |
< |
assertEquals(accepts.size() + rejects.size(), n); |
317 |
> |
// c is at risk of corruption if we got here, so be lenient |
318 |
> |
try { System.err.printf("c=%s%n", c); } |
319 |
> |
catch (Throwable t) { t.printStackTrace(); } |
320 |
> |
System.err.printf("n=%d%n", n); |
321 |
> |
System.err.printf("orig=%s%n", orig); |
322 |
> |
System.err.printf("accepts=%s%n", accepts); |
323 |
> |
System.err.printf("rejects=%s%n", rejects); |
324 |
> |
System.err.printf("survivors=%s%n", survivors); |
325 |
> |
System.err.printf("threwAt=%s%n", threwAt.get()); |
326 |
> |
throw ex; |
327 |
> |
} |
328 |
|
} |
329 |
|
|
330 |
|
/** |
337 |
|
for (int i = 0; i < n; i++) c.add(impl.makeElement(i)); |
338 |
|
ArrayList iterated = new ArrayList(); |
339 |
|
ArrayList iteratedForEachRemaining = new ArrayList(); |
340 |
+ |
ArrayList tryAdvanced = new ArrayList(); |
341 |
|
ArrayList spliterated = new ArrayList(); |
342 |
< |
ArrayList foreached = new ArrayList(); |
342 |
> |
ArrayList forEached = new ArrayList(); |
343 |
> |
ArrayList removeIfed = new ArrayList(); |
344 |
|
for (Object x : c) iterated.add(x); |
345 |
|
c.iterator().forEachRemaining(e -> iteratedForEachRemaining.add(e)); |
346 |
+ |
for (Spliterator s = c.spliterator(); |
347 |
+ |
s.tryAdvance(e -> tryAdvanced.add(e)); ) {} |
348 |
|
c.spliterator().forEachRemaining(e -> spliterated.add(e)); |
349 |
< |
c.forEach(e -> foreached.add(e)); |
349 |
> |
c.forEach(e -> forEached.add(e)); |
350 |
> |
c.removeIf(e -> { removeIfed.add(e); return false; }); |
351 |
|
boolean ordered = |
352 |
|
c.spliterator().hasCharacteristics(Spliterator.ORDERED); |
353 |
|
if (c instanceof List || c instanceof Deque) |
354 |
|
assertTrue(ordered); |
355 |
|
if (ordered) { |
356 |
|
assertEquals(iterated, iteratedForEachRemaining); |
357 |
+ |
assertEquals(iterated, tryAdvanced); |
358 |
|
assertEquals(iterated, spliterated); |
359 |
< |
assertEquals(iterated, foreached); |
359 |
> |
assertEquals(iterated, forEached); |
360 |
> |
assertEquals(iterated, removeIfed); |
361 |
|
} else { |
362 |
|
HashSet cset = new HashSet(c); |
363 |
|
assertEquals(cset, new HashSet(iterated)); |
364 |
|
assertEquals(cset, new HashSet(iteratedForEachRemaining)); |
365 |
+ |
assertEquals(cset, new HashSet(tryAdvanced)); |
366 |
|
assertEquals(cset, new HashSet(spliterated)); |
367 |
< |
assertEquals(cset, new HashSet(foreached)); |
367 |
> |
assertEquals(cset, new HashSet(forEached)); |
368 |
> |
assertEquals(cset, new HashSet(removeIfed)); |
369 |
|
} |
370 |
|
if (c instanceof Deque) { |
371 |
|
Deque d = (Deque) c; |
384 |
|
|
385 |
|
/** |
386 |
|
* Calling Iterator#remove() after Iterator#forEachRemaining |
387 |
< |
* should remove last element |
387 |
> |
* should (maybe) remove last element |
388 |
|
*/ |
389 |
|
public void testRemoveAfterForEachRemaining() { |
390 |
|
Collection c = impl.emptyCollection(); |
397 |
|
assertEquals(impl.makeElement(0), it.next()); |
398 |
|
assertTrue(it.hasNext()); |
399 |
|
assertEquals(impl.makeElement(1), it.next()); |
400 |
< |
it.forEachRemaining((e) -> {}); |
401 |
< |
it.remove(); |
402 |
< |
assertEquals(n - 1, c.size()); |
403 |
< |
for (int i = 0; i < n - 1; i++) |
404 |
< |
assertTrue(c.contains(impl.makeElement(i))); |
405 |
< |
assertFalse(c.contains(impl.makeElement(n - 1))); |
400 |
> |
it.forEachRemaining(e -> assertTrue(c.contains(e))); |
401 |
> |
if (testImplementationDetails) { |
402 |
> |
if (c instanceof java.util.concurrent.ArrayBlockingQueue) { |
403 |
> |
assertIteratorExhausted(it); |
404 |
> |
} else { |
405 |
> |
it.remove(); |
406 |
> |
assertEquals(n - 1, c.size()); |
407 |
> |
for (int i = 0; i < n - 1; i++) |
408 |
> |
assertTrue(c.contains(impl.makeElement(i))); |
409 |
> |
assertFalse(c.contains(impl.makeElement(n - 1))); |
410 |
> |
} |
411 |
> |
} |
412 |
|
} |
413 |
|
if (c instanceof Deque) { |
414 |
|
Deque d = (Deque) impl.emptyCollection(); |
419 |
|
assertEquals(impl.makeElement(n - 1), it.next()); |
420 |
|
assertTrue(it.hasNext()); |
421 |
|
assertEquals(impl.makeElement(n - 2), it.next()); |
422 |
< |
it.forEachRemaining((e) -> {}); |
423 |
< |
it.remove(); |
424 |
< |
assertEquals(n - 1, d.size()); |
425 |
< |
for (int i = 1; i < n; i++) |
426 |
< |
assertTrue(d.contains(impl.makeElement(i))); |
427 |
< |
assertFalse(d.contains(impl.makeElement(0))); |
422 |
> |
it.forEachRemaining(e -> assertTrue(c.contains(e))); |
423 |
> |
if (testImplementationDetails) { |
424 |
> |
it.remove(); |
425 |
> |
assertEquals(n - 1, d.size()); |
426 |
> |
for (int i = 1; i < n; i++) |
427 |
> |
assertTrue(d.contains(impl.makeElement(i))); |
428 |
> |
assertFalse(d.contains(impl.makeElement(0))); |
429 |
> |
} |
430 |
|
} |
431 |
|
} |
432 |
|
|
439 |
|
final Object x = impl.makeElement(1); |
440 |
|
final Object y = impl.makeElement(2); |
441 |
|
final ArrayList found = new ArrayList(); |
442 |
< |
Consumer<Object> spy = (o) -> { found.add(o); }; |
442 |
> |
Consumer<Object> spy = o -> found.add(o); |
443 |
|
c.stream().forEach(spy); |
444 |
|
assertTrue(found.isEmpty()); |
445 |
|
|
473 |
|
Runnable checkElt = () -> { |
474 |
|
threadsStarted.countDown(); |
475 |
|
while (!done.get()) |
476 |
< |
c.stream().forEach((x) -> { assertSame(x, elt); }); }; |
476 |
> |
c.stream().forEach(x -> assertSame(x, elt)); }; |
477 |
|
Runnable addRemove = () -> { |
478 |
|
threadsStarted.countDown(); |
479 |
|
while (!done.get()) { |
497 |
|
final Object x = impl.makeElement(1); |
498 |
|
final Object y = impl.makeElement(2); |
499 |
|
final ArrayList found = new ArrayList(); |
500 |
< |
Consumer<Object> spy = (o) -> { found.add(o); }; |
500 |
> |
Consumer<Object> spy = o -> found.add(o); |
501 |
|
c.forEach(spy); |
502 |
|
assertTrue(found.isEmpty()); |
503 |
|
|
531 |
|
Runnable checkElt = () -> { |
532 |
|
threadsStarted.countDown(); |
533 |
|
while (!done.get()) |
534 |
< |
c.forEach((x) -> { assertSame(x, elt); }); }; |
534 |
> |
c.forEach(x -> assertSame(x, elt)); }; |
535 |
|
Runnable addRemove = () -> { |
536 |
|
threadsStarted.countDown(); |
537 |
|
while (!done.get()) { |