-
hashbrown
port of Google's SwissTable hash map
-
indexmap
A hash table with consistent order and fast iteration
-
bitvec
Addresses memory by bits, for packed collections and bitfields
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
phf
Runtime support for perfect hash function data structures
-
ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
roaring
A better compressed bitset - pure Rust implementation
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
rangemap
Map and set data structures whose keys are stored as ranges. Contiguous and overlapping ranges that map to the same value are coalesced into a single range
-
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
tinyvec
tinyvecprovides 100% safe vec-like data structures -
slotmap
data structure
-
bit-set
A set of bits
-
tinystr
A small ASCII-only bounded length string representation
-
bimap
Bijective maps
-
rpds
Persistent data structures with structural sharing
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
ego-tree
Vec-backed ID-tree
-
modular-bitfield
Easily define bitfield types with modular building blocks
-
enumset
creating compact sets of enums
-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
faststr
string library that reduces the cost of clone
-
intaglio
UTF-8 string and byte string interner and symbol table
-
elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
yrs
High performance implementation of the Yjs CRDT
-
ecow
Compact, clone-on-write vector and string
-
croaring
Rust wrapper for CRoaring
-
bitmaps
Fixed size boolean arrays
-
range-set-blaze
Integer sets as fast, sorted integer ranges; Maps with integer-range keys; Full set operations
-
bit-vec
A vector of bits
-
generator
Stackfull Generator Library in Rust
-
rowan
generic lossless syntax trees
-
fixedbitset
bitset collection
-
nonempty-collections
Correct-by-construction non-empty collections
-
linked_hash_set
HashSet with insertion ordering
-
ringbuffer
A fixed-size circular buffer
-
string-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
crdts
Practical, serializable, thoroughly tested CRDTs
-
daggy
A directed acyclic graph data structure library. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
-
smartstring
Compact inlined strings
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
radix_trie
Generic radix trie data-structure
-
bloomfilter
Bloom filter implementation
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
typed-index-collections
Typed index version of Rust slice and Vec containers
-
arraydeque
A ring buffer with a fixed capacity, which can be stored on the stack
-
dary_heap
A d-ary heap
-
cordyceps
Mycelium intrusive data structures
-
intmap
Specialized HashMap for integer keys
-
circular-buffer
Efficient, fixed-size, overwriting circular buffer
-
iddqd
Maps where keys borrow from values, including bijective and trijective maps
-
hdf5
Thread-safe Rust bindings for the HDF5 library
-
smallstr
String-like container based on smallvec
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
mitsein
Strongly typed APIs for non-empty collections, slices, and iterators
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
hybrid-array
Hybrid typenum-based and const generic array types designed to provide the flexibility of typenum-based expressions while also allowing interoperability and a transition path to const generics
-
array-init
Safe wrapper for initializing fixed-size arrays
-
thin-vec
A vec that takes up less space on the stack
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
ndarray-stats
Statistical routines for the n-dimensional array data structures provided by ndarray
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
spade
Delaunay triangulations for the rust ecosystem
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
jaq-json
JSON values for jaq
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
immutable-chunkmap
A fast immutable map and set with batch insert and update methods, COW operations, and big O efficient implementations of set and merge operations
-
egg
egraphs
-
cardinality-estimator
estimating the cardinality of distinct elements in a stream or dataset
-
im
Immutable collection datatypes
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
bitfield-struct
Struct-like procedural macro for bitfields
-
imbl
Immutable collection datatypes
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.
-
boa_interner
String interner for the Boa JavaScript engine
-
gix-hashtable
that provides hashtable based data structures optimized to utilize ObjectId keys
-
weak-table
Weak hash maps and sets
-
tick
primitives to interact with and manipulate machine time
-
orx-priority-queue
Priority queue traits and high performance d-ary heap implementations
-
orx-split-vec
An efficient dynamic capacity vector with pinned element guarantees
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
datalogic-rs
A fast, type-safe Rust implementation of JSONLogic for evaluating logical rules as JSON. Perfect for business rules engines and dynamic filtering in Rust applications.
-
hashbag
An unordered multiset implementation using a hash bag
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
ph
data structures based on perfect hashing
-
newtype-uuid
Newtype wrapper around UUIDs
-
smallbitvec
A bit vector optimized for size and inline storage
-
space
providing abstractions for spatial datastructures and search
-
skiplist
in Rust for fast insertion and removal, including a normal skiplist, ordered skiplist, and skipmap
-
equivalent
Traits for key comparison in maps
-
str-buf
Static string buffer
-
typed_floats
Types for handling floats with type checking at compile time
-
i24
working with 24-bit integers
-
gix-merge
gitoxide project implementing merge algorithms
-
smallbox
Small Boxoptimization: store small item on stack and fallback to heap for large item -
opentelemetry-resource-detectors
A collection of community supported resource detectors for OpenTelemetry
-
rust-rule-engine
blazing-fast Rust rule engine with RETE algorithm, backward chaining inference, and GRL (Grule Rule Language) syntax. Features: forward/backward chaining, pattern matching, unification…
-
string
A UTF-8 encoded string with configurable byte storage
-
crop
A pretty fast text rope
-
bao-tree
BLAKE3 verfiied streaming with custom chunk groups and range set queries
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
nexus-ascii
Fixed-capacity ASCII strings for high-performance systems
-
i256
Optimized implementations of 256-bit signed and unsigned integers
-
arrow-digest
Stable hashes for Apache Arrow
-
vart
An immutable versioned adaptive radix trie
-
range-collections
Sets and maps of ranges, backed by smallvec
-
bytesbuf
Types for creating and manipulating byte sequences
-
indexset
A two-level BTree with fast iteration and indexing operations
-
typemap_rev
A hashmap, but stores types as keys
-
zerofrom
trait for constructing
-
vers-vecs
A collection of succinct data structures supported by fast implementations of rank and select queries
-
binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps
-
csaf-walker
work with CSAF data
-
grovedb-path
Path extension crate for GroveDB
-
miniconf
Serialize/deserialize/access reflection for trees
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
fqdn
FQDN (Fully Qualified Domain Name)
-
tree_iterators_rs
built to provide you with the iterators to easily work with tree data structures in Rust
-
range-set
Smallvec-backed containers of sorted integer ranges
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
narrow
Apache Arrow
-
intervaltree
generic implementation of an immutable interval tree
-
vec_map
map based on a vector for small integer keys
-
iroh-metrics
metrics for iroh
-
blart
adaptive radix tree packaged as a BTreeMap replacement
-
blobby
Iterator over simple binary blob storage
-
portgraph
Data structure library for directed graphs with first-level ports
-
cita_trie
Modified Patricia Tree (aka Trie)
-
log-once
Collection of helper macros for logging some events only once
-
ordinal-map
Ordinal trait to map values to integers and efficient maps and sets for such types
-
slice-dst
Slice-based custom DSTs
-
modql
Model Query Language support
-
grid
Dynamic generic 2D data structure
-
small_btree
that add SmallBTreeMap data structure
-
quantities
Unit-safe computations with quantities
-
btree-range-map
B-tree range map implementation
-
static-files
help automate static resource collection
-
orx-tree
A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
uluru
fast, LRU cache implementation
-
vecmap-rs
A vector-based map and set implementation
-
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
qwt
Quad Wavelet Tree
-
open-payments-iso20022-acmt
Open Payments - Message Parsing Library - ISO20022 ACMT
-
collection_tools
General purpose tools to manipulate collections( containers like Vec/HashMap/HashSet )
-
calimero-storage
Core Calimero infrastructure and tools
-
timed-map
Lightweight map implementation that supports expiring entries and fully compatible with both std and no_std environments
-
any_vec
Type erased vector. Most operations can be done without type knowledge. Mostly zero overhead.
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
array-macro
Array multiple elements constructor syntax
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
ffi-convert
A collection of utilities to ease conversion between Rust and C-compatible data structures
-
ringmap
A hash table with consistent deque-like order and fast iteration
-
pfds
Purely Functional Data Structures
-
slotmap-careful
Wrap the slotmap crate and prevent key reuse
-
saorsa-gossip-crdt-sync
Delta-CRDTs for Saorsa Gossip: OR-Set, LWW-Register with anti-entropy sync
-
lean_string
Compact, clone-on-write string
-
snowflake_me
A distributed unique ID generator inspired by Twitter's Snowflake
-
dogma
Named,MaybeNamed,Labeled,MaybeLabeled,Collection, andCollectionMuttraits -
ankurah-storage-common
Ankurah storage engine common libraries
-
llm_models_spider
Auto-updated registry of LLM model capabilities (vision, audio, etc.)
-
submap
B-Tree map for pub/sub services
-
oxiblas-matrix
Matrix types and views for OxiBLAS
-
byteview
Thin, immutable zero-copy slice type
-
cc-traits
Common collection traits
-
phf_shared
Support code shared by PHF libraries
-
deepmesa-collections
A collection of data structures and algorithms designed for performance
-
sucds
Succinct data structures in Rust
-
binary-layout
allows type-safe, inplace, zero-copy access to structured binary data. You define a custom data layout and give it a slice of binary data, and it will allow you to read and write the…
-
terraphim_types
Core types crate for Terraphim AI
-
sqrid
Square coordinates and grid-like arrays, with zero dependencies, in a single file
-
id_tree
creating and modifying Tree structures
-
keyvi
key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
miyabi-types
Core type definitions for Miyabi - Autonomous AI Development Operations Platform
-
sync-ptr
Sync & Send wrappers for raw pointer's and function pointers in rust
-
interavl
An optimised interval tree for efficient interval stabbing
-
ohno
High-quality Rust error handling
-
cranelift-entity
Data structures using entity references as mapping keys
-
bridgetree
A space-efficient Merkle tree designed for linear appends with witnessing of marked leaves, checkpointing & state restoration
-
circular-queue
A circular buffer-like queue
-
validit
Validate data structures internal state
-
micromap
The fastest alternative to HashMap, for maps smaller than 20 keys
-
soa-rs
A Vec-like structure-of-arrays container
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
bitflag-attr
A macro to generate bitflags structures from C-like enums
-
fast_radix_trie
Memory-efficient trie data structures based on radix tree
-
algorithm
about algorithm data structure, now has ttl with lru/lru-k/lfu/arc and slab/rbtree/roaring_bitmap/timer_wheelss, 关于算法常用的数据结构
-
enum-table
creating tables with enums as key
-
rsmarisa
Pure Rust port of marisa-trie: a static and space-efficient trie data structure
-
datasketches
A software library of stochastic streaming algorithms (a.k.a. sketches)
-
cdg_api
interact with api.congress.gov
-
rsf-cli
Ranked Spreadsheet Format - Deterministic column ordering based on cardinality
-
tag_ptr
that enables a pointer to be associated with a tag of type
usize -
rvf-types
RuVector Format core types -- segment headers, enums, flags
-
short-uuid
generate and parse short uuids
-
synheart-flux
On-device compute engine for HSI-compliant human state signals
-
linearize
Types that are enumerable and an array-backed map
-
xml-builder
Easy and highly-configurable XML builder/writer
-
itybity
An itty bitty crate providing bit iterators and bit iterator accessories
-
rust_dynamic
Support for dynamically-typed values in run-time
-
deferred-map
High-performance generational arena using handle-based deferred insertion with O(1) operations
-
docker-compose-types
Deserialization and Serialization of docker-compose.yml files in a relatively strongly typed fashion
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
keyed_priority_queue
Priority queue that support changing priority or early remove by key
-
bytes-str
A string type that is backed by bytes crate
-
sql-json-path
SQL/JSON Path implementation in Rust
-
pumpkin-conflict-resolvers
The conflict resolvers of the Pumpkin constraint programming solver
-
alimentar
Data Loading, Distribution and Tooling in Pure Rust
-
succinctly
High-performance succinct data structures for Rust
-
dup-indexer
Create a non-duplicated index from Strings, static str, Vec, or Box values
-
bitwheel
High-performance fixed capacity timer wheel
-
lru-slab
Pre-allocated storage with constant-time LRU tracking
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
streaming_algorithms
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
gpt_disk_types
GPT (GUID Partition Table) disk data types no_std library
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
json-number
JSON number parsing and storage
-
pathmap
A key-value store with prefix compression, structural sharing, and powerful algebraic operations
-
relastic
lib inspired by Serilog for application-wide logging to Elastic
-
uuid-rng-internal
Private implementation details of the uuid crate
-
cgp
Main crate for using context-generic programming
-
crdt-lite
A lightweight, column-based CRDT implementation in Rust
-
xot
Full-featured XML tree library for Rust
-
octofhir-fhirpath-model
Value types and FHIR model support for FHIRPath implementation
-
packedvec
Store vectors of integers efficiently
-
imbl-sized-chunks
Efficient sized chunk datatypes
-
pie_core
A high-performance, index-based data structure toolkit. Provides an arena allocator (ElemPool) used to build a cache-friendly PieList (doubly-linked list) and FibHeap (priority queue).
-
redactable
Automatic redaction of sensitive data in structs for safe logging and debugging
-
data_privacy
Data annotation and redaction system providing a robust way to manipulate sensitive information
-
sparse_set_container
A container based on sparse set. Stable keys, O(1) lookup, cache-friendly iterations, and no hashing.
-
ck-core
Core types and utilities for ck semantic search tool
-
bitm
bit and bitmap (bit vector) manipulation
-
cueue
High performance SPSC circular byte buffer with batch operations
-
octaindex3d
3D Spatial Indexing and Routing System based on BCC lattice with truncated octahedral cells
-
nary_tree
A vec-backed tree structure with tree-specific generational indexes
-
kotoba-graph
High-performance graph data structures for Kotoba graph processing system
-
ftree
A very fast fenwick tree implementation
-
nybbles
Efficient nibble-sized (4-bit) byte sequence data structure
-
tinyset
Size-optimized sets
-
value-ext
Serde Json Value Extension Trait and Json Utilities
-
snowid
generating SnowID - a Snowflake-like timestamp-based distributed unique identifier
-
dlv-list
Semi-doubly linked list implemented using a vector
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
trie-root
In-memory patricia trie operations
-
toml-query
work with toml::Value objects more conveniently
-
las
Reads and writes point clouds stored in the ASPRS las file format
-
xmltv
electronic program guide (EPG) parser and generator using serde
-
stacked_errors
high level error propogation with software controlled backtraces
-
kcr_apps_kubeblocks_io
Kubernetes Custom Resource Bindings
-
ordered_hash_map
HashMap which preserves insertion order
-
chat-prompts
Chat prompt template
-
compressed-intvec
Space-efficient integer vectors for Rust. Offers a fixed-width implementation for O(1) mutable and atomic access, and a variable-width implementation that uses instantaneous codes and…
-
grovedb-version
Versioning library for Platform
-
trees
General purpose tree data structures
-
smol_bitmap
A space-efficient bitmap with inline storage optimization for small bitmaps
-
spart
A collection of space partitioning tree data structures for Rust
-
mzpeaks
representing peaks in mass spectrometry data
-
exint
generic signed and unsigned integers
-
cow_vec
A vector-like container optimized for efficient cloning with copy-on-write semantics
-
ordered-multimap
Insertion ordered multimap
-
awint
Arbitrary width integers
-
plain_trie
Classic trie implementation capable of mapping any T to char iterator
-
seatbelt
Resilience and recovery mechanisms for fallible operations
-
serde_single_or_vec2
Type which can be deserialized from either a sequence or a single value
-
idlset
Fast u64 set operations library
-
stac-server
SpatioTemporal Asset Catalog (STAC) API server
-
ptr_hash
A high-throughput minimal perfect hash function
-
bytes-utils
Additional utilities for working with the bytes crate
-
trit-vsa
Balanced ternary arithmetic library with bitsliced storage and VSA operations
-
slice_ring_buf
A ring buffer implementation optimized for working with slices
-
xgx_intern
A high-performance, Hash-based value interner with custom handle types
-
segment-array
Segment array (growable, append-only) data structure
-
bin_file
Mangling of various file formats that conveys binary information (Motorola S-Record, Intel HEX, TI-TXT and binary files)
-
bit_ops
Common bit-oriented operations on primitive integer types with a focus on
no_stdandconstcompatibility. Unlike other crates that provide tooling to create sophisticated high-level types with bitfields… -
doubloon
Money datatype that supports both statically and dynamically typed currencies
-
among
The enum
Amongwith variantsLeft,MiddleandRightis a general purpose sum type with three cases -
smartbuf
A high-performance buffered reader with background thread pre-fetching and full seek support
-
xml2arrow
Efficiently convert XML data to Apache Arrow format for high-performance data processing
-
apollonius
N-dimensional Euclidean geometry for Rust: points, vectors, lines, segments, hyperspheres, hyperplanes, AABBs, triangles, and a unified intersection API—all with const generics
-
rart
High-performance Adaptive Radix Tree implementation with SIMD optimizations
-
ndstruct
Structures for N-dimensions
-
hexser
Zero-boilerplate hexagonal architecture with graph-based introspection
-
elizaos-plugin-personality
Character evolution and self-modification plugin for elizaOS - Rust implementation
-
sundo
Snapshot-based undo/redo library with support for persistent data structures
-
tree-ds
manipulate tree data structures
-
aisle
Metadata-driven Parquet pruning for Rust: Skip irrelevant data before reading
-
lib-sokoban
Sokoban: compact, efficient data structures packed into contiguous byte arrays
-
array-concat
Macros for concatenating const arrays
-
domain-key
High-performance, domain-driven, type-safe key system for Rust
-
dagex
A pure Rust DAG executor supporting implicit node connections, branching, and config sweeps
-
bounded_graph
A thin newtype wrapper for
petgraphto assist in the creation of graphs with restrictions on their edges -
tskit
rust interface to tskit
-
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
thermogram
Plastic memory capsule with 4-temperature tensor states (hot/warm/cool/cold), bidirectional transitions, and hash-chained auditability
-
count-min-sketch
Count-min-sketch implementation
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
sparsevec
Compress vectors using row displacement
-
embed-collections
A collection of intrusive data structures (linked lists) for Rust, supporting various pointer types
-
converge
Layered configuration, can be expressed in a single line of code. The
Convergetrait merges instances of structures into a new instance of a structure. TheConvergetrait can be derived… -
iso7816-tlv
tools and utilities for handling TLV data as defined in ISO/IEC 7816-4
-
paginator-rs
Pagination trait for Rust collections
-
tagged-pointer
Platform-independent space-efficient tagged pointers
-
plotnik-bytecode
Bytecode format and runtime types for Plotnik
-
xsd-types
XSD data types
-
bitvec_helpers
BitVec based bitstream reader and writer
-
wordvec
A compact
SmallVec<T>-like container with onlyalign_of::<T>()overhead for small stack-only instances -
matreex
matrix implementation
-
moduforge-transform
不可变数据结构与事务系统基础
-
meminterval
interval-tree in Rust made to store memory mappings
-
i_shape
iShape is a compact and efficient library specifically designed for representing 2D data structures using IntPoint
-
worktable
in-memory storage
-
iset
Map and set with interval keys (x..y)
-
defaultmap
HashMap with an automatic default for missing keys
-
merkletree
Light merkle tree implementation with SPV support and dependency agnostic
-
vibe-graph-core
Core domain model for the Vibe-Graph neural OS
-
tetengo_trie
A trie library implemented with a double array
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
idmap
Efficient maps of integer id keys to values, backed by an underlying
Vec -
mutaig
Mutable AIGs designed for equivalence checking
-
fixed_deque
A fixed size VecDeque to match Python Deque
-
agentic-memory
Binary graph-based memory system for AI agents
-
generic_singleton
allowing for generic singleton patterns
-
easy-tree
efficient tree structure library for Rust with recursive traversal
-
orx-iterable
Defines and implements Iterable, Collection and CollectionMut traits to represent types that can be iterated over multiple times
-
digit-bin-index
A high-performance, O(P) data structure for weighted random sampling of binned probabilities, ideal for large-scale simulations
-
pi_append_vec
Only supports append vectors, lock free
-
simd_aligned
Safe and fast SIMD-aligned data structures with easy and transparent 'flat' access
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
array_range_query
High-performance generic segment tree and lazy segment tree implementations in Rust for efficient range queries, range updates, and interval operations. Supports custom monoid operations with zero-cost abstractions.
-
const-secret
A
no_stdcrate for compile-time encrypted secrets -
im-lists
Persistent unrolled linked lists and vlists
-
indexical
indexed collections
-
delay_map
HashMap collections whose entries expire after a given time
-
avila-atom
Atomic computational structures - Option, Result, Vec, HashMap built from nucleus
-
json_dotpath
Dotted path access to nested JSON objects (serde_json::Value)
-
router_prefilter
Fast prefix-based prefiltering for router pattern matching
-
xtri
A fast, memory-efficient radix tree (compressed trie) implementation in Rust with UTF-8 support
-
ttgraph
Typed/Transactional Graph container
-
pstd
parts of Rust std library ( different implementations, features not yet stabilised etc )
-
splinter-rs
A compressed bitmap format optimized for small, sparse sets of u32s with zero-copy querying
-
zed-sum-tree
A sum tree data structure, a concurrency-friendly B-tree
-
kcr_operator_tigera_io
Kubernetes Custom Resource Bindings
-
rsdict
Fast static rank and select data structure
-
hodgepodge
Lightweight dataset crate of enums for prototyping, teaching, and experimentation
-
seoul
trait Isomorphism
-
hvec
A Vec-like structure that can store different types of different sizes contiguous with each other in memory
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
know
Framework for Rust
-
wavltree
An intrusive Weak AVL Tree
-
i_tree
Expiration key tree. Usable in algorithms like swipe line. Only for uniq elements
-
gotgraph
A type-safe, scope-aware graph library that leverages Rust's type system to prevent common graph-related bugs at compile time
-
phf_generator
PHF generation logic
-
vectree
Vector-buffered tree collection with pre-/post-order, depth-first, mutable/immutable iterator
-
bacnet-emb
A bacnet library for embedded systems (no_std)
-
arena-terms
A lightweight, arena-backed representation of Prolog–like terms
-
jolt-protocol
Protocol types for jolt daemon IPC
-
wabi_tree
Order-statistic B-tree map and set with O(log n) rank operations. Drop-in replacements for BTreeMap/BTreeSet.
-
cooklang-find
finding and managing Cooklang recipes in the filesystem
-
ddsketchy
DD Sketch in Rust
-
xor_name
Xor Type
-
mesh-sieve
Modular, high-performance Rust library for mesh and data management, designed for scientific computing and PDE codes
-
fides
cryptographic primitives
-
flow-mumu
Stream transform tools plugin for the Lava language
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
spacetimedb-data-structures
Assorted data structures used in spacetimedb
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
beach_map
slotmap
-
clonelicious
macro library that simplifies cloning and closure execution. The
clone!macro automatically clones variables and immediately executes the closure with the cloned values, streamlining… -
eytzinger-interpolation
Eytzinger array layout with interpolative search support
-
flex_array
A
#[no_std]flexible array much like std::Vec but with custom indices and length and capacity types -
minuet
Extended memory systems built on amari-holographic
-
edtui-jagged
A jagged array data structure for the edtui editor
-
steel-gen
Code generation crates for use within steel
-
stable-vec
A Vec-like collection which guarantees stable indices and features O(1) element deletion (semantically similar to
Vec<Option<T>>). Useful for allocations in graphs or similar data structures. -
pi_world
ecs world
-
eqmap
Using e-graphs for logic synthesis
-
endpoints
A collection of data structures for the OpenAI-compatible endpoints
-
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
brk_fjall
Log-structured, embeddable key-value storage engine
-
robin-sparkless
PySpark-like DataFrame API in Rust on Polars; no JVM
-
reconcile
A reconciliation service to sync a key-value map over multiple instances
-
mule-map
A hybrid between a HashMap and a lookup table
-
bitstring
traits and implementations
-
wildbird
Rust Framework 🐦
-
thread_aware
Facilities to support thread-isolated state
-
modmap
Universal module map schema for codebase structure representation
-
infra-compass-db
Parse and manage the NREL's INFRA-COMPASS data
-
differential-dogs3
Advanced join patterns in differential dataflow
-
polars-formula
High-performance formula parsing and materialization library for Polars DataFrames with R/Formulaic/Patsy style syntax
-
superintervals
Interval overlap library
-
boomphf
Scalable and Efficient Minimal Perfect Hash Functions
-
lsph
Learned Spatial HashMap
-
btree-vec
A growable array (vector) implemented using a B-tree
-
array2d
A fixed sized two-dimensional array
-
lexime-trie
A char-wise Double-Array Trie with zero dependencies
-
agnix-rules
Validation rules for agnix - agent configuration linter
-
aliasable
Basic aliasable (non unique pointer) types
-
atomicow
A
Cow-like data structure where owned data is stored inside anArc -
stringtape
A tape class for strings arrays compatible with Apache Arrow
-
armature-collab
Real-time collaboration with CRDTs and Operational Transformation for Armature framework
-
oxidart
A very fast Tree that support get/set/del/ttl operations some variant
-
tasru
A method to map and understand dwarf symbol information
-
undo
An undo-redo library
-
keymaps
standardized encoding for key codes
-
stash
An amortized
O(1)table for cases where you don’t need to choose the keys and want something faster than a HashTable -
logic_tracer
Recognize a logic proposition and trace its truth value, also generate a truth table (still in development)
-
rpos
Cursor Manager on Table
-
ordered
A wrapper for adding arbitrary partial/total order to a type
-
hyperloglockless
High-performance HyperLogLog with bias correction and full concurrency support
-
attuned-cli
CLI tool for Attuned development and testing
-
uuid-rs
Universally Unique IDentifier (UUID)
-
tagid
Defines a newtype labeled tagging for different types of ids
-
spatialtree
A fast and flexible generic spatial tree collection (Octree, Quadtree, etc)
-
tagged-types
Define strongly typed wrappers over base types with minimal boilerplate
-
pgm-extra
high-performance learned index structures for Rust
-
netcrab
creating and exporting Petri nets
-
flatk
Flat layout abstraction toolkit
-
rbitset
A bit set, being able to hold a fixed amount of booleans in an array of integers
-
revelation-bible
Bible domain for Revelation project
-
open-payments-iso20022-reda
Open Payments - Message Parsing Library - ISO20022 REDA
-
heapless_graphs
composable graphs for no_alloc environments
-
neobit
Zero-dependency, lightweight bitflags with readable debug output
-
fast-sparse-merkle-tree
Fast Sparse Merkle Tree (SMT) library in Rust, using TurboSHAKE128 as default hash function
-
rbtree
the rbtree for Rust
-
clustered-fast-trie
Ordered integer set (u32/u64/u128) for data with locality. O(1) range counting. Stable O(log log U) latency.
-
arithmetic-nonmax
Integer types that cannot be the maximum value, allowing for memory layout optimization and intuitive arithmetic operations
-
flatten_objects
A container that stores numbered objects. Each object can be assigned with a unique ID.
-
segmented-vec
A vector with stable element addresses using segmented allocation and O(1) index-to-segment mapping
-
d-ary-heap
Generic d-ary heap priority queue supporting min/max via comparator, with O(1) item lookup for updates. Features configurable arity, efficient priority updates, and cross-language API compatibility
-
phago
Self-evolving knowledge substrates through biological computing primitives
-
puruda
Pure Rust DataFrame
-
rustpix-core
Core traits and types for rustpix pixel detector processing
-
caches
popular caches (support no_std)
-
spider_agent_types
Pure data types and constants for spider_agent automation. Zero heavy dependencies.
-
intervalmap
An interval set/map library inspired by Boost.Icl
-
sigma-types
Types checked for an invariant
-
treeclocks
Various Tree Clock data-structures and utilities
-
graph-api-lib
Core library for the graph-api ecosystem - a flexible, type-safe API for working with in-memory graphs in Rust
-
omega-core
Core types and traits for ExoGenesis Omega universal intelligence orchestration system
-
ultragraph
Hypergraph data structure
-
dot2
generating Graphviz DOT language files for graphs
-
tagged-core
A lightweight tagged type abstraction for type-safe IDs, etc
-
mdcs-delta
Delta-state CRDT machinery for the Carnelia Merkle-Delta CRDT Store
-
zarray
Cache-optimized 2D and 3D arrays using Morton order (aka Z-order) Z-indexed storage, with a convenient API for common 2D and 3D access patterns. Use of zarray in place of a Vec of Vecs often improves performance…
-
dsq-core
Core functionality for dsq - data processing with jq syntax
-
oracle_omen_core
Core types and abstractions for oracle.omen deterministic agent framework
-
unique_id_lookup
Associative Array specifically designed for integer keys. Significant performance boost over conventional hash maps.
-
orn
A generic implementation of a sum type (or discriminated union). It provides
enum Or<T1, T2, ..., N>types as a counterpart to tuples. -
rshyper
focuses on hypergraphs
-
incremental-topo
Data structure to maintain an incremental topological ordering over a collection of values
-
trk-io
TrackVis (*.trk) reader and writer
-
tailvec
Split Vec to mutable slice and TailVec, the TailVec can push or pop etc
-
enum-collections
Collections data structures optimized for Enum, initializable at runtime
-
binary-greedy-meshing
A port of https://github.com/cgerikj/binary-greedy-meshing to Rust
-
chunked_vec
A vector-like data structure that stores elements in fixed-size chunks for better memory management
-
field_access
Dynamically access struct fields
-
bigraph
Different representations with implemented operations on bigraphs
-
adflib
handle amiga disk files
-
ucm-core
Core types and traits for the Unified Content Model
-
maplike
Traits for common operations over maps, sets, (stable) vectors. Has built-ins for std, stable-vec, thunderdome, rstar, rstared.
-
ball-tree
K-nearest neighbors
-
card-est-array
Infrastructure for managing large arrays of cardinality estimators
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
numeric-array
Wrapper around generic-array that adds efficient numeric trait implementations
-
libwebnovel
enabling users to get chapters of a webnovel, with multiple available backends
-
moduforge-model
不可变数据结构与事务系统基础
-
tailcall-chunk
persistent data structure for efficient append and concatenation operations
-
rumpsteak-types
Core session types for Rumpsteak - matching Lean definitions
-
sif-itree
immutable, flat interval tree
-
float16
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
rdf-model
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
cmsketch
A count min sketch implementation in Rust
-
ux-primitives
Graphics Primitives for Angular Rust
-
fixed-slice-deque
A fixed size deque implementation
-
pi_slotmap
Slotmap data structure
-
blockbucket
Read Write Delete (block u8: key, data) to bucket file
-
compvec
Compressing integer vectors
-
signvec
Vector implementation for fast, sign-based manipulation of dynamic collections
-
uninum
A robust, ergonomic unified number type for Rust with automatic overflow handling, type promotion, and cross-type consistency
-
higher-free-macro
macro that creates a (naive) Free Monad type based on a user-supplied Functor. It uses the traits from the "higher" crate. This macro is a port of the Control.Monad.Free part of the…
-
kcr_kueue_x_k8s_io
Kubernetes Custom Resource Bindings
-
oxidd-rules-bdd
Binary decision diagrams (BDDs) for OxiDD
-
orx-fixed-vec
An efficient fixed capacity vector with pinned element guarantees
-
nexus-collections
SLUB allocator backed intrusive collections for low-latency systems
-
hashify
Fast perfect hashing without dependencies
-
ph-temp
data structures based on perfect hashing
-
inc-complete
writing incremental computations that re-execute the minimum number of steps when an input is changed
-
off-grid-primitives
Core data structures and logic for the Off-Grid exchange: spot market (L1/L2/L3), order books, matching engine, and account balances
-
pw-core
Shared types for PromptWallet - OpenAI-compatible chat API types, artifacts, and extensions
-
art
adaptive radix trie
-
comparable_test
comparing data structures in Rust, oriented toward testing
-
jumprope
fast rope (fancy string) library built on top of Skiplists
-
any-rope
A fast and robust arbitrary rope for Rust. Based on Ropey.
-
rs-ecs
reasonably simple entity component system
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
eastl-rs
EASTL binary-compatible Rust implementations
-
vecset
A vector-based sorted map, set and keyed-set implementation
-
normalize_interval
Normalizing interval library
-
tracker
A macro to track changes on structs
-
recoco
A Rust-only fork of CocoIndex, a modular, high-performance ETL and data transformation library
-
ranged_bitmap
A high-performance bitmap library
-
wrapbin
binary newtype as wrapped Cow u8 array
-
diet-xml
Probably the simplest, most approachable XML builder for Rust
-
clone_cell
A Cell that works with a restrictive form of Clone
-
slotted-egraphs
E-Graphs with name binding
-
fm-index
FM index and its variant implementations for Rust
-
fhirpathrs
Fhirpath implementation in Rust
-
optarray
Resizable Arrays in Optimal Time and Space
-
key-node-list
Doubly-linked list that stores key-node pairs
-
aleo-core
Data model for Leo documents (DAG=Directed - Acylic - Graph)
-
more_ranges
Range types not provided in the standard library
-
orbweaver
designed for effortless construction and analysis of graph data structures
-
cfixed-string
Pass Rust strings to C with potentially not needing heap allocation
-
more_collections
Additional collections not found in std::collections
-
nzfcc
New Zealand Financial Category Codes (NZFCC) library
-
trie-hard
Fast implementation of trie data structure
-
typeid_prefix
that implements a type-safe version of the TypePrefix section of the
TypeIDSpecification -
djotters
Djot (Markdown) parser that runs at hyper speeds!
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
sized-chunks
Efficient sized chunk datatypes
-
radix-heap
Fast monotone priority queues
-
copy-stack-vec
A no_std, fixed-capacity, stack-allocated Copy vector for Copy types, with no unsafe code by default
-
gctree
cache-friendly, graph-like, arena-allocated datastructures
-
odht
hash tables that can be mapped from disk into memory without the need for up-front decoding
-
riskless
A pure Rust implementation of Diskless Topics
-
ndarray-ndimage
Multidimensional image processing for ArrayBase, the n-dimensional array data structure provided by ndarray
-
ndtensor
An n-dimensional tensor
-
unbound
Locally nameless representation with automatic capture-avoiding substitution and alpha equivalence
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
bv
Bit-vectors and bit-slices
-
singletonThread
thread in a singleton
-
mappy-core
Core maplet data structure implementation
-
ni
Small limited alloc-free named identifier
-
bevy_archive
An experimental ECS world snapshot system built on Bevy, featuring structured archetype storage and manifest-based serialization
-
superset_map
Map that stores distinct supersets based on the total order defined
-
svd-rs
A CMSIS-SVD base structures
-
eventfold
Lightweight, append-only event log with derived views — your application state is a fold over an event log
-
firims
fixed range integer maps and sets
-
voxtree
sparse voxel 64-tree implementation in rust
-
quilibrium-verkle
Verkle trie implementation with KZG commitments for Quilibrium
-
cactus
Immutable parent pointer tree
-
ndarray-layout
definitions and transformations for multi-dimensional array data layouts
-
ggapi
communicating with start.gg's API
-
multi_ranged
Efficient data structures for representing and manipulating ranges of discrete values
-
oats-rs
Short, unique ids without the hassle of random uuids
-
rangeset
Integer collection backed by ranges with set operation support
-
vibe-graph-automaton
Foundational graph automaton with temporal state evolution and rule-driven transitions
-
valkyrie-ast
Strong typed abstract syntax tree of valkyrie language
-
expanding_slice_rb
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
-
activitystreams-vocabulary
ActivityStreams 2.0 Vocabulary data structures
-
pair_macro
Create types consisting of the same type values such that Pair, Triplet, and so on
-
tedium
A fast and easy TDMS Library for Rust
-
seq-map
Sequential Map
-
feagi_data_structures
The most core library, defines the basic data types used by FEAGI, as well as some processors to modify them
-
mindset
A pure functional state machine library built on Stillwater's Effect system
-
hypeerlog
A fast, distributable, and lightweight HyperLogLog implementation with bias correction
-
naan
A fast, easy, and tasty functional programming prelude
-
tinysetqueue
A tiny, allocation-free FIFO queue with direct-mapped membership tracking for dense integer domains
-
typed-bytes
Fully typed data size units (IEC and SI) with operator overloading
-
dsq-functions
Built-in functions and registry for dsq
-
simd-lookup
High-performance SIMD utilities for fast table lookups, compression and data processing
-
evict
Page eviction policies: LRU, LRU-k, LIRS, SLRU etc
-
sugars_collections
Efficient collection types including ZeroOneOrMany and OneOrMany with array tuple syntax support
-
hypergraph
data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices
-
mikufans-proto
gRPC APIs for Mikufans
-
isx
Traits for checking certain conditions of values
-
medea-reactive
Reactive mutable data containers
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
tuplez
Tuples represented in recursive form
-
slabmap
HashMap-like collection that automatically determines the key
-
pasture-core
A framework for working with point cloud data
-
oxirs-rule
Forward/backward rule engine for RDFS, OWL, and SWRL reasoning
-
tree_arena
An arena allocated tree
-
notatype
Types for Ordinary
-
flex
Flexible borrowing and ownership for Rust
-
onebuck
An efficient unordered dynamically-sized data structure
-
bhc-index
Typed indices for efficient and safe indexing
-
vec-belt
Multi-threaded bulk-append, single-threaded consume
Vec<T> -
suggest
A minimal library to provide similar name suggestions like "Did you mean?"
-
diffus
Finds the difference between two instances of any data structure. Supports: collections, Strings, Maps etc. Uses LCS where applicable. Also supports derive via
diffus-derive. -
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
klingt
Lock-free audio graph library with message-passing parameter control
-
spqr-tree
A representation of the SPQR tree in Rust with support for I/O
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
cf-colo-hint
Cloudflare colo to Durable Objects location hint mapping
-
merc_lts
Implements labelled transition systems for various I/O formats using a general LTS trait
-
type-set
A set of heterogeneous types
-
laurier
ratatui helper library
-
gr-tdigest
Mergeable TDigest in Rust with Python, Polars, and Java bindings
-
uniques
Analyze items in a slice and calculate the unique, first, duplicate, and subsequent items and their indices
-
merkle-cbt
generating efficient Merkle tree and combined Merkle proof based on complete binary tree
-
hashslab
A hash table with data accessible by index
-
lnc-core
Core types and primitives for LANCE - TLV, SortKey, LoanableBatch, buffer pool
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
taco-interval-ta
allowing you to obtain a threshold automaton with an (symbolic) interval abstraction applied to it. This crate is part of the TACO toolsuite.
-
cpx-coords
power the rust-quantum project, this library provides a robust
Cpxtype, specifically optimized for the intensive complex number multiplications required for quantum gate applications and tensor product operations… -
graus-db
A high-performance, thread-safe key-value embedded data store
-
gpt_disk_io
GPT (GUID Partition Table) disk IO no_std library
-
tuplities
A collection of utilities for working with tuples in Rust
-
btree-slab
A memory compact Slab-based B-tree implementation
-
minidom
A small, simple DOM implementation on top of rxml, targeting the subset of XML useful for XMPP
-
range-mutex
A
Mutex<[T]>-like type, that allows locking different ranges separately -
quantor
Declarative quantifiers for filtering, validation, and testing in Rust
-
kotoba-routing
Declarative, graph-based HTTP routing engine for the Kotoba ecosystem
-
whale
A lock-free, dependency-tracking primitive for incremental computation
-
diffo
Semantic diffing for Rust structs via serde
-
hpkg
A native Rust crate to parse Haiku's binary package and repo formats
-
tex_engine
A modular crate for building TeX engines
-
zetamesh_flags
zetamesh-flags is a minimal Rust library for rule-based validation of state combinations
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
hecs-hierarchy
Hierachy implementation for Hecs ECS
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
bytes-cast
Safely re-interpreting &[u8] bytes as custom structs without copying, for efficiently reading structured binary data
-
mergle
A data structure with fast merging and comparison
-
symbol_table
A symbol table that's fast, concurrent, and gives stable references
-
psrutils
few utilities to facilitate pulsar science projects in rust
-
data_reader
A data loading library for data scientist
-
jgd-rs
generating realistic JSON data using declarative schema definitions
-
pdatastructs
probabilistic data structures
-
slotmapd
orlp/slotmap fork where serialization cycle doesn't change observable behavior
-
swiss-table
An educational Rust implementation of the Swiss Table hash map algorithm
-
f3l_search_tree
3D Point Cloud Library
-
roussillon-type-system
A type system for a programming language
-
aatree
in Rust
-
composable-indexes
In-memory collections with composable indexes
-
arraylist
wrapper built on top of rust vector implementation. Taste like Java Arraylist, and intuitive to use like Python list and JavaScript array.
-
hibitset
Hierarchical bit set structure
-
canadensis_dsdl_frontend
Compiler front-end for the Cyphal Data Structure Description Language
-
cutoff-common
A collection of common utilities and helpers used across Cutoff projects
-
ptrie
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes
-
collect_failable
A trait for collecting values into a container which has an invariant to uphold and whose construction may fail
-
stack_collections
Stack-allocated collections for Rust
-
jaggedarray
Multidimensional jagged array
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
bsp-tree
Binary Space Partitioning (BSP) tree useful for 3D rendering. Works with flat polygons (triangles, quads, etc.).
-
array-deque
Fixed-capacity circular buffer implementations: heap-allocated ArrayDeque and stack-allocated StackArrayDeque. Efficient O(1) operations, no_std support.
-
short-id
Tiny crate for generating short, URL-safe, random or time-ordered IDs
-
slice-cell
A
Cell<[T]>-like mutable slice, that allows slice-like APIs -
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
type_slicer
型付きメモリスライサー
-
atelier
a Computational Workshop for Market Microstructure Modeling, Synthetic Simulation and Historical Replay
-
uid_store
Generate random uid strings containing letters, numbers, or base62 values
-
graphcore
Base data structure to represent and manipulate property graph
-
deep_causality_tensor
Tensor data structure for for deep_causality crate
-
disjoint-ranges
Ranges with gaps
-
ceres-core
Core types, business logic, and services for Ceres
-
zakat-ledger
Event sourcing, timeline simulation, and Hawl tracking for Zakat calculations
-
dcel
doubly-connected edge list
-
sparse-merkle-tree
Sparse merkle tree implement in rust
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
rd-util
collection library for resctl-demo
-
either-or-both
The enums EitherOrBoth with the three variants Left, Right, Both and Either with the Left and Right variants
-
orange-trees
Tree data structure with several methods to query and manipulate nodes
-
opensearch_query_builder
Opensearch query builder
-
a-tree
A dynamic data structure for efficiently indexing arbitrary boolean expressions
-
min-max-heap
An efficient, double-ended priority queue
-
rdf-types
Data-structures and traits definitions for RDF
-
arkts
reversing HarmonyOS Arkts bytecode files
-
seg_lib
A collection of segment tree variants
-
do-notation
Monadic do syntactic sugar
-
fffl
A contiguous First-fit Freelist
-
queue-file
lightning-fast, transactional, file-based FIFO
-
optional
supplies a number of Option-like primitive types
-
soplex-rs
Safe Rust bindings for the SoPlex LP solver
-
user-error
UserFacingError is an error crate that allows you to pretty print your errors and error chain for consumption by the end user. If you implement the UFE trait, the default implementation…
-
digit-sequence
Sequence of u8 digits
-
array_list
A dynamic container that combines the characteristics of a Vec and a LinkedList
-
smodel
Symbol semantic modeling for Rust
-
veclite
A lightweight, ergonomic wrapper around Vec<T> that implements Display
-
entid
generating and validating type-safe, prefixed entity identifiers based on UUIDs and ULIDs
-
solvent
Dependency Resolver library
-
pypinindia
Indian pincode lookup and geographical information
-
kn0sys_ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
cbsk_socket
socket callback tool
-
sqlx-data-params
Data parameter utilities for SQLx-Data - advanced pagination (Serial/Slice/Cursor), dynamic filtering, sorting, and type-safe query parameters for database operations
-
better_peekable
Peekable iterator like std::iter::Peekable but allows for peeking n items ahead instead of just one
-
typesense_codegen
Types for typesense generated with openapi spec
-
array-queue
Fixed size bidirectional queues based on arrays
-
rocketman
A modular(ish) jetstream consumer
-
array-plus-extra
An array type that holds N+EXTRA elements with const generic parameters, providing safe slice access to contiguous memory
-
unbounded-interval-tree
An interval tree working with inclusive/exclusive bounds, as well as unbounded intervals. Provides helpers to fetch overlapping intervals, and difference of intervals.
-
strict
collections with strict bounds
-
microkelvin
tree traversal over annotated data structures
-
anymap2
A safe and convenient store for one value of each type
-
suffixarrayview
Creates a view of a suffix array
-
fukurow-rules
Rule traits and constraint validation (SHACL equivalent) for Fukurow reasoning
-
f1r3fly-rspace-plus-plus
F1r3fly Tuple Space implementation in Rust - high-performance storage and pattern matching
-
count-min-sketch-rs
A high-performance, zero-allocation Count-Min Sketch implementation for frequency estimation
-
intrusive-lru-cache
An LRU cache implementation using intrusive data structures
-
heavykeeper
finding Top-K elephant flows with high precision and low memory footprint
-
chronoflake
Generate unique IDs based on the Snowflake algorithm
-
html-mumu
HTML manipulation and tools plugin for the Lava/MuMu language
-
compress-json-rs
Store JSON data in a space-efficient compressed form, with round-trip compression/decompression
-
lattice-graph
Set of Lattice(Grid) based Graph Structures
-
agb_hashmap
no_std hashmap implementation intended for use in the
agblibrary -
disjoint
Fast and safe implementation of the disjoint-set data structure
-
prism3-value
Type-safe value container framework with unified abstractions for single values, multi-values, and named values with complete serde support
-
scarf-syntax
A helper crate of scarf for expressing a SystemVerilog concrete syntax tree
-
c_vec
Structures to wrap C arrays
-
linear-hashtbl
Linear probing hash table
-
streamies
More features for your streams
-
flat-tree
Series of functions to map a binary tree to a list
-
alot
A forbid-unsafe, generational slot map with usize-sized IDs
-
pi_slot
lock free Slotmap data structure
-
cmrdts
A collection of Commutative Replicated Data Types (CmRDTs) implemented in pure Rust
-
pretty_graph
toolbox to build and working with graphs
-
appendlist
An append-only list that preserves references to its elements
-
bump-stack
A stack implementation using bump allocation
-
ratio-interner
Ratio's value interner library
-
minarrow
Apache Arrow-compatible, Rust-first columnar data library for high-performance computing, native streaming, and embedded workloads. Minimal dependencies, ultra-low-latency access, automatic 64-byte SIMD alignment…
-
agentic-commerce-protocol
Type definitions for the Agentic Commerce Protocol specification
-
eight-booleans
A small Rust library to store and manipulate 8 booleans in a single byte
-
rostl-oram
Oblivious RAM (ORAM) implementations
-
crusty_cards
Playing Card and Deck Library
-
limited-queue
a limited queue that overrides the oldest data if trying to push a data when the queue is full
-
cve
Mappings for parsing the CVE JSON files
-
dawg
Directed Acyclic Word Graph
-
packed-uints
Array of uints that scales from u4 to u32 to minimize wasted space while still being fast
-
dsq-shared
Shared types and utilities for DSQ crates
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
quake-util
using Quake file formats
-
gpui_rn_sum_tree
A sum tree data structure (fork for React Native GPUI)
-
fqdn-trie
FQDN (Fully Qualified Domain Name) lookup structures (based on tries)
-
tincan
A lightweight reactive state management library for Rust
-
range-map
Maps and sets implemented using ranges
-
slack-blocks
Models + clientside validation for Slack's JSON Block Kit
-
cell-grid
2d grid container
-
entity_data
A container for entity component data
-
lookupvec
Container with Vec-like properties that also offers O(1) lookup of items based on an id field
-
phyz-gravity
Layered gravity solver from constant-g to post-Newtonian corrections for phyz
-
anchors
async incremental computations
-
qtruss
finite-element solver for trusses
-
flagged_cl_args
Command line argument parsing
-
fibonacci_heap
A high-performance Fibonacci Heap implementation in Rust with generic type support
-
fingertrees
Immutable persisten finger trees
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
static-lang-word-lists
Runtime decompressed statically-included word lists
-
index-ext
Index slices with arbitrary ints and as arrays
-
vicardi
JSON VCardArray Generator that uses Serde
-
vortex-vector
Vortex in-memory canonical data format
-
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
elephantry-extras
A collection of additional components for elephantry
-
uniqer_rs
flexible library for generating various types of unique IDs using a builder pattern
-
vec_historic
Rust Undo Collection
-
axion-data
A high-performance data processing library written in Rust, providing DataFrame and Series functionality similar to pandas
-
gap-buf
Generic gap buffer
-
dig-network-block
Primitives for DIG L2 block structure: header/body types, roots, and consensus emissions
-
stac
SpatioTemporal Asset Catalog (STAC) specification
-
graphix
representing undirected graphs using a compressed adjacency list
-
mikel_binary_tree
search binary tree implementation
-
product-farm-core
Core domain types for Product-FARM rule engine
-
u24
An unsigned 24-bit integer type
-
signalk
parse signalk maritime data
-
tiled_parse_tree
Tree data structure
-
orx-pseudo-default
PseudoDefault trait allows to create a cheap default instance of a type, which does not claim to be useful
-
vec-collections
Rust collections that are newtype wrappers around smallvec
-
fixed-macro
Macros for creating fixed-point constants for types in the
fixedcrate -
typwire
Rust types for the Typst plugin system
-
options
The package provides a data structure for managing named parameters
-
basic_trie
Trie implementation in Rust
-
fastbit
A fast, efficient, and pure Rust bitset implementation for high-performance data indexing and analytics
-
dia-i18n
-
lox
Fast polygon mesh library with different data structures and traits to abstract over those
-
schema-registry-analytics
Analytics engine for usage tracking, metrics collection, and reporting
-
cbsk_base
locked version cargo crates
-
pofk_algorithm
A collection of efficient algorithms implemented in Rust for real-world projects
-
segtri
Segment tree with customizable data type and update operations
-
qlib-rs
A flexible in-memory database library
-
triple-r
Macros to for the recuerdame crate
-
token_trie
A high-performance Radix Trie implementation with sorted children for efficient binary search operations
-
backgammon_engine
Backgammon engine in Rust: state representation, legal move generation, and deterministic afterstate transitions for agent/RL development
-
takeable
Container type that allows for temporarily moving out of the container, or permanently moving out and invalidating the container
-
xorfilter-rs
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
-
miny
Box<T> with small value optimization
-
openresponses
API types, generated from the OpenAPI specification
-
re_string_interner
string interning library
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
lum_libs
Serves as a central collection and re-export of all external crates used in the lum framework to ensure consistent dependency versions across the framework
-
wasefire-slice-cell
Slice with dynamic borrow checking
-
nlist
inline-allocated list with statically tracked length
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
polars-structpath
dynamically accessing nested Rust structures using path notation
-
strumbra
Umbra-style strings (also known as German strings)
-
rstrie
A generalized Trie implementation for Rust
-
succparen
Succinct data structures library for balanced parentheses representation
-
paginate
framework agnostic pagination crate, that is especially suited for databases, slices and collections. Paginate calculates the range of pages indexes, making it ideal for accessing slices…
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
paginator-utils
Shared pagination response structures
-
dotenv_lib
A dotenv file parser
-
windowed-infinity
data structure representing an infinite sequentially writable u8 vector of which a small view has writes to it preserved. This is primarily useful when implementing CoAP block-wise transfers…
-
crdt-data-types
High-performance CRDT library with dual pathways: JSON-native for web APIs and Cap'n Proto zero-copy for binary transport
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
runtime-context
A runtime context providing type storage and management
-
gpui_collections
Standard collection type re-exports used by Zed and GPUI
-
wybr
Collection of preferential voting methods
-
tinyvec_string
tinyvec based string types
-
lightspeed_logger
LightSpeed
-
compact-rc
Low-memory reference-counting pointers
-
embed-struct
embedding data structures
-
mashmap
A flat HashMap that supports multiple entries per key
-
tld
Top Level domain static hash map, tld list is obtained from of iana.org
-
jmt-pq
PQ Jellyfish Merkle Tree
-
rc-u8-reader
A tiny implement for reading
u8data from a reference counted instance -
CartesianTree
Build hierarchical Cartesian coordinate systems to easily transform poses
-
balanced-tree-index
constant-time manipulation of a complete binary tree with a flat in-memory representation
-
identity_map
Identity-based maps
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
bypond
A highly untested and undocumented complete tree library
-
double_linked_list
High-performance doubly-linked list with smart pointer support and memory pool optimization
-
cpx-mat2by2
power the rust-quantum project, this library provides a robust AltMat type for a single qubit, specifically optimized for the intensive complex number multiplications required for quantum…
-
pimalaya-tui
Collection of crossterm widgets shared accross Pimalaya projects
-
michis_collection_cursor
A cursor which wraps an indexable collection, providing a movable position which points to an index of the collection. Useful for things like history, undo-redo systems, or timelines.
-
arbor-graph
Graph schema and relationship tracking for Arbor
-
risc0-povw
Core library for RISC Zero Proof of Verifiable Work (PoVW)
-
kempt
Ordered collection types with no unsafe code and no_std support
-
csf
compressed static functions (maps) that use perfect hashing and value compression
-
rt_ref
Internal
Reftypes forrt_refandrt_vec -
gapbuf
Generic gap buffer
-
merc_data
Defines data expressions on top of terms that are compatible with the mCRL2 toolset
-
list_ordered_hashmap
An insertion-ordered hash map that provides O(1) (amortized) insertion, lookup, update and removal
-
dmfr-dataset-reader
Reads transitland folder and outputs graph of valid feeds and operators
-
sortedlist-rs
A fast sorted list data structure in rust
-
admissibility-kernel
Deterministic context slicing with cryptographic admissibility verification for conversation DAGs
-
nexus-bits
Bit field packing for integer IDs
-
mset
/ multiset / bag implementation
-
approx_collections
Collections using approximate floating-point comparison
-
datavalue-rs
High-performance Arena-based alternative to serde_json::Value
-
ndshape
fast linearization of N-dimensional array indices
-
id_collections
Index-oriented programming in Rust
-
hextree
Location to value mapping
-
rb_tree
A Red Black Tree implementation in Rust
-
flatarray
flattened iterator, that acts as if it still was an iterator of iterator
-
bitvek
bit vector implementation
-
bit_mask_ring_buf
A ring buffer implementation with cheap indexing
-
indexed_arena
index-based arena without deletion
-
plane-2d
Continuous 2D data structure representing infinite 2d plane
-
retworkx
A python graph library implemented in Rust
-
ergo_avltree_rust
cryptographically authenticated dictionary based on AVL tree
-
walker-extras
Additional functionality for SBOM and CSAF walker
-
array_buf
Highly optimized fixed-capacity deque buffer stored on the stack
-
unitx
A general-purpose library for units and quantities
-
mih-rs
Multi-index hashing (MIH) for neighbor searches on binary codes in the Hamming space
-
disjoint-sets
Three union-find implementations
-
lignin
A virtual DOM structure, primarily for web use
-
spimdisasm
MIPS disassembler
-
praborrow
framework - A distributed systems framework for Rust
-
bitvec-rs
Bit vector with guaranteed
[u8]representation and the ability to get safe immutable and mutable views into its internal vector for easy I/O -
std-macro-extensions
A collection of macro extensions for Rust's standard library data structures, simplifying the creation and manipulation of common collections such as HashMap, Vec, and more
-
syntastica-themes
A collection of themes for syntastica
-
chiralmap
Left-Right map using IndexMap
-
heapix
providing heap data structures
-
iron_types
Shared types and data structures for Iron Cage AI agent management
-
orx-selfref-col
SelfRefCol is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees
-
ware
middleware chains
-
range_minimum_query
Range Minimum Query (RMQ) is used on arrays to find the position of an element with the minimum value between two specified indices
-
diff_json
A powerful JSON diff library for Rust
-
xuko
Rust utility library
-
rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 9a27044f42ace9eb652781b53f598e25d4e7e918 The publishing script for this crate lives at: https://github… -
pin-list
A safe
Pin-based intrusive doubly linked list -
oxirs-vec
Vector index abstractions for semantic similarity and AI-augmented querying
-
rostl-datastructures
Oblivious data structures for secure and efficient computation
-
iron_runtime_state
Runtime state management for Iron Cage agents
-
gen_value
indexes and values with generations for vectors
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
libcint-src
libcint (C library) source or build specification
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
bit_manipulation
lightweight Rust crate for seamless management and validation of up to 128 option states. Empower your applications with efficient, flexible, and intuitive option handling, ensuring…
-
rtree_rs
R-tree for Rust
-
wt-indexset
Fork of original indexset which is used for worktable
-
frozen-collections
Fast partially-immutable collections
-
omega-memory
12-tier cosmic memory system with automatic consolidation (Instant → Omega)
-
theymx
A small Rust library for handling DMX data
-
rust-keypaths
A static dispatch, faster alternative to rust-key-paths - Type-safe, composable keypaths for Rust with superior performance
-
trie_hard_rs
Fast, memory-efficient Trie (prefix tree) implementation with autocomplete support - Rust implementation
-
singlevec
Vec-like container optimized for storing only a single item
-
rs-statemachine
COLA-style state machine with fluent API
-
tritools
A collection of tools
-
image-ndarray
Zero-copy implementations for the Image crate to convert to and from ndarrays
-
sarif_rust
A comprehensive Rust library for parsing, generating, and manipulating SARIF (Static Analysis Results Interchange Format) v2.1.0 files
-
linker-set
Declarative programming via linker-constructed arrays
-
leveled-hash-map
structure to separate values into different levels with keys. Every key-value entry which is not at the top level has a parent key at the superior level. Keys at the same level are unique…
-
polytype
A Hindley-Milner polymorphic typing system
-
varlen
Ergonomic variable-length types
-
atree
An arena based tree structure with removal support
-
pna
PNA(Portable-Network-Archive) decoding and encoding library
-
calimero-wasm-abi
WASM-level ABI v1 for Calimero applications
-
half-2
Fork of starkat99/half-rs. Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types.
-
singletons
Type-keyed data structures: SingletonSet stores one instance per type, SingletonMap<V> maps types to values
-
segment-tree
Quickly perform interval queries or modifications
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
stac-validate
json-schema validation for the Rust implementation of the STAC specification
-
sweetrpg-kv-objects
Objects for Key-value store
-
attribute-search-engine
Generic search engine for rows with attributes using different matchers
-
map_vec
The Map and Set APIs backed by Vec
-
closed-interval-set
Unions of closed intervals as containers of pairs
-
codemap
A data structure for efficiently storing source code position and span information (e.g. in a compiler AST), and mapping it back to file/line/column locations for error reporting and suggestions.
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
forest-ds
secure tree structure
-
unordered-pair
A tuple struct representing an unordered pair
-
assoc
Treat vectors like associative arrays
-
graph-api-petgraph
Integration between graph-api and petgraph - use graph-api's traversal system with petgraph structures
-
range_map_vec
range map data structure backed by a Vec
-
nonempty_tools
优雅的 Rust 非空集合类型库，在编译时保证集合非空
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
materials
Data on rocks, elements, metals, etc
-
jerky
Succinct on-disk data structures in Rust
-
arc-string-interner
An efficient cuncurrent string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
cynos-incremental
Incremental View Maintenance (IVM) for Cynos database
-
floating_bar
Representing rational numbers using the floating-bar number type
-
vsmtp-config
Next-gen MTA. Secured, Faster and Greener
-
parser_fuck
parser combinator library
-
bbse
Backward Binary Search Encoding — minimal and deterministic scheme for sorted domains
-
hash-link
Keep elements insert order while searchable by hash
-
cow_map
A map that starts as static PHF (compile-time) and promotes to HashMap on first write
-
tether-map
Order-preserving linked hash map with O(1) reordering
-
steel-imbl
Immutable collection datatypes
-
re_tf
Rerun spatial transform processing
-
stack-allocator
A stack-based memory allocator with optional fallback to a global/secondary allocator
-
lull-spec
Lull spec library
-
dendron
Generic tree data structure
-
ra-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 5113ed28ea1451a13eae3a05dca0dbabfd56f587 The publishing script for this crate lives at:… -
mtgjson
Unofficially provided lightweight models of the data provided by MTGJSON
-
palindromeda
Palindrome number generator and checker at blazing speed
-
radixmap
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
-
fontspector-checkapi
developing checks for the fontspector font QA tool
-
snowflaked
creating and working with snowflake ids
-
forrust_fire_tracing
Tracing integration for
forrust_fire_tree -
hit-data
Hierarchical Indexed Typed data structure
-
queues
Efficient FIFO Queue data structures
-
text-span
Struct covering areas of text
-
bhc-data-structures
Common data structures for the BHC compiler
-
indexed-table
A tiny in-memory indexed table
-
beap
Bi-parental heap data structure implementation in Rust
-
data-source
that fetches data from different sources
-
flange-flat-tree
A tree that can be expanded by attaching new values to the node without mutability of the old ones
-
monarch_data
Data types and utilities handling
-
labeledarray
labeled n-dimensional arrays with spatial-aware helpers for geospatial and scientific workflows
-
multi-map
Like a std::collection::HashMap, but allows you to use either of two different keys to retrieve items
-
enum-toggles
A generic Rust library for managing toggles/flags using enums and bitvec
-
unobtanium-text-pile
Turns HTML into externally annotated plain text that is optimized for being serialized to the postcard format
-
gtfs-geojson
converter for GTFS to GeoJSON formats
-
minecraft-command-types
AST like structure for Minecraft commands
-
ocm-types
Types required to implement the OpenCloudMesh filesharing protocol
-
arrayset
An array-backed ordered set type
-
layered
Build composable async services with layered middleware
-
bitboard64
A 64-bit bitboard useful for chess programming
-
deep_causality_sparse
Spare matrix data structure for for deep_causality crate
-
radix_trees
Various radix tree (trie) data structures
-
stavec
Stack-allocated vector with static capacity
-
prost-unwrap
A procedural macro for prost-generated structs validation and type-casting
-
pbn
Programming by Navigation types and traits
-
gevi_error
A flavor of error types and error handling that I like
-
retaker
ecs implementation
-
tree-flat
TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust
-
grit-data-prison
providing the struct Prison<T>, a Generational Arena that allows full interior mutability to each and every element
-
openai-protocol
OpenAI-compatible API protocol definitions and types
-
crispii_bits
Bit-related functionality for Rust's native u{int} types (usize excluded)
-
traiter
Traits collection
-
nibble_vec
Vector data-structure for half-byte values
-
offset-vec
Packer for Vec and String etc, for all methods index add a offset
-
text-style
Types and conversions for styled text
-
dsa_abc
basic data structure and algorithms. Usability and performance is priority
-
aviutl2-alias
AviUtl2のエイリアスデータを操作するためのライブラリ
-
yrs_tree
implementing a CRDT-based tree data structure powered by Yrs
-
astrie
High-performance hybrid data structure that combines the benefits of tries and B+ trees to provide efficient key-value storage with adaptive behavior based on data patterns
-
id-map
Data structure of values indexed by IDs
-
task-local-extensions
Task-local container for arbitrary data
-
bumparaw-collections
A small set of bumpalo-backed collections for low-level operations
-
smt-circom
Sparse Merkle Tree, compatible with circom proofs
-
range_bounds_map
[
RangeBoundsMap] and [RangeBoundsSet], Data Structures for storing non-overlapping intervals based of [BTreeMap] -
cseq
compact sequences
-
michis_undo_redo
undo/redo system, inspired by Godot Engine's UndoRedo object
-
enum-tag
Proc. macro for generating enum discriminant types.
-
rs-merkle-tree
Merkle tree implementation in Rust with configurable storage backends and hash functions. Fixed depth and incremental only. Optimized for fast proof generation.
-
vp-avl
A combined Vantage-Point AVL tree, to make VP trees updateable
-
triple_arena
Regular, Chain, Surjection, and Ordered Arenas supporting non-Clone types, deletion, and more
-
garlic
A collection of random side projects
-
roadmap
model a project roadmap as a directed acyclic graph
-
forrust_fire_tree
A tree data structure
-
typed_graph
Staticly typed graph library
-
coca
Data structures with constant capacity
-
qutee
A quadtree implementation
-
cli-tilemap
that provides basic functionality of Tilemap for CLI-based games!
-
open-payments-iso20022-admi
Open Payments - Message Parsing Library - ISO20022 ADMI
-
rustywallet-bloom
Fast and memory-efficient Bloom Filter with counting support for rustywallet
-
bo4e
BO4E (Business Objects for Energy) - Rust implementation
-
higher
Functors, Applicatives, Monads and other bad ideas
-
flatcontainer
A flat container representation for Rust
-
support
A collection of helper methods for Rust projects
-
ordsearch
A data structure for efficient lower-bound lookups
-
vec-strings
Store any string efficiently in an immutable way
-
alopex-dataframe
Polars-compatible DataFrame API for Alopex DB (v0.1)
-
lru-mem
An LRU cache implementation bounded by memory
-
standing-relations
Standing relations over a shifting dataset optimized for 'feedback loop' scenarios
-
delta-collections
Data structures with revertable operations called deltas
-
bumpish
A set of collections using bump allocations
-
spanley
my generic string span, his name is Spanley
-
rustpower-sol-klu
A very basic KLU-based sparse linear solver unsafe wrapper
-
leetcode-trees-rs
Tree Node LeetCode problems
-
uintx
Unaligned unsigned integers with exact size in memory and arithmetic operations for them
-
bitstring-trees
Trees based on bitstrings
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any char iterator
-
aograph
AND-OR graph data structures and algorithms
-
copyspan
An alternative to
Range<T>that has a defined memory layout and implementsCopy -
soavec
A vector-like data structure for conventient growable Struct-of-Arrays creation and manipulation
-
waremax-metrics
Metrics collection and reporting for Waremax
-
fillet
An efficient thin pointer based contiguous collection
-
parametrized
Supply useful iterating methods for user-defined types which are parametrized by type parameters
-
expiration_list
A datastructure for items that expire
-
prefix_array
A generic container for searching on prefixes of keys
-
hotel
Collection Data-structure to associate values with keys
-
generic-btree
Generic BTree for versatile purposes
-
slab_tree
A vec-backed tree structure with tree-specific generational indexes
-
snowflake-ng
Dead easy and high performance
snowflakeimplemented in Rust -
point-nd
flexible no-std struct to model points on axes of any dimensions
-
ploc-bvh
A Bounding Volume Hierarchy based on PLOC
-
blas-array2
Parameter-optional BLAS wrapper by ndarray::Array (Ix1 or Ix2)
-
digits
Custom “numeric” incrementor without u64 MAX limit in size. Like a score flipper for a custom character set.
-
river-layout-toolkit
Write River layouts in Rust with ease
-
dynarg
mechanism for dynamic robust argument handling
-
bom-kit
A flexible Bill of Materials (BOM) management library for assembly planning with substitutes and unit conversions
-
enso-data
A collection of useful data structures
-
suff_collections
Fast realization of suffix array and suffix tree
-
logify
A high-performance, portable boolean logic engine. Turns abstract logic into optimized data structures that can be serialized, cached, and evaluated against arbitrary user data (Bitmaps, Sets, JSON, etc)
-
cirno_store
containing motivational phrases in Japanese and Russian
-
openrouter-provider
Type definitions for the OpenRouter Provider API contract (https://openrouter.ai/docs/guides/for-providers)
-
compactor
A collection which compresses old data
-
rust-tagged
A lightweight tagged type abstraction for type-safe IDs, etc
-
rc-vec
RcVec based on Rc and can be converted from Rc without allocation
-
taco-bdd
A Binary Decision Diagram (BDD) crate that provides a unified interface for the CUDD and OxiDD BDD libraries. This crate is part of the TACO toolsuite.
-
tensorism
Multidimensional arrays with bounds included in the type system
-
knot0-types
Rust types generated from Knot0 JSON Schemas
-
slice-rbtree
A slice-based Red-black tree
-
iotdb
Apache IotDB Client written in Rust
-
rocstr
An immutable fixed capacity stack based generic copy string
-
tudi
There, inside the game's two-dimensional universe, life was simple
-
astro-math
Astronomy math algorithms for telescope control and sky transforms
-
phago-agents
Reference agent implementations using Phago biological primitives
-
iati-transform
Transformations and rollups for IATI Activity data (sum by type/year/currency)
-
zkcg-common
Shared types, errors, and utilities for the ZKCG protocol
-
smol-atlas
2D rectangular bin packing with optional item removal
-
radix_route_matcher
A high-performance route matching library based on Radix Tree
-
leanbridgetree
Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves
-
bit-int
An arbitrary fixed bit-width integer library
-
hashheap
data structures that combine a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
tree_by_path
A tree data structure featuring nodes addressable using a &Vec<usize> path and avoiding recursion and run-time borrow checking
-
rustkernel-temporal
RustKernels Temporal domain kernels
-
struct-reflection
obtaining struct field names at runtime through reflection-like capabilities
-
safety-net
A reference-counted netlist library for EDA tools
-
sbits
Succinct data structures: near-optimal space with efficient queries
-
loc_api
interact with the loc.gov API
-
gpui_sum_tree
A sum tree data structure, a concurrency-friendly B-tree
-
hifa-xml-schema
Structure generator from XSD source file
-
livestock-rs
comprehensive library and CLI tool for managing, identifying, and working with livestock breeds, growth rates, and health. Designed to support farming and ranching applications, breed registries…
-
rtdlib
TDLib for rust
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
skipfree
lockfree skiplist
-
griddle
A HashMap variant that spreads resize load across inserts
-
sea-plus
A collection of useful extensions for SeaORM
-
open_menu_standard
OpenMenuStandard (OMS) specification
-
betterunion
safe union-like structure which uses the turbofish operator for reads and writes
-
types
Shared types and DTOs for the Liturgy workspace
-
lodtree
help create octrees and quadtrees for chunked level of detail
-
pathmod
Re-export crate for pathmod
-
numeric-statistics
Numeric Statistics: functions for min, max, average, variance, standard deviation, and more to come
-
gufo-webp
Data structure for WebP images
-
binary-vec
A sorted vector that uses binary search
-
dothocanhnau_phong_thuy
Du lieu quy chuan ban tho va vach ngan phong tho Canh Nau, Thach That. Chuan phong thuy Lo Ban 2026.
-
rust_flightweather
Decodes METAR and TAF
-
compact-calendar
Compact representation of a set of days based on a bit-maps
-
code_location
UNMAINTAINED! Use std::panic::Location instead!
-
mmdb
A std-collection-like database
-
safe_index
Type-safe indexes
-
simd-intervaltree
A SIMD-accelerated interval tree with zero-allocation queries
-
vecdeque-stableix
Deque with stable index values
-
rust-hll
HLL that is compatible with the Aggregate Knowledge HLL Storage Spec
-
scryer-modular-bitfield
Allows to easily define bitfield types with modular building blocks. This is a forked version of the modular-bitfield crate with tweaks for use by Scryer Prolog.
-
rstared
decorator that adds rstar::RTree to collections such as HashMap, BTreeMap, StableVec, thunderdome::Arena
-
type-rules
easily constrain a struct
-
unsafe-tools
A collection of tools making safer unsafe Rust
-
graphix_io
reading and writing graphs from and to text files, based on the graphix crate
-
swiss-eph-data
Embedded ephemeris data files for swiss-eph (Swiss Ephemeris)
-
iowrap
Small helpers for using io::Read/io::Write
-
comparer
track changes in a HashMap/DashMap over several iterations
-
vec-option
A space optimized version of
Vec<Option<T>>that stores the discriminant seperately -
unsized-vec
Like Vec, but for unsized values
-
fey_grid
2D grid data structure and related traits
-
canadensis_bit_length_set
A bit length set type used to calculate data type sizes when processing Cyphal data structure description language files
-
range-filters
High-performance range filter implementation - DIVA (VLDB 2025 Best Research Paper)
-
sharded
Safe, fast, and obvious concurrent collections
-
oxa-types
Rust types generated from the OXA schema
-
traitgraph
Abstracting over different graph representations
-
zhifeng_impl_barnes_hut_tree
implements Barns-Hut Tree for accelerated N-body force calculation
-
raphy
A graph data structure library
-
adar-registry
Advanced Architecture (ADAR) is a collection of architectural tools that help you write more readable and performant code
-
beetle_bits
A collection of bit-based types. Currently only u1 (1bit uint) and f3 (3bit float) are implemented
-
vslab
container with persistent unique keys to access stored values
-
data_hook
A lightweight data collection facade
-
patina_internal_collections
Collection types to the DXE Core
-
gnostr-filetreelist
filetree abstraction based on a sorted path list, supports key based navigation events, folding, scrolling and more
-
fenwick
tree: data structure that efficiently calculates prefix sums in a changing array of numbers
-
try-lazy-init
Fallible lazy initialization
-
kg-tree
Generic object tree with Opath query language, similar to XPath
-
rexsgdata
Scatter-Gather Data Descriptors
-
foldlist
A mutable list with fast folding
-
aion-lib-arraymap
A wrapper around Vec<T> with a freelist. Preserves index validity on mutations without heavy generation counters.
-
prefix-sum-vec
Compressed storage for highly repeating elements, with
O(log n)lookups -
emap
A map with a fixed capacity and integers as keys
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
bittle
Zero-cost bitsets over native Rust types
-
cortenforge-capture-utils
Capture helpers and recorder sinks (JSON, overlays, pruning) for the CortenForge stack
-
squads-rustfsm
Define state machines that can accept events and produce commands
-
kcr_workloads_kubeblocks_io
Kubernetes Custom Resource Bindings
-
qlrumap
An LRU HashMap with an optional passive ttl feature
-
irange
A data structure to store and manipulate ranges of integers with set operations
-
aph_disjoint_set
Disjoint set implementation with optimized memory usage and ability to detach elements
-
b-k-tree
Burkhard-Keller tree data structure for finding items separated by a small discrete distance
-
contack
easy contact library
-
generational_token_list
A doubly-linked list backed by generational-arena
-
bitvector
in Rust
-
aglaea
Automatic Grammar Lifting with Assisted Entity Annotation
-
cortenforge-models
Burn-based model definitions (LinearDetector/ConvolutionalDetector) for the CortenForge stack
-
simple_dto_mapper_derive
A derive macro for mapping DTOs with rename/transform/skip support
-
espalier
Very simple flattened tree structure
-
tui-vfx-types
Framework-agnostic foundation types for the tui-vfx ecosystem
-
generic_constants
Traits providing type-generic numeric constants (Zero, One, ..., OneHundredTwentySeven) implemented across common integer and float types
-
ref_kind
Different reference kinds
-
string_manipulation_utf8
String manipulation functions using character indexing (UTF-8) instead of bytes
-
variant-rs
VARIANT support for Rust. Clean, idiomatic handling of WinAPI/COM results.
-
sequence_trie
Trie-like data-structure for storing sequences of values
-
boxed_array_ringbuffer
A ring buffer of fixed size, that uses a boxed array as storage, therefore avoiding re-allocations when converting from Vec or to VecDeque
-
mdcs-core
Core CRDT types and traits for the Carnelia Merkle-Delta CRDT Store
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
avl
A map and a set implemented with an AVL tree
-
mago-reflection
Offers data structures and APIs to represent and inspect PHP code elements—like classes, functions, and interfaces—enabling introspection and analysis
-
linear_collections
Map and Set types backed by linear data structures
-
persist-o-vec
A Vec type that aims to have stable indices and memory location
-
fungi-lang
Fungi: A typed, functional language for programs that name their cached dependency graphs
-
thin-string
A String with a smaller stack footprint
-
blazemap
Implements a vector-based slab-like map with an interface similar to that of HashMap, and also provides tools for generating lightweight identifiers that can be type-safely used as keys for this map
-
ministd
Rewriting Rust's standard library for fun (no_std)
-
faststr-fork
Faststr is a string library that reduces the cost of clone
-
serde-ordered
A procedural macro for deserializing ordered arrays into keyed structs using Serde
-
opt_struct
Optional collections
-
indexmap-rmw
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
ix-id
Hash-based ID generation for Ixchel
-
pvec
RRB-Tree based persistent vector implementation
-
bit-byte-bit
Implements a bit string using a collection of bytes
-
nested_containment_list
A data structure for efficiently storing and querying nested intervals
-
ro-crate-rs
creating, modifying and reading RO-Crates
-
shortlist
An efficient data structure to track the largest items pushed to it
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
sliding_window_alt
A structure that holds the last N items pushed to it
-
cntp_config
support for reading Contemporary.toml files
-
multidimension
High-level manipulation of multi-dimensional arrays
-
pocketbase-sdk
Pocketbase SDK
-
dayendar
advanced days calendar operations
-
xml-schema
Structure generator from XSD source file
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
expiring-atomic-filter
Thread-safe approximate membership filter with time-based expiration
-
amadeus-streaming
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
coalesced_intervals
Data structure for maintaining maximally-coalesced 1D intervals
-
hattrie
A high-performance, cache-conscious, ordered map for string keys, based on the HAT-trie paper
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
zcstring
High-performance zero-copy string handles for Serde, backed by arcstr
-
extarray
Space-Efficient Extensible Arrays
-
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
fuid
A UUID-compatible identifier in a friendly base-62 format
-
rucksack-lib
The rucksack core library
-
segarray
A fast, growable array type with no copies
-
redmaple
offers an oppinionated yet extremely flexible data modeling system based on events for backend applications
-
cow_vec_item
Copy-on-write Vec, available on stable rust
-
truncate-integer
Truncate integers
-
ord-by-set
providing a weakly ordered multi-set with compile-time configurable ordering scheme
-
rdf-writer
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
libwebnovel-storage
A complement to libwebnovel: this package handles downloading and organizing collections of followed webnovels
-
rotbl
Read Only Table
-
ascent-byods-rels
data structures for Ascent relations, made possible by Ascent's BYODS feature
-
cbsk_log
log tool
-
apma
Adaptive Packed Memory Array (APMA) — a cache-efficient sorted associative container
-
linked-data-schema
Generates SHACL from Rust structure
-
sliceable-ring-buffer
A double-ended queue that Deref's into a slice
-
generational-indextree
Arena based tree structure by using indices instead of reference counted pointers
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
luka
working with graphs
-
modular-bitfield-msb
Allows to easily define bitfield types with modular building blocks. MSB-first version.
-
simple-graph
Graph library with ability to serialize/deserialize Trivial Graph Format
-
ux-dataflow
Data Processing Library
-
nu-plugin-engine
Functionality for running Nushell plugins from a Nushell engine
-
lace_codebook
Contains the Lace codebook specification as well as utilities for generating defaults
-
arr-rs
arrays library
-
flow_arena
A HashMap managed Graph Model with the concept of ownership
-
simple_tables
An easy to use rust crate for creating table structures. Including macros for easily creating these table structures.
-
orx-pinned-vec
PinnedVectrait defines the interface for vectors which guarantee that elements added to the vector are pinned to their memory locations unless explicitly changed -
sif-kdtree
immutable, flat k-d tree
-
elicitor-types
Core types for the elicit crate - presentation-agnostic survey definitions
-
lockerroom
Readers-writer access to individual cells of your collection!
-
omango-util
Utililites
-
settrie
Fast subset and superset queries
-
statiki
Static friendly data structures
-
box-collections
A no_std compatible implementation of the collection crate
-
bytearray-ringbuffer
a no_std and no-alloc ring buffer for variable-length byte slices in rust
-
ffi-toolkit
A collection of functions useful for working with the Rust FFI
-
iot_driver_core
iot driver core
-
ordinary-types
Types for Ordinary
-
async-func
providing macros to simplify the creation of asynchronous closures with external state captured by move. Useful for structuring asynchronous code with ease and clarity.
-
write_x86_64
help you write x86_64 assembly code
-
medianheap
A median heap for keeping track of a running median
-
noindexmap
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
indexed_vec
IndexVecfromlibrustc_data_structures -
merkle-tree-stream
A stream that generates a merkle tree based on the incoming data
-
inexor-rgf-core-di
Inexor - Reactive Graph Flow - Dependency Injection
-
hash_ring
Consistent Hashing library for Rust
-
elizaos-plugin-trajectory-logger
Trajectory logging plugin for elizaOS - Rust implementation
-
simple-grid
2d-grid structure
-
moka-cht
Lock-free resizeable concurrent hash table
-
incremental-map
combinators for incremental immutable maps (see crate
incremental) -
idbag
A bag of integers
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
ferreus_bbfmm
Parallel black box fast multipole method (BBFMM) library
-
taskchain
A block-based, non-circular double-linked list implementation for Rust
-
obzenflow-idkit
Phantom-typed ULID identifiers for ObzenFlow - type-safe IDs for native and WASM
-
compt
A complete binary tree visitor library
-
ruchei-collections
Collections to support the implementation of ruchei
-
mco-gen
Stackfull Generator Library in Rust
-
broom
An ergonomic tracing garbage collector that supports mark 'n sweep garbage collection
-
patternize
provide macros and traits to create design pattern
-
hashmap-mem
Fast, low-overhead in-memory hashmap implementation optimized for performance using fxhash
-
libpna
PNA(Portable-Network-Archive) decoding and encoding library
-
entropy-map
Ultra-low latency hash map using minimal perfect hash functions and compact encoding of values, minimizing memory footprint and storage size for efficient data retrieval
-
pl-hlist
support for heterogeneous lists (known as
HLists), which are functional, tuple-like, strongly-typed data structures that can contain elements of differing types -
oramacore_ptrie
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes
-
stack-queue
Heapless auto-batching queue
-
parallel_vec
A generic contiguous collection of heterogenous values
-
implies
A parser for logical formulas
-
precedence-net
Create and analyse precedence networks
-
cbsk_timer
rayon thread runtime
-
nonoverlapping_interval_tree
Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate).
-
large_int
An ease-of-use unbounded signed integer
-
extindex
Persisted immutable index
-
sparseset
A Sparse Set
-
froop
A functional reactive stream library for rust
-
drtahash
A non-cryptographic hash function using AES-NI for high performance
-
evento-query
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
pgm_index
Ultra-fast learned PGM-Index for efficient sorted key lookup with bounded error
-
idata
Small tools to reduce mutability
-
envish
Search for environment variables
-
flatmap
Fast and Efficient Linear Map and Set for small collections
-
zjctl-proto
Protocol types for zjctl RPC communication
-
stac-io
Input and output (I/O) for the SpatioTemporal Asset Catalog (STAC)
-
rj
reactive json
-
stack-map
constant-size associative container for building higher-level data structures out of
-
hirpdag
procedural macros for Hash Consed, Immutable, Reference Counted, Persistent, Directed Acyclic Graph data structures
-
entity
that provides entity-like constructs
-
weak-map
BTreeMap with weak references
-
grid-engine
A flexible and efficient library for managing 2D grid-based layouts with automatic collision handling and dynamic vertical expansion
-
brownstone
building fixed-size arrays
-
snowflake
A module for generating guaranteed process unique IDs
-
staticvec
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics
-
runfiles
Bazel runfiles support for cargo
-
onigiri
handling chars
-
winpty-rs-windows-collections
Windows collection types
-
sequencetree
a new type of collection to store keys and their corresponding values
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
fenwick-bit-tree
Slighly over-engineered FenwickTree implmentation
-
uuidv7
UUIDv7 implementation
-
grid-tree
Pixel quadtrees and voxel octrees
-
HArcMut
mutable arc
-
pulz-arena
A generational arena allocator with compact generational indices
-
rshyper-algo
implements various algorithms for the rshyper framework
-
host-port-pair
Host-port pair type
-
fixed_heap
A fixed-size heap structure with manually provided stateful comparison function
-
cmtree
A generic Cartesian Merkle Tree implementation
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
msg-store
A fast and light-weight message store designed to work as a priority queue in low hardware equiped devices
-
avltriee
Customized version of AVLTree library.Process the same value in the third branch. One data is immovable from one row, and positional relationships such as left, right, and parent are all referenced by row numbers…
-
scope-cell
temporary, scope-bound, and thread-safe mutation of data in Rust
-
msgpack_simple
Simplified, easy to use, pure Rust MessagePack implementation focused on handling dynamic data structures
-
hashbrown_tstd
port of Google's SwissTable hash map
-
rep
A small tool for representation/class invariants
-
multi_containers
Ergonomically work with multiple values per key
-
sorted-index-buffer
array based sorted map with u64 keys
-
default-vec2
Vec-like data structure with default elements and a bitset built using it -
butils
shared by software included in BSuccinct
-
smallvec-wrapper
Macro and common structs to play with
smallvec -
rotated-array-set
An ordered set supporting O(1) rank and O(√n) inserts and deletes
-
art-tree
The Adaptive Radix Tree
-
emcee
Python's emcee affine-invariant mcmc ensemble sampler
-
object-collection
A collection that can store multiple values of types
-
sortedvec
a sorted vector that enables quick lookups
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
bloom-filter-yss
bloom filter for me or you
-
siraph
A node-based digital signal processing crate
-
bst-hashmap
A binary tree implementation with a hashmap-inspired interface
-
helgoboss-midi
Interfaces, data structures and utilities for dealing with MIDI messages according to the MIDI 1.0 specification
-
titans_memory
Titans Memory: Neural-inspired memory system for AIngle AI agents
-
hora-id
A 64-bit time-based sorted unique ID generator that includes the current time in the ID
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
densevec
Map like collection with usize indices that stores values contiguosly
-
patricia_router
Radix Tree implementation for Rust
-
fwdlist
A simply linked (forward) list
-
recursive_reference
way to walk on recursive structures easily and safely
-
chronofold
A conflict-free replicated data structure (a.k.a CRDT) for versioned text
-
string-newtype
New Type idiom helper for string-like types
-
gridly
managing fixed-size 2D spaces
-
attuned-core
Core types and traits for Attuned - human state representation for LLM systems
-
smallbitset
series of allocation free sets capable of holding small integer values
-
mappy-client
Client library for mappy maplet data structures
-
multiset
Multisets/bags
-
z_table
lookup functions for the standard normal table, also called Z table
-
oak-structure
AST-based document structure and symbol tree generation for the Oak framework
-
word-dictionary
data structure for word mapping. It can be used for language translation.
-
tugger-file-manifest
Interact with lists of files through a storage-agnostic interface
-
fluxus-api
High-level API for Fluxus stream processing engine
-
ttmap
Trivial implementation of type map
-
brk_rolldown_plugin_chunk_import_map
Rolldown plugin for chunk import mapping
-
minsize
Collections with a statically known minimum size (using const generics)
-
map-macro
Declarative macros for statically initializing collections
-
rocketsplash-formats
Shared data types and serialization formats for Rocketsplash TUI animations
-
kollect
Collections made ergonomic for gamedev usecases
-
boost_concept_check
Boost C++ library boost_concept_check packaged using Zanbil
-
debounce
Data structures and helpers for debouncing a stream of events: removing duplicate events occurring closely in time
-
ppar
Persistent immutable array
-
synesthetic-validator
Validation helpers for Synesthetic operator and graph definitions
-
deep_causality_data_structures
Data structures for for deep_causality crate
-
muds
Minimalistic Data Structures and Entity-Component-System Library
-
rose_tree
An indexable tree data structure with a variable and unbounded number of branches per node. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
-
holyhashmap
A hash map with stable indices
-
school_library
structures to manage school-related data, including students, classes, and schools
-
enum_meta
Add metadata to Enum Variants
-
tokmd-analysis-types
Analysis receipt contracts for tokmd
-
bst-rs
Recursive & Iterative Binary Search Tree Implementations within Rust
-
arbitrary-chunks
An iterator that allows specifying an input array of arbitrary chunk-sizes with which to split a vector or array
-
slotmap-slice-fork
Fork of slotmap
-
rustdf
interacting with Bruker TDF formatted Raw Data
-
syntastica-queries
Collection of tree-sitter queries for syntastica
-
circbuf
A growable circular buffer for working with bytes
-
mzdata-spectra
A subset of
mzdata’s traits and spectrum data model -
outils
Graph and tree data structure library. Providing utilities which aren't easily available in Rust.
-
discord-indexmap
A fork of the popular
indexmaplibrary that adds a few extra APIs that are yet to be upstreamed -
btree-ondisk
BTree structure on persistent storage in userspace
-
gpui_rn_collections
Standard collection type re-exports (fork for React Native GPUI)
-
calcit_fingertrees
(Calcit fork of )Immutable persisten
fingertrees -
slas
Static Linear Algebra System
-
mori
orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data analysis…
-
rand_pool
Create a pool of random numbers pre generated thread safe
-
pi_cancel_timer
Cancellable timer based on wheel structure
-
indexed_json
Index json files like a database
-
formualizer-sheetport
SheetPort runtime: bind manifests to workbooks, validate IO, and run sessions deterministically
-
tree-sitter-traversal2
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
jsondiffpatch
JSON diff & patch (object and array diff, text diff, multiple output formats)
-
gamma
Graph primitives and traversals for Rust
-
phf_macros
Macros to generate types in the phf crate
-
hash-rings
Implementations of various hash rings
-
try_reserve
Stable implementation of the TryReserveError from std for custom collections
-
reputation-types
Core types and data structures for the KnowThat Reputation Engine
-
union-fn
Proc. macro for creating efficient "inline closures".
-
formualizer-common
Core value, reference, and error types shared across the Formualizer parser and engine
-
designal
Procedural macro for use with futures-signals
-
aversion
Versioned data structures with auto-upgrading
-
limq
Queue with a controller for monitoring queue elements
-
hybridmap
Hybrid map using smallvec and the std hashmap
-
sum
General-purpose sum types
-
sequential-id-alloc
sequential ID allocator that guarantees sequential allocation
-
no-copy
packer, but no implement copy
-
minimizer-iter
Iterate over minimizers of a DNA sequence
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
advanced_collections
advanced data structures (collections). Includes counter (hash-bag, multiset), disjoint set (union-find, merge-find), circular buffer (cyclic buffer) and interval (range)
-
anyval
A lightweight, dynamically‑typed value container for Rust that works like a scripting language
-
bitset-core
Straightforward, no-std compatible, simd optimized, BitSet API
-
simple-triplestore
graph database for storing triples with support for custom node and edge properties
-
commitlog
Sequential, disk-backed commit log library
-
kcr_security_profiles_operator_x_k8s_io
Kubernetes Custom Resource Bindings
-
bdaddr
Bluetooth Device Address
-
wasm_macro
Collections of useful macros for wasm
-
sugars_builders
Builder pattern utilities and abstractions for the cyrup-sugars ecosystem
-
persistent-kv
Persistent key-value store
-
avon
A lightweight data connector library
-
rc-hashmap
A HashMap with reference-counted key-value entries
-
fairqueue
Spatially distancing fair queue. A kind of queue for sequential round-robin processing.
-
brie-tree
A fast B+ Tree implementation that uses integer keys
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
reactive-signals
dx-first scope-based fine-grained reactive system
-
msiz_rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 74d5c70b174f06843049af2d764ff57ddc81c81c The publishing script for this crate lives at: https://github… -
fn-store
A dynamic persistent value store using closure type as key and storing its return value
-
rustz
functional programming in Rust
-
fixed_bitmaps
A small crate implementing bitmap functionality around primitive Rust unsigned integers
-
indexlist1
A doubly linked list, backed by a vector
-
nopetgraph
Graph data structure library. Provides graph types and graph algorithms.
-
im-pathtree
Immutable, path-addressable tree data structure
-
raw-btree
Generic B-Tree implementation
-
shiftnanigans
contains different iteration data structures for either iterating or for shifting iteratively forward and backward
-
libnv
Safe and rustic wrapper around libnv-sys
-
jvs-packets
that provide structures for JVS protocols
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
aligned-utils
Common utilities to work with aligned values and allocation
-
openrml
(Rust Mesh Library) aims to provide a rust-native mesh processing data structures and algorithms for 3D graphics and VFX applications
-
wrapped_slab
WrappedSlab: Auto-generate newtype idiom based on a Slab
-
hydroperfox-smodel
Semantic modeling for Rust
-
rust-prelude-plus
Higher-order functions built on top of keypaths for type-safe functional programming
-
geosite-rs
that parses geosite.dat file format
-
netlist
generic netlist data structure for VLSI design
-
panoradix
A generic map and a set, both backed by a Radix tree
-
watermark
watermarking set for in-order insertions
-
bayesic
A string matching library similar to NaiveBayes but optimized for many small classifications
-
stateset-primitives
Strongly-typed primitive types for StateSet iCommerce
-
cock-tier
Measure the power level of a peen
-
kcr_kafka_banzaicloud_io
Kubernetes Custom Resource Bindings
-
atomic_ptr_cell
Safe no_std repr(transparent) wrapper for AtomicPtr and &AtomicPtr with an api similar to a cell
-
skipidy
A skiplist implementation
-
tinyvecdeq
VecDeque-like data structures -
sprsdata
Data structures based on sparse and dense arrays
-
influxdb-dispatcher
Batch metrics collection using influxdb
-
openvx
1.3.1 wrapper
-
minivec
A version of Vec that's only the size of a single pointer
-
ef_rs
Elias-Fano encoding scheme
-
segmap
Map and set data structures whose keys are stored as ranges. Contiguous and overlapping ranges that map to the same value are coalesced into a single range. Originated as a fork of Jeff Parsons' "rangemap"
-
rust-bloomfilter
bloom filter implementation in Rust programming language
-
tiered-vector
Tiered Vectors
-
openligadb
API
-
merkle_light
Light merkle tree implementation with SPV support and dependency agnostic
-
timer-queue
Pure, minimal, and scalable timers
-
wplot
Plot interface
-
list-zipper
a zipper data structure for sequenceable data types
-
construe
Compile-Time Growable Array: Vec & String for const!
-
tpntree
A N-dimensional generalization of region quad/oc-trees
-
set_genome
A genetic data structure for neuroevolution algorithms
-
smolset
" An unordered set of elements optimized for small sizes. This is a fork of the original library with overhauled internals, better fallback perforamance (O(1) insert and find) and more features!
-
lykoi_data
data
-
fenny
working with Fenwick trees
-
rive-models
Revolt API models for the Rive ecosystem
-
search_trail
manager of variables that can save and restore their values
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
oot_bitset
A no‑frills, zero‑overhead bit flag system
-
polars_structpath
dynamically accessing nested Rust structures using path notation
-
stack-vector
Vec-like wrapper for an array allocated on the stack
-
lumberjack
Read and modify constituency trees
-
fast-rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 15812785344d913d779d9738fe3cca8de56f71d5 The publishing script for this crate lives at: https://github… -
partial-array
potentially partially-filled arrays
-
string-mumu
String functions and tools plugin for the Lava / Mumu language
-
histogram-sampler
Sampling from a distribution given by a histogram
-
v9
A slim data engine for Data Oriented Design
-
optempty
Tools for working types that may be empty. E.g., an empty
String,Vec,HashMap, etc. -
bankarr
Array-like but growable vectors
-
loose-semver
Loose parser for Semantic Versioning
-
hprtree
A Hilbert-Packed-R-Tree implementation for rust
-
rust-tls-duplex-stream
Full Duplex stream Wrapper around rust-tls
-
shrink-to-fit
Recursively calls
shrink_to_fiton all elements of the container -
reversible
A generic wrapper struct that provides reversible editing capabilities
-
lazy-cogs
Lazy Cogs is a implementation of lazy clonable data structures
-
seq-str
Flat collections of strings etc
-
pinned_vec
Vec-like data structure whose elements never move
-
exhaustive-map
An exhaustive map for types with finite inhabitants
-
win-variant
that aims to provide a more ergonomic way of working with variants in winapi based projects
-
index_many
A proof of concept for indexing an slice at multiple locations at once
-
swap-queue
A lock-free thread-owned queue whereby tasks are taken by stealers in entirety via buffer swapping
-
patternutils
Tiny utility library for some common design patterns
-
skippy
Highly flexible worst-case O(log n) intrusive skip list
-
quickphf_codegen
Code generator for creating static maps and sets for use with quickphf
-
grove
A segment tree library enabling generic user-defined queries and actions on segments of your data
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
omega-meta-sona
Self-Optimizing Neural Architecture (META-SONA) with evolutionary search and fitness evaluation
-
bitlab
Extracting a range of bits from a binary data source
-
keyarray
modeling and managing mutually exclusive states (keys in a key array)
-
bucket_vec
A vector-like data structure that guarantees to never move its contained elements
-
regroup
regrouping arrays
-
cbloom
Concurrent implementation of Bloom filters
-
exprz
An Expression Library
-
inplace-vec-builder
Build a vec from a vec, in place
-
ittybitty
An itty bitty bitset to hold your itty bitty bits
-
non-empty-vec
NonEmptyvector implementation, ensure non-emptiness by construction -
list-any
Type erased slices and Vecs
-
fuzzy-search
collections for fuzzy search
-
tree-rizzen-yazston
Tree Library using the Any trait for data
-
ring_pair
Tiny fixed-size ring buffer specialized for exactly two elements
-
fixed-index-vec
A vector-like data structure whose indices do not change when elements are removed
-
flex-algo
Rust commonly used data structure and algorithms
-
cortenforge-data-contracts
Data contracts for run manifests and capture metadata used across the CortenForge stack
-
weave-draft
representing and manipulating weaving drafts
-
segmentmap
A collection that maintains insertion order
-
chainbuf
Fast chained buffers
-
chinese-rand
Random generation of data structures in Chinese, using Rust
-
type-freak
Collection of typed data structures, trait operators and aliases
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
steru
-
linear-map
A map implemented by searching linearly in a vector
-
phago-rag
Biological RAG — query interface on self-organizing Hebbian knowledge graph
-
bitvec_simd
bitvec with SIMD
-
dge-gen
building a computational graph to be executed distributely
-
artsy
ART Tree data structure library
-
gufo-tiff
Data structure for TIFF images
-
csc411_rpegio
A collection functions to handle rpeg data i/o. Intended for use in URI's CSC 411 class.
-
prehash
storing values with precomputed hashes
-
xio_base_datatypes
XIO base data structures
-
trying
Basic trie crate
-
oxc_index
Newtype-style helpers for
Vecandusize -
char-list
A persistent string type with the same API as a linked-list of characters
-
bitf
procedural macro to easily create a bitfield out of a struct
-
succinct
data structures for Rust
-
blockset-lib
BLOCKSET internal library
-
graphlib
powerful rust library for the graph data-structure
-
malwaredb-api
Common API endpoints and data types for MalwareDB components
-
tinybox
Like
Box, but with an optimization that avoids allocations for small data-structures -
slotmap_fork_lmondada
Slotmap data structure
-
insrcdata
Embed static data as source code
-
ztimer
A block-based, non-circular double-linked list implementation for Rust
-
giftbox
A fun Rust crate called
giftboxto help Rustlings learn and explore generics -
populated
Collection types that are guaranteed to be populated (i.e. non-empty). Based on std::collections types.
-
fast-ordered-buffer
A faster buffering implementation for asynchronous streams, trading off memory usage for speed
-
elizaos-plugin-memory
Memory management plugin for ElizaOS (Rust)
-
corresponding
Move corresponding fields between structs
-
landfill
Various types for dealing with on-disk data
-
canutils-lib
A collection of types for working with CAN bus data
-
lace_data
Data definitions and data container definitions for Lace
-
rosary
About Rose Trees
-
foreign_vec
Unofficial implementation of Apache Arrow spec in safe Rust
-
pax-properties-coproduct
Static container for program-variable data structures and polymorphic components
-
zellij_widgets
A wiget library for zellij
-
flat_map
A compact map stored as a vector of key, value pairs
-
parallel_frontier
Queue-like frontier for breath-first visits on graphs that supports constant-time concurrent pushes and parallel iteration
-
seq_watcher
A pair of structures for monitoring a stream of data for one or more sequences
-
boolvec
A vector of boolean stored contiguously in memory
-
delatin
Fast TIN generation using Delaunay triangulation
-
asbytes
Traits for viewing data as byte slices or consuming data into byte vectors. Relies on bytemuck for POD safety.
-
beat_saber_map
Read and write Beat Saber maps with Rust
-
catalan
binary tree of n variables where the parent node represents a function and the child node represents a value
-
plod
deriving plain old data
-
fid
FID (Fully Indexable Dictionary) implementation for Rust
-
shortguid
Short URL-safe Base64 encoded UUIDs
-
swamp-script-source-map-lookup
Source map lookup for Swamp
-
doubly
Doubly-linked lists in Rust
-
retriever
embedded in-memory data store for rust applications
-
array-mumu
Array tools plugin for the Mumu ecosystem
-
boxing
cross-platform implementations for NaN and ptr boxes
-
obsessive_peek
An iterator adapter to peek at future elements without advancing the cursor of the underlying iterator
-
galemu
workaround for generic associated types (GAT) limited to lifetimes (GAL)
-
tc-value
TinyChain's representation of a value which can be collated and stored
-
undoredo
Incremental-diff undo-redo decorator for collections such as HashMap, BTreeMap, StableVec, thunderdome::Arena, rstar::RTree. No need to implement commands.
-
neighborhood-diversity
computing the neighborhood diversity of simple, undirected graphs
-
static-collections
Implementations of fixed-capacity collection types
-
handy
providing handles and handlemaps
-
traitgraph-tsplib-io
Functions to read and write graphs in TSPLIB format
-
flatten_structs
Allows inlining fields into another struct
-
data_tree
Hierarchical data tree with pathing and search support
-
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
python-objects
that implements the architecture of the CPython objects. with this crate you can crate a list with any data type from rust
-
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
clnooms
Assembly-level implementation of interesting data types
-
rc-writer
A tiny implement for writing data to a reference counted instance
-
mutable
keep track of changes in structures
-
domain-lookup-tree
A tree structure in Rust optimized for looking up domain names, with wildcard support
-
fdec
A collection of macros for generating fixed-size fixed-point numeric types for Rust
-
hgg
Approximate nearest neighbor search collection
-
fallback
A helper library to implement fallback mechaism
-
ringo-buff
Ring buffers for bytes, with heap and stack storage
-
mdcs-compaction
Compaction, pruning and stability subsystem for the Carnelia MDCS
-
ndcopy
Fast N-dimensional array memcpy
-
drthashbrown
port of Google's SwissTable hash map
-
quadtree_simple
quadtree implementation
-
uuid47
lightweight library for converting between UUIDv7 and UUIDv4 facade
-
tournament-kway
k-way merge using a tournament tree
-
xsparseset
sparse set
-
unique-pointer
UniquePointerdata structure that makes extensive use ofunsaferust to provide a shared pointer across other data structures -
lambda-runtime-types
Common structures for lambda architecture
-
identified_vec
Like HashSet but retaining INSERTION order and without
Hashrequirement on the Element type -
disk-ringbuffer
lock free on disk ringbuffer to be used in the implementation of Franz
-
s3vectors-metadata-filter
A flexible and efficient Rust library for filtering data using S3 Vectors Metadata Filter
-
monistode-assemblers
A collection of assemblers for the monistode set of architectures
-
task-collection
Types for managing and waiting on groups of tasks
-
dsa_sport
revision material for undergrads
-
veripb-formula
VeriPB library to handle pseudo-Boolean constraints, formulas, and more data structures
-
set-trie
A trie for fast subset and superset queries
-
rudac
common data structures and algorithms
-
qipu-core
Core domain logic for Qipu knowledge management system
-
wccg-models
WCCG Data
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
open-coroutine-timer
The time utils
-
contigious-tree
Write and read tree graphs to and from contigious blocks of memory
-
tf_playlist
The playlist feature used in Tubefeeder
-
ord-collections
offering collections which are pre-sorted automatically
-
pointcloud
An accessor layer for goko
-
embassy-mock
An unofficial collection of mocked types for the Embassy framework
-
kdtree-simd
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
-
recoverable
Recovery information and classification for resilience patterns
-
value_pool
implements a ValuePool struct that makes the creation of self-referential data structures easier and safer
-
global-registry
A global type registration system for Rust
-
arrowmax
High-performance Arrow data stack: columnar storage, zero-copy streaming, and schema codegen
-
densemap
A collection data structure that is permanently accessible by unique keys and fast iterable
-
predicates
boolean-valued predicate functions
-
stac-extensions
Manage STAC extensions (https://stac-extensions.github.io/)
-
sparse_map
A sparse map with stable generational keys
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
deltastruct
Allows defining deltas for tagged structs for later application
-
pokeapi-model
Data structures for PokéAPI v2
-
sweeper
A foundation for Minesweeper implementations in Rust
-
tobz1000-petgraph
Pseudo-namespaced fork of
petgraph: Graph data structure library. Provides graph types and graph algorithms. -
extended-rational
implementations of high-accuracy projectively-extended rational numbers and macros for creating them
-
resizing-vec
An automatic resizing vector for data with linear increasing ids
-
html-json-extract
A package for parse some data from html.scripts
-
neopdf_capi
C language interface to NeoPDF
-
type-erased-table
A column-oriented based raw data storage
-
ucd-trie
A trie for storing Unicode codepoint sets and maps
-
arraystring
Fixed capacity stack based generic string
-
beehive
collections for 3D hexagonal maps
-
internode
Smart references to your graph nodes
-
gzbbinarydoc
json like object structure to organize data.supported data types are binary(Vec<u8>),string,i64,f64,null,Vec<self> and hashmap<string,self>. the document can be parsed from and to a vec<u8>.
-
chainmap
mutability of intermediate maps
-
luthor
A collection of lexers for various languages/formats, and the tools required to build them
-
dahl-partition
An efficient representation of a set partition
-
range_union_find
A union-find data structure for ranges
-
tilecoding
Dr. Richard S. Sutton's tile coding software.
-
merkle-tree-bulletin-board
A public bulletin board based upon Merkle trees
-
rust_redux
A Redux-like state management library for Rust
-
the-zipper
zipper is a data structure that allows you to traverse and modify a tree-like structure efficiently. It provides a way to navigate through the tree while keeping track of the context…
-
tyght-map
A static type map implementation
-
named_colors
that provides named colors in RGB and Hexadecimal formats
-
upair
Unordered pair data structure
-
segmented_string
an immutable string type built from array segments, similar to clojure's persistent vector, with unicode grapheme/width support
-
lobby-queue
Const-size queue-like data structure
-
cphf
Compile-time perfect hash function data structures
-
fenwick-tree
binary indexed tree (Fenwick tree) data structure in Rust
-
dltree
Doubly linked tree with leaf-considering typing
-
liblet
learning about formal languages and grammars
-
pq-tree
consecutive ones property (C1P) and graph planarity testing
-
taco-zcs-model-checker
Model Checker constructing an abstract counter system encoded into BDDs to verify threshold automata. This model checker is part of the TACO toolsuite.
-
mutcursor
Safely stores mutable references to parent nodes, for backtracking during traversal of tree & graph structures
-
acme-types
Types for implementing ACME (RFC 8555) providers and clients
-
secretmangle
mangling sensitive data in memory with a random key
-
forrustts
Tools for forward simulation with tree sequence recording
-
kurobako_problems
A collection of black-box optimization problems
-
lhlist
Labeled heterogeneous lists
-
cycler
A simultainious write/read data structure
-
baz-tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
grangers
working with genomic ranges and annotations
-
ittapi
High-level Rust bindings for ittapi
-
modupipe
A modular and extensible ETL-like pipeline builder
-
stable-id
mainly deals with issuing and maintaining stability of indices
-
bpht
A bit-packed hash table implementation using hopscotch hashing for 32-bit keys and values
-
optionee
The macro to create option struct easily
-
inspector
General purpose inspection for popular data structures
-
polystore
Polymorphic data store
-
mt-kahypar
A statically-linked Mt-KaHyPar
-
memtally
A wrapper for some collection types that keeps track of indirectly allocated heap memory
-
sedimentree_core
Sedimentree: a hash-linked CRDT storage structure with fragments, commits, and content-addressed blobs
-
checked
Implements a wrapper over the primitive Rust types that better indicates overflow during arithmetic
-
arq
manage Arq Backup data formats
-
dst
Data structures for DSTs
-
merkle
tree implementation with support for generation of inclusion proofs
-
cursorvec
Cursored vector container
-
timer_list
A list of timed events that will be triggered sequentially when the timer expires
-
ordered_hashmap
Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
-
dependency-graph
building and resolving dependency graphs
-
atomic_swapping
An arbitrary type atomic storage with swap operations
-
guzzle
A derivable trait for consuming key value pairs into structs
-
bisetmap
fast and thread-safe two-way hash map of sets. It is best suited where you need to associate two collumns uniquely. Each key is associated to one or more other unique values. The structure…
-
multi-stash
Vector-based arena data structure that reuses vacant slots
-
lazy_vec
A lazily initialized (but eagerly allocated) Vec-like datastructure
-
bonzai
An abstraction for optimizing the memory layout and pointer aliasing of trees
-
arraysetcell
A fixed-capacity, vector-like array with interior mutability and no ordering guarantees
-
graphrepresentations
providing efficient abstract implementations of different graph representations
-
fixedvec
A heapless version of the Rust vector type
-
range-traits
Ranges related traits
-
bstree-file-readonly
Query read-only binary-search tree file, supporting billions of entries in files of tens of GB
-
twovec
A data structure for storing 2 types of data in a packed, heap allocated array
-
booking_kit
A powerful and extensible booking toolkit for Rust — featuring core data structures, flexible status logic, and seamless integration into any reservation system
-
isomorphism
2 directional hashmaps
-
lottie-data
Data structures for Lottie animations
-
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
hicollections
C-liked Collections
-
rahashmap
Fork of standard library HashMap with additional functionality
-
kg-utils
Various collections and utilities
-
roers
prepare augmented annotations for single-cell RNA-seq analysis
-
dyn-slice
&dyn [Trait] implementation, inspired by a Reddit thread
-
smallbytes
= SmallVec + impl BufMut (from the bytes crate)
-
thincollections
Alternative implementations for vector, map and set that are faster/smaller for some use cases
-
singletonset
SingletonSetdata structure, which makes it easy to store a single instance each of various types within a single set -
char-buf
A writable, fixed-length
charbuffer usable inno_stdenvironments -
alist
Association list offering fast lookups while preserving insertion order
-
purse
Bag data structure implementation in Rust
-
iterlist
Linked list with a cursor based api
-
equivalent-flipped
Similar to
equivalentcrate, but flipsKandQ -
tinymap
A map structure that stores its data on the stack
-
go-heap-rs
Golang's heap written in Rust
-
overtone
An API for creation and management of rich (as in rich-text) musical-ish projects
-
hibit_tree
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
-
bl-range-set
working with range sets
-
sorted_vector_map
maps and sets backed by sorted vectors
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
yyid
Yyid generator (random tokens like UUIDv4, but using all the bits)
-
disjoint-collections
Disjoint-set data structures
-
tokmd-substrate
Shared repo substrate context for cross-sensor coordination
-
mem_btree
A Data Structure of BTree Implemented with Rust, support snapshot. not use any unsafe lib.
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
suffix_trie
Suffix trie for searching
-
expiringmap
a HashMap-backed TTL map
-
lookup-tables
High performance & compile-time customizable lookup tables
-
triangle_matrix
Triangle matrix indexing operations
-
cds
Collection of Optimized Data Structures
-
caliber-pcp
Persistent Context Protocol validation and checkpointing for CALIBER
-
rds-tensors
Rust Data Science Tensors crate
-
messaging
two-way messaging crate
-
zot
Option-like enums for working with ordered collections of zero, one, or two items (
Zot), or ordered collections of one or two items (Ot) -
dectree-rs
A decision tree implementation in Rust
-
tuplities-flatten-nest
Traits for flattening nested tuples and nesting flat tuples
-
anvaya
ECS like dynamic storage in ~500 LOC
-
statemachine-rs
A statemachine crate which have zero dependencies
-
ascii-dag
Zero-dependency, no_std compatible ASCII DAG renderer. Visualize error chains, dependency trees, and graphs in the terminal.
-
fastgraph
Graph abstraction providing a generic interface and powerful parallelized traversals
-
goodreads
deserializing a Goodreads library export
-
diskmap
disk based HashMap-like for shared concurrent memory usage
-
validbr
data structure and validation for Brazilian Registries, such as CPF, CNPJ and CNH (currently only CPF and CNPJ is supported)
-
willowtree
Lazily evaluated trees
-
gridbugs
Collection of re-exported crates for building roguelike games
-
groupex
Syncronization primitive that allows acquire lock by index
-
xtree
general purpose tree data structure
-
sharedvec
A fast but limited collection for storing values of a single type
-
simple-ref-fn
function wrappers that do not require virtual tables
-
soak
Transform a struct into arrays of its fields
-
oxrdf_elevont
Basic data structures related to RDF
-
double-map
A HashMap with double key to single data/value
-
simple-observable
observable pointer for mutable and immutable data
-
spark-signals
A standalone reactive signals library for Rust - fine-grained reactivity for any application
-
mkargs
Build command arguments
-
rs_transducers
transducers for Rust
-
contiguous_collections
collections backed by flat contiguous arrays
-
adts
Common abstract data type traits and implementations
-
bucket_queue
A Bucket Queue data structure that can be used as a Priority Queue
-
formualizer-eval
High-performance Arrow-backed Excel formula engine with dependency graph and incremental recalculation
-
chesspos
Basic structs for representing chess squares
-
attr
attris a library to provide external access to a datastructure through a typed path object, using all type information known about the data structure at hand -
taganak-core
RDF types and interfaces from Taganak (Transactional, Aggregating Graph Architecture for Networking and Access to Knowledge)
-
array_manipulation
Methods for manipuling arrays in a Vec-like fashion. It will (probably) get into core once const expressions get less experimental.
-
justly
justified containers
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
critbit
Map and Set based on critical bit trees
-
pl-lens
support for lenses, which are a mechanism in functional programming for focusing on a part of a complex data structure
-
RustyDSA
A libary for Rust data structure
-
wide
help you go wide
-
nonempty-containers
Fast, zero-cost conversion, and fully inter-operable nonempty container types
-
sparse_set
sparse set data structure
-
composite_types
Compose type definitions in the style of typescript
-
bufferbuffer
Double Buffer design pattern from 'Game Programming Patterns' by Robert Nystrom
-
prefix-tree-rs
A Trie (prefix tree) implementation
-
lending-library
A key-value store that loans full ownership of items
-
minimal_signals
minimal API for working with signals
-
roaring_bitmap
Roaring bitmap data structure implemented in Rust
-
linked-vector
A hybrid linked list and vector data structure
-
marisa-ffi
Rust FFI bindings for libmarisa - a space-efficient trie data structure
-
dsu-tree
A non-invasive disjoint-set-like data structure implementation
-
rust-constraint
constraint satisfaction problem (CSPs)
-
cartesian-tree
Construct a Cartesian Tree from a Slice in Linear Time
-
rolling_norm
Computes the rolling mean, variance, standard derivation and norm
-
fast_trie_tree
A fast
TrieTreefor multiple data types -
etf-matcher-vector-config-loader
Download and parse ETF Matcher ticker vector configurations
-
many-to-many
creating many-to-many data structures with the ability to query either side, useful for applications such as pubsub. Like a fusion between
bimapandmultimap. -
nimble-steps
Nimble Steps Collections
-
membuffer
A very fast flat memory buffer used to deserialize at a fast speed
-
teardown_tree
A binary search tree that supports fast clone and delete-range operations
-
enumoid
Enum Indexed Containers
-
restorable
An iterator adapter for saving and restoring iterator state
-
read-copy-update
locking primitive
-
aabb
Static AABB spatial index for 2D queries
-
dynp
Dynamic property system that emphasizes the use of the Newtype pattern
-
simple_trie
array backed trie
-
array2ds
Package for handling sized 2d arrays in rust, without the usage of the keyword unsafe cuz why not
-
streams
A collection of stream-extensions that are missing in the
futurescrate -
expiringdict
A dict / HashMap whose items expire over time
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16coordinates. -
file-backed-value
lazily generated persistent values backed by a file, with the option to require a recomputation after a certain amount of time
-
retrace
Safe, generic rollback log with predictable latency
-
range-split
splitting sequences with range parameters
-
cmus-status
structure cmus status data
-
btreemultimap
A multimap implementation with range support
-
bookfile
A container file format with chapters and an index
-
stride
A strided slice type
-
mofurun
Multi variant Optimized Fun U....okay Mofu is just a cute name okay. Experimental implementation of Vec that stores the state of the underlying array through its enum.
-
literally
Macro literals for members of std::collections
-
offset
Glorified offsets for arbitrary structures
-
datastructures
A variety of data structures for learning purpose
-
cast-rs
A collection of types cast for Rust
-
sliding_extrema
Queue data structure with support for an O(1) extrema function over contents (for example, to obtain min and max over a sliding window of samples)
-
evidentsource-core
Core types for the EvidentSource event sourcing platform
-
spatialize
collection of spatial data structures used for efficent spatial partitioning
-
cdl-list-rs
A circular doubly linked list implementation using Rc<T> and RefCell<T>
-
tree-mapper
generating a hierarchical mapping of files and directories represented as a HashMap. The mapping reflects the directory structure and file levels, allowing for efficient retrieval and…
-
sorbus
A tree manipulation library
-
fns
add common fn, eg: debounce, throttle
-
easy_collections
Wrappers around standard collections for ease of use and quick prototyping
-
ecoord-core
Core primitives and operations for transforming between 3D coordinate frames
-
tusks-tasks
Easily build a CLI based on a Rust Module/Function Structure
-
lightning-containers
A set of lock-free data structures
-
subranges
manage non-interssecting integer intervals
-
arrow
Apache Arrow
-
kcr_opensearch_opster_io
Kubernetes Custom Resource Bindings
-
leetcode-solutions
A collection of leetcode solution in rust
-
common-tree
common tree lib
-
circular_vec
A fixed length vector that provides a next function that loops infinitely
-
kotoba-schema
Graph Schema Definition and Validation for Kotoba
-
numas
multidimensional array for efficient computing
-
struct-compression-analyzer
Analyzes the bit distribution of packed structures
-
flatbuffers-owned
that enables a more flexible usage of FlatBuffers
-
mapack
mapbox vector tiles
-
boost_move
Boost C++ library boost_move packaged using Zanbil
-
indexmap-amortized
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
exegraph
no_std execution graph library
-
slablit
Literal for slab creation
-
flat-veb
Fast implementation of vEB trees without internal allocation
-
rscm-core
Core traits and functionalities for the creation of reduced-complexity climate models
-
changed
change detection
-
small-world-rs
The easiest HNSW vector index you'll ever use
-
dyn_vec
A Vec<T: ?Sized>
-
bengbenge
inifity array for round-robin dns, beng, beng
-
contexts
Implements a type for treating several hashmaps as one
-
akita_core
Akita - Mini orm for rust
-
fxd
Fixed-point decimal implementation
-
block-array-cow
In memory array de-duplication, useful for efficient storing of a history of data versions
-
basedrop
Memory management tools for real-time audio and other latency-critical scenarios
-
gcollections
Generic traits over Rust collections library
-
app_properties
reading application properties from a file
-
gamozolabs/rangeset
Pure Rust x86_64 bootloader and kernel
-
ahtable
Array Hash Table implementation
-
prometheus-tokio
A collection of tokio runtime metrics for prometheus consumption
-
pulz-bitset
bitset implementation
-
alive-map
An insertion-order-preserving hash map with O(1)
.remove -
bidirectional-map
A two-way map data structure for small keys and values
-
petitset
An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap
-
twodarray
A 2D array library
-
graphlib_rust
Dagre's Graphlib implementation in Rust
-
weight-cache
A cache that holds a limited number of key-value-pairs according to a user defined criterion
-
erased-type-arena
A type-erased allocation arena with proper dropping
-
runar-schemas
Protobuf schema types for Runar (ServiceMetadata, etc.)
-
fionn-diff
JSON diff/patch/merge for fionn
-
regex-collection
常用正则表达式合集
-
queue-rs
queue
-
rdf-fusion-model
RDF Fusion Model
-
greentic-session
Greentic multi-tenant session manager with in-memory and Redis backends
-
chain-map
A chain of maps with a single view into the aggregated values
-
btree_experiment
implements a BTreeMap similar to std::collections::BTreeMap
-
rsleetcode
Implementations of LeetCode problem solutions in Rust
-
rdf-vocab
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
any_of
A general optional sum of product type which can be Neither, Left, Right or Both
-
rshyper-hmap
implements the hypermap implementation (a map-based hypergraph) for the rshyper framework
-
good_lp
Mixed Integer Linear Programming for Rust, with an user-friendly API. This crate allows modeling LP problems, and lets you solve them with various solvers.
-
make-message-bus
Generate a pub-sub bus for use in async applications
-
hedge
An index based half-edge mesh implementation
-
rust_fixed_width
that allows for easier manipulation of fixed width files allowing for the ability to name fields and such using specs
-
nerio
generic for neural networks
-
witness-core
Core types and cryptography primitives for the Witness timestamping system
-
u64_array_bigints
biginteger library based on u64 arrays
-
cola-crdt
A text CRDT for real-time collaborative editing
-
smart_access
A minimalistic "lazy bidirectional pointer" framework
-
paft-market
Market data models and requests for paft
-
clampf
Clamped floating-point types
-
tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
signet-storage
Unified storage interface for Signet hot and cold storage
-
gtars-scoring
Small, rust utility to compute read overlaps of fragments files over a universe
-
discrete_range_map
DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap
-
normal-rust-types
A common Rust types library for the entire Normal ecosystem
-
bit-index
A little-endian zero-indexed bitstring representation
-
eirproject/libeir_ir
Erlang ecosystem common IR
-
k2_tree
A space-efficient representation of sparsely populated bit-matrices
-
rcbytes
Rc version bytes crate
-
yrs-kvstore
Generic persistence layer over Yrs documents
-
big_unsigned_ints
Big Unsigned Integers ranging from U256 to U2048 using u64 arrays all under a fixed-size of 32
-
plurals
singular/plural forms, mostly in English
-
bytesbox
ByteBox is a high-performance hash map implementation optimized for byte slices. It efficiently maps keys and values of type Vec<u8>, providing full ownership of the data. ByteBox uses…
-
rust_multistack
Support for two-dimentional stacks for the Rust programming language
-
grafana-dashboard
grafana import/export data serializable structures
-
version-rs
A struct for Versions, with the methods you expect
-
hilbert_curve_generator
A WIP Hilbert Space-Filling Curve Coordinate Generator
-
elastic-array-plus
Elastic vector backed by fixed size array
-
differential-dataflow-master
An incremental data-parallel dataflow platform
-
shapemap
RDF data shapes implementation in Rust
-
structured
Data structures to handle large, structured data
-
partial_const
way to handle constant and non-constant values in a unified way
-
judy-wrap
Judy arrays FFI mid-level binding
-
priority-expiry-cache
A cache that evicts items based on their priority and expiry time (LRU + TTL) Add (O(1)), Get (O(1)), Evict (O(1)) in both time and space
-
quantus-miner-api
API definitions for communication between Quantus node and external miners
-
incrementalmerkletree-testing
Common types, interfaces, and utilities for testing Merkle tree data structures
-
fast_collections
noheap zero copy collections
-
engcon
macros to define (eng)ineering (con)tracts on data-structure level
-
geomprim2d
2D geometric primitive types
-
priority_container
Datastructure to find n biggest/smallest items within a large set
-
weak-self
WeakSelf is simple way to have a Weak pointer to yourself
-
building_blocks_partition
Acceleration structures for spatial queries on voxel data
-
inditech
A set of technical indicators for time series analysis
-
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
wolf-derivation-graph
Adds support for memoizing data flow graphs to wolf-graph
-
viral32111-xml
XML parser crate for my Rust projects
-
german-str-borrow
German/Umbra-style strings. Data is borrowed, static, or inlined
-
nook
Useful types with niches
-
sys-mumu
System calls and tools plugin for the Mumu ecosystem
-
nanoset-py
A memory-optimized wrapper for Python sets likely to be empty
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
atlas-rb-tree
A textbook implementation of a Red-Black Tree
-
break_array
For breaking array indexing
-
tar-no-std
read Tar archives (by GNU Tar) in
no_stdcontexts with zero allocations. The crate is simple and only supports reading of “basic” archives, therefore no extensions, such as GNU Longname… -
bitint
Integer types that have a logical size measured in bits
-
palettevec
A palette compressed vector library for potentially insane runtime compression ratios
-
ropey
A fast and robust text rope for Rust
-
iostream
the project is rust io stream.you can easily use it to manipulate files stream and memory stream
-
copse
Direct ports of the standard library’s BTreeMap, BTreeSet and BinaryHeap collections, but that sort according to a specified total order rather than the
Ordtrait -
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
funnel
data structure that makes it easy to read from multiple channels from a single source
-
mesura
A lightweight library for metrics gathering, Prometheus compatible
-
smallbigint
Big integer types that have a small on-stack representation for small values. Uses num-bigint internally.
-
fast_set
A set of usize with O(1) creation, add, remove, contains, and clear functions
-
keyed
Implement comparison traits by specifying a key
-
bagofholding
collection types. Efficient data structures that look bigger on the inside.
-
nl-compiler
AIG and Verilog frontend compilers
-
hpo
Human Phenotype Ontology Similarity
-
one-stack-vec
OneStackVec could contain any number of item like
Vec, and it does heap allocation only when it contains more than one item -
sized-vec
Type level sized vectors
-
collectivity
Generic collection traits
-
srcpos
Structure of the location in the source code
-
cbsk_log_tokio
log tool, using tokio as the runtime
-
xsd
XSD.rs
-
index_vec
Newtype-style helpers for
Vecandusize -
basic_tree
basic tree for rust, for now including only trie
-
hkalbasi-rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
libpaprika
read and generate Paprika recipe files and recipe collections
-
globalvar
declaring a global variable
-
quadboard
Typed fixed-length buffers of chess pieces
-
sketchddd-core
Core categorical semantics and data structures for SketchDDD
-
rand_set
A hash set with O(1) random element access and all standard set operations
-
priq
Array implementation of the min/max heap
-
color_names
map [r, g, b] values to the color name it corresponds to. Note that this lib is rather large and can increase compile time drastically.
-
ndim
N-dimensional array for numerals in Rust similar to NumPy
-
swimmer
Thread-safe object pool type
-
rl-bandit
multi-armed bandit implementation
-
subset-map
A map where the keys are subsets of an initial set of elements
-
amplify
Amplifying Rust language capabilities: multiple generic trait implementations, type wrappers, derive macros
-
binary_sort_tree
二叉树的new,insert,del,search等方法
-
sot
Object Tree
-
hdrhistogram
A port of HdrHistogram to Rust
-
ospf-rust-multiarray
A multi-array utils for ospf-rust
-
flammkuchen
Some data structures for fun and flammkuchen (e.g. a 2d grid which permits negative indices)
-
version-lp
a version struct library for use with version comparing, and wildcard resolving
-
compare
Experimental comparators for collections to be generic over
-
pipebuf
Efficient byte-stream pipe buffer
-
partial
Optional monad with fake variant
-
strune
directional knowledge structure library for building linked references and word books
-
strawberry_fields
Consume, read, and mutate struct fields with an iterator-like api
-
lineartree
tree data structure for rust
-
collect_result
collecting an iterator of results into a result of a collection
-
pas
strided slice
-
activitist
Models of ActivityPub
-
deep_causality_ast
AST data structure for deep_causality crate
-
epoch-timestamp
Boilerplate collection for epoch timestamping
-
croaring-sys
Raw bindings to CRoaring
-
dequemap
A no_std compatible implementation of the dequemap crate
-
sweetrpg-model-core
Core model definitions for SweetRPG
-
chunked-bytes
A rope-like non-contiguous buffer for efficient data structure serialization and vectored output
-
Sparse-Voxel-64Tree
A lib for handling Sparse Voxel Contrees
-
simplecountry
Country Library
-
jirachi
A collision resistant runtime agnostic key-generator
-
teloader
Loader of Total Editor's level files (*.te3)
-
ordered-map
A HashMap, with the capability of accessing the keys and values in order
-
automap
pattern to implement key-value maps where the value type contains the key type
-
butterfly-common
Common utilities for the butterfly-osm toolkit
-
foliage
Abstract syntax tree for first-order logic with integer arithmetics
-
processing_chain
set up processing chains of large amounts of data
-
tiny-artnet-bytes-no-atomic
Vendored copy of Bytes fork for use in tiny-artnet. Types and traits for working with bytes
-
kodiak-taxonomy
manage generic taxonomies supporting unique features
-
vec-entries
Entry API for iterating over and removing elements from a
Vec -
crdt_tree
Tree Conflict-free Replicated Data Type (CRDT)
-
osmgraph
Convert OSM queries into graphs
-
sparse-bin-mat
A sparse implementation of a binary matrix optimized for row operations
-
linked-list
An alternative implementation of std::collections::LinkedList
-
dashmap-shard
port of Google's SwissTable hash map
-
dynamic_bitset
A dynamic bitset using a vector to store 32 bit unsigned integers. Provides a serde feature flag to enable Serialization and Deserialization of bitset
-
bitset-matrix
Space-efficient, row-major 2D bitset matrix with fast bitwise ops
-
kv6
Collection of structs to allow reading of Ken Silverman's voxel formats
-
planspec-core
Core types and validation for PlanSpec declarative work orchestration
-
handler_map
Map from types to functions that receive them
-
actions
Software without side-effects. Redo and Undo. Macro's.
-
microstr
Stack-allocated string with fixed capacity
-
raii-map
Map and set types in Rust in which the presence of the entry in the data structure is tied to the lifetime of a RAII handle returned by the insertion
-
portable-string
Static-length strings without any allocations
-
inline-css
Embed CSS directly in your Rust code
-
curri
Functional Programming Tools
-
validiter
Iterator adapters for validating iterations
-
guppy
Track and query Cargo dependency graphs
-
multi_key_map
a hash table that shares one value across multiple keys
-
typescript-definitions-ufo-patch
serde support for exporting Typescript definitions
-
igraph
A graph representation data structure with a built in index on keys
-
bytes_deque
A growable bytes deque in Rust, providing access to the raw pointer
-
syntastic
Generic abstract syntax representation
-
tinyid
A tiny ID type that's like UUID except shorter and easier for a user to type in
-
dynprops
Creating and extending objects with typed dynamic properties
-
string-wrapper
A possibly-stack-allocated string with generic bytes storage
-
tree-graphviz
Generate GraphViz DOT directed trees, based on an arbitrary tree structure
-
ensure
target state of an object
-
htmldom_read
HTML reader that parses the code into easy-use tree
-
chunky
Abstract storage of heterogeneously-sized entity-collections
-
win-idispatch
that aims to provide a more ergonomic way of working with idispatch in winapi based projects
-
orx-imp-vec
ImpVecstands for immutable push vector 👿, it is a data structure which allows appending elements with a shared reference -
ipfrs-core
Core content-addressing primitives and data structures for IPFRS
-
nave
Thinking about the construction of distributed systems starting from the *consistent hash* algorithm
-
regd-testing
regd testing is a collection of utilities designed to simplify testing in regd projects
-
minecraft_end_generation
The minecraft end generation implemented in rust
-
numr
High-performance numerical computing with multi-backend GPU acceleration (CPU/CUDA/WebGPU)
-
finite-automata
A collection of extendable finite automata with immutable state and transition data
-
sdsl
interface for the Succinct Data Structure Library
-
octarr
dynamic cubic octree capable of storing class data, accessed via indexers
-
collectable
Fallible, no_std-friendly collection traits
-
deep-diff
A small crate to deeply diff serde_json::Value trees
-
file_lookup
functions to search up in the file tree for a file by name
-
rsurf
A data structure providing range query filtering with Fast Succinct Tries
-
quantized-density-fields
Quantized Density Fields data structure
-
bitworks
meant to provide easy to use bitsets with emphasis on safety
-
semver-store
An HashMap structure that uses semver strings as keys
-
runtime-sized-array
A variable-length array, also called runtime-sized
-
multipath
split file path, like
/home/{user,admin}/file.txt -
fast_forward
Quering collections blazing fast
-
trans-gen-kotlin
Generating Kotlin trans code
-
gauze
Probabilistic set membership filters with a simple interface
-
tan-lints
A collection of lints for the Tan Language
-
datazoo
Bitset and jagged array data structures
-
ro
stuff read-only
-
hson
JSON like format for HTML. Allow querying the data through searching methods similar to client-side DOM queries methods
-
hayami
general use symbol table
-
typed_index_collection
Manage collection of objects
-
sliding_tree
A tree that grows from the leaves and recedes from the root
-
try-push
A trait for attempting potentially expensive actions
-
qualified_do
Composable _qualified_ do expressions for Rust, supporting monad- and applicative-like structures
-
rstmdb-core
State machine engine for rstmdb - definitions, transitions, guard evaluation
-
apid
Collection of type definitions from several APIs
-
rand_map
A map that creates a random handle on insertion to use when retrieving
-
wunderkammer
Entity-Component storage for tiny games
-
woodland
Easy to use implementations of popular tree data structures such as Binary, Binary Search, AVL, Red-Black, and more
-
threshold-dict
A data structure to find smallest key that is larger than the query
-
string-err
String error type
-
gridd-euclid
euclid-compatible grid data structure (forked from Frosh_VII's gridd)
-
hash_table_datastruct
Adds a HashTable type, allowing to store values in a table with integer-indexed rows and hashable keys for columns
-
tinystr-raw
Raw string-to-integer conversions for tinystr
-
bo4e-core
Core types for BO4E (Business Objects for Energy)
-
pciids
parse the pci.ids data file
-
codemap2
maintained fork of the codemap crate that contains a data structure for efficiently storing source code position and span information (e.g. in a compiler AST), and mapping it back to file/line/column locations for error…
-
hexga_array_vec
A vector with fixed capacity, backed by an array based on arrayvec
-
omega-persistence
SQLite-based persistence layer for ExoGenesis Omega with schema migrations and transactions
-
fido-types
Shared types for the Fido social platform
-
merkle-lite
fast, and composable binary Merkle tree and proof for Rust Crypto hash functions
-
wolf-graph-mermaid
Adds support for generating Mermaid diagrams from wolf-graph graphs
-
bufferring
Ring buffers for Rust
-
traitgraph-algo
Graph algorithms based on the traitgraph crate
-
apint
Arbitrary precision integers library
-
arrav
Sentinel-based heapless vector
-
bitsvec
A bit vector with the Rust standard library's portable SIMD API
-
no_debug
Helper types to omit debug info for select values
-
ds-bst
Binary search tree implementation
-
erased_set
A set of erased types
-
libarena
Arena allocated graph implementation
-
hash_arr_map
Hash maps with an array part, like Lua's tables
-
median-heap
A median heap implementation in Rust, used to keep track of a running median of a sequence of numbers
-
bytering
A ring buffer specialized for vectored reading and writing in blocking and async I/O
-
mini_uuid
A small and URL-safe UUID crate for Rust
-
banyan
Persistent indexable tree data structure
-
libflow
grouping network flow data
-
kodiak-sets
manage generic sets supporting unique features
-
dawgdic
Port of DAFSA in safe Rust (original implementation courtesy to Susumu Yata)
-
smart-string
A collection of string types and traits designed for enhanced string manipulation
-
markov-generator
Highly customizable library for building Markov chains and generating random data
-
xdag
DAG(Directed Acyclic Graph) lib
-
tree-cursor
non-intrusive tree cursor that supports node mutation without Cell/RefCell
-
pgat
Proxy GAT: Abstractions for generic proxy views with GAT to enable generic container types
-
hexarr
working with hexagonal grids
-
tiny-test
tiny-testis collection of functions simplifying test assertions in rust -
one_way_slot_map
SlotMap with minimal restrictions on Keys and Values
-
standards
A collection of standards for international trade facilitation
-
freezable
immutable data
-
array_map
Map backed array for fixed size keys with O(1) performance
-
foyer-intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
nodegraph
A data structure in rust describing a graph of nodes, where each node may contain arbitrary data
-
cgp-core
Context-generic programming core traits
-
datastruct
A pure-data structure builder
-
hash-trie
Hash Array Mapped Trie (HAMT) Immutable Set Implementation
-
yuuang_petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
ov
a collection of traits that allow you to chain off of anything
-
wildland-catlib
Wildland Catalog Library client
-
itc
Interval Tree Clocks as described in the itc2008 paper
-
lim-bit-vec
Limited bit vectors
-
data_structure_traits
data structure collection traits
-
simple-bitrange
manipulating bit ranges which is common when working with IC registers
-
multipeek
An adapter to peek at future elements in an iterator without advancing the iterator cursor
-
arbitrary-int
Modern and lightweight implementation of u2, u3, u4, ..., u127
-
big_enum_set
creating sets of enums with a large number of variants
-
spaceindex
-
magnetise
asses the similarity between SQL queries
-
portdiff
Data structure for fast local graph rewriting
-
shoo
blackjack games and trainers
-
dynsequence
Sequence-Like data-structure for storing dynamically sized types
-
aggregate-map
Collect key-values pairs into a mapping from keys to collections of values
-
seq-set
A Set collection that maintains insertion order
-
specado-schemas-temp
Provider and prompt schema validation helpers for Specado
-
distant-protocol
Protocol library for distant, providing data structures used between the client and server
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
colours
Color types for different color models with conversions between it
-
syntree
A memory efficient syntax tree for language developers
-
path-value
Universal type and access property(s) by path
-
inline-str
Efficent and immutable string type, backed by inline-array
-
pi_sinfo
used to describe the 'structure', that is, the meta information of the structure
-
typed_polars
A statically-typed wrapper around Polars for compile-time type safety
-
artie_common
Common Library for Artie Rust Projects
-
rbtset
A set based on a RB-Tree for efficient operations
-
id_sys
data structures which can be marked such that they only work with similarly marked integer data types
-
ligature
Ligature's data model in Rust
-
froggy
prototype for the Component Graph System programming model. It aims to combine the convenience of composition-style Object-Oriented Programming with the performance close to Entity-Component Systems
-
future-fn
providing macros to simplify the creation of asynchronous closures with external state captured by move. Useful for structuring asynchronous code with ease and clarity.
-
balloc
Bounded allocation datastructures
-
append-only
Append only versions of std data structures
-
prfx
Prefix Tree
-
xio_instructionset
XIO instructionset data structures
-
simple-matrix
generic matrix library
-
cli_tree
A CLI tool to generate a tree of user defined nodes
-
fionn-crdt
CRDT implementations for fionn
-
rsor
Reusable slice of references
-
atomic-slot
lock-free, atomic slot for transferring ownership of Box<T>
-
jagged_array
Owned
[[T]]-like 2D array where each row can differ in length -
genindex
Generational index library
-
alo
ALO means At Least One. It could contain any number of item like
Vecbut it does not heap allocation if it contains only one item -
tongrams
Tons of N-grams
-
equivalence
Trait and derive macro for comparing and hashing types modulo an equivalence relation
-
usage
A convenient alternative to the newtype pattern
-
colony
A fast associative data-structure that chooses its own keys
-
another-option
option data type; useful when allocations are expensive
-
weakheap
Weak Heap data structure implementation in Rust
-
bounded-vec
Non-empty rust Vec wrapper with type guarantees on lower and upper bounds for items quantity
-
bfield
B-field datastructure implementation in Rust
-
bitaccess
Macro for efficient and type-checked access to individual bits of a variable
-
setting
The styles of all graphics elements
-
recursive_array
arrays using recrusive data structures to avoid limitations of the rust compiler
-
ketsugou
merges two arrays
-
total-maps
Maps where every possible key has an associated value
-
unicase_collections
Collection of UniCase datastructures
-
json-node
A way to work with JSON as a node tree
-
serde_either
set to enums to deserialize and serialize data that can either be string, struct or vec
-
awid
Small, simple, universally unique identifiers
-
cosmic_undo_2
Undo and redo done the right-way
-
whirlybird
generic type implementations for RedMaple library, that offers workflows for different events compatible with common contents like todos, blogs and etc
-
field_accessor
A procedural macro to get and set a struct field by String dynamically
-
stac-duckdb
Client for querying stac-geoparquet using DuckDB
-
cobt
A Cache-Oblivious B-Tree implementation in Rust
-
shared-vec
Efficient shared container types
-
unthbuf
Unsigned N-bit Buffer: A structure that holds a fixed buffer of
bits-sized unsigned integer elements -
pure-hfsm
A finite state machine library with a clear separation between the machine definition and its changing state
-
llmcc-core
llmcc brings multi-depth architecture graphs for code understanding and generation
-
uguid
GUID (Globally Unique Identifier) no_std library
-
rstructure
A thread-safe data structure library
-
kn0sys_ndarray_rand
Constructors for randomized arrays.
randintegration forndarray. -
sbbf-rs-safe
Split block bloom filter implementation
-
alignment-exporter
Proc macro providing alignment info for a user-defined struct
-
grid_trait
2D and 3D grids with combinators
-
mumu-test
Test suite plugin for the Lava language
-
cset
Fine-grained and reversible struct transactions
-
tokmd-types
Core data types and contracts for tokmd. Tier 1 stability.
-
immutable-avl
An Immutable map and set implement for rust based on an AVL tree
-
gridava
2D coordinate systems
-
ax_banyan
Persistent indexable tree data structure
-
partitions
A disjoint-sets/union-find implementation that allows for efficient iteration over elements of a set
-
cumulfreqtable
A Cumulative Frequency Table implemented with a Binary Indexed Tree
-
dd_statechart
A Data-Driven implementation of Harel Statecharts designed for high-reliability systems
-
gsrs
Generic Self Referencing Struct
-
varflags
exporting varflags macro, allowing to use unit-like enums in conjunction with Varflags struct to create easy to use bitflags data structure defined over enum variants
-
largeint
that supports large integer arithmetic
-
hashcons
Hash cons'ing for compact representations of shared, immutable data structures
-
golomb-coded-set
BIP158 Golomb-Coded Set data structure
-
miniqueue
A minimalistic single-thread job queue based on fold/reduce
-
pretree
package for storing and querying routing rules with prefix tree. Pretree 是一个用于存储和查询路由规则的包。它用前缀树存储路由规则，支持包含变量的路由。
-
nb-tree
Very simple tree structure with generic node and branch data
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
bitarr
A fast and efficient Rust implementation of a BitSet, supporting multiple backing stores
-
swamp-core-extra
Rust runtime implementations for Swamp core library collections (Vec, Map, Grid, Stack, etc.)
-
mux-radix-tree
A full-featured radix tree implementation
-
tree-iter
iterating over tree structures
-
hyperbitbit
data structure
-
pathlink
A URL type whose path can also be used as a filesystem path, for Rust
-
rand-select
a tiny choice selector
-
simple-undo
Easy to use undo-redo library
-
kn0sys-ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
hdf5-hl
High level bindings to HDF5 High Level API
-
hedel-rs
A Hierarchical Doubly Linked List
-
stateset-core
Core domain models and business logic for StateSet iCommerce
-
generational_array
A small package to handle generational arrays and prevent the ABA problem while reusing unused space
-
poetrie
Poetic trie crafted with intetion to ease searching of rhymes for poems
-
merkle-log
"Merkle Tree-Structured Log" defined in the paper "Transparent Logs for Skeptical Clients." https://research.swtch.com/tlog
-
Project2
Implementations of red black tree and AVL tree
-
shogiutil
A collection of tools to handle shogi data
-
tbytes
A tiny library for reading and writing typed data into buffers
-
free-ranges
An efficient data structure for keeping track of indices which are either free or not
-
atelier_dcml
Distributed Convex Machine Learning for the atelier-rs engine
-
bit-vec-omnitool
A vector of bits
-
lookups
Improve the data retrieval operations for collections
-
indexland
Rust Collections with Newtype Indices
-
vecbool
bit vector built on top of Vec<u8>
-
kukoo
lockfree cuckoo hashmap
-
fpdec-core
Common constants and functions for crate fpdec
-
artful
Low-memory overhead and high-performance adaptive radix tree
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
iter-group
grouping (key,value) iterators into maps of collections
-
trait-based-collection
A trait-based collection library that implement different data structures using the same trait
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
staticsort
Implements a macro providing a compile-time quicksort function for arrays of any length, containing any primitive Copy type with a PartialOrd implementation
-
m6coll
Small Smart Collections using prefix m6
-
chtholly_tree
Rust bindings for Chtholly Tree
-
benchmark-counters
Light-weight data structures to help with monitoring and benchmarking
-
gtars-refget
refget standard for accessing reference sequences
-
nebz
an immutable non-empty bytes container
-
amalgamator
A set/map like data structure that allows you to combine members together
-
grapes
Persistent graph data structures: Tree, Graph, Arena & more
-
pollination
An experimental library exposing hybrid Raft and CRDT primitives
-
lazy_simd
Trait based SIMD acceleration and safe abstraction
-
riblt
Rateless Invertable Bloom Lookup Table (RIBLT) data structure
-
mvbitfield
Generates types to work with bit-aligned fields
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
cycle_map
Implementations of bi-directionally accessible hashmaps
-
sum-queue
Queue struct that keeps a fixed number of items by time, not capacity, and allows to get summarized stats of its content
-
data-buffer
low-level data buffer type useful for IO and in homogeneous collections
-
span-map
A data structure for efficiently managing sets of values over spans/ranges
-
const-vec
Vec-like data structure with immutable push method
-
omega-loops
7 temporal cognitive loops from Reflexive (1ms) to Transcendent (10y) for multi-scale processing
-
anylist
a list type for any type
-
faex
A fast and efficient Compact Data Structures Library
-
pathmod_core
Core runtime for pathmod accessors
-
dotreds-binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps. Makes some previously internal function public
-
slotmap-fork-otter
Slotmap data structure - temporary fork for Otter
-
segmented_array
Segmented array (growable, append-only) data structure
-
arenas
Arena data structure for efficiently adding & removing items with stable IDs
-
bittyset
A BitSet type for manipulating bit sets
-
ident
wrapping types with an immutable identifier and storing/accessing such types in collections
-
very_simple_trie
A Trie or prefix tree is a specialized tree-like data structure used for efficient storage
-
fplist
An immutable, persistent, singly-linked list
-
abstract-bits
Turn any combination of bit and byte fields into a structs
-
min-heap
A Min Priority Queue implemented as a Thin Wrapper around BinaryHeap from the Standard Library
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
reusable-vec
A Vec wrapper that allows reusing contained values
-
another_radix_trie
Rust built radix tree library
-
dstructs
A collection of high-performance data structures for Rust
-
arboriter
A tree traversal primitive for Rust, inspired by Tyler Glaiel's blog post
-
microcrates-bytes
Types and traits for working with bytes (with no_std support by default)
-
setbits
Create an unsigned integer with the high/low
nbits set to1 -
fn-map
Abstraction around HashMap. Uses closure to compute and store value.
-
keylist
Elixir keyword list in Rust
-
bose_einstein
A data structure that efficiently partitions elements into two sets
-
louds
LOUDS implementation for Rust
-
nested
A memory efficient container for nested collections (like
Vec<String>orVec<Vec<T>>) -
field-ref
Field reference (like a member pointer to non-static data field in C++) for Rust
-
taskai-schema
Schema definitions for TaskAI - structured task representation for AI agents
-
final
Wrap a value in a type that does not give out mutable references
-
sequential_gen
sequential generator
-
ecstatic
Statically-typed ECS library
-
tzarrays
Optimal resizable Arrays
-
graphstack
Graph-structured stack
-
unsure
handling unsure (optional) values that might fail, with an additional rejection variant
-
passive
A trio of marker traits to classify passive data structures
-
skp-validator-actix
Actix Web integration for skp-validator - high-performance validation for Actix services
-
index_graph
Graph library that only stores indexes from a base array
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
vbox
type erased Box of trait object
-
stackvector
StackVec: vector-like facade for stack-allocated arrays
-
smallgraph
A small graph based on smallvec
-
jui_file
file tool
-
eztd
Quick start Rust
-
stable-map
A hash map with temporarily stable indices
-
slots
Fixed size data structure with constant-time operations
-
rustupolis
tuple space data structure in Rust
-
hkalbasi-rustc-ap-rustc_graphviz
Automatically published version of the package
rustc_graphvizin the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
prototty_menu
Prototty menus
-
boost_date_time
Boost C++ library boost_date_time packaged using Zanbil
-
num-bigfloat
Increased precision floating point numbers implemented purely in Rust
-
cmp_wrap
Let you compare structes by context
-
b-tree
A persistent B+ tree using freqfs
-
hardly-trie
efficient trie data structure implementation
-
thread_aware_macros_impl
Macros for the thread_aware crate
-
splay
native implementation of a Splay Tree for Rust. Splay Trees are self-balancing binary search trees which adapt dynamically to lookups over time to allow common access patterns to frequently have better than log(n)…
-
prust-lib
Persistent & Immutable Data Structures in Rust
-
swaybar-types
building swaybar status commands in rust
-
hv-alchemy
Heavy Alchemy - the black arts of transmutation, wrapped for your safe usage and enjoyment
-
minimal_perfect_hash
Fast minimal perfect hashing (PT-style): per-bucket seeds, deterministic build, O(1) lookups
-
hamt-rs
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell
-
rdf-format
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
building_blocks_storage
Efficient storage for maps on sparse or dense, 2D and 3D integer lattices
-
jsonpath-rust
basic functionality to find the set of the data according to the filtering query
-
dispatchtable
Small library used to specify function dispatch tables HashMap<K, Box<Fn(..)>>
-
single_byte_hashmap
HashMap for storing singular bytes as keys
-
zond
standard rust collections but with collecting statistics
-
attuned-store
Storage traits and in-memory backend for Attuned
-
st_ring_buffer
A fixed-size String implementation using a ring buffer
-
kcr_forklift_konveyor_io
Kubernetes Custom Resource Bindings
-
tsil_cev
LinkedList on Vec
-
avl-cont
A contiguous AVL Tree
-
radyx
A basic radix tree implementation
-
vertree
A persistent trie where each node is typed and versioned
-
extended-collections
An extension to the collections in the standard library with various data structures
-
gtrie
Generic trie implementation with a support of different key and value types
-
dag_compute
construction of arbitrary computation DAGs and the expression of dataflow graphs
-
persistent_rope
An immutable persistent rope data structure
-
bitmaptrie
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
-
fix_float
Fixed floating types that allows useful trait implementations and datastructures on float numbers
-
prefix-tree
A map and set interfaces using trie data structure
-
parse_tree
A non-abstract syntax tree type
-
cacheline-ef
Per-cacheline encoding of sorted integer sequences
-
lz_diet
An AVL balanced Discrete Interval Encoding Tree
-
ttgraph_macros
Proc-macros for TTGraph
-
either-both
An enum similar to the well-known
Either, but with aBothvariant -
trailer
Store a type with an associated buffer in contiguous memory
-
kd-tree-rs
k-d tree
-
qu-miner-api
API definitions for communication between Quantus node and external miners
-
im_interval_tree
An immutable data structure for storing and querying a collection of intervals
-
scoped_stack
A scoped stack data structure
-
ranno
Annotations over recursive data structures
-
fixed-queue
no_std, no_alloc, use [T; N]. support
Vec/VecDeque/History -
gentrix
that adds the Matrix typed using generics that is basically a wrapper around a 2D Vector
-
nslice
Structures for interpreting slices of variable length as arrays
-
libreda-splay
Splay map and splay set data structures
-
nearest-derive
Derive macros for the nearest crate
-
div-int
Rational numbers with a compile-time denominator
-
memcell
providing a MemoryCell struct, which stores a current and previous value
-
treaplist
A Treap-based list implementation
-
bloomz
A fast, flexible Bloom filter library for Rust with parallel operations support
-
polars-structpath-types
Common objects for polars-structpath and polars-structpath-derive
-
linkedin-csv
Structs defined to hold the data as exported from LinkedIn
-
vec_key_value_pair
A drop-in replacement for std::HashMap and std::HashSet that use Vec on the backend
-
fill_canvas
FillCanvas is a wrapper around a matrix with special methods to fill the cells
-
get-full-year
An unofficial Rust client for getfullyear.com that helps you get the full year
-
phago-viz
Browser-based real-time visualization for Phago colonies
-
paft-aggregates
Aggregated info snapshots built on paft primitives
-
ramp_table
RampTable, a data structure useful for certain specialized situations
-
graphific
graph data structure library
-
binartree
Binary Tree realisation
-
aabel-multihash-rs
extends Hasher trait. The added functionality allows users to get sequeces of hash values. It can be used inside of implementations of probabilistic data structures such bloom filter or count-min.
-
vec-dimension-shift
N-Dimension shift features for Vec<T>
-
restor
A dynamic resource storage system in rust
-
vec-x
structure
VecXto manage fixed-length arrays, supporting numeric operations and assignment operations betweenVecXand scalar values -
pyrpds
Python Wrapper for Rust Persistent Data Structures
-
tree-mumu
Creates Linux
tree-style renderings of MuMu values -
hashable_rc
Hashable wrappers for reference countings
-
simploxide-bindgen
SimpleX-Chat API types and client generator
-
form_builder
building forms with various fields and validation
-
bounded
numeric types
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
atelier_base
Core data structures and I/O tools for the atelier-rs engine
-
schema2struct
Convert a JSON schema into Rust structs for efficient and type-safe data management
-
key_set
KeySet representing concepts of All, None, Some(list), and AllExceptSome(list), with basic set calculations (intersection, difference, inverse)
-
tagged-tree
A tree-like data structure where the values are tagged
-
truetree
Trees in Rust
-
hubs
The horribly unsafe buffer structure
-
union-find-rs
Disjoint-set forest implementation to support the union-find algorithm in Rust
-
tuplities-try-from
Traits for fallible conversion of values into tuples
-
ladata
& modular data model
-
ternary-tree-wasm
A simplified Wasm binding to ternary-tree crate
-
arc-bytes
A reference-counted byte buffer
-
token_deque
A double-ended queue backed by a vector that allows access to interior values
-
disjoint-hash-set
A disjoint set / union-find data structure suitable for incremental tracking of connected component identified by their hash
-
computed_map
proc-macro crate for generating indexed maps with computed fields and indicies
-
flat_enum
Expand nested enum into flattened enum
-
cutoff_list
A linked-list structure where each element tracks how many predefined "cutoff points" precede or coincide with its position in the list sequence
-
ReSet-Lib
Data structure library for ReSet
-
hashable_weak
A hashable weak pointer
-
weak-lists
Lists with weak references and concurrent iteration and modification
-
handlemap
A collection that produces handles that can be used as keys to retrieve the stored items
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
more_collection_macros
Adds new macros to rust for creating collections
-
hashable-map
Wrappers for HashMap and HashSet that implement Hash
-
algods
A collection of data structures and algorithms
-
bmap
A bitmap with an internal counter
-
packbytes
Convert structures to and from packed representavises - byte arrays of fixed size that live on stack
-
cbsk_unique
unique value generator
-
grit-bitvec
BitVec, a vector type that can store fixed-width data with irregular bit widths
-
heapq
Priority Queue with scoring function
-
touch-selection
Selection data structure intended for touch and single button devices
-
forgetful
Track and forget values within a specific scope, enabling detection of repeated values
-
wolf-graph-dot
Adds support for generating Graphviz DOT files from wolf-graph graphs
-
simple-bst
A bst implementation
-
decoded-char
wrapper to keep track of the original byte length of a decoded character in the encoded source file
-
serde_single_or_vec
Type which can be deserialized from either a sequence or a single value
-
running_buffer
data types for keeping track of changing values, allowing analysis in trends and histories
-
simple_ringbuf
Ringbuf is a speedy lightweight fixed-size infinite-use collection optimized for straightforward single threaded use
-
trans-gen-dlang
Generating D trans code
-
cbsk_log_rayon
log tool, using tokio as the runtime
-
cbor-tag-index
Tag index
-
secured_linked_list
A cryptographically secured and provable linked list
-
kvv-efa-api
Rust bindings for the KVV (Karlsruher Verkehrs Verbund) "EFA"-API
-
pinus
A prickly BTreeMap. You can insert through shared references and values are pin-projected.
-
default-vec
A specialized vector that has a default value
-
cervine
A slightly more flexible Cow; roughly to T: Borrow<R> as alloc::borrow::Cow is to B: ToOwned
-
local_vec
fixed-capacity vector allocated on the stack
-
ABtree
AVL and Btree for rust
-
broomdog
A type-erased map with 'indefinite loanership'
-
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
kcr_mutations_gatekeeper_sh
Kubernetes Custom Resource Bindings
-
nimrodshn-btree
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite
-
hecs
A fast, minimal, and ergonomic entity-component-system library
-
mdcs-merkle
Merkle-Clock DAG for causal history tracking in the Carnelia MDCS
-
mrkl
Generic, minimalist, parallelizable Merkle tree
-
sbf-blake3
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
graphia
graph data structure
-
grdf
Generalized RDF graphs and datasets
-
traitgraph-dimacs-io
Functions to read and write graphs in DIMACS format
-
causal-length
CRDT's based on causal length sets
-
kurve
Adjacency list graph data structure
-
intsplit
splitting numeric types into their binary component arrays
-
modql-macros
Macros for modql. Not intended to be used directly.
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
objectionable
storage of unsized types inline inside allocated objects
-
not_empty
Slices and vectors that are statically guaranteed to be not empty
-
frbf
robust, and efficient implementation of the Bloom Filter data structure in Rust
-
embedded-async-helpers
staticfriendly helpers for async on embedded -
growable-bitmap
A growable (and shrinkable) compact boolean array
-
simple-file-manifest
Interact with lists of files through a storage-agnostic interface
-
bipbuffer
Simon Cooke's Bip-Buffer
-
bloom_filter_plus
rust_bloom_filter
-
dynamic-grid
Dynamic grid Structure for Rust
-
fixed-collections
Dynamically allocated ungrowable collections
-
bitrush-index
A serializable bitmap index library able to index millions values/sec on a single thread
-
atomic_lifo
Lock free thread-safe lifo for rust
-
collections-more
Common data structure and algorithms for rust-lang to complete the already excellent std::collections
-
merged_range
rangeset that can merge overlap
-
tiny-bitstream
Standard implementation of a classic bitstream library
-
store-interval-tree
A balanced unbounded interval-tree in Rust with associated values in the nodes
-
zsling
Rust Wrapper around a Sequentially lockign (SeqLock) Ring Buffer written in Zig
-
siebencorgie/jakar-tree
-
cursed-collections
Collections that (seem to) break Rust safety
-
ascii_num
digit to ascii numbers
-
pathtree
An immutable tree data structure for fast path operations
-
two_three
A two-three (2-3) tree implementation in Rust. Includes a map and set interface
-
hylo-fix
Fixed-point number types with Solana Anchor support
-
mori_parallel
parallel orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data…
-
byte_set
Efficient sets of bytes
-
prefix_sum
prefix sum data structure
-
mumu-array
Array tools plugin for the MuMu/Lava language
-
bloom
Fast Bloom Filter and Counting Bloom Filter implementation
-
twie
fast and compact prefix tries
-
schema-registry-core
Core types and traits for the LLM Schema Registry platform
-
dastral
Reduce boilerplate code, learn data structures & algorithms with Dastral
-
array_stump
A data structure mixing dynamic array and sorted set semantics
-
maybe
An enum similar to Option but can also represent undefined values
-
sesstype
Multiparty Session Types
-
container_traits
Traits for container types
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
front-vec
Efficiently-prependable Vec and String types
-
wired
WIP: Collection of embeddable database models for Rust
-
wrapping
slices and arrays
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
boomphf-patched
Scalable and Efficient Minimal Perfect Hash Functions (version modified by Piotr Beling)
-
triskell
A tri-partite ring buffer
-
crdt
Conflict-free Replicated Data Types for Rust
-
quotient-filter
A quotient filter implementation
-
push-while-ref
push while having a reference
-
backtracking_iterator
generic iterator with an item history, capable of backtracking and forgetting
-
skog
Adobe's stlab::forest data structure
-
valet
Stores your objects and gives you a tag to retrieve them later
-
stable_node_set
An ordered set with handles to values
-
batbox-approx
Approximate comparison
-
graphix_algs
Algorithm extensions for graphix: connected-components, contraction, and MST routines
-
ordered-vecmap
Ordered map and set based on vectors and binary search
-
language-objects
Work with language objects for localization
-
no_std_collections
Auxiliary structures and traits for using dynamically resizable arrays (Vectors) in flexible environments, supporting both std and no_std contexts
-
Xorfilter
No alloc membership approximation
-
graph-api-test
Test utilities and property-based testing for the graph-api ecosystem
-
ranged_integers
An integer restricted to a compile-time defined bounds driven by const generics
-
unempty
Non-empty data structures for Rust
-
shelves
Storing values referenced by a unique typed index
-
kvstructs
General basic key-value structs for Key-Value based storages
-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
no_vec
modifying sized arrays
-
crio
An easy to use persistent data storage library
-
contextual
deal with data in context
-
identifier
Generate 128 bits id structs easily
-
tuco
Tuco can automatically generate tuple representations of simple types. This is helpful if you want to create an API using plain types. Or if you want to provide an easy way to convert between types.
-
compressed_vec
Floating point and integer compressed vector library, SIMD-enabled for fast processing/iteration over compressed representations
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it's own. Very similar to Slab.
-
kcr_rocketmq_apache_org
Kubernetes Custom Resource Bindings
-
gguppy_data
Traits and adapters used by gguppy for dataframe access
-
rt_map
Runtime managed mutable borrowing from a map
-
overlay-map
A two-layered map data structure for Rust that tracks current and previous values for each key — with zero-clone, in-place state transitions
-
typed_id
Make your IDs strongly typed!!
-
dlist
List data structure based on AVL tree. It can store elements which have dimension and quickly search for elements by distance from 0.
-
simple-collection-macros
configurable macros for maps and sets
-
applejack
Radix tree
-
collect-rs
Special and custom Collections and Containers (for Rust)
-
fusefilter
No alloc membership approximation
-
diamond-types-extended
Unified CRDT library with ergonomic API - fork of diamond-types
-
bintrie
A performant binary trie data structure that doesnt store data or keys
-
aabel-identifier-rs
defines identifier behavior, such comparing them, or generating sequences of identifiers
-
pg_filters
helper to generate postgres sql for pagination, sorting and filtering
-
blocked-vec
A vector of byte blocks behaving like files
-
seg-tree
segment tree library
-
simple-binary-tree
binary tree view representation
-
molten-core
Core domain models, traits, and types for the Molten document and workflow management system
-
autocomplete
Auto-complete feature using Trie data structure
-
enum-ref
Proc. macro for generating enum discriminant types.
-
kd_interval_tree
Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups.
-
indexed_bitvec
An indexed bitvector with (hopefully) fast rank and select operations
-
collect-mac
collect!macro, which can be used to easily construct arbitrary collections, includingVec,String, andHashMap. It also endeavours to construct the collection with a single allocation, where possible. -
dynamic-matrix
work with matrices
-
fricgan
performing basic input and output on bytes
-
collidea
Collision-prone memory-efficient collections
-
free-algebra
Types for constructing free algebras over sets
-
num-bigint
Big integer implementation for Rust
-
trashmap
A HashMap and HashSet that operate directly on hashes instead of keys, avoiding rehashing
-
smolvec
A lightweight vector implementation with small-vector optimization for rust
-
eclectic
Experimental collection traits
-
elaru
Memory safe implementation of LRU cache
-
caffeine
Collection of data structures I'm writing for fun. Originally written for use with my crafting interpeters tutorial implementation.
-
labelgraph
graph implementation, allowing random access to nodes via labels
-
xskiplist
Skiplist implementation in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
hdf5-dst
DST extensions for HDF5
-
loaf
Why have a slice when you can have a loaf?
-
vecless
A minimal, Vec-free, singly linked list with Display support and ergonomic APIs
-
interval-rbtree
An interval tree implementation using Red-Black Tree as its underlying data structure
-
dag-cbor-references
Extract blake3 ipld links from dag-cbor blocks
-
ring_buffer_max
Keep track of the max value of ring buffer in linear time
-
grafite
Range Filter
-
kerrex-gdnative-sys
Bindings to the GDNative C API
-
simple-canvas
generic 2 dimensional canvas struct
-
dot_tree
Create, query and store binary trees
-
bonsai
Index arithmetic functions for perfect binary trees
-
modern-multiset
A hash multiset implementation
-
jsonmap
store values of multiple types value in one Map
-
arenavec
An arena backed implementation of vectors and related types
-
dcbor
Deterministic CBOR ("dCBOR") for Rust
-
dogged
Persistent vector, similar to Clojure
-
indextreemap
A BTreeMap implementation that allows for key and or positional insertion and retreival
-
dyn_list
A linked list that can hold dynamically sized values in its nodes
-
banyan-utils
work with banyan trees
-
littlechestnutgames-trie
A generalized trie implementation for quick prefix searching
-
jmt-blake3
Jellyfish Merkle Tree based on BLAKE3 hash function
-
ent-rs
Entropy and randomness analysis tool for binary files (Rust port of ent.hpp)
-
variant-map
defines maps to store variants of enums
-
simid
Universally Unique IDentifier (UUID)
-
flat_collections
Lightweight and memory-efficient associative data structures
-
fral
Functional random-access lists
-
streamhist
streaming histogram
-
dgrambuf
A fixed capacity ring buffer for datagrams (byte slices)
-
asimov-sdk
ASIMOV Software Development Kit (SDK) for Rust
-
hydroperx-sem
Semantic entities for Rust
-
hashed-array-tree
Hashed Array Trees
-
char_index
efficient charwise indexing into a string
-
lurk-elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
borsa-types
Shared Borsa-specific data transfer objects built on top of paft
-
hopscotch
A FIFO queue for efficiently hopping and skipping between tagged items
-
arena-graph
a questionable library for arena-allocated graphs
-
packed_array
Packed Array aka sparse set structure with compile-time known size
-
shared_bytes
Owned string and byte slices
-
skiplist-rs
Skip list is a kind of ordered map and can store any value inside. See skip list wikipedia page to learn more about this data structure.
-
interval-map
A vector-based, non-duplicate range-keyed, sorted array
-
rdf-reader
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
dcl_data_structures
Moved to: https://crates.io/crates/deep_causality_data_structures
-
gridd
A generic, dirt-simple, two-dimensional grid
-
nvpair-rs
Safe and rustic wrapper around nvpair
-
holodeque
Array- and slice-backed double-ended queues in 100% safe Rust
-
structures
collection data structures
-
leonardo-heap
Heap structure supporting fast in-place partial sorting
-
lesbar
String types that must encode legible text
-
mucell
A cell with the ability to mutate the value through an immutable reference when safe
-
fvm_ipld_kamt
Sharded IPLD Map implementation with level skipping
-
unsized_enum
Unsized enum implementation
-
synthax
Synthesize syntax with quasiquoting plugins
-
treelike
A trait to abstract over trees, and simplify implementing them, all in one handy crate
-
bm-le
Little endian 256-bit layer for binary merkle trie with ssz compatibility and extensions
-
plain
A small Rust library that allows users to reinterpret data of certain types safely
-
workit
single-threaded work queueing utility
-
anti-r
A spatial data structure outperforming r-trees for low numbers of elements
-
prefix_dictionary
Data structure similar to a dictionary, but enabling search for prefixes
-
slot-vec
A high-performance, reusable slot container for Rust, providing efficient insertion, removal, and iteration of elements
-
usize-set
Set data structures optimized to store sparsely distributed usize values
-
flaga
Flag management engine with support for binary, hex, and enum flags, event triggering, and persistent flag schemas
-
test-mumu
Test suite plugin for the Lava language
-
wolf-graph
Data structures and algorithms for working with graphs with reference or value semantics
-
trie
An ordered map and set based on a trie
-
scratchbuffer
A Vec<u8> like data-structure, that can be used as slices of different types
-
arbutus
Trees
-
bit-set-omnitool
A set of bits
-
enid
parse Encrypted Numeric Identifiers
-
hashvec
A HashMap/Vector hybrid: efficient, ordered key-value data storage
-
copy-range
core::ops::Range et al, but Copy and IntoIterator
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
bytes-quilt
data structure for tracking random-access writes to a buffer
-
index-set
bitset implementation with support for atomic operations
-
just-string
Container for various kinds of strings
-
dot3
generating Graphviz DOT language files for graphs
-
sketches
Probabilistic data structures for scalable approximate analytics
-
mapro
A tiny macro library for creating std::collections
-
higher_order_functions
A small collection of traits for implementing higher order functions
-
flag_set
FlagSet can process operations of the infinite complementary sets and the origin sets
-
atom_table
Assign easy-to-handle typed IDs to large, hard to handle things like strings
-
hashtree
A Merkle Tree implementation in Rust
-
generic-arrayvec
Interop between the arrayvec and generic_array crates
-
std_collection_traits
Abstraction of operations in std collection types
-
yagraphc
working with Graph data structures and common algorithms on top of it
-
kcr_dataprotection_kubeblocks_io
Kubernetes Custom Resource Bindings
-
intset
Various integer set data structures, each efficient for different operations
-
nostd-bv
Bit-vectors and bit-slices
-
phago-llm
LLM integration for Phago semantic intelligence
-
rs-bush
Bush data structure
-
armory
a fast pool for storing lots of objects of one type without fragmenting
-
trans-gen-go
Generating Go trans code
-
simple_bitfield
Create bitfields with the same memory structure as integers using a simple macro
-
expiremap
Key-Value map where each value has a custom expiry time
-
bstree
A Binary Search Tree written in Rust
-
bloomy
Bloom filter using only two hash functions
-
higher-cat
Functors, Applicatives, Monads and other bad ideas
-
pointer-value-pair
A pair of a pointer and a small integer packed into a pointer-sized object
-
nsrb
Nifty Simple Ring Buffer (aka circular buffer) is a no_std library that provides 2 macros to easily create fixed circular buffer on the stack
-
tiny-bit-flags
Generate bit-flags struct and methods
-
unrolled-linked-list
unrolled linked list in rust
-
sorted-list
SortedList data structure which allows mapping an Ord key to multiple distinct PartialEq values
-
typedflake
A Snowflake-style ID generator library with newtype-driven design
-
const_queue
A stack-only, no_std queue using const generics
-
pegitan
A bunch of random algorithms library
-
ninja-files-data
Core data structures for ninja files
-
mdarray
Multidimensional array for Rust
-
stac-async
Asynchronous I/O for stac-rs
-
index-map
A map with automatically generated usizes as keys
-
committable
Keccak256-based structured commitments
-
altdeque
An alternative deque implementation
-
omega-agentdb
Advanced vector database with ruvector integration for agent storage and skill management
-
borsa-core
Core types, connector traits, and time-series utilities for the borsa financial data ecosystem
-
content-tree
An efficient data structure for compacted RLE data
-
any_key
Dynamically typed keys for associative arrays
-
mycelial-crdt
mycelial crdt
-
tuplities-from
Traits for converting values into tuples
-
an-rope
an rope for large text documents
-
nanobox
NanoBoxoptimization: store small item on stack and fallback to heap for large item -
bndpresbufq
Bounds-preserving, optionally limited, buffer queue
-
automatic-relations
Tree automatic relations
-
ensured_bufreader
A Bufreader ensures N bytes in buffer
-
bugu
Cuckoo Filter: Practically Better Than Bloom
-
stack-array
A data structure for storing and manipulating fixed number of elements of a specific type
-
id-vec
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
-
bitmac
Structure for accessing to single bits
-
hashmap-entry-ownable
Variation of HashMap::entry() that accepts borrowed forms of keys
-
unique-id-collection
Collection with unique Id
-
dst-container
Containers for DST objects
-
cons-rs
containing a Cons data structure
-
len-trait
Len trait for collectons
-
bittree
O(1) find functions in a special data structure called a bit tree
-
static-box
A stack-allocated box that stores trait objects
-
to-offset
developer-friendly methods to manipulate strings with character indices
-
const-arrayvec
A vec-like type backed by an array on the stack
-
fcsd
Front-coding string dictionary
-
valord-map
A dictionary sorted by values
-
generic-cursors
A generic way to mutably traverse acyclic recursive data structures
-
skip-list
Implementing a skip list with rust
-
trie-generic
A trie with generic content
-
variant-set
A set-like data structure for enum variants, allowing you to store at most one value for each variant of an enum
-
typerat
Type-level rational numbers based on
typenum -
know_yaml
The KNOW Framework for Rust
-
bloomfilter-rust
A bloomfilter implementation in Rust
-
distri-types
Shared message, tool, and config types for Distri
-
vec-2-10-10-10
A 32-bit vector, where 2 bits are dedicated for alpha, and 30 bits are dedicated for color. Compatible with GL_UNSIGNED_INT_2_10_10_10_REV vertex attribute format.
-
im-rope
Unicode strings backed by RRB vectors
-
mini-linked-list
A package containing a minimal i32 LinkedList implementation
-
bits128
A struct to iterate over 128 bits by taking only 128 bits
-
freezie
small library that disables mutation for the contained type
-
serde_map
Mapbased onVecfor serialization purposes -
polars_structpath_types
Common objects for polars_structpath and polars_structpath_derive
-
pgdb_to_struct
CLI application to generate Rust struct files from PostgreSQL database tables
-
treers
Sedgewick's tree maps
-
kcr_instana_io
Kubernetes Custom Resource Bindings
-
bitbloom
A no_std Bloom filter implementation
-
data_privacy_macros_impl
Macros for the data_privacy crate
-
rope_rd
A Read/Seek rope implementation
-
simple-vec-collections
Collections implemented using Vec
-
compressed-sparse-fiber
Compressed sparse fiber implementation for Rust
-
rshyper-core
implements the core functionality of rshyper, focusing on providing the essential components that compose a hypergraph
-
rmat
minimal implementation of two-dimensional matrix algebra
-
spigal
fixed-length ring buffer implementation, intended to be no-frills and easy to use, especially for embedded applications
-
learn_together
Curated collection of lists of useful resources to learn Rust together
-
compressed_map
'Static functions': compressed maps with the keys removed
-
open-payments-iso20022-pain
Open Payments - Message Parsing Library - ISO20022 PAIN
-
sakurai
Performant, general-purpose data structures
-
aliri_braid_examples
Examples demonstrating usage of the
aliri_braidcrate -
small-ord-set
A set data-structure represented by a sorted
SmallVec -
pin_array
Tiny crate providing an array with structurally projected pinning
-
hamst
Hash Array Mapped Shareable Trie
-
offset-views
Create and index offset views of arrays, slices, strings, etc
-
zk-kit-pmt
Generic for storage Merkle Tree (sparse & fixed-size) in Rust
-
timed_set
timed set in Rust to store elements for a given time period
-
id-set
A bitset implementation that stores data on the stack for small sizes
-
graphsearch
graph search and representation library
-
delete_if_not
unsafely in-place delete function
-
ax_banyan_utils
work with banyan trees
-
ttl-queue
A queue that drops its content after a given amount of time
-
llist
Lisp-style singly-linked list
-
no-order
A transparent wrapper to ignore ordering and hashing of any value
-
lighter
Macro for rewriting string matches as tries
-
type-pools
A data structure to store values of multiple types
-
projected-hash-map
projected HashMap over HashSet
-
stacking
using a stack datastructure in rust
-
robyn
MLIR sidekick
-
btree_graph
A generic graph data structure
-
tree_multiset
A tree-based multiset for Rust
-
nexum
collection of commonly used data structures
-
vector2
2D vector library
-
minimizer-queue
Fast computation of minimizers using a monotone queue
-
kappendlist
Append to a growable list in O(1) without needing &mut
-
boost_variant
Boost C++ library boost_variant packaged using Zanbil
-
history-buffer
A fixed capacity, write-only, ring buffer
-
astack
offers a Stack data structure with fixed capacity capable of fast LIFO operations
-
lmq
Linked Message Queue
-
fixedbitset-stack
A forked version of FixedBitSet that supports const generics
-
output_iter
An iterator that performs calculation during iteration
-
tinybitset
Generic implementation of small, fixed size, copyable bitsets
-
distri-a2a
A2A protocol types for the Distri ecosystem
-
aabb-quadtree
A quadtree that maps bounding-boxes to elements
-
trie_map
A trie with good iterator support backed by a hashmap
-
paged
Read and create read-only paged database files
-
rust-ds
Custom data structures crate for Rust
-
head
Common types with inline headers, such as HeaderVec for Vec
-
flowerbloom
fast bloom filter implementation with thorough documentation and tests
-
chargrid_menu
chargrid menus
-
rs-bucket-filter
Skips slow scans using cache, bloom filter,
-
associative_positional_list
AssociativePositionalList is a list-like container in which each value is associated with an index, but unlike other list containers, the index for a value can be determined efficiently
-
mqfilters
Highly optimized approximate membership query filters (bloom, cuckoo, xor, quotient) with SIMD support
-
elu
Traits and implementations for EVAL-LINK-UPDATE data structures
-
priority-queue-rs
Priority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by…
-
attuned-qdrant
Qdrant storage backend for Attuned
-
bs
bitset with small-set (single-word) optimization
-
terrain-graph
Graph Library for Rust
-
hoop
Fixed ring buffer that allows non-consuming iteration both ways
-
vmcircbuf
A circular buffer that magically wraps around without any copying
-
rotbuf
Queue implementation wrapped around the
Bytescrates’ BytesMut data structure -
df-derive
Procedural derive macro for efficiently converting Rust structs into Polars DataFrames
-
gvec
Very simple implementation of generational indexing for vectors written in Rust
-
lazy_concat
Lazy concatenation for Strings and Vecs
-
lifetimed-bytes
Bytes, but with attached lifetime
-
hj_ds
A data structure library for Rust
-
pbloom
A portable bloom filter implementation in Rust
-
mutcrab
written in rust that contains various classic data structures
-
llm-governance-models
Shared data models and types for LLM Governance Dashboard multi-tenant platform
-
lazy_list
Lazily-populated lists, finite or infinite
-
iblt
Invertible bloom lookup table implementation
-
bit-vec_serde
A vector of bits
-
cyclic_data_types
Cyclic data types are series of structs, enums, types and functions to create a series of fast data types
-
rbl_circular_buffer
A zero-allocation, fast, circular buffer implementation in Rust
-
wasmflow-interface
Types used by the Wasmflow tool chain
-
indextree-ng
Arena based tree structure by using indices instead of reference counted pointers. Fork of indextree by Sascha Grunert which allows to remove nodes
-
plain-map
map that uses small_vec as backing storage, which is useful for having many tiny maps. For storing non-Copy types please use v1.x which is also supported.
-
anat-rs
represent natural numbers as well-founded sets
-
pgm-rs
A PGM index implementation for sorted u64 keys
-
bloom_filter_plush
rust_bloom_filter
-
treap_non_random
A non-randomized Treap implementation. Not very useful as a balanced tree, but useful when implementing CVM or similar algorithms.
-
trans-gen-python
Generating Python trans code
-
my-stack
stack implementation in Rust
-
linked_list_c
Safely work with c compatible linked lists
-
immutable-map
An immutable ordered map and set based on weight-balanced tree
-
typeslice
type-level slices
-
flashtext
algorithm to search and replace keywords in given text
-
winvec
Windowed Vector (TTL) Collection for Rust
-
eitherq
Queue which support two different types
-
json-mumu
JSON tools and JSON Schema plugin for the Mumu ecosystem
-
btreelist
A list data structure that has efficient insertion and removal in the middle
-
deferred_vector
A deferred vector implementation
-
btree_network
A generic network (undirected graph) data structure
-
btreec
Rust bindings for btree.c
-
priority-set
A no_std Priority Set
-
deqmap
A double-ended queue with optional keys
-
rdf-query
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
styc
Typesystem definition SDK
-
enum-map-derive
Macros 1.1 implementation of #[derive(Enum)]
-
json_dig
a json dig tool
-
flats
flattens nested structures into a flat single dimension map
-
pinned-queue
Queue-like data structure whose elements can never move
-
kcr_volsync_backube
Kubernetes Custom Resource Bindings
-
bitsetium
One stop shop for all bitset needs
-
neighborgrid
A 2-D grid datastructure with easy to use iterators and adjacent cell methods
-
header-slice
Definitions for slices with headers, and a vec-like type with a header allocated inline
-
pointer_vec
The PointerVec works same as the std Vec structure except the Vec has a size of 3 usize (pointer, length, capacity). This crate provides a replacement that has a size of 1 pointer.
-
vhr_serde
A serde (de)serializer crate for the simplist possible binary format
-
fallacy-hash
fallible hash collections
-
bitgrid
A compact, efficient bit grid structure
-
tc-state
TinyChain's general state enum
-
closures
Abstraction for seperating code and state in closures
-
const-buffer
A fixed-capacity memory buffer allocated on the stack using const generics
-
collect
An experimental extension of std::collections
-
bytes_to_type
facilitate byte conversion to specified types using macro generation
-
static_map
A static hashmap implementation, based on the Round-Robin hashing algorithm found in rustc
-
atelier_generators
Probabilistic generators and events simulation for the atelier-[rs] ecosystem
-
sealingslice
A mutable slice that can seal its initial part off from mutability, and hand out the sealed parts as immutable references
-
rs-collections
generic collections (no dependency on std)
-
tourney
A small package for generating and simulating tournaments of various structures
-
batbox-collection
Collection of identifiable objects
-
doubly-linked-list
double link list
-
circularbuf
Rust fixed size circular (ring) buffer
-
pq-bincode
A wrapper crate of queue-file for bincode serializable structs
-
collect-me
Additional collections not included in the Rust standard library
-
stonks
Sets that allow borrowing while inserting entries
-
llkv-btree
Generic, paged B+Tree with batch-only pager I/O for the LLKV toolset
-
ati
Introduces the
Attrait, which allows collections to be indexed byu|i{8,16,32,64,128}andisize. Supports Python-like negative index, where -1 is last element. -
byte_trie
A compressed trie based on bytes with some weird child node bucket sizes
-
stable_bst
An ordered map and set based on a binary search tree. Works with stable Rust 1.9.0.
-
bounded-vec-deque
A double-ended queue|ringbuffer with an upper bound on its length
-
collect-once-hashmap
A hashmap that can be collected only when there are unique keys in the iterator
-
ctxmap
A collection that can store references of different types and lifetimes
-
tuplities-ref
A trait for getting tuples of references from tuples
-
object-chain
Ad-hoc structure builder
-
shifted_vec
A growable datastructure with positive and negative indexing built on top of
std::vec::Veccalculating the offset automatically -
hashset_ext
Extension for HashSet with intuitive, chainable Python-like set operations
-
mrslac
sparse matrix data structures
-
treesome
tree creation, manipulation, traversal and visualization
-
chunky-vec
A pin safe, append only vector never moves the backing store for an element
-
bytesstr
An immutable reference-counted UTF8 String
-
quarkrs
A collection of small life improvements for rust
-
sorting-vec
Sorts a vector using a btreemap
-
bitstr
contiguous sequence of bits in memory
-
mmap_json_file
parse, count, filter JSON files using memory mapped io library
-
calf-vec
Small copy-on-write arrays, essentially combining
SmallVecandCow -
static_merkel_tree
Static Merkel Tree is dedicated for generating Merkle Root and Merkle Proof for a static list of items
-
embedrs-bytes
Types and traits for working with bytes
-
intid-core
Defines the IntegerId trait without a dependency on intid_derive
-
uvector
access two slices as a single continuous vector
-
dfb
Dynamic-Fifo-Buffer, like AnyMap but uses a VecDeque to store values and treats access as a Fifo
-
lanyard
UTF-8 C string types
-
explicit-discriminant
Macro for enforcing enum discriminants
-
cuml_map
A trait representing cumulative mappings, and several implemntations of this trait
-
few
A generalization of
std::Optionallowing for up to two optional values -
tree-automata
Term Rewriting Systems
-
fp-collections
An alternate collections library for rust
-
mut-binary-heap
Enhanced version of std::collections::BinaryHeap that supports increase and decrease key, max, min, and custom-order heaps
-
hashed
type you can convert any hashable type into and still do equality checks on
-
utf8char
that supplies a utf8 encoded char
-
kcr_quay_redhat_com
Kubernetes Custom Resource Bindings
-
base-traits
base traits (for Rust)
-
open-payments-iso20022-pacs
Open Payments - Message Parsing Library - ISO20022 PACS
-
stack-buf
Vector-like facade for arrays allocated entirely on the stack
-
realhydroper-smodel
Semantic modeling for Rust
-
rusted_list
A ever sorted list for rust that is operating on binary search
-
smolbox
Like a Box, but small objects are stored on the stack
-
qmap
LinkedHashMap alternative using nested VecDeque as LinkedList replacement
-
shared-string
Split a string without another allocation
-
bitmap4rust
creating and manipulating bitmaps
-
moonlight_collections
Collections for Rust
-
google-contacts-csv
Struct defined to hold the contact information from the Google contact file
-
sliced
A segmented vector for iterating over slices
-
ring_queue
A double-ended queue implemented using a vector that reuses space after elements are removed
-
indexvec
Simplified copy of rustc's index crate
-
latestmap
latest map
-
ransel
rank/select succinct data structures
-
cloneless_cow
A greatly-reduced implementation of Cow that does not require T to be Clone but allows for storing either a reference or an owned instance for future needs of references to T
-
priority-matrix
A matrix that supports per-row, per-column and whole-matrix maximum key queries
-
histree
A framework for disk-based historical indices
-
segment-map
A self-balancing binary search tree for mapping discrete, disjoint segments to values
-
any_handle
A thread-safe, type-safe smart pointer that can share, store and downcast a
dyn Any -
unsized-stack
Fast heterogeneous / unsized stack
-
terms
Tree terms and patterns data structures
-
phago-runtime
Colony management, scheduling, and runtime for Phago biological computing
-
tapa-trait-serde
A collection of Tapalogi's reusable crates
-
board
creating a single vector with coordinate based access, and a few nice functions for easy use
-
trans-gen-csharp
Generating C# trans code
-
rdf_rs
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
small_vec2
Vector on the stack or heap need nightly rustc
-
split_slice
accessing (&[T], &[T]) as if it were a single slice
-
tag-vec
A vector used for storing tags
-
stacked
Stack-allocated data structures. This was a good learning experience, and these container types work well, but in the end, I was not able to beat the performance of Vec
-
enumap
A HashMap and HashSet like interface for enums backed by an array
-
cachingmap
A caching Hashmap accepting new entries through interior-mutability
-
bloomfx
Bloom filter implementation backed by fxhash
-
animgraph
Animation data flow library using hierarchical state machines
-
querable
Quer(y)able data structure implementation
-
sixarm_collections
Collections for HashMapToSet and BTreeMapToSet as trait extensions. By SixArm.com.
-
mumu-file
File handling function and steams plugin for the Lava language
-
stack-stack
stack-allocated stack
-
aabel-bloom-rs
implements the Bloom filter
-
metacomplete_ptrie
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes
-
bytes-expand
Types and traits for working with bytes
-
rblist
A block-based, non-circular double-linked list implementation for Rust
-
id_cache
A cache data structure which generates sequentially-assigned ids for unique values
-
regex-map
Associative container where the keys are regular expressions
-
subway
Fast, performant in-memory SkipList implemented in Rust
-
kalgan_string
A collection of functions for string manipulation used by Kalgan Framework
-
buf-list
A list of buffers that implements the bytes::Buf trait
-
arc-slice
Shared memory slices
-
big-tuple
providing trait implementations for tuples of up to 128 elements
-
boost_container
Boost C++ library boost_container packaged using Zanbil
-
algae-rs
A collection of abstract algebraic structures implemented in Rust
-
dsll
Fast Thread Safe Doubly Sorted Linked List
-
comprehend
Python like list, set and hashmap comprehensions via macros
-
vector_mapp
A Vec based map
-
tranche
Tranches are an alternative to slices
-
struct2vec
Rust structure to slice
-
prio-queue
priority queue implemented as a heap stored in a Vec
-
atelier_quant
Quantiative Finance Tools & Models for the atelier-rs engine
-
containerof
Macros and traits facilitating the use of intrusive structures in Rust
-
trie_of_lists
Trie library for storing and searching lists of arbitrary data structures efficiently that have substantial overlap. For example file paths
-
baffa
Generic buffer for bytes
-
tcgeneric
Generic data types used internally by TinyChain
-
bare-types
A zero-cost foundation for type-safe domain modeling in Rust. Implements the 'Parse, don't validate' philosophy to eliminate primitive obsession and ensure data integrity at the system boundary.