0N/A/*
157N/A * Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
157N/A * published by the Free Software Foundation.
0N/A *
157N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
0N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
0N/A * or visit www.oracle.com if you need additional information or have any
157N/A * questions.
157N/A */
157N/A
0N/A/*
0N/A * @test
0N/A * @bug 4904067
0N/A * @summary Unit test for Collections.checkedSet
0N/A * @author Josh Bloch
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class CheckedSetBash {
0N/A static Random rnd = new Random();
0N/A
0N/A public static void main(String[] args) {
0N/A int numItr = 100;
0N/A int setSize = 100;
0N/A
0N/A for (int i=0; i<numItr; i++) {
0N/A Set s1 = newSet();
0N/A AddRandoms(s1, setSize);
0N/A
0N/A Set s2 = newSet();
0N/A AddRandoms(s2, setSize);
0N/A
0N/A Set intersection = clone(s1);
0N/A intersection.retainAll(s2);
0N/A Set diff1 = clone(s1); diff1.removeAll(s2);
0N/A Set diff2 = clone(s2); diff2.removeAll(s1);
0N/A Set union = clone(s1); union.addAll(s2);
0N/A
0N/A if (diff1.removeAll(diff2))
0N/A fail("Set algebra identity 2 failed");
0N/A if (diff1.removeAll(intersection))
0N/A fail("Set algebra identity 3 failed");
0N/A if (diff2.removeAll(diff1))
0N/A fail("Set algebra identity 4 failed");
0N/A if (diff2.removeAll(intersection))
0N/A fail("Set algebra identity 5 failed");
0N/A if (intersection.removeAll(diff1))
0N/A fail("Set algebra identity 6 failed");
0N/A if (intersection.removeAll(diff1))
0N/A fail("Set algebra identity 7 failed");
0N/A
0N/A intersection.addAll(diff1); intersection.addAll(diff2);
0N/A if (!intersection.equals(union))
0N/A fail("Set algebra identity 1 failed");
0N/A
0N/A if (new HashSet(union).hashCode() != union.hashCode())
0N/A fail("Incorrect hashCode computation.");
0N/A
0N/A Iterator e = union.iterator();
0N/A while (e.hasNext())
0N/A if (!intersection.remove(e.next()))
0N/A fail("Couldn't remove element from copy.");
0N/A if (!intersection.isEmpty())
0N/A fail("Copy nonempty after deleting all elements.");
0N/A
0N/A e = union.iterator();
0N/A while (e.hasNext()) {
0N/A Object o = e.next();
0N/A if (!union.contains(o))
0N/A fail("Set doesn't contain one of its elements.");
0N/A e.remove();
0N/A if (union.contains(o))
0N/A fail("Set contains element after deletion.");
0N/A }
0N/A if (!union.isEmpty())
0N/A fail("Set nonempty after deleting all elements.");
0N/A
0N/A s1.clear();
0N/A if (!s1.isEmpty())
0N/A fail("Set nonempty after clear.");
0N/A }
0N/A }
0N/A
0N/A // Done inefficiently so as to exercise toArray
0N/A static Set clone(Set s) {
0N/A Set clone = newSet();
0N/A List arrayList = Arrays.asList(s.toArray());
0N/A clone.addAll(arrayList);
0N/A if (!s.equals(clone))
0N/A fail("Set not equal to copy.");
0N/A if (!s.containsAll(clone))
0N/A fail("Set does not contain copy.");
0N/A if (!clone.containsAll(s))
0N/A fail("Copy does not contain set.");
0N/A return clone;
0N/A }
static Set newSet() {
Set s = Collections.checkedSet(new HashSet(), Integer.class);
if (!s.isEmpty())
fail("New instance non empty.");
return s;
}
static void AddRandoms(Set s, int n) {
for (int i=0; i<n; i++) {
int r = rnd.nextInt() % n;
Integer e = new Integer(r < 0 ? -r : r);
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.");
}
}
static void fail(String s) {
throw new RuntimeException(s);
}
}