Details
-
Bug
-
Resolution: Fixed
-
P2
-
8
-
None
-
b108
-
Verified
Description
Update HashMap and LinkedHashMap using similar techniques from ConcurrentHashMap where normally bins/buckets are used to store entries. When the bin size gets over a threshold the bin is converted to a red/black tree, which reduces the complexity when looking up entries for keys that hash to the same value.
Attachments
Issue Links
- blocks
-
JDK-8024009 Remove jdk.map.useRandomSeed system property
- Closed
- duplicates
-
JDK-6563366 (coll) LinkedHashMap$Entry.recordAccess() is too expensive for the first entry
- Closed
- relates to
-
JDK-8023795 java/lang/reflect/Generics/Probe.java needs update for api changes
- Resolved
-
JDK-8005698 Handle Frequent HashMap Collisions with Balanced Trees
- Closed