nwtnni/arctic

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

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.

A memory-efficient patricia tree implementation written in Rust

An immutable, copy-on-write, versioned adaptive radix trie data-structure

Prolly is a content-addressed ordered map built on prolly trees. It gives applications immutable snapshots, cheap branching, structural sharing, efficient diffs and merges, sync primitives, and verifiable key/range proofs.

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

An updated version of linked-hash-map and friends

Slotmap data structure for Rust

High-performance wait-free memory reclamation for wait-free data structures (ASMR). Bounded memory usage, predictable latency.