/* * Copyright (c) 2003, 2004, 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 4904135 4923181 * @summary Unit test for EnumSet * @author Josh Bloch * @author Neal Gafter * @author Yo Ma Ma * @key randomness
*/
import java.util.*; import java.io.*;
publicclass EnumSetBash { static Random rnd = new Random();
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<T>(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 various functions static <E extendsEnum<E>> EnumSet<E> clone(EnumSet<E> s, Class<E> cl) {
EnumSet<E> clone = null; int method = rnd.nextInt(6); switch(method) { case 0:
clone = s.clone(); break; case 1:
clone = EnumSet.noneOf(cl);
Collection arrayList = (Collection)Arrays.asList(s.toArray());
clone.addAll((Collection<E>)arrayList); break; case 2:
clone = EnumSet.copyOf(s); break; case 3:
clone = EnumSet.copyOf((Collection<E>)s); break; case 4: if (s.isEmpty())
clone = EnumSet.copyOf((Collection<E>)s); else
clone = EnumSet.copyOf((Collection<E>)(Collection)
Arrays.asList(s.toArray())); break; case 5:
clone = (EnumSet<E>) deepCopy(s);
} if (!s.equals(clone))
fail("Set not equal to copy. " + method); if (!s.containsAll(clone))
fail("Set does not contain copy. " + method); if (!clone.containsAll(s))
fail("Copy does not contain set. " + method); return clone;
}
// Utility method to do a deep copy of an object *very slowly* using // serialization/deserialization static <T> T deepCopy(T oldObj) { try {
ByteArrayOutputStream bos = new ByteArrayOutputStream();
ObjectOutputStream oos = new ObjectOutputStream(bos);
oos.writeObject(oldObj);
oos.flush();
ByteArrayInputStream bin = new ByteArrayInputStream(
bos.toByteArray());
ObjectInputStream ois = new ObjectInputStream(bin); return (T) ois.readObject();
} catch(Exception e) { thrownew IllegalArgumentException(e.toString());
}
}
static <T extendsEnum<T>> void AddRandoms(EnumSet<T> s, Enum[] universe) { for (int i=0; i < universe.length * 2 / 3; i++) {
T e = (T) universe[rnd.nextInt(universe.length)];
boolean prePresent = s.contains(e); int preSize = s.size(); 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.");
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
