ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/Collection8Test.java

Comparing jsr166/src/test/tck/Collection8Test.java (file contents):
Revision 1.3 by jsr166, Sun Oct 9 05:25:09 2016 UTC vs.
Revision 1.35 by jsr166, Mon Nov 28 17:53:59 2016 UTC

#	Line 5 | Line 5
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;
16	+	import java.util.HashSet;
17	+	import java.util.Iterator;
18	+	import java.util.List;
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.ConcurrentLinkedQueue;
25		import java.util.concurrent.CountDownLatch;
26		import java.util.concurrent.Executors;
27		import java.util.concurrent.ExecutorService;
28		import java.util.concurrent.Future;
29	+	import java.util.concurrent.Phaser;
30	+	import java.util.concurrent.ThreadLocalRandom;
31		import java.util.concurrent.atomic.AtomicBoolean;
32		import java.util.concurrent.atomic.AtomicLong;
33	+	import java.util.concurrent.atomic.AtomicReference;
34		import java.util.function.Consumer;
35	+	import java.util.function.Predicate;
36	+	import java.util.stream.Collectors;
37
38		import junit.framework.Test;
39
#	Line 39 | Line 56 | public class Collection8Test extends JSR
56		impl);
57		}
58
59	+	Object bomb() {
60	+	return new Object() {
61	+	public boolean equals(Object x) { throw new AssertionError(); }
62	+	public int hashCode() { throw new AssertionError(); }
63	+	};
64	+	}
65	+
66	+	/** Checks properties of empty collections. */
67	+	public void testEmptyMeansEmpty() throws Throwable {
68	+	Collection c = impl.emptyCollection();
69	+	emptyMeansEmpty(c);
70	+
71	+	if (c instanceof java.io.Serializable) {
72	+	try {
73	+	emptyMeansEmpty(serialClonePossiblyFailing(c));
74	+	} catch (java.io.NotSerializableException ex) {
75	+	// excusable when we have a serializable wrapper around
76	+	// a non-serializable collection, as can happen with:
77	+	// Vector.subList() => wrapped AbstractList$RandomAccessSubList
78	+	if (testImplementationDetails
79	+	&& (! c.getClass().getName().matches(
80	+	"java.util.Collections.*")))
81	+	throw ex;
82	+	}
83	+	}
84	+
85	+	Collection clone = cloneableClone(c);
86	+	if (clone != null)
87	+	emptyMeansEmpty(clone);
88	+	}
89	+
90	+	void emptyMeansEmpty(Collection c) throws InterruptedException {
91	+	assertTrue(c.isEmpty());
92	+	assertEquals(0, c.size());
93	+	assertEquals("[]", c.toString());
94	+	{
95	+	Object[] a = c.toArray();
96	+	assertEquals(0, a.length);
97	+	assertSame(Object[].class, a.getClass());
98	+	}
99	+	{
100	+	Object[] a = new Object[0];
101	+	assertSame(a, c.toArray(a));
102	+	}
103	+	{
104	+	Integer[] a = new Integer[0];
105	+	assertSame(a, c.toArray(a));
106	+	}
107	+	{
108	+	Integer[] a = { 1, 2, 3};
109	+	assertSame(a, c.toArray(a));
110	+	assertNull(a[0]);
111	+	assertSame(2, a[1]);
112	+	assertSame(3, a[2]);
113	+	}
114	+	assertIteratorExhausted(c.iterator());
115	+	Consumer alwaysThrows = e -> { throw new AssertionError(); };
116	+	c.forEach(alwaysThrows);
117	+	c.iterator().forEachRemaining(alwaysThrows);
118	+	c.spliterator().forEachRemaining(alwaysThrows);
119	+	assertFalse(c.spliterator().tryAdvance(alwaysThrows));
120	+	if (c.spliterator().hasCharacteristics(Spliterator.SIZED))
121	+	assertEquals(0, c.spliterator().estimateSize());
122	+	assertFalse(c.contains(bomb()));
123	+	assertFalse(c.remove(bomb()));
124	+	if (c instanceof Queue) {
125	+	Queue q = (Queue) c;
126	+	assertNull(q.peek());
127	+	assertNull(q.poll());
128	+	}
129	+	if (c instanceof Deque) {
130	+	Deque d = (Deque) c;
131	+	assertNull(d.peekFirst());
132	+	assertNull(d.peekLast());
133	+	assertNull(d.pollFirst());
134	+	assertNull(d.pollLast());
135	+	assertIteratorExhausted(d.descendingIterator());
136	+	d.descendingIterator().forEachRemaining(alwaysThrows);
137	+	assertFalse(d.removeFirstOccurrence(bomb()));
138	+	assertFalse(d.removeLastOccurrence(bomb()));
139	+	}
140	+	if (c instanceof BlockingQueue) {
141	+	BlockingQueue q = (BlockingQueue) c;
142	+	assertNull(q.poll(0L, MILLISECONDS));
143	+	}
144	+	if (c instanceof BlockingDeque) {
145	+	BlockingDeque q = (BlockingDeque) c;
146	+	assertNull(q.pollFirst(0L, MILLISECONDS));
147	+	assertNull(q.pollLast(0L, MILLISECONDS));
148	+	}
149	+	}
150	+
151	+	public void testNullPointerExceptions() throws InterruptedException {
152	+	Collection c = impl.emptyCollection();
153	+	assertThrows(
154	+	NullPointerException.class,
155	+	() -> c.addAll(null),
156	+	() -> c.containsAll(null),
157	+	() -> c.retainAll(null),
158	+	() -> c.removeAll(null),
159	+	() -> c.removeIf(null),
160	+	() -> c.forEach(null),
161	+	() -> c.iterator().forEachRemaining(null),
162	+	() -> c.spliterator().forEachRemaining(null),
163	+	() -> c.spliterator().tryAdvance(null),
164	+	() -> c.toArray(null));
165	+
166	+	if (!impl.permitsNulls()) {
167	+	assertThrows(
168	+	NullPointerException.class,
169	+	() -> c.add(null));
170	+	}
171	+	if (!impl.permitsNulls() && c instanceof Queue) {
172	+	Queue q = (Queue) c;
173	+	assertThrows(
174	+	NullPointerException.class,
175	+	() -> q.offer(null));
176	+	}
177	+	if (!impl.permitsNulls() && c instanceof Deque) {
178	+	Deque d = (Deque) c;
179	+	assertThrows(
180	+	NullPointerException.class,
181	+	() -> d.addFirst(null),
182	+	() -> d.addLast(null),
183	+	() -> d.offerFirst(null),
184	+	() -> d.offerLast(null),
185	+	() -> d.push(null),
186	+	() -> d.descendingIterator().forEachRemaining(null));
187	+	}
188	+	if (c instanceof BlockingQueue) {
189	+	BlockingQueue q = (BlockingQueue) c;
190	+	assertThrows(
191	+	NullPointerException.class,
192	+	() -> {
193	+	try { q.offer(null, 1L, HOURS); }
194	+	catch (InterruptedException ex) {
195	+	throw new AssertionError(ex);
196	+	}},
197	+	() -> {
198	+	try { q.put(null); }
199	+	catch (InterruptedException ex) {
200	+	throw new AssertionError(ex);
201	+	}});
202	+	}
203	+	if (c instanceof BlockingDeque) {
204	+	BlockingDeque q = (BlockingDeque) c;
205	+	assertThrows(
206	+	NullPointerException.class,
207	+	() -> {
208	+	try { q.offerFirst(null, 1L, HOURS); }
209	+	catch (InterruptedException ex) {
210	+	throw new AssertionError(ex);
211	+	}},
212	+	() -> {
213	+	try { q.offerLast(null, 1L, HOURS); }
214	+	catch (InterruptedException ex) {
215	+	throw new AssertionError(ex);
216	+	}},
217	+	() -> {
218	+	try { q.putFirst(null); }
219	+	catch (InterruptedException ex) {
220	+	throw new AssertionError(ex);
221	+	}},
222	+	() -> {
223	+	try { q.putLast(null); }
224	+	catch (InterruptedException ex) {
225	+	throw new AssertionError(ex);
226	+	}});
227	+	}
228	+	}
229	+
230	+	public void testNoSuchElementExceptions() {
231	+	Collection c = impl.emptyCollection();
232	+	assertThrows(
233	+	NoSuchElementException.class,
234	+	() -> c.iterator().next());
235	+
236	+	if (c instanceof Queue) {
237	+	Queue q = (Queue) c;
238	+	assertThrows(
239	+	NoSuchElementException.class,
240	+	() -> q.element(),
241	+	() -> q.remove());
242	+	}
243	+	if (c instanceof Deque) {
244	+	Deque d = (Deque) c;
245	+	assertThrows(
246	+	NoSuchElementException.class,
247	+	() -> d.getFirst(),
248	+	() -> d.getLast(),
249	+	() -> d.removeFirst(),
250	+	() -> d.removeLast(),
251	+	() -> d.pop(),
252	+	() -> d.descendingIterator().next());
253	+	}
254	+	}
255	+
256	+	public void testRemoveIf() {
257	+	Collection c = impl.emptyCollection();
258	+	boolean ordered =
259	+	c.spliterator().hasCharacteristics(Spliterator.ORDERED);
260	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
261	+	int n = rnd.nextInt(6);
262	+	for (int i = 0; i < n; i++) c.add(impl.makeElement(i));
263	+	AtomicReference threwAt = new AtomicReference(null);
264	+	List orig = rnd.nextBoolean()
265	+	? new ArrayList(c)
266	+	: Arrays.asList(c.toArray());
267	+
268	+	// Merely creating an iterator can change ArrayBlockingQueue behavior
269	+	Iterator it = rnd.nextBoolean() ? c.iterator() : null;
270	+
271	+	ArrayList survivors = new ArrayList();
272	+	ArrayList accepts = new ArrayList();
273	+	ArrayList rejects = new ArrayList();
274	+
275	+	Predicate randomPredicate = e -> {
276	+	assertNull(threwAt.get());
277	+	switch (rnd.nextInt(3)) {
278	+	case 0: accepts.add(e); return true;
279	+	case 1: rejects.add(e); return false;
280	+	case 2: threwAt.set(e); throw new ArithmeticException();
281	+	default: throw new AssertionError();
282	+	}
283	+	};
284	+	try {
285	+	try {
286	+	boolean modified = c.removeIf(randomPredicate);
287	+	assertNull(threwAt.get());
288	+	assertEquals(modified, accepts.size() > 0);
289	+	assertEquals(modified, rejects.size() != n);
290	+	assertEquals(accepts.size() + rejects.size(), n);
291	+	if (ordered) {
292	+	assertEquals(rejects,
293	+	Arrays.asList(c.toArray()));
294	+	} else {
295	+	assertEquals(new HashSet(rejects),
296	+	new HashSet(Arrays.asList(c.toArray())));
297	+	}
298	+	} catch (ArithmeticException ok) {
299	+	assertNotNull(threwAt.get());
300	+	assertTrue(c.contains(threwAt.get()));
301	+	}
302	+	if (it != null && impl.isConcurrent())
303	+	// check for weakly consistent iterator
304	+	while (it.hasNext()) assertTrue(orig.contains(it.next()));
305	+	switch (rnd.nextInt(4)) {
306	+	case 0: survivors.addAll(c); break;
307	+	case 1: survivors.addAll(Arrays.asList(c.toArray())); break;
308	+	case 2: c.forEach(survivors::add); break;
309	+	case 3: for (Object e : c) survivors.add(e); break;
310	+	}
311	+	assertTrue(orig.containsAll(accepts));
312	+	assertTrue(orig.containsAll(rejects));
313	+	assertTrue(orig.containsAll(survivors));
314	+	assertTrue(orig.containsAll(c));
315	+	assertTrue(c.containsAll(rejects));
316	+	assertTrue(c.containsAll(survivors));
317	+	assertTrue(survivors.containsAll(rejects));
318	+	if (threwAt.get() == null) {
319	+	assertEquals(n - accepts.size(), c.size());
320	+	for (Object x : accepts) assertFalse(c.contains(x));
321	+	} else {
322	+	// Two acceptable behaviors: entire removeIf call is one
323	+	// transaction, or each element processed is one transaction.
324	+	assertTrue(n == c.size() || n == c.size() + accepts.size());
325	+	int k = 0;
326	+	for (Object x : accepts) if (c.contains(x)) k++;
327	+	assertTrue(k == accepts.size() || k == 0);
328	+	}
329	+	} catch (Throwable ex) {
330	+	System.err.println(impl.klazz());
331	+	// c is at risk of corruption if we got here, so be lenient
332	+	try { System.err.printf("c=%s%n", c); }
333	+	catch (Throwable t) { t.printStackTrace(); }
334	+	System.err.printf("n=%d%n", n);
335	+	System.err.printf("orig=%s%n", orig);
336	+	System.err.printf("accepts=%s%n", accepts);
337	+	System.err.printf("rejects=%s%n", rejects);
338	+	System.err.printf("survivors=%s%n", survivors);
339	+	System.err.printf("threwAt=%s%n", threwAt.get());
340	+	throw ex;
341	+	}
342	+	}
343	+
344	+	/**
345	+	* Various ways of traversing a collection yield same elements
346	+	*/
347	+	public void testIteratorEquivalence() {
348	+	Collection c = impl.emptyCollection();
349	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
350	+	int n = rnd.nextInt(6);
351	+	for (int i = 0; i < n; i++) c.add(impl.makeElement(i));
352	+	ArrayList iterated = new ArrayList();
353	+	ArrayList iteratedForEachRemaining = new ArrayList();
354	+	ArrayList tryAdvanced = new ArrayList();
355	+	ArrayList spliterated = new ArrayList();
356	+	ArrayList splitonced = new ArrayList();
357	+	ArrayList forEached = new ArrayList();
358	+	ArrayList streamForEached = new ArrayList();
359	+	ConcurrentLinkedQueue parallelStreamForEached = new ConcurrentLinkedQueue();
360	+	ArrayList removeIfed = new ArrayList();
361	+	for (Object x : c) iterated.add(x);
362	+	c.iterator().forEachRemaining(iteratedForEachRemaining::add);
363	+	for (Spliterator s = c.spliterator();
364	+	s.tryAdvance(tryAdvanced::add); ) {}
365	+	c.spliterator().forEachRemaining(spliterated::add);
366	+	{                       // trySplit returns "strict prefix"
367	+	Spliterator s1 = c.spliterator(), s2 = s1.trySplit();
368	+	if (s2 != null) s2.forEachRemaining(splitonced::add);
369	+	s1.forEachRemaining(splitonced::add);
370	+	}
371	+	c.forEach(forEached::add);
372	+	c.stream().forEach(streamForEached::add);
373	+	c.parallelStream().forEach(parallelStreamForEached::add);
374	+	c.removeIf(e -> { removeIfed.add(e); return false; });
375	+	boolean ordered =
376	+	c.spliterator().hasCharacteristics(Spliterator.ORDERED);
377	+	if (c instanceof List || c instanceof Deque)
378	+	assertTrue(ordered);
379	+	HashSet cset = new HashSet(c);
380	+	assertEquals(cset, new HashSet(parallelStreamForEached));
381	+	if (ordered) {
382	+	assertEquals(iterated, iteratedForEachRemaining);
383	+	assertEquals(iterated, tryAdvanced);
384	+	assertEquals(iterated, spliterated);
385	+	assertEquals(iterated, splitonced);
386	+	assertEquals(iterated, forEached);
387	+	assertEquals(iterated, streamForEached);
388	+	assertEquals(iterated, removeIfed);
389	+	} else {
390	+	assertEquals(cset, new HashSet(iterated));
391	+	assertEquals(cset, new HashSet(iteratedForEachRemaining));
392	+	assertEquals(cset, new HashSet(tryAdvanced));
393	+	assertEquals(cset, new HashSet(spliterated));
394	+	assertEquals(cset, new HashSet(splitonced));
395	+	assertEquals(cset, new HashSet(forEached));
396	+	assertEquals(cset, new HashSet(streamForEached));
397	+	assertEquals(cset, new HashSet(removeIfed));
398	+	}
399	+	if (c instanceof Deque) {
400	+	Deque d = (Deque) c;
401	+	ArrayList descending = new ArrayList();
402	+	ArrayList descendingForEachRemaining = new ArrayList();
403	+	for (Iterator it = d.descendingIterator(); it.hasNext(); )
404	+	descending.add(it.next());
405	+	d.descendingIterator().forEachRemaining(
406	+	e -> descendingForEachRemaining.add(e));
407	+	Collections.reverse(descending);
408	+	Collections.reverse(descendingForEachRemaining);
409	+	assertEquals(iterated, descending);
410	+	assertEquals(iterated, descendingForEachRemaining);
411	+	}
412	+	}
413	+
414	+	/**
415	+	* Calling Iterator#remove() after Iterator#forEachRemaining
416	+	* should (maybe) remove last element
417	+	*/
418	+	public void testRemoveAfterForEachRemaining() {
419	+	Collection c = impl.emptyCollection();
420	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
421	+	testCollection: {
422	+	int n = 3 + rnd.nextInt(2);
423	+	for (int i = 0; i < n; i++) c.add(impl.makeElement(i));
424	+	Iterator it = c.iterator();
425	+	assertTrue(it.hasNext());
426	+	assertEquals(impl.makeElement(0), it.next());
427	+	assertTrue(it.hasNext());
428	+	assertEquals(impl.makeElement(1), it.next());
429	+	it.forEachRemaining(e -> assertTrue(c.contains(e)));
430	+	if (testImplementationDetails) {
431	+	if (c instanceof java.util.concurrent.ArrayBlockingQueue) {
432	+	assertIteratorExhausted(it);
433	+	} else {
434	+	try { it.remove(); }
435	+	catch (UnsupportedOperationException ok) {
436	+	break testCollection;
437	+	}
438	+	assertEquals(n - 1, c.size());
439	+	for (int i = 0; i < n - 1; i++)
440	+	assertTrue(c.contains(impl.makeElement(i)));
441	+	assertFalse(c.contains(impl.makeElement(n - 1)));
442	+	}
443	+	}
444	+	}
445	+	if (c instanceof Deque) {
446	+	Deque d = (Deque) impl.emptyCollection();
447	+	int n = 3 + rnd.nextInt(2);
448	+	for (int i = 0; i < n; i++) d.add(impl.makeElement(i));
449	+	Iterator it = d.descendingIterator();
450	+	assertTrue(it.hasNext());
451	+	assertEquals(impl.makeElement(n - 1), it.next());
452	+	assertTrue(it.hasNext());
453	+	assertEquals(impl.makeElement(n - 2), it.next());
454	+	it.forEachRemaining(e -> assertTrue(c.contains(e)));
455	+	if (testImplementationDetails) {
456	+	it.remove();
457	+	assertEquals(n - 1, d.size());
458	+	for (int i = 1; i < n; i++)
459	+	assertTrue(d.contains(impl.makeElement(i)));
460	+	assertFalse(d.contains(impl.makeElement(0)));
461	+	}
462	+	}
463	+	}
464	+
465		/**
466		* stream().forEach returns elements in the collection
467		*/
#	Line 48 | Line 471 | public class Collection8Test extends JSR
471		final Object x = impl.makeElement(1);
472		final Object y = impl.makeElement(2);
473		final ArrayList found = new ArrayList();
474	<	Consumer<Object> spy = (o) -> { found.add(o); };
474	>	Consumer<Object> spy = o -> found.add(o);
475		c.stream().forEach(spy);
476		assertTrue(found.isEmpty());
477
#	Line 82 | Line 505 | public class Collection8Test extends JSR
505		Runnable checkElt = () -> {
506		threadsStarted.countDown();
507		while (!done.get())
508	<	c.stream().forEach((x) -> { assertSame(x, elt); }); };
508	>	c.stream().forEach(x -> assertSame(x, elt)); };
509		Runnable addRemove = () -> {
510		threadsStarted.countDown();
511		while (!done.get()) {
#	Line 106 | Line 529 | public class Collection8Test extends JSR
529		final Object x = impl.makeElement(1);
530		final Object y = impl.makeElement(2);
531		final ArrayList found = new ArrayList();
532	<	Consumer<Object> spy = (o) -> { found.add(o); };
532	>	Consumer<Object> spy = o -> found.add(o);
533		c.forEach(spy);
534		assertTrue(found.isEmpty());
535
#	Line 127 | Line 550 | public class Collection8Test extends JSR
550		assertTrue(found.isEmpty());
551		}
552
553	<	public void testForEachConcurrentStressTest() throws Throwable {
553	>	/**
554	>	* Motley crew of threads concurrently randomly hammer the collection.
555	>	*/
556	>	public void testDetectRaces() throws Throwable {
557		if (!impl.isConcurrent()) return;
558	+	final ThreadLocalRandom rnd = ThreadLocalRandom.current();
559		final Collection c = impl.emptyCollection();
560	<	final long testDurationMillis = timeoutMillis();
560	>	final long testDurationMillis
561	>	= expensiveTests ? LONG_DELAY_MS : timeoutMillis();
562		final AtomicBoolean done = new AtomicBoolean(false);
563	<	final Object elt = impl.makeElement(1);
564	<	final Future<?> f1, f2;
563	>	final Object one = impl.makeElement(1);
564	>	final Object two = impl.makeElement(2);
565	>	final Consumer checkSanity = x -> assertTrue(x == one || x == two);
566	>	final Object[] emptyArray =
567	>	(Object[]) java.lang.reflect.Array.newInstance(one.getClass(), 0);
568	>	final List<Future<?>> futures;
569	>	final Phaser threadsStarted = new Phaser(1); // register this thread
570	>	final Runnable[] frobbers = {
571	>	() -> c.forEach(checkSanity),
572	>	() -> c.stream().forEach(checkSanity),
573	>	() -> c.parallelStream().forEach(checkSanity),
574	>	() -> c.spliterator().trySplit(),
575	>	() -> {
576	>	Spliterator s = c.spliterator();
577	>	s.tryAdvance(checkSanity);
578	>	s.trySplit();
579	>	},
580	>	() -> {
581	>	Spliterator s = c.spliterator();
582	>	do {} while (s.tryAdvance(checkSanity));
583	>	},
584	>	() -> { for (Object x : c) checkSanity.accept(x); },
585	>	() -> { for (Object x : c.toArray()) checkSanity.accept(x); },
586	>	() -> { for (Object x : c.toArray(emptyArray)) checkSanity.accept(x); },
587	>	() -> {
588	>	assertTrue(c.add(one));
589	>	assertTrue(c.contains(one));
590	>	assertTrue(c.remove(one));
591	>	assertFalse(c.contains(one));
592	>	},
593	>	() -> {
594	>	assertTrue(c.add(two));
595	>	assertTrue(c.contains(two));
596	>	assertTrue(c.remove(two));
597	>	assertFalse(c.contains(two));
598	>	},
599	>	};
600	>	final List<Runnable> tasks =
601	>	Arrays.stream(frobbers)
602	>	.filter(task -> rnd.nextBoolean()) // random subset
603	>	.map(task -> (Runnable) () -> {
604	>	threadsStarted.arriveAndAwaitAdvance();
605	>	while (!done.get())
606	>	task.run();
607	>	})
608	>	.collect(Collectors.toList());
609		final ExecutorService pool = Executors.newCachedThreadPool();
610		try (PoolCleaner cleaner = cleaner(pool, done)) {
611	<	final CountDownLatch threadsStarted = new CountDownLatch(2);
612	<	Runnable checkElt = () -> {
613	<	threadsStarted.countDown();
614	<	while (!done.get())
615	<	c.forEach((x) -> { assertSame(x, elt); }); };
144	<	Runnable addRemove = () -> {
145	<	threadsStarted.countDown();
146	<	while (!done.get()) {
147	<	assertTrue(c.add(elt));
148	<	assertTrue(c.remove(elt));
149	<	}};
150	<	f1 = pool.submit(checkElt);
151	<	f2 = pool.submit(addRemove);
611	>	threadsStarted.bulkRegister(tasks.size());
612	>	futures = tasks.stream()
613	>	.map(pool::submit)
614	>	.collect(Collectors.toList());
615	>	threadsStarted.arriveAndDeregister();
616		Thread.sleep(testDurationMillis);
617		}
618	<	assertNull(f1.get(0L, MILLISECONDS));
619	<	assertNull(f2.get(0L, MILLISECONDS));
618	>	for (Future future : futures)
619	>	assertNull(future.get(0L, MILLISECONDS));
620	>	}
621	>
622	>	/**
623	>	* Spliterators are either IMMUTABLE or truly late-binding or, if
624	>	* concurrent, use the same "late-binding style" of returning
625	>	* elements added between creation and first use.
626	>	*/
627	>	public void testLateBindingStyle() {
628	>	if (!testImplementationDetails) return;
629	>	if (impl.klazz() == ArrayList.class) return; // for jdk8
630	>	// Immutable (snapshot) spliterators are exempt
631	>	if (impl.emptyCollection().spliterator()
632	>	.hasCharacteristics(Spliterator.IMMUTABLE))
633	>	return;
634	>	final Object one = impl.makeElement(1);
635	>	{
636	>	final Collection c = impl.emptyCollection();
637	>	final Spliterator split = c.spliterator();
638	>	c.add(one);
639	>	assertTrue(split.tryAdvance(e -> { assertSame(e, one); }));
640	>	assertFalse(split.tryAdvance(e -> { throw new AssertionError(); }));
641	>	assertTrue(c.contains(one));
642	>	}
643	>	{
644	>	final AtomicLong count = new AtomicLong(0);
645	>	final Collection c = impl.emptyCollection();
646	>	final Spliterator split = c.spliterator();
647	>	c.add(one);
648	>	split.forEachRemaining(
649	>	e -> { assertSame(e, one); count.getAndIncrement(); });
650	>	assertEquals(1L, count.get());
651	>	assertFalse(split.tryAdvance(e -> { throw new AssertionError(); }));
652	>	assertTrue(c.contains(one));
653	>	}
654		}
655
656	<	// public void testCollection8DebugFail() { fail(); }
656	>	//     public void testCollection8DebugFail() {
657	>	//         fail(impl.klazz().getSimpleName());
658	>	//     }
659		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines