CarlKCarlK/range-set-blaze

Map data structure whose keys are stored as ranges

A better compressed bitset in Rust

A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and allows lookups of entries by value or sorted order position.

Bf-Tree is a modern read-write-optimized concurrent larger-than-memory range index in Rust from MS Research.

Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.

Python library for handling efficiently sorted integer sets.

A hash table with consistent order and fast iteration; access items by key or sequence index

Collection of succinct data structures in Rust

Skiplist implementation in rust