All 15 Enums questions
More in Enums
What is an enum in Java, and how does it differ from simply using a set of integer or String constants? How do you retrieve all constants of an enum type, and how would you iterate over them? How do you add fields, constructors, and methods to a Java enum, and how would you implement an enum representing planets with mass and radius that calculates surface gravity? How would you implement an enum that also implements an interface, and what's the benefit of having different enum constants provide different behavior through a shared interface contract? What are the ordinal() and name() methods on an enum constant, and why is relying on ordinal() for persistence or serialization considered dangerous? How do you correctly use an enum as a switch statement/expression's target, and what changed with the introduction of arrow-style switch expressions (Java 14+) regarding exhaustiveness and fall-through? What is the valueOf() method on an enum, and what happens when you pass a name that doesn't match any declared constant? How would you use an enum to represent a fixed set of configuration keys combined with a shared lookup method, avoiding scattered String literal keys throughout a codebase? How would you implement the Strategy pattern using an enum with constant-specific method bodies, and how does this compare to a traditional interface-based Strategy implementation? How does Java implement enums under the hood at the bytecode level (extending java.lang.Enum), and what makes them inherently thread-safe and serialization-safe as singletons?
Advertisement
Back to results for “Collections”
Java › Enums

How does the EnumSet and EnumMap provide more efficient alternatives to HashSet<Enum> and HashMap<Enum, V> specifically for enum keys?

Intermediate

Answer

EnumSet and EnumMap are specialized collection implementations designed exclusively for use with enum types, internally represented as a compact bitvector (EnumSet) or array indexed directly by each constant's ordinal() (EnumMap), giving them dramatically better memory efficiency and performance than a generic HashSet/HashMap would achieve for the same enum-keyed data (avoiding hashing overhead entirely, since the ordinal provides a direct, dense array index) -- the JDK documentation specifically recommends these specialized types whenever working with sets or maps keyed by enum constants, since there's essentially no downside to using them over the generic alternatives in this specific scenario.
enum Permission { READ, WRITE, EXECUTE, DELETE }

// EnumSet: highly efficient bitvector-backed set, ideal for enum flag combinations
EnumSet<Permission> userPermissions = EnumSet.of(Permission.READ, Permission.WRITE);

// EnumMap: array-backed map, far more efficient than HashMap<Permission, String> for this use case
EnumMap<Permission, String> descriptions = new EnumMap<>(Permission.class);
descriptions.put(Permission.READ, "Can view content");
Real-world example A file permission system representing a set of granted permissions (READ, WRITE, EXECUTE) per user uses EnumSet<Permission> rather than a generic HashSet<Permission>, gaining both meaningfully better memory efficiency and faster set operations (union, intersection) purpose-built for exactly this enum-based use case.

Common follow-ups: How does EnumSet's internal bitvector representation make operations like union/intersection especially fast?;What happens if you try to use EnumMap or EnumSet with a null key -- is it permitted?

Collections Framework;Diagnostics & Performance
All 15 Enums questions