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.32 by jsr166, Mon Nov 28 03:30:28 2016 UTC vs.
Revision 1.53 by jsr166, Sun May 6 22:09:42 2018 UTC

#	Line 8 | Line 8
8		import static java.util.concurrent.TimeUnit.HOURS;
9		import static java.util.concurrent.TimeUnit.MILLISECONDS;
10
11	+	import java.util.ArrayDeque;
12		import java.util.ArrayList;
13		import java.util.Arrays;
14		import java.util.Collection;
15		import java.util.Collections;
16	+	import java.util.ConcurrentModificationException;
17		import java.util.Deque;
18		import java.util.HashSet;
19		import java.util.Iterator;
20		import java.util.List;
21		import java.util.NoSuchElementException;
22		import java.util.Queue;
23	+	import java.util.Set;
24		import java.util.Spliterator;
25		import java.util.concurrent.BlockingDeque;
26		import java.util.concurrent.BlockingQueue;
#	Line 58 | Line 61 | public class Collection8Test extends JSR
61
62		Object bomb() {
63		return new Object() {
64	<	public boolean equals(Object x) { throw new AssertionError(); }
65	<	public int hashCode() { throw new AssertionError(); }
66	<	};
64	>	@Override public boolean equals(Object x) { throw new AssertionError(); }
65	>	@Override public int hashCode() { throw new AssertionError(); }
66	>	@Override public String toString() { throw new AssertionError(); }
67	>	};
68		}
69
70		/** Checks properties of empty collections. */
#	Line 91 | Line 95 | public class Collection8Test extends JSR
95		assertTrue(c.isEmpty());
96		assertEquals(0, c.size());
97		assertEquals("[]", c.toString());
98	+	if (c instanceof List<?>) {
99	+	List x = (List) c;
100	+	assertEquals(1, x.hashCode());
101	+	assertEquals(x, Collections.emptyList());
102	+	assertEquals(Collections.emptyList(), x);
103	+	assertEquals(-1, x.indexOf(impl.makeElement(86)));
104	+	assertEquals(-1, x.lastIndexOf(impl.makeElement(99)));
105	+	assertThrows(
106	+	IndexOutOfBoundsException.class,
107	+	() -> x.get(0),
108	+	() -> x.set(0, impl.makeElement(42)));
109	+	}
110	+	else if (c instanceof Set<?>) {
111	+	assertEquals(0, c.hashCode());
112	+	assertEquals(c, Collections.emptySet());
113	+	assertEquals(Collections.emptySet(), c);
114	+	}
115		{
116		Object[] a = c.toArray();
117		assertEquals(0, a.length);
#	Line 139 | Line 160 | public class Collection8Test extends JSR
160		}
161		if (c instanceof BlockingQueue) {
162		BlockingQueue q = (BlockingQueue) c;
163	<	assertNull(q.poll(0L, MILLISECONDS));
163	>	assertNull(q.poll(randomExpiredTimeout(), randomTimeUnit()));
164		}
165		if (c instanceof BlockingDeque) {
166		BlockingDeque q = (BlockingDeque) c;
167	<	assertNull(q.pollFirst(0L, MILLISECONDS));
168	<	assertNull(q.pollLast(0L, MILLISECONDS));
167	>	assertNull(q.pollFirst(randomExpiredTimeout(), randomTimeUnit()));
168	>	assertNull(q.pollLast(randomExpiredTimeout(), randomTimeUnit()));
169		}
170		}
171
#	Line 251 | Line 272 | public class Collection8Test extends JSR
272		() -> d.pop(),
273		() -> d.descendingIterator().next());
274		}
275	+	if (c instanceof List) {
276	+	List x = (List) c;
277	+	assertThrows(
278	+	NoSuchElementException.class,
279	+	() -> x.iterator().next(),
280	+	() -> x.listIterator().next(),
281	+	() -> x.listIterator(0).next(),
282	+	() -> x.listIterator().previous(),
283	+	() -> x.listIterator(0).previous());
284	+	}
285		}
286
287		public void testRemoveIf() {
#	Line 342 | Line 373 | public class Collection8Test extends JSR
373		}
374
375		/**
376	+	* All elements removed in the middle of CONCURRENT traversal.
377	+	*/
378	+	public void testElementRemovalDuringTraversal() {
379	+	Collection c = impl.emptyCollection();
380	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
381	+	int n = rnd.nextInt(6);
382	+	ArrayList copy = new ArrayList();
383	+	for (int i = 0; i < n; i++) {
384	+	Object x = impl.makeElement(i);
385	+	copy.add(x);
386	+	c.add(x);
387	+	}
388	+	ArrayList iterated = new ArrayList();
389	+	ArrayList spliterated = new ArrayList();
390	+	Spliterator s = c.spliterator();
391	+	Iterator it = c.iterator();
392	+	for (int i = rnd.nextInt(n + 1); --i >= 0; ) {
393	+	assertTrue(s.tryAdvance(spliterated::add));
394	+	if (rnd.nextBoolean()) assertTrue(it.hasNext());
395	+	iterated.add(it.next());
396	+	}
397	+	Consumer alwaysThrows = e -> { throw new AssertionError(); };
398	+	if (s.hasCharacteristics(Spliterator.CONCURRENT)) {
399	+	c.clear();          // TODO: many more removal methods
400	+	if (testImplementationDetails
401	+	&& !(c instanceof java.util.concurrent.ArrayBlockingQueue)) {
402	+	if (rnd.nextBoolean())
403	+	assertFalse(s.tryAdvance(alwaysThrows));
404	+	else
405	+	s.forEachRemaining(alwaysThrows);
406	+	}
407	+	if (it.hasNext()) iterated.add(it.next());
408	+	if (rnd.nextBoolean()) assertIteratorExhausted(it);
409	+	}
410	+	assertTrue(copy.containsAll(iterated));
411	+	assertTrue(copy.containsAll(spliterated));
412	+	}
413	+
414	+	/**
415	+	* Some elements randomly disappear in the middle of traversal.
416	+	*/
417	+	public void testRandomElementRemovalDuringTraversal() {
418	+	Collection c = impl.emptyCollection();
419	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
420	+	int n = rnd.nextInt(6);
421	+	ArrayList copy = new ArrayList();
422	+	for (int i = 0; i < n; i++) {
423	+	Object x = impl.makeElement(i);
424	+	copy.add(x);
425	+	c.add(x);
426	+	}
427	+	ArrayList iterated = new ArrayList();
428	+	ArrayList spliterated = new ArrayList();
429	+	ArrayList removed = new ArrayList();
430	+	Spliterator s = c.spliterator();
431	+	Iterator it = c.iterator();
432	+	if (! (s.hasCharacteristics(Spliterator.CONCURRENT) ||
433	+	s.hasCharacteristics(Spliterator.IMMUTABLE)))
434	+	return;
435	+	for (int i = rnd.nextInt(n + 1); --i >= 0; ) {
436	+	assertTrue(s.tryAdvance(e -> {}));
437	+	if (rnd.nextBoolean()) assertTrue(it.hasNext());
438	+	it.next();
439	+	}
440	+	Consumer alwaysThrows = e -> { throw new AssertionError(); };
441	+	// TODO: many more removal methods
442	+	if (rnd.nextBoolean()) {
443	+	for (Iterator z = c.iterator(); z.hasNext(); ) {
444	+	Object e = z.next();
445	+	if (rnd.nextBoolean()) {
446	+	try {
447	+	z.remove();
448	+	} catch (UnsupportedOperationException ok) { return; }
449	+	removed.add(e);
450	+	}
451	+	}
452	+	} else {
453	+	Predicate randomlyRemove = e -> {
454	+	if (rnd.nextBoolean()) { removed.add(e); return true; }
455	+	else return false;
456	+	};
457	+	c.removeIf(randomlyRemove);
458	+	}
459	+	s.forEachRemaining(spliterated::add);
460	+	while (it.hasNext())
461	+	iterated.add(it.next());
462	+	assertTrue(copy.containsAll(iterated));
463	+	assertTrue(copy.containsAll(spliterated));
464	+	assertTrue(copy.containsAll(removed));
465	+	if (s.hasCharacteristics(Spliterator.CONCURRENT)) {
466	+	ArrayList iteratedAndRemoved = new ArrayList(iterated);
467	+	ArrayList spliteratedAndRemoved = new ArrayList(spliterated);
468	+	iteratedAndRemoved.retainAll(removed);
469	+	spliteratedAndRemoved.retainAll(removed);
470	+	assertTrue(iteratedAndRemoved.size() <= 1);
471	+	assertTrue(spliteratedAndRemoved.size() <= 1);
472	+	if (testImplementationDetails
473	+	&& !(c instanceof java.util.concurrent.ArrayBlockingQueue))
474	+	assertTrue(spliteratedAndRemoved.isEmpty());
475	+	}
476	+	}
477	+
478	+	/**
479		* Various ways of traversing a collection yield same elements
480		*/
481	<	public void testIteratorEquivalence() {
481	>	public void testTraversalEquivalence() {
482		Collection c = impl.emptyCollection();
483		ThreadLocalRandom rnd = ThreadLocalRandom.current();
484		int n = rnd.nextInt(6);
#	Line 353 | Line 487 | public class Collection8Test extends JSR
487		ArrayList iteratedForEachRemaining = new ArrayList();
488		ArrayList tryAdvanced = new ArrayList();
489		ArrayList spliterated = new ArrayList();
490	+	ArrayList splitonced = new ArrayList();
491		ArrayList forEached = new ArrayList();
492		ArrayList streamForEached = new ArrayList();
493		ConcurrentLinkedQueue parallelStreamForEached = new ConcurrentLinkedQueue();
#	Line 362 | Line 497 | public class Collection8Test extends JSR
497		for (Spliterator s = c.spliterator();
498		s.tryAdvance(tryAdvanced::add); ) {}
499		c.spliterator().forEachRemaining(spliterated::add);
500	+	{                       // trySplit returns "strict prefix"
501	+	Spliterator s1 = c.spliterator(), s2 = s1.trySplit();
502	+	if (s2 != null) s2.forEachRemaining(splitonced::add);
503	+	s1.forEachRemaining(splitonced::add);
504	+	}
505		c.forEach(forEached::add);
506		c.stream().forEach(streamForEached::add);
507		c.parallelStream().forEach(parallelStreamForEached::add);
#	Line 376 | Line 516 | public class Collection8Test extends JSR
516		assertEquals(iterated, iteratedForEachRemaining);
517		assertEquals(iterated, tryAdvanced);
518		assertEquals(iterated, spliterated);
519	+	assertEquals(iterated, splitonced);
520		assertEquals(iterated, forEached);
521		assertEquals(iterated, streamForEached);
522		assertEquals(iterated, removeIfed);
#	Line 384 | Line 525 | public class Collection8Test extends JSR
525		assertEquals(cset, new HashSet(iteratedForEachRemaining));
526		assertEquals(cset, new HashSet(tryAdvanced));
527		assertEquals(cset, new HashSet(spliterated));
528	+	assertEquals(cset, new HashSet(splitonced));
529		assertEquals(cset, new HashSet(forEached));
530		assertEquals(cset, new HashSet(streamForEached));
531		assertEquals(cset, new HashSet(removeIfed));
#	Line 404 | Line 546 | public class Collection8Test extends JSR
546		}
547
548		/**
549	+	* Iterator.forEachRemaining has same behavior as Iterator's
550	+	* default implementation.
551	+	*/
552	+	public void testForEachRemainingConsistentWithDefaultImplementation() {
553	+	Collection c = impl.emptyCollection();
554	+	if (!testImplementationDetails
555	+	|| c.getClass() == java.util.LinkedList.class)
556	+	return;
557	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
558	+	int n = 1 + rnd.nextInt(3);
559	+	for (int i = 0; i < n; i++) c.add(impl.makeElement(i));
560	+	ArrayList iterated = new ArrayList();
561	+	ArrayList iteratedForEachRemaining = new ArrayList();
562	+	Iterator it1 = c.iterator();
563	+	Iterator it2 = c.iterator();
564	+	assertTrue(it1.hasNext());
565	+	assertTrue(it2.hasNext());
566	+	c.clear();
567	+	Object r1, r2;
568	+	try {
569	+	while (it1.hasNext()) iterated.add(it1.next());
570	+	r1 = iterated;
571	+	} catch (ConcurrentModificationException ex) {
572	+	r1 = ConcurrentModificationException.class;
573	+	assertFalse(impl.isConcurrent());
574	+	}
575	+	try {
576	+	it2.forEachRemaining(iteratedForEachRemaining::add);
577	+	r2 = iteratedForEachRemaining;
578	+	} catch (ConcurrentModificationException ex) {
579	+	r2 = ConcurrentModificationException.class;
580	+	assertFalse(impl.isConcurrent());
581	+	}
582	+	assertEquals(r1, r2);
583	+	}
584	+
585	+	/**
586		* Calling Iterator#remove() after Iterator#forEachRemaining
587		* should (maybe) remove last element
588		*/
589		public void testRemoveAfterForEachRemaining() {
590		Collection c = impl.emptyCollection();
591		ThreadLocalRandom rnd = ThreadLocalRandom.current();
592	+	ArrayList copy = new ArrayList();
593	+	boolean ordered = c.spliterator().hasCharacteristics(Spliterator.ORDERED);
594		testCollection: {
595		int n = 3 + rnd.nextInt(2);
596	<	for (int i = 0; i < n; i++) c.add(impl.makeElement(i));
596	>	for (int i = 0; i < n; i++) {
597	>	Object x = impl.makeElement(i);
598	>	c.add(x);
599	>	copy.add(x);
600	>	}
601		Iterator it = c.iterator();
602	<	assertTrue(it.hasNext());
603	<	assertEquals(impl.makeElement(0), it.next());
604	<	assertTrue(it.hasNext());
605	<	assertEquals(impl.makeElement(1), it.next());
606	<	it.forEachRemaining(e -> assertTrue(c.contains(e)));
602	>	if (ordered) {
603	>	if (rnd.nextBoolean()) assertTrue(it.hasNext());
604	>	assertEquals(impl.makeElement(0), it.next());
605	>	if (rnd.nextBoolean()) assertTrue(it.hasNext());
606	>	assertEquals(impl.makeElement(1), it.next());
607	>	} else {
608	>	if (rnd.nextBoolean()) assertTrue(it.hasNext());
609	>	assertTrue(copy.contains(it.next()));
610	>	if (rnd.nextBoolean()) assertTrue(it.hasNext());
611	>	assertTrue(copy.contains(it.next()));
612	>	}
613	>	it.forEachRemaining(
614	>	e -> {
615	>	assertTrue(c.contains(e));
616	>	assertTrue(copy.contains(e));});
617		if (testImplementationDetails) {
618		if (c instanceof java.util.concurrent.ArrayBlockingQueue) {
619		assertIteratorExhausted(it);
#	Line 428 | Line 623 | public class Collection8Test extends JSR
623		break testCollection;
624		}
625		assertEquals(n - 1, c.size());
626	<	for (int i = 0; i < n - 1; i++)
627	<	assertTrue(c.contains(impl.makeElement(i)));
628	<	assertFalse(c.contains(impl.makeElement(n - 1)));
626	>	if (ordered) {
627	>	for (int i = 0; i < n - 1; i++)
628	>	assertTrue(c.contains(impl.makeElement(i)));
629	>	assertFalse(c.contains(impl.makeElement(n - 1)));
630	>	}
631		}
632		}
633		}
634		if (c instanceof Deque) {
635		Deque d = (Deque) impl.emptyCollection();
636	+	assertTrue(ordered);
637		int n = 3 + rnd.nextInt(2);
638		for (int i = 0; i < n; i++) d.add(impl.makeElement(i));
639		Iterator it = d.descendingIterator();
#	Line 542 | Line 740 | public class Collection8Test extends JSR
740		assertTrue(found.isEmpty());
741		}
742
743	+	/** TODO: promote to a common utility */
744	+	static <T> T chooseOne(T ... ts) {
745	+	return ts[ThreadLocalRandom.current().nextInt(ts.length)];
746	+	}
747	+
748	+	/** TODO: more random adders and removers */
749	+	static <E> Runnable adderRemover(Collection<E> c, E e) {
750	+	return chooseOne(
751	+	() -> {
752	+	assertTrue(c.add(e));
753	+	assertTrue(c.contains(e));
754	+	assertTrue(c.remove(e));
755	+	assertFalse(c.contains(e));
756	+	},
757	+	() -> {
758	+	assertTrue(c.add(e));
759	+	assertTrue(c.contains(e));
760	+	assertTrue(c.removeIf(x -> x == e));
761	+	assertFalse(c.contains(e));
762	+	},
763	+	() -> {
764	+	assertTrue(c.add(e));
765	+	assertTrue(c.contains(e));
766	+	for (Iterator it = c.iterator();; )
767	+	if (it.next() == e) {
768	+	try { it.remove(); }
769	+	catch (UnsupportedOperationException ok) {
770	+	c.remove(e);
771	+	}
772	+	break;
773	+	}
774	+	assertFalse(c.contains(e));
775	+	});
776	+	}
777	+
778	+	/**
779	+	* Concurrent Spliterators, once exhausted, stay exhausted.
780	+	*/
781	+	public void testStickySpliteratorExhaustion() throws Throwable {
782	+	if (!impl.isConcurrent()) return;
783	+	if (!testImplementationDetails) return;
784	+	final ThreadLocalRandom rnd = ThreadLocalRandom.current();
785	+	final Consumer alwaysThrows = e -> { throw new AssertionError(); };
786	+	final Collection c = impl.emptyCollection();
787	+	final Spliterator s = c.spliterator();
788	+	if (rnd.nextBoolean()) {
789	+	assertFalse(s.tryAdvance(alwaysThrows));
790	+	} else {
791	+	s.forEachRemaining(alwaysThrows);
792	+	}
793	+	final Object one = impl.makeElement(1);
794	+	// Spliterator should not notice added element
795	+	c.add(one);
796	+	if (rnd.nextBoolean()) {
797	+	assertFalse(s.tryAdvance(alwaysThrows));
798	+	} else {
799	+	s.forEachRemaining(alwaysThrows);
800	+	}
801	+	}
802	+
803		/**
804		* Motley crew of threads concurrently randomly hammer the collection.
805		*/
#	Line 549 | Line 807 | public class Collection8Test extends JSR
807		if (!impl.isConcurrent()) return;
808		final ThreadLocalRandom rnd = ThreadLocalRandom.current();
809		final Collection c = impl.emptyCollection();
810	<	final long testDurationMillis = timeoutMillis();
810	>	final long testDurationMillis
811	>	= expensiveTests ? LONG_DELAY_MS : timeoutMillis();
812		final AtomicBoolean done = new AtomicBoolean(false);
813		final Object one = impl.makeElement(1);
814		final Object two = impl.makeElement(2);
815	+	final Consumer checkSanity = x -> assertTrue(x == one || x == two);
816	+	final Consumer<Object[]> checkArraySanity = array -> {
817	+	// assertTrue(array.length <= 2); // duplicates are permitted
818	+	for (Object x : array) assertTrue(x == one || x == two);
819	+	};
820		final Object[] emptyArray =
821		(Object[]) java.lang.reflect.Array.newInstance(one.getClass(), 0);
822		final List<Future<?>> futures;
823		final Phaser threadsStarted = new Phaser(1); // register this thread
560	–	final Consumer checkSanity = x -> assertTrue(x == one || x == two);
824		final Runnable[] frobbers = {
825		() -> c.forEach(checkSanity),
826		() -> c.stream().forEach(checkSanity),
#	Line 573 | Line 836 | public class Collection8Test extends JSR
836		do {} while (s.tryAdvance(checkSanity));
837		},
838		() -> { for (Object x : c) checkSanity.accept(x); },
839	<	() -> { for (Object x : c.toArray()) checkSanity.accept(x); },
840	<	() -> { 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	<	},
839	>	() -> checkArraySanity.accept(c.toArray()),
840	>	() -> checkArraySanity.accept(c.toArray(emptyArray)),
841		() -> {
842	<	assertTrue(c.add(two));
843	<	assertTrue(c.contains(two));
844	<	assertTrue(c.remove(two));
845	<	assertFalse(c.contains(two));
846	<	},
842	>	Object[] a = new Object[5];
843	>	Object three = impl.makeElement(3);
844	>	Arrays.fill(a, 0, a.length, three);
845	>	Object[] x = c.toArray(a);
846	>	if (x == a)
847	>	for (int i = 0; i < a.length && a[i] != null; i++)
848	>	checkSanity.accept(a[i]);
849	>	// A careful reading of the spec does not support:
850	>	// for (i++; i < a.length; i++) assertSame(three, a[i]);
851	>	else
852	>	checkArraySanity.accept(x);
853	>	},
854	>	adderRemover(c, one),
855	>	adderRemover(c, two),
856		};
857		final List<Runnable> tasks =
858		Arrays.stream(frobbers)
#	Line 644 | Line 910 | public class Collection8Test extends JSR
910		}
911		}
912
913	+	/**
914	+	* Spliterator.getComparator throws IllegalStateException iff the
915	+	* spliterator does not report SORTED.
916	+	*/
917	+	public void testGetComparator_IllegalStateException() {
918	+	Collection c = impl.emptyCollection();
919	+	Spliterator s = c.spliterator();
920	+	boolean reportsSorted = s.hasCharacteristics(Spliterator.SORTED);
921	+	try {
922	+	s.getComparator();
923	+	assertTrue(reportsSorted);
924	+	} catch (IllegalStateException ex) {
925	+	assertFalse(reportsSorted);
926	+	}
927	+	}
928	+
929	+	public void testCollectionCopies() throws Exception {
930	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
931	+	Collection c = impl.emptyCollection();
932	+	for (int n = rnd.nextInt(4); n--> 0; )
933	+	c.add(impl.makeElement(rnd.nextInt()));
934	+	assertEquals(c, c);
935	+	if (c instanceof List)
936	+	assertCollectionsEquals(c, new ArrayList(c));
937	+	else if (c instanceof Set)
938	+	assertCollectionsEquals(c, new HashSet(c));
939	+	else if (c instanceof Deque)
940	+	assertCollectionsEquivalent(c, new ArrayDeque(c));
941	+
942	+	Collection clone = cloneableClone(c);
943	+	if (clone != null) {
944	+	assertSame(c.getClass(), clone.getClass());
945	+	assertCollectionsEquivalent(c, clone);
946	+	}
947	+	try {
948	+	Collection serialClone = serialClonePossiblyFailing(c);
949	+	assertSame(c.getClass(), serialClone.getClass());
950	+	assertCollectionsEquivalent(c, serialClone);
951	+	} catch (java.io.NotSerializableException acceptable) {}
952	+	}
953	+
954	+	public void testReplaceAllIsNotStructuralModification() {
955	+	Collection c = impl.emptyCollection();
956	+	if (!(c instanceof List))
957	+	return;
958	+	List list = (List) c;
959	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
960	+	for (int n = rnd.nextInt(2, 10); n--> 0; )
961	+	list.add(impl.makeElement(rnd.nextInt()));
962	+	ArrayList copy = new ArrayList(list);
963	+	int size = list.size(), half = size / 2;
964	+	Iterator it = list.iterator();
965	+	for (int i = 0; i < half; i++)
966	+	assertEquals(it.next(), copy.get(i));
967	+	list.replaceAll(n -> n);
968	+	// ConcurrentModificationException must not be thrown here.
969	+	for (int i = half; i < size; i++)
970	+	assertEquals(it.next(), copy.get(i));
971	+	}
972	+
973		//     public void testCollection8DebugFail() {
974		//         fail(impl.klazz().getSimpleName());
975		//     }

Diff Legend

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