Hotspot could use a tree structure to complement the already existing data structures.
There already exist a treap in NMT, but a red–black tree would be more robust and provide tighter time complexity constraints.
In the future, this could replace the treap in NMT, and also be used wherever a tree structure is appropriate.
There already exist a treap in NMT, but a red–black tree would be more robust and provide tighter time complexity constraints.
In the future, this could replace the treap in NMT, and also be used wherever a tree structure is appropriate.
- relates to
-
JDK-8349211 Add support for intrusive trees to the utilities red-black tree
-
- Open
-
- links to
-
Commit(master) openjdk/jdk/2efb6aaa
-
Review(master) openjdk/jdk/22360