What's better (faster? more memory efficient?) whe...

# codereview

[Marc Knaup]

What's better (faster? more memory efficient?) when creating mutable maps where the insertion order doesn't matter?
Use mutableMapOf() and toMutableMap() which use LinkedHashMap
or instead hashMapOf() and HashMap(other)?

[gildor]

hashMap

[Marc Knaup]

👍 thanks
I guess maintaining the order adds quite noticeable overhead?

[gildor]

Not sure about real performance difference. you may try to find benchmarks. Also it depends on your use case

[gildor]

LinkedHashMap consumes more memory because Entry has also before and after nodes

[ursus]

TreeMap maintains order

[Marc Knaup]

No, it's sorts entries :)

[ursus]

well yea, because its a sorted tree inside

[ursus]

thats why its log n

[ursus]

oh you asked order doesnt matter, sorry

[Marc Knaup]

But thanks for the intent :)