droundy/tinyset

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

Hierarchical sparse bitset

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.

Blazing fast immutable collection datatypes for Rust.

Collection of succinct data structures in Rust

Rust port of Google's SwissTable hash map

A better compressed bitset in Rust

An inline SIMD accelerated hashmap designed for small amount of data.

Integer sets as fast, sorted, integer ranges with full set operations