How do you use EnumMap with a simple code example?

EnumMap is a specialized map implementation in Java that uses Enum types as keys. It provides better performance than HashMap and is optimized for use with enum keys.

EnumMap, Java, Enum, Key-Value pairs, Performance, Specialized Map

This content provides an example of how to use EnumMap in Java, showcasing its efficiency and simplicity when handling enum keys.

import java.util.EnumMap;

enum Day {
    SUNDAY, MONDAY, TUESDAY, WEDNESDAY, THURSDAY, FRIDAY, SATURDAY
}

public class EnumMapExample {
    public static void main(String[] args) {
        EnumMap<Day, String> activities = new EnumMap<>(Day.class);
        
        activities.put(Day.MONDAY, "Go to gym");
        activities.put(Day.TUESDAY, "Team meeting");
        activities.put(Day.WEDNESDAY, "Work on project");
        activities.put(Day.THURSDAY, "Grocery shopping");
        activities.put(Day.FRIDAY, "Watch movie");
        activities.put(Day.SATURDAY, "Family time");
        
        for (Day day : activities.keySet()) {
            System.out.println(day + ": " + activities.get(day));
        }
    }
}

EnumMap Java Enum Key-Value pairs Performance Specialized Map

Related Questions

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?