How linkedhashmap maintains insertion order

Question

I know how Hashmap works internally. Linkedhashmap is extending Hashmap class. So how Linkedhashmap is able to maintain the insertion order. I have read the javadoc for Linkedhashmap, but it does not have any details about this. Can somebody help me understand this?

Thanks in advance.

The javadoc should rarely reveal how the class works inside. Have you tried looking at the source code of LinkedHashMap? — cherouvim
– cherouvim, Commented Nov 24, 2013 at 7:00
See this: javaopensourcecode.blogspot.co.il/2012/06/linkedhashmap.html — Maroun
– Maroun, Commented Nov 24, 2013 at 7:00
@GauthamArunachalam web.archive.org/web/20130417022355/http://… — Turkhan Badalov
– Turkhan Badalov, Commented Mar 29, 2023 at 0:10

madabrowski · Accepted Answer · 2013-11-24 07:20:24Z

9

http://docs.oracle.com/javase/7/docs/api/java/util/LinkedHashMap.html.

Idea behind implementation is quite simple. It extends regular hashMap (so it has all hashMap goodies) but also builds double linked list when adding elements.

(entries are also extended from the HashMap.Entry so they have pointers to after and before) So all entries are ordered HEAD -> Entry1 <-> Entry2 ... <-- TAIL

and at the same time kept in standard HashSet (i assume you are familiar with implementation).

Now when iterating It Linked list of entries is used.

answered Nov 24, 2013 at 7:20

madabrowski

1,6511 gold badge16 silver badges18 bronze badges

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

Comments

Community · Accepted Answer · 2017-05-23 12:33:05Z

1

It maintains a linkedlist of the entries in the map in the order in which they were inserted. This helps to maintain iteration order and elements will be returned in the order they were first added in.

You would like reading this post too as whenever you start comparing, you might understand better: Difference between HashMap, LinkedHashMap and TreeMap

edited May 23, 2017 at 12:33

CommunityBot

11 silver badge

answered Nov 24, 2013 at 7:57

fscore

2,5917 gold badges44 silver badges76 bronze badges

Comments

Java Strikers · Accepted Answer · 2018-07-18 01:47:48Z

0

Internally it maintains double linked list (Map.Entry) to store objects in the order , because double linked list stores the address of previous node and next node .

Same you can also check in source code .

edited Jul 18, 2018 at 1:47

answered Jul 18, 2018 at 1:36

Java Strikers

193 bronze badges

Comments

Avi Tyagi · Accepted Answer · 2019-06-04 17:08:28Z

0

The reference fields before and after maintains a doubly linked list for all the entries of the LinkedHashMap. Using before and after fields, we can traverse all the entries of a LinkedHashMap.
Internal of LinkedHashMap : http://techmastertutorial.in/java-collection-internal-linked-hashmap.html

answered Jun 4, 2019 at 17:08

Avi Tyagi

613 bronze badges

Collectives™ on Stack Overflow

How linkedhashmap maintains insertion order

4 Answers 4

Comments

Comments

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

4 Answers 4

Comments

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related