Implementation of java.util.Map using insertion order as order

Question

The JDK documentation on java.util.Map states

The order of a map is defined as the order in which the iterators on the map's collection views return their elements. Some map implementations, like the TreeMap class, make specific guarantees as to their order; others, like the HashMap class, do not.

And the documentation on TreeMap states:

The map is sorted according to the natural ordering of its keys, or by a Comparator provided at map creation time, depending on which constructor is used.

Is there any JDK implementation of Map that uses the order that elements were inserted into the map as the order?

Andrzej Doyle · Accepted Answer · 2010-08-11 19:50:48Z

13

java.util.LinkedHashMap:

This implementation differs from HashMap in that it maintains a doubly-linked list running through all of its entries. This linked list defines the iteration ordering, which is normally the order in which keys were inserted into the map (insertion-order). Note that insertion order is not affected if a key is re-inserted into the map.

answered Aug 11, 2010 at 19:50

Andrzej Doyle

104k33 gold badges191 silver badges231 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Implementation of java.util.Map using insertion order as order

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related