Project

General

Profile

Actions
Copy link

Optimization #6720

open

Optimization #6721: hash tables: explore how red black trees compare to linked list in hash buckets

flow: explore how red black trees compare to linked list in hash buckets

Added by Shivani Bhardwaj 10 months ago. Updated 10 months ago.

Status:
New
Priority:
Normal
Assignee:
Shivani Bhardwaj
Target version:
TBD
Effort:
Difficulty:
Label:

Description

Since Java 8, HashMaps use red black trees for hash buckets in case of collisions instead of linked lists and it has been a huge boost to perf. Given that we also use linked lists for the same purpose, it may be interesting to explore how trees would behave in such a situation.

Actions
Copy link

Also available in: Atom PDF