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
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
A variant of Cuckoo Filter whose size automatically scales as necessary
A Rust HashMap implementation with copy-on-write keys and values
a Rust implementation of a hollow heap
Safe, fast, and obvious concurrent collections in Rust.
A tiny vector-like container allocated on the stack
Rust data structure and utilities for (de)serialization and storage of Web Application Manifests
A generic map and a set, both backed by a Radix tree.
Rust library for programming contest
Demonstration of a branded graph structure with safe and fast self-references.
data structures & algorithms
A queue for unique indices with constant-time lookup and removal backed by Vec
Rust Solutions of All Leetcode Problems (Weeky update)