lun3x/multi_index_map

Maps where keys are borrowed from values.

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

Slotmap data structure for 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.

Compile time static maps for Rust

Rust port of Google's SwissTable hash map

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

An updated version of linked-hash-map and friends

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