With the new red-black tree, the NMT treap can be removed and its uses replaced. The red-black tree provides comparative performance, but with better time complexity constraints without any intrinsic randomness.
- relates to
-
JDK-8345314 Add a red–black tree as a utility data structure
-
- Resolved
-
-
JDK-8349211 Add support for intrusive trees to the utilities red-black tree
-
- Resolved
-
- links to
-
Commit(master) openjdk/jdk/0ad919c1
-
Review(master) openjdk/jdk/26655