util/Collections/CheckedSetBash.java

/*
 * Copyright (c) 2003, 2013, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/*
 * @test
 * @bug     4904067 7129185
 * @summary Unit test for Collections.checkedSet
 * @author  Josh Bloch
 * @run testng CheckedSetBash
 * @key randomness
 */

import org.testng.annotations.DataProvider;
import org.testng.annotations.Test;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;
import java.util.function.Supplier;

import static org.testng.Assert.assertTrue;
import static org.testng.Assert.fail;

public class CheckedSetBash {
    static final int numItr = 100;
    static final int setSize = 100;
    static final Random rnd = new Random();

    @Test(dataProvider = "Supplier<Set<Integer>>")
    public static void testCheckedSet(String description, Supplier<Set<Integer>> supplier) {

        Set<Integer> s1 = supplier.get();
        assertTrue(s1.isEmpty());

        AddRandoms(s1, setSize);

        Set<Integer> s2 = supplier.get();

        assertTrue(s2.isEmpty());

        AddRandoms(s2, setSize);

        Set<Integer> intersection = clone(s1, supplier);
        intersection.retainAll(s2);
        Set<Integer> diff1 = clone(s1, supplier); diff1.removeAll(s2);
        Set<Integer> diff2 = clone(s2, supplier); diff2.removeAll(s1);
        Set<Integer> union = clone(s1, supplier); union.addAll(s2);

        if (diff1.removeAll(diff2))
            fail("Set algebra identity 2 failed");
        if (diff1.removeAll(intersection))
            fail("Set algebra identity 3 failed");
        if (diff2.removeAll(diff1))
            fail("Set algebra identity 4 failed");
        if (diff2.removeAll(intersection))
            fail("Set algebra identity 5 failed");
        if (intersection.removeAll(diff1))
            fail("Set algebra identity 6 failed");
        if (intersection.removeAll(diff1))
            fail("Set algebra identity 7 failed");

        intersection.addAll(diff1); intersection.addAll(diff2);
        if (!intersection.equals(union))
            fail("Set algebra identity 1 failed");

        if (new HashSet(union).hashCode() != union.hashCode())
            fail("Incorrect hashCode computation.");

        Iterator e = union.iterator();
        while (e.hasNext())
            if (!intersection.remove(e.next()))
                fail("Couldn't remove element from copy.");
        if (!intersection.isEmpty())
            fail("Copy nonempty after deleting all elements.");

        e = union.iterator();
        while (e.hasNext()) {
            Object o = e.next();
            if (!union.contains(o))
                fail("Set doesn't contain one of its elements.");
            e.remove();
            if (union.contains(o))
                fail("Set contains element after deletion.");
        }
        if (!union.isEmpty())
            fail("Set nonempty after deleting all elements.");

        s1.clear();
        if (!s1.isEmpty())
            fail("Set nonempty after clear.");
    }

    // Done inefficiently so as to exercise toArray
    static <T> Set<T> clone(Set<T> s, Supplier<Set<T>> supplier) {
        Set<T> clone = supplier.get();
        List<T> arrayList = Arrays.asList((T[]) s.toArray());
        clone.addAll(arrayList);
        if (!s.equals(clone))
            fail("Set not equal to copy.");
        if (!s.containsAll(clone))
            fail("Set does not contain copy.");
        if (!clone.containsAll(s))
            fail("Copy does not contain set.");
        return clone;
    }

    static void AddRandoms(Set s, int n) {
        for (int i = 0; i < n; i++) {
            Integer e = rnd.nextInt(n);

            int preSize = s.size();
            boolean prePresent = s.contains(e);
            boolean added = s.add(e);
            if (!s.contains(e))
                fail("Element not present after addition.");
            if (added == prePresent)
                fail("added == alreadyPresent");
            int postSize = s.size();
            if (added && preSize == postSize)
                fail("Add returned true, but size didn't change.");
            if (!added && preSize != postSize)
                fail("Add returned false, but size changed.");
        }
    }

    @DataProvider(name = "Supplier<Set<Integer>>", parallel = true)
    public static Iterator<Object[]> navigableSetsProvider() {
        ArrayList<Object[]> iters = new ArrayList<>(makeCheckedSets());
        iters.ensureCapacity(numItr * iters.size());
        for (int each=1; each < numItr; each++) {
            iters.addAll(makeCheckedSets());
        }
        return iters.iterator();
    }

    public static Collection<Object[]> makeCheckedSets() {
        Object[][] params = {
            {"Collections.checkedSet(HashSet)",
             (Supplier) () -> Collections.checkedSet(new HashSet(), Integer.class)},
            {"Collections.checkedSet(TreeSet(reverseOrder))",
             (Supplier) () -> Collections.checkedSet(new TreeSet(Collections.reverseOrder()), Integer.class)},
            {"Collections.checkedSet(TreeSet.descendingSet())",
             (Supplier) () -> Collections.checkedSet(new TreeSet().descendingSet(), Integer.class)},
            {"Collections.checkedNavigableSet(TreeSet)",
             (Supplier) () -> Collections.checkedNavigableSet(new TreeSet(), Integer.class)},
            {"Collections.checkedNavigableSet(TreeSet(reverseOrder))",
             (Supplier) () -> Collections.checkedNavigableSet(new TreeSet(Collections.reverseOrder()), Integer.class)},
            {"Collections.checkedNavigableSet(TreeSet.descendingSet())",
             (Supplier) () -> Collections.checkedNavigableSet(new TreeSet().descendingSet(), Integer.class)},
        };
        return Arrays.asList(params);
    }
}
Revision:	1.9
Committed:	Mon Jan 8 03:12:03 2018 UTC (6 years, 4 months ago) by jsr166
Branch:	MAIN
CVS Tags:	HEAD
Changes since 1.8:	+14 -4 lines
Log Message:	organize imports
#	User	Rev	Content
1	jsr166	1.1	/*
2	jsr166	1.4	* Copyright (c) 2003, 2013, Oracle and/or its affiliates. All rights reserved.
3	jsr166	1.1	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4			*
5			* This code is free software; you can redistribute it and/or modify it
6			* under the terms of the GNU General Public License version 2 only, as
7			* published by the Free Software Foundation.
8			*
9			* This code is distributed in the hope that it will be useful, but WITHOUT
10			* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11			* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12			* version 2 for more details (a copy is included in the LICENSE file that
13			* accompanied this code).
14			*
15			* You should have received a copy of the GNU General Public License version
16			* 2 along with this work; if not, write to the Free Software Foundation,
17			* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18			*
19	jsr166	1.3	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20			* or visit www.oracle.com if you need additional information or have any
21			* questions.
22	jsr166	1.1	*/
23
24			/*
25			* @test
26	jsr166	1.4	* @bug 4904067 7129185
27	jsr166	1.1	* @summary Unit test for Collections.checkedSet
28			* @author Josh Bloch
29	jsr166	1.4	* @run testng CheckedSetBash
30			* @key randomness
31	jsr166	1.1	*/
32
33	jsr166	1.9	import org.testng.annotations.DataProvider;
34			import org.testng.annotations.Test;
35
36			import java.util.ArrayList;
37			import java.util.Arrays;
38			import java.util.Collection;
39			import java.util.Collections;
40			import java.util.HashSet;
41			import java.util.Iterator;
42			import java.util.List;
43			import java.util.Random;
44			import java.util.Set;
45			import java.util.TreeSet;
46	jsr166	1.4	import java.util.function.Supplier;
47
48	jsr166	1.9	import static org.testng.Assert.assertTrue;
49	jsr166	1.4	import static org.testng.Assert.fail;
50	jsr166	1.1
51			public class CheckedSetBash {
52	jsr166	1.4	static final int numItr = 100;
53			static final int setSize = 100;
54			static final Random rnd = new Random();
55
56			@Test(dataProvider = "Supplier<Set<Integer>>")
57			public static void testCheckedSet(String description, Supplier<Set<Integer>> supplier) {
58
59			Set<Integer> s1 = supplier.get();
60			assertTrue(s1.isEmpty());
61
62			AddRandoms(s1, setSize);
63
64			Set<Integer> s2 = supplier.get();
65
66			assertTrue(s2.isEmpty());
67
68			AddRandoms(s2, setSize);
69
70			Set<Integer> intersection = clone(s1, supplier);
71			intersection.retainAll(s2);
72			Set<Integer> diff1 = clone(s1, supplier); diff1.removeAll(s2);
73			Set<Integer> diff2 = clone(s2, supplier); diff2.removeAll(s1);
74			Set<Integer> union = clone(s1, supplier); union.addAll(s2);
75
76			if (diff1.removeAll(diff2))
77			fail("Set algebra identity 2 failed");
78			if (diff1.removeAll(intersection))
79			fail("Set algebra identity 3 failed");
80			if (diff2.removeAll(diff1))
81			fail("Set algebra identity 4 failed");
82			if (diff2.removeAll(intersection))
83			fail("Set algebra identity 5 failed");
84			if (intersection.removeAll(diff1))
85			fail("Set algebra identity 6 failed");
86			if (intersection.removeAll(diff1))
87			fail("Set algebra identity 7 failed");
88
89			intersection.addAll(diff1); intersection.addAll(diff2);
90			if (!intersection.equals(union))
91			fail("Set algebra identity 1 failed");
92
93			if (new HashSet(union).hashCode() != union.hashCode())
94			fail("Incorrect hashCode computation.");
95
96			Iterator e = union.iterator();
97			while (e.hasNext())
98			if (!intersection.remove(e.next()))
99			fail("Couldn't remove element from copy.");
100			if (!intersection.isEmpty())
101			fail("Copy nonempty after deleting all elements.");
102
103			e = union.iterator();
104			while (e.hasNext()) {
105			Object o = e.next();
106			if (!union.contains(o))
107			fail("Set doesn't contain one of its elements.");
108			e.remove();
109			if (union.contains(o))
110			fail("Set contains element after deletion.");
111			}
112			if (!union.isEmpty())
113			fail("Set nonempty after deleting all elements.");
114	jsr166	1.1
115	jsr166	1.4	s1.clear();
116			if (!s1.isEmpty())
117			fail("Set nonempty after clear.");
118	jsr166	1.1	}
119
120			// Done inefficiently so as to exercise toArray
121	jsr166	1.4	static <T> Set<T> clone(Set<T> s, Supplier<Set<T>> supplier) {
122			Set<T> clone = supplier.get();
123			List<T> arrayList = Arrays.asList((T[]) s.toArray());
124	jsr166	1.1	clone.addAll(arrayList);
125			if (!s.equals(clone))
126			fail("Set not equal to copy.");
127			if (!s.containsAll(clone))
128			fail("Set does not contain copy.");
129			if (!clone.containsAll(s))
130			fail("Copy does not contain set.");
131			return clone;
132			}
133
134			static void AddRandoms(Set s, int n) {
135	jsr166	1.8	for (int i = 0; i < n; i++) {
136			Integer e = rnd.nextInt(n);
137	jsr166	1.1
138			int preSize = s.size();
139			boolean prePresent = s.contains(e);
140			boolean added = s.add(e);
141			if (!s.contains(e))
142	jsr166	1.5	fail("Element not present after addition.");
143	jsr166	1.1	if (added == prePresent)
144	jsr166	1.5	fail("added == alreadyPresent");
145	jsr166	1.1	int postSize = s.size();
146			if (added && preSize == postSize)
147	jsr166	1.5	fail("Add returned true, but size didn't change.");
148	jsr166	1.1	if (!added && preSize != postSize)
149	jsr166	1.5	fail("Add returned false, but size changed.");
150	jsr166	1.1	}
151			}
152
153	jsr166	1.4	@DataProvider(name = "Supplier<Set<Integer>>", parallel = true)
154			public static Iterator<Object[]> navigableSetsProvider() {
155			ArrayList<Object[]> iters = new ArrayList<>(makeCheckedSets());
156			iters.ensureCapacity(numItr * iters.size());
157			for (int each=1; each < numItr; each++) {
158	jsr166	1.7	iters.addAll(makeCheckedSets());
159	jsr166	1.4	}
160			return iters.iterator();
161			}
162	jsr166	1.1
163	jsr166	1.4	public static Collection<Object[]> makeCheckedSets() {
164	jsr166	1.7	Object[][] params = {
165			{"Collections.checkedSet(HashSet)",
166			(Supplier) () -> Collections.checkedSet(new HashSet(), Integer.class)},
167			{"Collections.checkedSet(TreeSet(reverseOrder))",
168			(Supplier) () -> Collections.checkedSet(new TreeSet(Collections.reverseOrder()), Integer.class)},
169			{"Collections.checkedSet(TreeSet.descendingSet())",
170			(Supplier) () -> Collections.checkedSet(new TreeSet().descendingSet(), Integer.class)},
171			{"Collections.checkedNavigableSet(TreeSet)",
172			(Supplier) () -> Collections.checkedNavigableSet(new TreeSet(), Integer.class)},
173			{"Collections.checkedNavigableSet(TreeSet(reverseOrder))",
174			(Supplier) () -> Collections.checkedNavigableSet(new TreeSet(Collections.reverseOrder()), Integer.class)},
175			{"Collections.checkedNavigableSet(TreeSet.descendingSet())",
176			(Supplier) () -> Collections.checkedNavigableSet(new TreeSet().descendingSet(), Integer.class)},
177			};
178			return Arrays.asList(params);
179	jsr166	1.1	}
180			}