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.12 by jsr166, Sat Nov 5 16:10:38 2016 UTC vs.
Revision 1.32 by jsr166, Mon Nov 28 03:30:28 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;
#	Line 17 | Line 19 | 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 57 | Line 64 | public class Collection8Test extends JSR
64		}
65
66		/** Checks properties of empty collections. */
67	<	public void testEmptyMeansEmpty() {
67	>	public void testEmptyMeansEmpty() throws Throwable {
68		Collection c = impl.emptyCollection();
69		emptyMeansEmpty(c);
70
71	<	if (c instanceof java.io.Serializable)
72	<	emptyMeansEmpty(serialClone(c));
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) {
90	>	void emptyMeansEmpty(Collection c) throws InterruptedException {
91		assertTrue(c.isEmpty());
92		assertEquals(0, c.size());
93		assertEquals("[]", c.toString());
#	Line 94 | Line 112 | public class Collection8Test extends JSR
112		assertSame(3, a[2]);
113		}
114		assertIteratorExhausted(c.iterator());
115	<	Consumer alwaysThrows = (e) -> { throw new AssertionError(); };
115	>	Consumer alwaysThrows = e -> { throw new AssertionError(); };
116		c.forEach(alwaysThrows);
117		c.iterator().forEachRemaining(alwaysThrows);
118		c.spliterator().forEachRemaining(alwaysThrows);
#	Line 119 | Line 137 | public class Collection8Test extends JSR
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() {
151	>	public void testNullPointerExceptions() throws InterruptedException {
152		Collection c = impl.emptyCollection();
153		assertThrows(
154		NullPointerException.class,
#	Line 141 | Line 168 | public class Collection8Test extends JSR
168		NullPointerException.class,
169		() -> c.add(null));
170		}
171	<	if (!impl.permitsNulls()
145	<	&& Queue.class.isAssignableFrom(impl.klazz())) {
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()
152	<	&& Deque.class.isAssignableFrom(impl.klazz())) {
177	>	if (!impl.permitsNulls() && c instanceof Deque) {
178		Deque d = (Deque) c;
179		assertThrows(
180		NullPointerException.class,
#	Line 160 | Line 185 | public class Collection8Test extends JSR
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() {
#	Line 168 | Line 233 | public class Collection8Test extends JSR
233		NoSuchElementException.class,
234		() -> c.iterator().next());
235
236	<	if (Queue.class.isAssignableFrom(impl.klazz())) {
236	>	if (c instanceof Queue) {
237		Queue q = (Queue) c;
238		assertThrows(
239		NoSuchElementException.class,
240		() -> q.element(),
241		() -> q.remove());
242		}
243	<	if (Deque.class.isAssignableFrom(impl.klazz())) {
243	>	if (c instanceof Deque) {
244		Deque d = (Deque) c;
245		assertThrows(
246		NoSuchElementException.class,
#	Line 190 | Line 255 | public class Collection8Test extends JSR
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	<	ArrayList survivors = new ArrayList(c);
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	<	Predicate randomPredicate = (e) -> {
274	>
275	>	Predicate randomPredicate = e -> {
276		assertNull(threwAt.get());
277		switch (rnd.nextInt(3)) {
278		case 0: accepts.add(e); return true;
#	Line 207 | Line 282 | public class Collection8Test extends JSR
282		}
283		};
284		try {
210	–	assertFalse(survivors.contains(null));
285		try {
286		boolean modified = c.removeIf(randomPredicate);
287	<	if (!modified) {
288	<	assertNull(threwAt.get());
289	<	assertEquals(n, rejects.size());
290	<	assertEquals(0, accepts.size());
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	<	survivors.removeAll(accepts);
300	<	assertEquals(n - accepts.size(), c.size());
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	<	for (Object x : accepts) assertFalse(c.contains(x));
319	<	if (threwAt.get() == null)
320	<	assertEquals(accepts.size() + rejects.size(), n);
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	<	System.err.printf("c=%s%n", c);
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("threw=%s%n", threwAt.get());
339	>	System.err.printf("threwAt=%s%n", threwAt.get());
340		throw ex;
341		}
342		}
#	Line 245 | Line 351 | public class Collection8Test extends JSR
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 foreached = new ArrayList();
356	>	ArrayList forEached = new ArrayList();
357	>	ArrayList streamForEached = new ArrayList();
358	>	ConcurrentLinkedQueue parallelStreamForEached = new ConcurrentLinkedQueue();
359	>	ArrayList removeIfed = new ArrayList();
360		for (Object x : c) iterated.add(x);
361	<	c.iterator().forEachRemaining(e -> iteratedForEachRemaining.add(e));
362	<	c.spliterator().forEachRemaining(e -> spliterated.add(e));
363	<	c.forEach(e -> foreached.add(e));
361	>	c.iterator().forEachRemaining(iteratedForEachRemaining::add);
362	>	for (Spliterator s = c.spliterator();
363	>	s.tryAdvance(tryAdvanced::add); ) {}
364	>	c.spliterator().forEachRemaining(spliterated::add);
365	>	c.forEach(forEached::add);
366	>	c.stream().forEach(streamForEached::add);
367	>	c.parallelStream().forEach(parallelStreamForEached::add);
368	>	c.removeIf(e -> { removeIfed.add(e); return false; });
369		boolean ordered =
370		c.spliterator().hasCharacteristics(Spliterator.ORDERED);
371		if (c instanceof List || c instanceof Deque)
372		assertTrue(ordered);
373	+	HashSet cset = new HashSet(c);
374	+	assertEquals(cset, new HashSet(parallelStreamForEached));
375		if (ordered) {
376		assertEquals(iterated, iteratedForEachRemaining);
377	+	assertEquals(iterated, tryAdvanced);
378		assertEquals(iterated, spliterated);
379	<	assertEquals(iterated, foreached);
379	>	assertEquals(iterated, forEached);
380	>	assertEquals(iterated, streamForEached);
381	>	assertEquals(iterated, removeIfed);
382		} else {
263	–	HashSet cset = new HashSet(c);
383		assertEquals(cset, new HashSet(iterated));
384		assertEquals(cset, new HashSet(iteratedForEachRemaining));
385	+	assertEquals(cset, new HashSet(tryAdvanced));
386		assertEquals(cset, new HashSet(spliterated));
387	<	assertEquals(cset, new HashSet(foreached));
387	>	assertEquals(cset, new HashSet(forEached));
388	>	assertEquals(cset, new HashSet(streamForEached));
389	>	assertEquals(cset, new HashSet(removeIfed));
390		}
391		if (c instanceof Deque) {
392		Deque d = (Deque) c;
#	Line 283 | Line 405 | public class Collection8Test extends JSR
405
406		/**
407		* Calling Iterator#remove() after Iterator#forEachRemaining
408	<	* should remove last element
408	>	* should (maybe) remove last element
409		*/
410		public void testRemoveAfterForEachRemaining() {
411		Collection c = impl.emptyCollection();
412		ThreadLocalRandom rnd = ThreadLocalRandom.current();
413	<	{
413	>	testCollection: {
414		int n = 3 + rnd.nextInt(2);
415		for (int i = 0; i < n; i++) c.add(impl.makeElement(i));
416		Iterator it = c.iterator();
#	Line 296 | Line 418 | public class Collection8Test extends JSR
418		assertEquals(impl.makeElement(0), it.next());
419		assertTrue(it.hasNext());
420		assertEquals(impl.makeElement(1), it.next());
421	<	it.forEachRemaining((e) -> {});
422	<	it.remove();
423	<	assertEquals(n - 1, c.size());
424	<	for (int i = 0; i < n - 1; i++)
425	<	assertTrue(c.contains(impl.makeElement(i)));
426	<	assertFalse(c.contains(impl.makeElement(n - 1)));
421	>	it.forEachRemaining(e -> assertTrue(c.contains(e)));
422	>	if (testImplementationDetails) {
423	>	if (c instanceof java.util.concurrent.ArrayBlockingQueue) {
424	>	assertIteratorExhausted(it);
425	>	} else {
426	>	try { it.remove(); }
427	>	catch (UnsupportedOperationException ok) {
428	>	break testCollection;
429	>	}
430	>	assertEquals(n - 1, c.size());
431	>	for (int i = 0; i < n - 1; i++)
432	>	assertTrue(c.contains(impl.makeElement(i)));
433	>	assertFalse(c.contains(impl.makeElement(n - 1)));
434	>	}
435	>	}
436		}
437		if (c instanceof Deque) {
438		Deque d = (Deque) impl.emptyCollection();
#	Line 312 | Line 443 | public class Collection8Test extends JSR
443		assertEquals(impl.makeElement(n - 1), it.next());
444		assertTrue(it.hasNext());
445		assertEquals(impl.makeElement(n - 2), it.next());
446	<	it.forEachRemaining((e) -> {});
447	<	it.remove();
448	<	assertEquals(n - 1, d.size());
449	<	for (int i = 1; i < n; i++)
450	<	assertTrue(d.contains(impl.makeElement(i)));
451	<	assertFalse(d.contains(impl.makeElement(0)));
446	>	it.forEachRemaining(e -> assertTrue(c.contains(e)));
447	>	if (testImplementationDetails) {
448	>	it.remove();
449	>	assertEquals(n - 1, d.size());
450	>	for (int i = 1; i < n; i++)
451	>	assertTrue(d.contains(impl.makeElement(i)));
452	>	assertFalse(d.contains(impl.makeElement(0)));
453	>	}
454		}
455		}
456
#	Line 330 | Line 463 | public class Collection8Test extends JSR
463		final Object x = impl.makeElement(1);
464		final Object y = impl.makeElement(2);
465		final ArrayList found = new ArrayList();
466	<	Consumer<Object> spy = (o) -> { found.add(o); };
466	>	Consumer<Object> spy = o -> found.add(o);
467		c.stream().forEach(spy);
468		assertTrue(found.isEmpty());
469
#	Line 364 | Line 497 | public class Collection8Test extends JSR
497		Runnable checkElt = () -> {
498		threadsStarted.countDown();
499		while (!done.get())
500	<	c.stream().forEach((x) -> { assertSame(x, elt); }); };
500	>	c.stream().forEach(x -> assertSame(x, elt)); };
501		Runnable addRemove = () -> {
502		threadsStarted.countDown();
503		while (!done.get()) {
#	Line 388 | Line 521 | public class Collection8Test extends JSR
521		final Object x = impl.makeElement(1);
522		final Object y = impl.makeElement(2);
523		final ArrayList found = new ArrayList();
524	<	Consumer<Object> spy = (o) -> { found.add(o); };
524	>	Consumer<Object> spy = o -> found.add(o);
525		c.forEach(spy);
526		assertTrue(found.isEmpty());
527
#	Line 409 | Line 542 | public class Collection8Test extends JSR
542		assertTrue(found.isEmpty());
543		}
544
545	<	public void testForEachConcurrentStressTest() throws Throwable {
545	>	/**
546	>	* Motley crew of threads concurrently randomly hammer the collection.
547	>	*/
548	>	public void testDetectRaces() throws Throwable {
549		if (!impl.isConcurrent()) return;
550	+	final ThreadLocalRandom rnd = ThreadLocalRandom.current();
551		final Collection c = impl.emptyCollection();
552		final long testDurationMillis = timeoutMillis();
553		final AtomicBoolean done = new AtomicBoolean(false);
554	<	final Object elt = impl.makeElement(1);
555	<	final Future<?> f1, f2;
554	>	final Object one = impl.makeElement(1);
555	>	final Object two = impl.makeElement(2);
556	>	final Object[] emptyArray =
557	>	(Object[]) java.lang.reflect.Array.newInstance(one.getClass(), 0);
558	>	final List<Future<?>> futures;
559	>	final Phaser threadsStarted = new Phaser(1); // register this thread
560	>	final Consumer checkSanity = x -> assertTrue(x == one || x == two);
561	>	final Runnable[] frobbers = {
562	>	() -> c.forEach(checkSanity),
563	>	() -> c.stream().forEach(checkSanity),
564	>	() -> c.parallelStream().forEach(checkSanity),
565	>	() -> c.spliterator().trySplit(),
566	>	() -> {
567	>	Spliterator s = c.spliterator();
568	>	s.tryAdvance(checkSanity);
569	>	s.trySplit();
570	>	},
571	>	() -> {
572	>	Spliterator s = c.spliterator();
573	>	do {} while (s.tryAdvance(checkSanity));
574	>	},
575	>	() -> { for (Object x : c) checkSanity.accept(x); },
576	>	() -> { for (Object x : c.toArray()) checkSanity.accept(x); },
577	>	() -> { for (Object x : c.toArray(emptyArray)) checkSanity.accept(x); },
578	>	() -> {
579	>	assertTrue(c.add(one));
580	>	assertTrue(c.contains(one));
581	>	assertTrue(c.remove(one));
582	>	assertFalse(c.contains(one));
583	>	},
584	>	() -> {
585	>	assertTrue(c.add(two));
586	>	assertTrue(c.contains(two));
587	>	assertTrue(c.remove(two));
588	>	assertFalse(c.contains(two));
589	>	},
590	>	};
591	>	final List<Runnable> tasks =
592	>	Arrays.stream(frobbers)
593	>	.filter(task -> rnd.nextBoolean()) // random subset
594	>	.map(task -> (Runnable) () -> {
595	>	threadsStarted.arriveAndAwaitAdvance();
596	>	while (!done.get())
597	>	task.run();
598	>	})
599	>	.collect(Collectors.toList());
600		final ExecutorService pool = Executors.newCachedThreadPool();
601		try (PoolCleaner cleaner = cleaner(pool, done)) {
602	<	final CountDownLatch threadsStarted = new CountDownLatch(2);
603	<	Runnable checkElt = () -> {
604	<	threadsStarted.countDown();
605	<	while (!done.get())
606	<	c.forEach((x) -> { assertSame(x, elt); }); };
426	<	Runnable addRemove = () -> {
427	<	threadsStarted.countDown();
428	<	while (!done.get()) {
429	<	assertTrue(c.add(elt));
430	<	assertTrue(c.remove(elt));
431	<	}};
432	<	f1 = pool.submit(checkElt);
433	<	f2 = pool.submit(addRemove);
602	>	threadsStarted.bulkRegister(tasks.size());
603	>	futures = tasks.stream()
604	>	.map(pool::submit)
605	>	.collect(Collectors.toList());
606	>	threadsStarted.arriveAndDeregister();
607		Thread.sleep(testDurationMillis);
608		}
609	<	assertNull(f1.get(0L, MILLISECONDS));
610	<	assertNull(f2.get(0L, MILLISECONDS));
609	>	for (Future future : futures)
610	>	assertNull(future.get(0L, MILLISECONDS));
611	>	}
612	>
613	>	/**
614	>	* Spliterators are either IMMUTABLE or truly late-binding or, if
615	>	* concurrent, use the same "late-binding style" of returning
616	>	* elements added between creation and first use.
617	>	*/
618	>	public void testLateBindingStyle() {
619	>	if (!testImplementationDetails) return;
620	>	if (impl.klazz() == ArrayList.class) return; // for jdk8
621	>	// Immutable (snapshot) spliterators are exempt
622	>	if (impl.emptyCollection().spliterator()
623	>	.hasCharacteristics(Spliterator.IMMUTABLE))
624	>	return;
625	>	final Object one = impl.makeElement(1);
626	>	{
627	>	final Collection c = impl.emptyCollection();
628	>	final Spliterator split = c.spliterator();
629	>	c.add(one);
630	>	assertTrue(split.tryAdvance(e -> { assertSame(e, one); }));
631	>	assertFalse(split.tryAdvance(e -> { throw new AssertionError(); }));
632	>	assertTrue(c.contains(one));
633	>	}
634	>	{
635	>	final AtomicLong count = new AtomicLong(0);
636	>	final Collection c = impl.emptyCollection();
637	>	final Spliterator split = c.spliterator();
638	>	c.add(one);
639	>	split.forEachRemaining(
640	>	e -> { assertSame(e, one); count.getAndIncrement(); });
641	>	assertEquals(1L, count.get());
642	>	assertFalse(split.tryAdvance(e -> { throw new AssertionError(); }));
643	>	assertTrue(c.contains(one));
644	>	}
645		}
646
647		//     public void testCollection8DebugFail() {

Diff Legend

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