Rust persistent data structures
-
Updated
Jun 4, 2024 - Rust
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
Rust persistent data structures
Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
A Rust HashMap implementation with copy-on-write keys and values
Safe, fast, and obvious concurrent collections in Rust.
data structures & algorithms
Lock-free resizable concurrent hash table
A variant of Cuckoo Filter whose size automatically scales as necessary
A generic map and a set, both backed by a Radix tree.
Concurrent Sharded HashMap for Rust
a Rust implementation of a hollow heap
Deterministic Finite-State Automata Library for Rust, written in L1