bplus-index vs indextree vs stable-vec

Arena-backed B+Tree for in-memory sorted indexes. Zero unsafe, cache-friendly, supports non-unique keys.

Arena based tree structure by using indices instead of reference counted pointers

A Vec-like collection which guarantees stable indices and features O(1) element deletion (semantically similar to `Vec<Option<T>>`). Useful for allocations in graphs or similar data structures.