带枚举键的稀疏映射

Question

I need to create a Map with enum keys where only a small fraction of the enum constants will be actually inserted. What is the best approach? An EnumMap would be inefficient if the length of its underlying array is equal to the total number of enum constants.

Answer 1

I suggest using an ordinary HashMap .

Computing hashes for enums is both easy and cheap. There should be no significant memory overhead, since you are not duplicating the enum objects, but instead creating multiple references to the same object. For this reason, there should be little difference between storing an integer key and storing a reference to an enum object.

Answer 2

I'd also go with either a HashMap or a TreeMap (depending on whether you need a deterministic Iterator or not). Since your data is sparse, any real or imagined overhead is unlikely to be a significant performance hurdle.