public class IteratedMap<K,V>
A Map implementation that always iterates over the entire set to find requested
items. While this is inefficient compared to a hash map, it has the advantage that
keys can be modified after they have been inserted in the map and still be found
later. In a hash map, the hash code of the key must not change after it has been
entered in the map.
Note that while the map does not allow two entries with equal keys to be inserted
in the map, it is possible to modify one key so that it becomes equal to another
key in the map after both have been inserted in the map. The behaviour of the
map will become somewhat strange if this is done.