Why doesn’t Java Map extend Collection?

by

From the Java Collections API Design FAQ:

Why doesn’t Map extend Collection?

This was by design. We feel that
mappings are not collections and
collections are not mappings. Thus, it
makes little sense for Map to extend
the Collection interface (or vice
versa).

If a Map is a Collection, what are the
elements? The only reasonable answer
is “Key-value pairs”, but this
provides a very limited (and not
particularly useful) Map abstraction.
You can’t ask what value a given key
maps to, nor can you delete the entry
for a given key without knowing what
value it maps to.

Collection could be made to extend
Map, but this raises the question:
what are the keys? There’s no really
satisfactory answer, and forcing one
leads to an unnatural interface.

Maps can be viewed as Collections (of
keys, values, or pairs), and this fact
is reflected in the three “Collection
view operations” on Maps (keySet,
entrySet, and values). While it is, in
principle, possible to view a List as
a Map mapping indices to elements,
this has the nasty property that
deleting an element from the List
changes the Key associated with every
element before the deleted element.
That’s why we don’t have a map view
operation on Lists.

Update: I think the quote answers most of the questions. It’s worth stressing the part about a collection of entries not being a particularly useful abstraction. For example:

Set<Map.Entry<String,String>>

would allow:

set.add(entry("hello", "world"));
set.add(entry("hello", "world 2"));

(assuming an entry() method that creates a Map.Entry instance)

Maps require unique keys so this would violate this. Or if you impose unique keys on a Set of entries, it’s not really a Set in the general sense. It’s a Set with further restrictions.

Arguably you could say the equals()/hashCode() relationship for Map.Entry was purely on the key but even that has issues. More importantly, does it really add any value? You may find this abstraction breaks down once you start looking at the corner cases.

It’s worth noting that the HashSet is actually implemented as a HashMap, not the other way around. This is purely an implementation detail but is interesting nonetheless.

The main reason for entrySet() to exist is to simplify traversal so you don’t have to traverse the keys and then do a lookup of the key. Don’t take it as prima facie evidence that a Map should be a Set of entries (imho).

More Related Contents:

  1. Do Collections.unmodifiableXXX methods violate LSP? [closed]
  2. How do i get an object from another class in java
  3. What is the impact of declaring a method as final?
  4. What are the differences between a HashMap and a Hashtable in Java?
  5. Initialization of an ArrayList in one line
  6. Method Overloading for null argument
  7. Why is there no SortedList in Java?
  8. How to convert comma-separated String to List?
  9. Why use getters and setters/accessors?
  10. Encapsulation vs Abstraction?
  11. Why do many Collection classes in Java extend the abstract class and implement the interface as well?
  12. Android-java- How to sort a list of objects by a certain value within the object
  13. How to copy Java Collections list
  14. Performance considerations for keySet() and entrySet() of Map
  15. Java’s Collections.shuffle is doing what?
  16. Iterating over Java collections in Scala
  17. Is it faster to add to a collection then sort it, or add to a sorted collection?
  18. Static Binding and Dynamic Binding
  19. Flattening a collection
  20. Difference Between Object Type and Reference Type
  21. How to use Collections.sort() in Java?
  22. What is the Simplest Way to Reverse an ArrayList?
  23. Finding all objects that have a given property inside a collection [duplicate]
  24. Access subclass fields from a base class in Java
  25. interface as a method parameter in Java
  26. Comparing two hashmaps for equal values and same key sets?
  27. How much interfaces a class file can implement [closed]
  28. Storing different types of elements in a List in Java
  29. Hashmap implementation to count the occurrences of each character
  30. Perform operation on n random distinct elements from Collection using Streams API

Leave a Comment