Extra iterator adaptors, functions and macros
RustApache License 2.0active
Rust Data structures
Search all Rust projects →16 projectsLibraries › Data structures
- 69%active
- 13%steady
- 6%slowing
- 12%dormant
Data structures
SIMD-accelerated vector distances and similarity functions for x86 AVX2 & AVX-512, and Arm NEON
CApache License 2.0active
define newtype structures with validation constraints.
RustMIT Licenseactive
Persistent data structures.
RustMIT Licenseactive
Roaring Bitmaps
RustApache License 2.0active
An implementation of an LRU cache with O(1) put, get, get_mut, and pop operations.
RustMIT Licenseactive
a hack to allow for arrays sized by typenums
RustMIT Licenseactive
Hypergraph is a data structure library to generate directed hypergraphs.
RustMIT Licenseactive
K-dimensional tree for fast geospatial indexing and nearest neighbors lookup
RustApache License 2.0active
Safe, fallible, stack-only alternative to BTreeSet and BTreeMap.
RustMIT Licensedormant
Merkle tree implementation in Rust with configurable storage backends and hash functions. Fixed depth and incremental only. Optimized for fast proof generation.
RustMIT Licenseactive
A priority queue that implements priority changes.
Ruststeady
Undo/Redo pattern implementation for arbitrary data structures. Supports delta-based (sparse diffs), snapshot-based, and command-based undo-redo with derive macros for custom types. Compatible with no_std and serde.
Rustactive
Provide a two dimensional data structure that is easy to use and fast.
RustMIT Licensesteady
Array helpers. Some of the most common methods you would use on Arrays made available on Vectors. Polymorphic implementations for handling most of your use cases.
RustMIT Licensedormant
Ternary search tree collection
RustMIT Licenseslowing