Hi there.Just looking on page 544 of the (Highly revered ) K&B SCJP book and in relation to LinkedHashMap, I see that the text states that LinkedHashMap is quicker than HashMap for adding and removing elements. Im just wondering, how so? Many thanks & best regards. K [ June 19, 2008: Message edited by: Keith Nagle ]
LinkedHashMap is slightly slower than HashMap because it maintains the linked list in addition to the hashed data structure.
Of course, the comparisons Eckel provides come with a disclaimer: "...this will be different according to the computer and JVM you are using..." And if you study the table of test results he provides, you will also see that the size of the Map makes a difference.
"We're kind of on the level of crossword puzzle writers... And no one ever goes to them and gives them an award." ~Joe Strummer sscce.org
Keith Nagle
Ranch Hand
Joined: May 06, 2008
Posts: 65
posted
0
Great stuff marc. Thank you very much.
I agree. Here's the link: http://ej-technologies/jprofiler - if it wasn't for jprofiler, we would need to
run our stuff on 16 servers instead of 3.
0
)
