We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 669eabc commit d0b4fa1Copy full SHA for d0b4fa1
README.md
@@ -4,7 +4,7 @@
4
5
A fast, index-based Red-Black Tree with no heap allocations — ideal for systems where performance and memory layout matter.
6
7
-See [Documentation](https://docs.rs/flat_rbtree/0.1.7)
+See [Documentation](https://docs.rs/flat_rbtree/0.2.0)
8
9
## Features
10
0 commit comments