ChaosTree - Zero-dependency Java tree library with AVL, RBT, B-Tree, and B+Tree
Show HN: ChaosTree – A zero-dependency Java tree library (AVL,RBT,B-Tree,B+Tree)
ChaosTree is a zero-dependency Java library offering AVL, Red-Black, B-Tree, and B+Tree implementations as drop-in replacements for Java's NavigableSet and NavigableMap. Built for performance, its N-ary engine uses cache-friendly arrays to cut memory stalls by nearly 40% during large range scans. It passes over 214,000 Guava Testlib cases and property-based fuzzing, ensuring strict compatibility with java.util.TreeMap and TreeSet. With JDK 21 support, bulk-load APIs, and JMH benchmarks, ChaosTree is ideal for developers needing fast, reliable sorted collections.
I wanted ChaosTree to be correct just as much as I wanted it to be fast.
- my-next-account
You should add an intrusive variant of all the trees.
- MiroslavPokorny
Does this really need to be JDK 21 ?
I personally require libs that are JDK 11.