EnumMap is a specialized implementation of the Map interface in Java that is designed specifically for use with enum keys. It is highly efficient and can be used in scenarios where the keys are restricted to a finite set of enumerated constants. In recent Java versions, there have been enhancements in EnumMap to improve performance and ease of use.
EnumMap activities = new EnumMap<>(Day.class);
activities.put(Day.MONDAY, "Gym");
activities.put(Day.TUESDAY, "Reading");
activities.put(Day.WEDNESDAY, "Swimming");
for (Map.Entry entry : activities.entrySet()) {
System.out.println(entry.getKey() + ": " + entry.getValue());
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?