EnumSet
EnumSet是Java枚举类型的泛型容器,Java既然有了SortedSet、TreeSet、HashSet等容器,为何还要多一个EnumSet
专门为枚举类设计的集合类,所有元素必须是枚举类型
EnumSet的集合元素是有序的,内部以位向量的形成存储,因此占用内存小,效率高
不允许加入null元素
源码
package java.util; import sun.misc.SharedSecrets; public abstract class EnumSet> extends AbstractSet implements Cloneable, java.io.Serializable { final Class elementType; final Enum[] universe; private static Enum[] ZERO_LENGTH_ENUM_ARRAY = new Enum[0]; EnumSet(Class elementType, Enum[] universe) { this.elementType = elementType; this.universe = universe; } public static > EnumSet noneOf(Class elementType) { Enum[] universe = getUniverse(elementType); if (universe == null) throw new ClassCastException(elementType + " not an enum"); if (universe.length <= 64) return new RegularEnumSet<>(elementType, universe); else return new JumboEnumSet<>(elementType, universe); } public static > EnumSet allOf(Class elementType) { EnumSet result = noneOf(elementType); result.addAll(); return result; } abstract void addAll(); public static > EnumSet copyOf(EnumSet s) { return s.clone(); } public static > EnumSet copyOf(Collection c) { if (c instanceof EnumSet) { return ((EnumSet )c).clone(); } else { if (c.isEmpty()) throw new IllegalArgumentException("Collection is empty"); Iterator i = c.iterator(); E first = i.next(); EnumSet result = EnumSet.of(first); while (i.hasNext()) result.add(i.next()); return result; } } public static > EnumSet complementOf(EnumSet s) { EnumSet result = copyOf(s); result.complement(); return result; } public static > EnumSet of(E e) { EnumSet result = noneOf(e.getDeclaringClass()); result.add(e); return result; } public static > EnumSet of(E e1, E e2) { EnumSet result = noneOf(e1.getDeclaringClass()); result.add(e1); result.add(e2); return result; } public static > EnumSet of(E e1, E e2, E e3) { EnumSet result = noneOf(e1.getDeclaringClass()); result.add(e1); result.add(e2); result.add(e3); return result; } public static > EnumSet of(E e1, E e2, E e3, E e4) { EnumSet result = noneOf(e1.getDeclaringClass()); result.add(e1); result.add(e2); result.add(e3); result.add(e4); return result; } public static > EnumSet of(E e1, E e2, E e3, E e4, E e5) { EnumSet result = noneOf(e1.getDeclaringClass()); result.add(e1); result.add(e2); result.add(e3); result.add(e4); result.add(e5); return result; } @SafeVarargs public static > EnumSet of(E first, E... rest) { EnumSet result = noneOf(first.getDeclaringClass()); result.add(first); for (E e : rest) result.add(e); return result; } public static > EnumSet range(E from, E to) { if (from.compareTo(to) > 0) throw new IllegalArgumentException(from + " > " + to); EnumSet result = noneOf(from.getDeclaringClass()); result.addRange(from, to); return result; } abstract void addRange(E from, E to); public EnumSet clone() { try { return (EnumSet ) super.clone(); } catch(CloneNotSupportedException e) { throw new AssertionError(e); } } abstract void complement(); final void typeCheck(E e) { Class eClass = e.getClass(); if (eClass != elementType && eClass.getSuperclass() != elementType) throw new ClassCastException(eClass + " != " + elementType); } private static > E[] getUniverse(Class elementType) { return SharedSecrets.getJavaLangAccess() .getEnumConstantsShared(elementType); } private static class SerializationProxy > implements java.io.Serializable { private final Class elementType; private final Enum[] elements; SerializationProxy(EnumSet set) { elementType = set.elementType; elements = set.toArray(ZERO_LENGTH_ENUM_ARRAY); } private Object readResolve() { EnumSet result = EnumSet.noneOf(elementType); for (Enum e : elements) result.add((E)e); return result; } private static final long serialVersionUID = 362491234563181265L; } Object writeReplace() { return new SerializationProxy<>(this); } // readObject method for the serialization proxy pattern // See Effective Java, Second Ed., Item 78. private void readObject(java.io.ObjectInputStream stream) throws java.io.InvalidObjectException { throw new java.io.InvalidObjectException("Proxy required"); } }
总结
以上就是本文关于阅读EnumSet抽象类源码的全部内容,希望对大家有所帮助。感兴趣的朋友可以继续参阅本站其他相关专题,如有不足之处,欢迎留言指出。感谢朋友们对本站的支持!



