-
hashbrown
port of Google's SwissTable hash map
-
indexmap
A hash table with consistent order and fast iteration
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
phf
Runtime support for perfect hash function data structures
-
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
-
wide
help you go wide
-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
roaring
A better compressed bitset - pure Rust implementation
-
ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
tinyvec
tinyvecprovides 100% safe vec-like data structures -
rpds
Persistent data structures with structural sharing
-
slotmap
data structure
-
tinystr
A small ASCII-only bounded length string representation
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
yrs
High performance implementation of the Yjs CRDT
-
histogram
A collection of histogram data structures
-
bitvec
Addresses memory by bits, for packed collections and bitfields
-
bimap
Bijective maps
-
ego-tree
Vec-backed ID-tree
-
enumset
creating compact sets of enums
-
fixedbitset
bitset collection
-
modular-bitfield
Easily define bitfield types with modular building blocks
-
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.
-
radix_trie
Generic radix trie data-structure
-
skiplist
in Rust for fast insertion and removal, including a normal skiplist, ordered skiplist, and skipmap
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
ustr
Fast, FFI-friendly string interning
-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
jaq-json
JSON values for jaq
-
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
croaring
Rust wrapper for CRoaring
-
iddqd
Maps where keys borrow from values, including bijective and trijective maps
-
elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
ecow
Compact, clone-on-write vector and string
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
faststr
string library that reduces the cost of clone
-
hecs
A fast, minimal, and ergonomic entity-component-system library
-
rowan
generic lossless syntax trees
-
arraydeque
A ring buffer with a fixed capacity, which can be stored on the stack
-
guppy
Track and query Cargo dependency graphs
-
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.
-
nonempty-collections
Correct-by-construction non-empty collections
-
string-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
bit-vec
A vector of bits
-
typed-index-collections
Typed index version of Rust slice and Vec containers
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
linked_hash_set
HashSet with insertion ordering
-
range-set-blaze
Integer sets as fast, sorted integer ranges; Maps with integer-range keys; Full set operations
-
bloomfilter
Bloom filter implementation
-
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
-
dary_heap
A d-ary heap
-
generator
Stackfull Generator Library in Rust
-
circular-buffer
Efficient circular buffer implementation
-
cordyceps
Mycelium intrusive data structures
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
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. -
smallbitvec
A bit vector optimized for size and inline storage
-
imbl
Immutable collection datatypes
-
intmap
Specialized HashMap for integer keys
-
spade
Delaunay triangulations for the rust ecosystem
-
ittapi
High-level Rust bindings for ittapi
-
egg
egraphs
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.
-
thin-vec
A Vec that takes up less space on the stack
-
cita_trie
Modified Patricia Tree (aka Trie)
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
tick
primitives to interact with and manipulate machine time
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
hostname
Cross-platform system's host name functions
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
ohno
High-quality Rust error handling
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
gix-merge
gitoxide project implementing merge algorithms
-
smallbox
Small Boxoptimization: store small item on stack and fallback to heap for large item -
hashbag
An unordered multiset implementation using a hash bag
-
mitsein
Strongly typed APIs for non-empty collections, slices, and iterators
-
jsonata-core
High-performance Rust implementation of JSONata query and transformation language
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
vers-vecs
A collection of succinct data structures supported by fast implementations of rank and select queries
-
orx-split-vec
An efficient dynamic capacity vector with pinned element guarantees
-
iroh-metrics
metrics for iroh
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
bitfield-struct
Struct-like procedural macro for bitfields
-
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
-
atree
An arena based tree structure with removal support
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
vec_map
map based on a vector for small integer keys
-
ringbuffer
A fixed-size circular buffer
-
crdts
Practical, serializable, thoroughly tested CRDTs
-
i24
working with 24-bit integers
-
slice-dst
Slice-based custom DSTs
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
opentelemetry-resource-detectors
A collection of community supported resource detectors for OpenTelemetry
-
ringmap
A hash table with consistent deque-like order and fast iteration
-
blobby
Iterator over simple binary blob storage
-
micromap
The fastest alternative to HashMap, for maps smaller than 20 keys
-
i256
Optimized implementations of 256-bit signed and unsigned integers
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
range-collections
Sets and maps of ranges, backed by smallvec
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
orx-priority-queue
Priority queue traits and high performance d-ary heap implementations
-
typed_floats
Types for handling floats with type checking at compile time
-
indexset
A two-level BTree with fast iteration and indexing operations
-
blart
adaptive radix tree packaged as a BTreeMap replacement
-
lean_string
Compact, clone-on-write string
-
newtype-uuid
Newtype wrapper around UUIDs
-
space
providing abstractions for spatial datastructures and search
-
array-macro
Array multiple elements constructor syntax
-
crop
A pretty fast text rope
-
fast_radix_trie
Memory-efficient trie data structures based on radix tree
-
saorsa-gossip-crdt-sync
Delta-CRDTs for Saorsa Gossip: OR-Set, LWW-Register with anti-entropy sync
-
ucd-trie
A trie for storing Unicode codepoint sets and maps
-
csaf-walker
work with CSAF data
-
bytesbuf
Types for creating and manipulating byte sequences
-
bao-tree
BLAKE3 verfiied streaming with custom chunk groups and range set queries
-
ph
data structures based on perfect hashing
-
vecmap-rs
A vector-based map and set implementation
-
arrow-data
Array data abstractions for Apache Arrow
-
boa_interner
String interner for the Boa JavaScript engine
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
nexus-ascii
Fixed-capacity ASCII strings for high-performance systems
-
gix-hashtable
that provides hashtable based data structures optimized to utilize ObjectId keys
-
rvf-types
RuVector Format core types -- segment headers, enums, flags
-
ndarray-stats
Statistical routines for the n-dimensional array data structures provided by ndarray
-
string
A UTF-8 encoded string with configurable byte storage
-
arrow-digest
Stable hashes for Apache Arrow
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
fqdn
FQDN (Fully Qualified Domain Name)
-
las
Reads and writes point clouds stored in the ASPRS las file format
-
uuid-rng-internal
Private implementation details of the uuid crate
-
iset
Map and set with interval keys (x..y)
-
bytes-utils
Additional utilities for working with the bytes crate
-
cranelift-entity
Data structures using entity references as mapping keys
-
timed-map
Lightweight map implementation that supports expiring entries and fully compatible with both std and no_std environments
-
orx-tree
A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features
-
lazily
Lazy reactive signals with dependency tracking and cache invalidation
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
collection_tools
General purpose tools to manipulate collections( containers like Vec/HashMap/HashSet )
-
vart
An immutable versioned adaptive radix trie
-
dogma
Named,MaybeNamed,Labeled,MaybeLabeled,Collection, andCollectionMuttraits -
byteview
Thin, immutable zero-copy slice type
-
tree_iterators_rs
built to provide you with the iterators to easily work with tree data structures in Rust
-
grid
Dynamic generic 2D data structure
-
hypergraph
data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices
-
soa-rs
A Vec-like structure-of-arrays container
-
dataflow-rs
A lightweight rules engine for building IFTTT-style automation and data processing pipelines in Rust. Define rules with JSONLogic conditions, execute actions, and chain workflows.
-
fixed-bigint
Fixed-size big integer implementation for Rust
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
cc-traits
Common collection traits
-
str-buf
Static string buffer
-
phf_generator
PHF generation logic
-
nexus-collections
Slab-backed intrusive collections for low-latency systems
-
enum-table
creating tables with enums as key
-
sucds
Succinct data structures in Rust
-
datasketches
A software library of stochastic streaming algorithms (a.k.a. sketches)
-
cljrs-value
Runtime Value type and persistent collections for clojurust
-
lru-slab
Pre-allocated storage with constant-time LRU tracking
-
platform-data
Data types and traits for the LinksPlatform
-
thread_aware
Facilities to support thread-isolated state
-
ordinal-map
Ordinal trait to map values to integers and efficient maps and sets for such types
-
pi_slotmap
Slotmap data structure
-
redactable
Automatic redaction of sensitive data in structs for safe logging and debugging
-
slotmap-careful
Wrap the slotmap crate and prevent key reuse
-
interavl
An optimised interval tree for efficient interval stabbing
-
libsecret
Rust bindings of libsecret
-
zerofrom
trait for constructing
-
salmon-map
Selective-alignment mapping for the salmon Rust port: MEM collection, chaining, and alignment validation
-
int-interval
A small, no_std half-open interval algebra library for primitive integer types
-
iso7816-tlv
tools and utilities for handling TLV data as defined in ISO/IEC 7816-4
-
keyvi
key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
-
qwt
Quad Wavelet Tree
-
fm-index
FM index and its variant implementations for Rust
-
weak-table
Weak hash maps and sets
-
itybity
An itty bitty crate providing bit iterators and bit iterator accessories
-
geotiff-core
Shared GeoTIFF types: GeoKey directory, CRS, affine transforms, and tag constants
-
range-set
Smallvec-backed containers of sorted integer ranges
-
embed-collections
A collection of memory efficient and intrusive data structures
-
oxiblas-matrix
Matrix types and views for OxiBLAS
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
modql
Model Query Language support
-
bitm
bit and bitmap (bit vector) manipulation
-
rdf-model
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
seatbelt
Resilience and recovery mechanisms for fallible operations
-
ic-memory
Durable stable-memory allocation governance for Internet Computer canisters
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
narrow
Apache Arrow
-
xml-builder
Easy and highly-configurable XML builder/writer
-
ankurah-storage-common
Ankurah storage engine common libraries
-
jsonbb
A binary representation of json value, optimized for parsing and querying
-
fpdec
Decimal floating-point arithmetic
-
sqrid
Square coordinates and grid-like arrays, with zero dependencies, in a single file
-
hdf5
Thread-safe Rust bindings for the HDF5 library
-
stringtape
A tape class for strings arrays compatible with Apache Arrow
-
ax-driver
ArceOS rdrive driver registration and rdif binding collection
-
static-files
help automate static resource collection
-
btree-range-map
B-tree range map implementation
-
validit
Validate data structures internal state
-
rustica
functional programming library for the Rust language
-
tracker
A macro to track changes on structs
-
typemap_rev
A hashmap, but stores types as keys
-
metering
German energy metering domain library — DST-correct Europe/Berlin calendar arithmetic incl. the 06:00 Gastag, gas m3→kWh_Hs conversion, SigLinDe gas SLP, billing-period aggregation…
-
submap
B-Tree map for pub/sub services
-
value-ext
Serde Json Value Extension Trait and Json Utilities
-
highergraphen-cli
Command-line workflows for HigherGraphen
-
sync-ptr
Sync & Send wrappers for raw pointer's and function pointers in rust
-
stac
SpatioTemporal Asset Catalog (STAC) specification
-
dup-indexer
Create a non-duplicated index from Strings, static str, Vec, or Box values
-
linearize
Types that are enumerable and an array-backed map
-
lattix
Knowledge graph data structures
-
docker-compose-types
Deserialization and Serialization of docker-compose.yml files in a relatively strongly typed fashion
-
rdom-style
CSS data model + property dispatch for rdom — TuiStyle, Stylesheet, ComputedStyle, the property→value table. Leaf crate, no backend/runtime deps.
-
sized-chunks
Efficient sized chunk datatypes
-
binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps
-
cactus
Immutable parent pointer tree
-
base-traits
base traits (for Rust)
-
trie-hard
Fast implementation of a trie data structure
-
owl-dl-cli
Command-line interface for the rustdl OWL DL reasoner
-
bytes-str
A string type that is backed by bytes crate
-
delay_map
HashMap collections whose entries expire after a given time
-
domain-key
High-performance, domain-driven, type-safe key system for Rust
-
fstr
A stack-allocated fixed-length string type
-
value-trait
Traits to deal with JSONesque values
-
mzpeaks
representing peaks in mass spectrometry data
-
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…
-
imbl-sized-chunks
Efficient sized chunk datatypes
-
uor-foundation
UOR Foundation — typed Rust traits for the complete ontology. Import and implement.
-
heavykeeper
finding Top-K elephant flows with high precision and low memory footprint
-
greentic-session
Greentic multi-tenant session manager with in-memory and Redis backends
-
staticdatagen
generating structured data files and metadata for static sites, including HTML, RSS feeds, sitemaps, and SEO-optimized meta tags
-
snowid
generating SnowID - a Snowflake-like timestamp-based distributed unique identifier
-
xot
Full-featured XML tree library for Rust
-
spart
A collection of space partitioning tree data structures for Rust
-
bin_file
Mangling of various file formats that conveys binary information (Motorola S-Record, Intel HEX, TI-TXT and binary files)
-
ordered_hash_map
HashMap which preserves insertion order
-
rdom-core
Arena-backed DOM for Rust — pure tree + events, no renderer. Can be used headlessly or paired with rdom-tui for terminal rendering.
-
mrc
MRC-2014 file format reader/writer for cryo-EM — SIMD-accelerated, mmap-enabled
-
succinctly
High-performance succinct data structures for Rust
-
array-init
Safe wrapper for initializing fixed-size arrays
-
circular-queue
A circular buffer-like queue
-
cdg_api
interact with api.congress.gov
-
evorule-tcb
EvoRule TCB Core - 纯计算内核，零依赖，确定性状态转换
-
xmltv
electronic program guide (EPG) parser and generator using serde
-
rh-hl7-fhir-r4-core
Generated FHIR types from hl7.fhir.r4.core package version 4.0.1
-
bittle
Zero-cost bitsets over native Rust types
-
atomicow
A
Cow-like data structure where owned data is stored inside anArc -
equivalent
Traits for key comparison in maps
-
ggmath
A linear algebra library for games and graphics with generic SIMD types
-
ftree
A very fast fenwick tree implementation
-
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
int-intervals
Closed-open integer interval algebra, canonical interval sets, and overlap-stack structures
-
iradix
A generic, persistent (copy-on-write) radix trie with structural sharing — bring-your-own-key, no_std + alloc, parameterized over Rc/Arc
-
nexus-timer
High-performance timer wheel with O(1) insert and cancel
-
tiff-core
Shared TIFF/BigTIFF types: byte order, tag types, tag values, sample traits, and format constants
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
portgraph
Data structure library for directed graphs with first-level ports
-
scientific-workflow
Configuration-driven scientific tasks, typed state, and durable recordings
-
vibe-graph-core
Core domain model for the Vibe-Graph neural OS
-
dlv-list
Semi-doubly linked list implemented using a vector
-
packedvec
Store vectors of integers efficiently
-
rust_dynamic
Support for dynamically-typed values in run-time
-
rdfx
RDF 1.2 data-structures, traits and utilities: terms (incl. triple terms), triples, quads, interpretations, graphs, datasets, unstar/restar reification helpers.
-
smol_bitmap
A space-efficient bitmap with inline storage optimization for small bitmaps
-
ndarray-ndimage
Multidimensional image processing for ArrayBase, the n-dimensional array data structure provided by ndarray
-
alizarin-core
Core data structures and algorithms for Arches heritage graph and tile processing
-
uluru
fast, LRU cache implementation
-
zerodds-types
OMG XTypes 1.3 type system: TypeIdentifier + TypeObject (Minimal/Complete) + Assignability + DynamicType + TypeLookup. Pure-Rust no_std + alloc.
-
short-uuid
generate and parse short uuids
-
edtui-jagged
A jagged array data structure for the edtui editor
-
frozen-collections
Fast partially-immutable collections
-
solti-model
Domain model types for the Solti task execution SDK: task specs, states, and identifiers
-
marsdb-graph
Property graph model and CRUD storage layer used internally by MarsDB
-
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).
-
entity_data
A container for entity component data
-
rangelist
A representation of sets as lists of inclusive ranges
-
tinyset
Size-optimized sets
-
xgx_intern
A high-performance, Hash-based value interner with custom handle types
-
streaming_algorithms
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
json-number
JSON number parsing and storage
-
multi_ranged
Efficient data structures for representing and manipulating ranges of discrete values
-
trees
General purpose tree data structures
-
qubit-value
Type-safe containers for single, multi-valued, and named runtime values
-
sparse_set_container
A container based on sparse set. Stable keys, O(1) lookup, cache-friendly iterations, and no hashing.
-
synheart-flux
On-device compute engine for HSI-compliant human state signals
-
tirea-state
Typed state management with derive macros, CRDT lattice merge, and deterministic patch replay
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
log-once
Collection of helper macros for logging some events only once
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
merkletree
Light merkle tree implementation with SPV support and dependency agnostic
-
im-lists
Persistent unrolled linked lists and vlists
-
merkl
MerkleTree, embedded friendly implementation
-
ordered-multimap
Insertion ordered multimap
-
tensorlogic-adapters
Symbol tables, axis metadata, and domain masks for TensorLogic
-
trie-root
In-memory patricia trie operations
-
type-map
typemap container with FxHashMap
-
arkhe-kernel
Domain-neutral deterministic microkernel for virtual worlds. WAL-backed, bit-identical replay, invariant-lifetime shell brand, no async / no unsafe / no floating-point in canonical paths.
-
id_tree
creating and modifying Tree structures
-
affinity_btree_queue
An affinity-aware priority queue backed by an augmented classical (CLRS-style) B-tree
-
kcr_apps_kubeblocks_io
Kubernetes Custom Resource Bindings
-
among
A general purpose sum type with three cases: the enum
Amongwith variantsLeft,MiddleandRight. A three-way counterpart toEither, withno_std,serde,futuresandtokiointegrations. -
bit-string
A compact owned bit string type with editing, matching, and bitwise operations
-
xor_name
Xor Type
-
cueue
High performance SPSC circular byte buffer with batch operations
-
mywheel-rs
Reinventing my wheel - Custom data structures optimized for specific use cases
-
sorted-index-buffer
array based sorted map with u64 keys
-
caldir-core
Core library for caldir calendar storage, sync, and provider protocol
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
ck-core
Core types and utilities for ck semantic search tool
-
tagged-pointer
Platform-independent space-efficient tagged pointers
-
circom-prover
Circom prover is a Rust library for generating and verifying proofs for Circom circuits
-
gcollections
Generic traits over Rust collections library
-
fixed_deque
A fixed size VecDeque to match Python Deque
-
fibonacci_heap
A high-performance Fibonacci Heap implementation in Rust with generic type support
-
know
Framework for Rust
-
exint
generic signed and unsigned integers
-
parallel_frontier
Queue-like frontier for breath-first visits on graphs that supports constant-time concurrent pushes and parallel iteration
-
agileplus-cli
Typed intent graphs for engineering work — convert prompts into validated DAGs of intents, features, tasks, tests, and edges, then store, query, and serve them from Rust, HTTP, or MCP
-
kotoba-graph
High-performance graph data structures for Kotoba graph processing system
-
rart
High-performance Adaptive Radix Tree implementation with SIMD optimizations
-
weavatrix-graph
Deterministic, evidence-carrying graph core for Weavatrix repository intelligence
-
facet-hash
Reusable Weavy-backed structural hashing plans for Facet values
-
fin_decimal
A high-performance decimal fixed-point arithmetic library for financial applications
-
paginator-rs
Pagination trait for Rust collections
-
place-matcher
Deterministic and probabilistic matching of geographic places (Haversine distance, external place IDs, ISO 3166-1 alpha-2 country codes, categories) with explainable per-field score breakdowns
-
doubloon
Money datatype that supports both statically and dynamically typed currencies
-
ntex-bytes
Types and traits for working with bytes (bytes crate fork)
-
alembic-core
Core IR types and validation for Alembic
-
minidom
A small, simple DOM implementation on top of rxml, targeting the subset of XML useful for XMPP
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
coitrees
A very fast data structure for overlap queries on sets of intervals
-
cvkg-scene
Cyber Viking Kvasir Graph (CVKG) - High-fidelity agentic UI framework
-
bitvec_helpers
BitVec based bitstream reader and writer
-
segment-array
Segment array (growable, append-only) data structure
-
octaindex3d
3D Spatial Indexing and Routing System based on BCC lattice with truncated octahedral cells
-
typg-core
Core search/discovery engine for typg (made by FontLab https://www.fontlab.com/)
-
aisle
Metadata-driven Parquet pruning for Rust: Skip irrelevant data before reading
-
xraydb
X-ray reference data for the elements: absorption edges, emission lines, and Elam/Chantler cross-sections
-
dent8
A memory firewall for coding agents — the library facade (event model, firewall, stores)
-
vtcode-session-store
Unified per-session state store: append-only ThreadEvent log plus derived views, retention, and cross-session query
-
rd-ast
Canonical, producer-agnostic AST for R's Rd (documentation) format
-
optional
supplies a number of Option-like primitive types
-
pfds
Purely Functional Data Structures
-
robin-sparkless
PySpark-like DataFrame API in Rust on Polars; no JVM
-
idmap
Efficient maps of integer id keys to values, backed by an underlying
Vec -
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
smallvec-wrapper
Macro and common structs to play with
smallvec -
i_shape
iShape is a compact and efficient library specifically designed for representing 2D data structures using IntPoint
-
tskit
rust interface to tskit
-
aabb
Static AABB spatial index for 2D queries
-
crdt-graph
An op-based 2P2P-Graph CRDT implementation in Rust
-
rs-grid-core
Headless grid engine core: model, viewport, selection, hit-testing
-
spider_agent_types
Pure data types and constants for spider_agent automation. Zero heavy dependencies.
-
keyed_priority_queue
Priority queue that support changing priority or early remove by key
-
seesaw-tgg
Bidirectional graph transformation with a declarative rule format: value-free structural identity, delta-local cascade, no negative application conditions
-
keymap-seq
Multi-key sequence resolution for keymap-rs (leader keys, C-x C-s)
-
scattered-collect
Link-time collections for Rust (distributed slices, registries)
-
data_privacy
Data annotation and redaction system providing a robust way to manipulate sensitive information
-
mule-map
A hybrid between a HashMap and a lookup table
-
ultragraph
Hypergraph data structure
-
cumulo-dipa
dipa makes it easy to efficiently delta encode large Rust data structures
-
bit_mask_ring_buf
A ring buffer implementation with cheap indexing
-
matreex
matrix implementation
-
WorkTablesIndex
A two-level BTree with fast iteration and indexing operations
-
pna
PNA(Portable-Network-Archive) decoding and encoding library
-
claim-ledger
Deterministic, local-first claim/evidence/provenance ledger. Creates receipts for all material operations.
-
cow_vec
A vector-like container optimized for efficient cloning with copy-on-write semantics
-
sporse
Sparse vector index for learned sparse retrieval
-
small_btree
that add SmallBTreeMap data structure
-
orn
A generic implementation of a sum type (or discriminated union). It provides
enum Or<T1, T2, ..., N>types as a counterpart to tuples. -
easy-tree
efficient tree structure library for Rust with recursive traversal
-
panproto-schema
Schema representation for panproto
-
zust-root
Addressable object tree and storage abstractions for Zust runtime integrations
-
rustdf
interacting with Bruker TDF formatted Raw Data
-
either-or-both
The enums EitherOrBoth with the three variants Left, Right, Both and Either with the Left and Right variants
-
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
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
spoke-operations
SPOKE lifecycle helpers — pure functions over spoke-schemas wire types
-
bevy_archive
An experimental ECS world snapshot system built on Bevy, featuring structured archetype storage and manifest-based serialization
-
btree-slab
A memory compact Slab-based B-tree implementation
-
netcrab
creating and exporting Petri nets
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
lat-long
Geographic latitude/longitude coordinate types with multiple numeric backends
-
bitflag-attr
A macro to generate bitflags structures from C-like enums
-
compressed-intvec
Space-efficient integer vectors with fixed-width, variable-length, and sequence-oriented encodings
-
soma-som-ring
Universal soma(som) ring substrate — Quad / Ring / Unit / SuccessionDriver / CycleObserver + constitutive invariants + observer/vault primitives
-
indexical
indexed collections
-
platform-trees
Trees methods for linksplatform
-
octofhir-fhirpath-model
Value types and FHIR model support for FHIRPath implementation
-
asset-importer-rs-scene
Scene module for asset-importer-rs
-
pcode-ir
P-code intermediate representation types for SLEIGH-generated decoders
-
elusion
modern DataFrame / Data Engineering / Data Analysis library that combines the familiarity of DataFrame operations (like those in PySpark, Pandas, and Polars) with the power of SQL query building…
-
awint
Arbitrary width integers
-
kevy-map
Open-addressing hashtable with bucket-addr prefetch API
-
deepmesa-collections
A collection of data structures and algorithms designed for performance
-
hashify
Fast perfect hashing without dependencies
-
tagged-core
A lightweight tagged type abstraction for type-safe IDs, etc
-
ptr_hash
A high-throughput minimal perfect hash function
-
json_dotpath
Dotted path access to nested JSON objects (serde_json::Value)
-
obeli-sk-tag-ptr
that enables a pointer to be associated with a tag of type
usize -
minuet
Holographic memory systems built on amari-holographic — the optical table for holographic computing
-
fvm_ipld_kamt
Sharded IPLD Map implementation with level skipping
-
rh-hl7-fhir-r5-core
Generated FHIR types from hl7.fhir.r5.core package version 5.0.0
-
auths-transparency
Append-only transparency log types, Merkle math, and tile storage for Auths
-
cityjson
Types and accessor methods for representing semantic 3D city models in Rust, implementing the CityJSON specifications
-
array2d
A fixed sized two-dimensional array
-
sif-itree
immutable, flat interval tree
-
cvkg-spatial
CVKG spatial indexing — QuadTree, BVH, and SpatialHash for platform-wide use
-
crtx-memory
Memory lifecycle, salience, decay policies, and contradiction objects
-
differential-dogs3
Advanced join patterns in differential dataflow
-
openehr-rm
openEHR RM Reference Model, generated from BMM: generations v1_1 (RM 1.1.0) and v1_2 (RM 1.2.0, current)
-
flighthook
event bus types and schemas
-
sparsevec
Compress vectors using row displacement
-
beach_map
slotmap
-
hvec
A Vec-like structure that can store different types of different sizes contiguous with each other in memory
-
kcr_operator_tigera_io
Kubernetes Custom Resource Bindings
-
safety-net
A reference-counted netlist library for EDA tools
-
lash-remote-protocol
Versioned remote embedding protocol DTOs for Lash sessions, turns, activities, tools, and LLM calls
-
oxc_coverage_types
Istanbul-compatible coverage data types (FileCoverage, FnEntry, BranchEntry, Location) for the oxc-coverage suite
-
vecset
A vector-based sorted map, set and keyed-set implementation
-
varmap
Fast, heterogeneous key-value maps for Rust. Store mixed types (integers, strings, bytes, custom structs) under a single key namespace, with compile-time keys, runtime strings, or enum variants…
-
libro
Cryptographic audit chain — tamper-proof event logging with hash-linked entries and verification
-
array-concat
Macros for concatenating const arrays
-
bacnet-emb
A bacnet library for embedded systems (no_std)
-
ball-tree
K-nearest neighbors
-
obeli-sk-small-btree
that add SmallBTreeMap data structure
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
dataprof
High-performance data profiler with ISO 8000/25012 quality metrics for CSV, JSON/JSONL, and Parquet files
-
bytearray-ringbuffer
A no_std, no-alloc ring buffer for variable-length byte slices in Rust
-
tuplez
Tuples represented in recursive form
-
diff_json
A powerful JSON diff library for Rust
-
libnv
Safe and rustic wrapper around libnv-sys
-
cmidi-core
Conversational MIDI protocol — encode multi-agent discourse as symbolic music
-
rsmarisa
Pure Rust port of marisa-trie: a static and space-efficient trie data structure
-
uor-addr
— the typed reference vocabulary for content-addressing across recursively-grammared formats. Standard-library Layer-3 Prism realization of the UOR Foundation; ships the common architectural…
-
mutaig
Mutable AIGs designed for equivalence checking
-
brk_byteview
BRK-maintained fork of byteview, a thin immutable zero-copy byte slice
-
router_prefilter
Fast prefix-based prefiltering for router pattern matching
-
maplike
Rust traits for abstract containers and operations over them. Treats every container as map. You can have the same code work on Vec, HashMap, BTreeMap, Option, Box.
-
runfiles
lookup library for Bazel-built Rust binaries and tests
-
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
geiserx_ts_dynbitset
dynamically-growable bitset based on ts_bitset
-
vectree
Vector-buffered tree collection with pre-/post-order, depth-first, mutable/immutable iterator
-
bit-set
A set of bits
-
vigil-types
Core typed data structures for Vigil local AI safety runtime — DecisionRecord, AuditEvent, EffectVector, ApprovalRequest, ToolInvocation
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
hashrope
Hash rope: a BB[2/7] balanced binary tree with polynomial hash metadata for O(log n) concat, split, substring hashing, and O(log q) repetition encoding
-
i_tree
Expiration key tree. Usable in algorithms like swipe line. Only for uniq elements
-
persist
Cross-platform data persistence with pluggable backends
-
graphina
A graph data science library for Rust
-
cortexfs-protocol
Protocol-neutral intermediate representation for AI model requests and events
-
camus
An embedded persistent buffer with at-least-once storage handoff
-
rust-hll
HLL that is compatible with the Aggregate Knowledge HLL Storage Spec
-
genesis-types
KNHK V2 type system — foundational data structures for workflow engine (workflow/pattern defs, execution state, errors, config)
-
tag_ptr
that enables a pointer to be associated with a tag of type
usize -
mnesis-store
Event store edge layer for the Mnesis event-sourcing framework
-
jolt-protocol
Protocol types for jolt daemon IPC
-
mesh-sieve
Modular, high-performance Rust library for mesh and data management, designed for scientific computing and PDE codes
-
codewandler-connector-catalog
Every generated connector operation, embedded at compile time and queryable by key
-
trellis-core
Deterministic reconciler: state changes in; resource commands, output frames, and auditable receipts out
-
petgraph-decypher
Build petgraph graphs from OpenCypher queries
-
lsph
Learned Spatial HashMap
-
ddsketchy
DD Sketch in Rust
-
agnix-rules
Validation rules for agnix - agent configuration linter
-
option-block
A minimal utility Rust crate for small, fixed-size blocks of optional types
-
flatk
Flat layout abstraction toolkit
-
frankenpandas
Clean-room Rust reimplementation of the pandas API — DataFrame, Series, GroupBy, Rolling, Resample, MultiIndex, 8 IO formats. Zero unsafe.
-
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… -
array_list
A chunked ordered collection with iterators and cursors
-
iqdb-index
The Index trait unifying flat, HNSW, and IVF vector indexes - part of the iQDB family
-
aliasable
Basic aliasable (non unique pointer) types
-
automerge-cat
CRDTs as categorical colimits, built on comp-cat-rs
-
augmented-rbtree
An augmented red-black tree with generic, user-defined per-node statistics — enables interval trees, order-statistics trees, range-sum trees, and more
-
tagged-types
Define strongly typed wrappers over base types with minimal boilerplate
-
mif-frontmatter
Markdown frontmatter <-> JSON-LD lossless round-trip for the MIF (Modeled Information Format) ecosystem
-
fluent-assertions
testing library that enhances readability and expressiveness by enabling natural language-like syntax for test assertions
-
hyperloglockless
High-performance HyperLogLog with bias correction and full concurrency support
-
tiered-vector
Tiered Vectors
-
ndstruct
Structures for N-dimensions
-
dpp-registry
EU EUDPP Central Registry ghost connector — interface-only until EU API is published
-
foxstash-db
Database layer for foxstash — collections, filtering, hybrid search, WAL persistence, and concurrent access
-
waterslide
A tiny Rust sketch of WaterSlide-style tuple pipelines
-
truc
Rust code generator for safe, fixed size, evolving records
-
seoul
trait Isomorphism
-
featrs
Feature engineering library for Rust, inspired by scikit-learn
-
array-deque
Fixed-capacity circular buffer implementations: heap-allocated ArrayDeque and stack-allocated StackArrayDeque. Efficient O(1) operations, no_std support.
-
cel-context
Portable context snapshots for AI agents. Normalize any stream into reusable elements and point-in-time snapshots.
-
ribbit
Derive macro for bit fields
-
undo
An undo-redo library
-
test-assembler
A set of types for building complex binary streams
-
rpos
Cursor Manager on Table
-
champ-trie
Persistent hash map based on CHAMP — canonical form, O(1) structural equality via AdHash, COW structural sharing
-
data-stream
serialization library based on streams
-
cmn-substrate
The shared Rust library for CMN — data models, cryptographic verification, tree hashing, URI parsing, and JSON-schema validation used by Hypha and Synapse
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
pgm-extra
high-performance learned index structures for Rust
-
any_vec
Type erased vector. Most operations can be done without type knowledge. Mostly zero overhead.
-
card-est-array
Infrastructure for managing large arrays of cardinality estimators
-
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…
-
path_resolver
trie-based data structure to track and resolve relative path ownership across multiple packages
-
blumer
A high-performance, bit-optimized bloom filter library for Rust
-
flatten_objects
A container that stores numbered objects. Each object can be assigned with a unique ID.
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
mant-ir
Normalized, source-neutral document intermediate representation for ManT
-
orx-iterable
Defines and implements Iterable, Collection and CollectionMut traits to represent types that can be iterated over multiple times
-
float16
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
btree-indexmap
BTree-based map data structure with stable indexes
-
hyperlane-process-guard
A process guard service based on Hyperlane web framework for remote script execution and process management
-
rbtree
the rbtree for Rust
-
tailvec
Split Vec to mutable slice and TailVec, the TailVec can push or pop etc
-
betteroffice-drawingml
Shared DrawingML colors, themes, shape models, and preset geometry
-
phf_shared
Support code shared by PHF libraries
-
jumprope
fast rope (fancy string) library built on top of Skiplists
-
intrusive-lru-cache
An LRU cache implementation using intrusive data structures
-
moduforge-transform
不可变数据结构与事务系统基础
-
cybergraph
local-first cyberlink processor — unified API over bbg + foculus
-
unsigned-float
Unsigned floating-point formats for non-negative numeric domains
-
rsf-cli
Ranked Spreadsheet Format - Deterministic column ordering based on cardinality
-
rangeset
Integer collection backed by ranges with set operation support
-
bhc-index
Typed indices for efficient and safe indexing
-
dot2
generating Graphviz DOT language files for graphs
-
incr-core
Shared core for the incr family. Strategy-parameterized incremental computation engine. Used via incr-compute (single-threaded) or incr-concurrent (Send + Sync).
-
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.
-
pbt
High-throughput property-based testing with
derive, swarm-testing, precise sizing, and full graph-theoretic type analysis over mutually inductive and uninstantiable types -
segmented-vec
A vector with stable element addresses using segmented allocation and O(1) index-to-segment mapping
-
vibe-graph-automaton
Foundational graph automaton with temporal state evolution and rule-driven transitions
-
basic_trie
Trie implementation in Rust
-
treeclocks
Various Tree Clock data-structures and utilities
-
toml-query
work with toml::Value objects more conveniently
-
boarddown-schema
Shared schema types for BoardDown
-
inc-complete
writing incremental computations that re-execute the minimum number of steps when an input is changed
-
bluegum
A tree printer with rich formatting, alternate values, debug info, and flexible structure - perfect for ASTs and complex data visualization
-
flex_array
A
#[no_std]flexible array much like std::Vec but with custom indices and length and capacity types -
wavltree
An intrusive Weak AVL Tree
-
rshyper
focuses on hypergraphs
-
pineappl
not an extension of APPLgrid
-
avila-atom
Atomic computational structures - Option, Result, Vec, HashMap built from nucleus
-
philiprehberger-id-gen
Unified ID generation: ULID, UUIDv7, NanoID, and Snowflake
-
pathmap
A key-value store with prefix compression, structural sharing, and powerful algebraic operations
-
dial-theory
Dial theory framework for algebraic structure analysis
-
merkql
Embedded event log with Kafka-compatible semantics and merkle tree integrity verification
-
binary-greedy-meshing
A port of https://github.com/cgerikj/binary-greedy-meshing to Rust
-
radix-heap
Fast monotone priority queues
-
hybridmap
Hybrid map using smallvec and the std hashmap
-
diamond-types-extended
Unified CRDT library with ergonomic API - fork of diamond-types
-
openvet-tree
Content-addressed Merkle search tree (dense skip-tree) for OpenVet
-
mako-wim
WiM process engine for German smart-meter market communication (Wechsel des Messstellenbetreibers)
-
enum-collections
EnumMap implemented in safe rust
-
graph_process_manager_core
explore parts of a tree-like or graph-like structure that is not known in advance
-
libwebnovel
enabling users to get chapters of a webnovel, with multiple available backends
-
zer
Zero-shot entity resolution pipeline for Dutch-centric data, with GPU acceleration and neural judging
-
flow-ir-core
flow.ir Pure Rust schema + sync interpreter — Node / Expr / Dispatcher / eval (no mlua, no async)
-
reliakit-health
Health status types and a criticality-aware aggregator for service health checks, probes, and status pages. no_std-friendly and zero-dependency.
-
rs-ecs
reasonably simple entity component system
-
meminterval
interval-tree in Rust made to store memory mappings
-
compress-json-rs
Store JSON data in a space-efficient compressed form, with round-trip compression/decompression
-
scdata
High-performance Rust library for constructing sparse single-cell UMI count data with deterministic MatrixMarket export
-
sundo
Snapshot-based undo/redo library with support for persistent data structures
-
orx-fixed-vec
An efficient fixed capacity vector with pinned element guarantees
-
chunked_vec
A chunk-oriented vector collection with fixed-size chunk storage
-
bitwheel
High-performance fixed capacity timer wheel
-
ruvix-vecgraph
Kernel-resident vector and graph stores for RuVix Cognition Kernel (ADR-087)
-
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… -
field_access
Dynamically access struct fields
-
libmapper-rs
Rust bindings for libmapper
-
flat_string
FlatString is a fixed-size String that can be created directly on the stack
-
kmp-domain
Domain model of the Kernel Memory Protocol: aggregates, value objects, repositories and projections, with no IO
-
nary_tree
A vec-backed tree structure with tree-specific generational indexes
-
cmsketch
A count min sketch implementation in Rust
-
relmath-rs
Relation-first mathematics and scientific computing in Rust
-
bc-envelope-pattern
Pattern matcher for Gordian Envelope
-
unique_id_lookup
Associative Array specifically designed for integer keys. Significant performance boost over conventional hash maps.
-
typedflake
A Snowflake-style ID generator library with newtype-driven design
-
intrusive-doubly-list
efficient, zero-allocation intrusive doubly linked list in Rust. Features safe, lifetime-bounded iterators, unified ownership validation using a link_state flag to prevent node reuse bugs across multiple lists…
-
stac-server
SpatioTemporal Asset Catalog (STAC) API server
-
rsdict
Fast static rank and select data structure
-
rdf_rs
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
pair_macro
Create types consisting of the same type values such that Pair, Triplet, and so on
-
polars-formula
High-performance formula parsing and materialization library for Polars DataFrames with R/Formulaic/Patsy style syntax
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
kcr_kueue_x_k8s_io
Kubernetes Custom Resource Bindings
-
merkle-cbt
generating efficient Merkle tree and combined Merkle proof based on complete binary tree
-
obeli-sk-boa-interner
String interner for the Boa JavaScript engine
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
spacetimedb-data-structures
Assorted data structures used in spacetimedb
-
fillet
An efficient thin pointer based contiguous collection
-
otherone-memory
Long-term and short-term memory primitives for the Otherone agent framework
-
petgraph-live
Generic generation-keyed graph cache, disk snapshot, and graph algorithms for petgraph 0.8
-
range-map
Maps and sets implemented using ranges
-
suggest
A minimal library to provide similar name suggestions like "Did you mean?"
-
oxgraph-layout-util
Shared layout primitives for oxgraph: builder helpers + offset-integrity validation
-
btree-vec
A growable array (vector) implemented using a B-tree
-
bloom-lib
Probabilistic data structure library: Bloom filters, Cuckoo filters, Count-Min Sketch, HyperLogLog, MinHash, and Top-K. Tunable false-positive rates, serializable state, merge support, and streaming-safe updates.
-
agentic-forge-core
Blueprint engine for complete project architecture before code generation
-
kbd
Pure-logic hotkey engine — key types, modifier tracking, binding matching, layer stacks, sequence resolution. No platform dependencies.
-
rbitset
A bit set, being able to hold a fixed amount of booleans in an array of integers
-
un-motion-frame
UNMotion と関連プロジェクト向けのトランスポート非依存モーションフレームスキーマ。
-
arora-types
Shared type definitions for the Semio Arora framework
-
sync42
synchronization tools
-
wildbird
Rust Framework 🐦
-
trk-io
TrackVis (*.trk) reader and writer
-
sql-json-path
SQL/JSON Path implementation in Rust
-
bitstring
traits and implementations
-
timed-fsm
A timed finite state machine framework where timer commands are declarative transition outputs
-
sphere-n-rs
N-Sphere Code Generation in Rust
-
rustpix-core
Core traits and types for rustpix pixel detector processing
-
oaken
Configurable Lexer
-
arrlist
A generic, heap-allocated dynamic array
-
leanbridgetree
Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves
-
noethers-turnstile-core
Admissibility compiler core: Γ ⊢ z : p until ε
-
stackyard
Freestanding data structures and algorithms
-
ux-primitives
Graphics Primitives for Angular Rust
-
ni
Small limited alloc-free named identifier
-
compvec
Compressing integer vectors
-
ocpp_rs
no_std + alloc OCPP 1.6 and 2.1 protocol library (OCPP-J parse/serialize, CallResult correlation)
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
classic
Object-oriented programming for Rust
-
keyring_map
A hash map with multiple keys per value using a ring structure to minimize allocations
-
permission-auditor
Audit a list of Chrome / Manifest V3 extension permissions against a curated risk database: every MV3 permission + host-access patterns + plain-English risk descriptions, summarized into a per-extension report…
-
trit-vsa
Balanced ternary arithmetic library with bitsliced storage and VSA operations
-
firims
fixed range integer maps and sets
-
hypeerlog
A fast, distributable, and lightweight HyperLogLog implementation with bias correction
-
orx-selfref-col
SelfRefCol is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees
-
sheaf-coherence
Cellular sheaf coherence for multi-agent belief alignment — sheaf Laplacian
-
capped_collections
Collections with compile-time set capacities
-
hybrid-array-arcium-fork
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
-
npmgen-core
that generates the npm publish tree shipping a prebuilt Rust binary
-
do-notation
Monadic do syntactic sugar
-
merc_lts
Implements labelled transition systems for various I/O formats using a general LTS trait
-
digit-bin-index
A high-performance, O(P) data structure for weighted random sampling of binned probabilities, ideal for large-scale simulations
-
cadcore-topo
Arena-based B-Rep topology for the cadcore CAD kernel - Solid, Shell, Face, Edge, Vertex with typed IDs
-
sbits
Succinct data structures: near-optimal space with efficient queries
-
streaming-diskann
Postgres-free StreamingDiskANN core with storage traits, memory backend, and conformance tests
-
awsm-audio-schema
Authored WebAudio sample/graph schema consumed by the awsm-audio editor + player
-
arithmetic-nonmax
Integer types that cannot be the maximum value, allowing for memory layout optimization and intuitive arithmetic operations
-
journalmap
Journaling datatypes for easy undo, redo & version control
-
schema-catalog
Types for the JSON Schema catalog format (schema-catalog.json)
-
haz-dag
DAG construction and traversal for haz tasks
-
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.
-
uuid-base32hex
UUIDs with a base32hex string representation
-
defaultmap
HashMap with an automatic default for missing keys
-
odht
hash tables that can be mapped from disk into memory without the need for up-front decoding
-
flat-tree
Series of functions to map a binary tree to a list
-
surge-network
Surge network — canonical power-system domain model
-
scry-index
A concurrent sorted key-value map backed by learned index structures
-
gjstore
generational, garbage collected, json store
-
vec-belt
Multi-threaded bulk-append, single-threaded consume
Vec<T> -
cf-colo-hint
Cloudflare colo to Durable Objects location hint mapping
-
fast-sparse-merkle-tree
Fast Sparse Merkle Tree (SMT) library in Rust, using TurboSHAKE128 as default hash function
-
voxgig-struct
Uniform JSON-shaped data structure manipulations — Rust port of @voxgig/struct
-
relib-bdd
Binary Decision Diagrams (BDD) and Zero-suppressed BDDs (ZDD) for the relib reliability toolkit (engine behind the relibmss Python package)
-
bitree
A no_std-compatible binary indexed tree (Fenwick tree) for efficient prefix sums
-
jzod
Typed model for the JZOD open astrology chart interchange format
-
hylic-pipeline
Typestate pipelines and sugar traits over hylic lifts
-
const-secret
A
no_stdcrate for compile-time encrypted secrets -
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
voxtree
sparse voxel 64-tree implementation in rust
-
panproto-mig
Migration engine for panproto
-
neobit
Zero-dependency, lightweight bitflags with readable debug output
-
bounded_graph
A thin newtype wrapper for
petgraphto assist in the creation of graphs with restrictions on their edges -
fixed-queue
no_std, no_alloc, use [T; N]. support
Vec/VecDeque/History -
collections-gpui-unofficial
Standard collection types used by Zed and GPUI
-
graph-api-lib
Core library for the graph-api ecosystem - a flexible, type-safe API for working with in-memory graphs in Rust
-
onebuck
An efficient unordered dynamically-sized data structure
-
intervaltree
generic implementation of an immutable interval tree
-
oamp-types
Open Agent Memory Protocol (OAMP) types for Rust
-
eros-engine-core
Pure-domain types and rules for the eros-engine AI companion engine: persona, six-dimensional affinity, PDE decisions, and ghost-message logic with no I/O
-
ordered
A wrapper for adding arbitrary partial/total order to a type
-
diet-xml
Probably the simplest, most approachable XML builder for Rust
-
xsd-types
XSD data types
-
epcis-models
Type-safe GS1 EPCIS 2.0 event models implemented natively in Rust
-
spqr-tree
A representation of the SPQR tree in Rust with support for I/O
-
ph-temp
data structures based on perfect hashing
-
cairn-lang-formats
Readers and writers for .nbt, .litematic, .schem, and .mcstructure
-
openehr-am
openEHR AM Archetype Model, generated from BMM: generations v1_4 (AM 1.4.0, ADL 1.4) and v2_4 (AM 2.4.0, ADL 2; current)
-
starry-syscalls
A list of Linux system calls
-
simplehash
fast Rust library implementing common non-cryptographic hash functions: FNV, MurmurHash3, CityHash, and Rendezvous hashing
-
apollonius
N-dimensional Euclidean geometry for Rust: points, vectors, lines, segments, hyperspheres, hyperplanes, AABBs, triangles, and a unified intersection API—all with const generics
-
superset_map
Map that stores distinct supersets based on the total order defined
-
arora-behavior
The Behavior abstraction the Arora runtime ticks: a behavior tree, a node graph, or any interpreter, against the shared data store — plus the shared behavior graph model
-
mset
/ multiset / bag implementation
-
data_reader
A data loading library for data scientist
-
wordvec
A compact
SmallVec<T>-like container with onlyalign_of::<T>()overhead for small stack-only instances -
xar-array
A segmented exponential array with stable element addresses
-
tachyon-types
Shared myko entity and command types for the tachyon Ansible runner
-
philharmonic-store
Storage substrate traits for the Philharmonic workflow orchestration system: content store, identity store, entity store. Backend-agnostic; implementations in companion crates.
-
higher-graphen-structure
Structural primitives for HigherGraphen spaces, contexts, morphisms, and topology
-
plain_trie
Classic trie implementation capable of mapping any T to char iterator
-
index-ext
Index slices with arbitrary ints and as arrays
-
oblige
Bounded and fixed-length data structures and primitives
-
more_collections
Additional collections not found in std::collections
-
tex_engine
A modular crate for building TeX engines
-
perl-semantic-facts
Neutral semantic fact vocabulary for Perl analysis layers
-
lexime-trie
A char-wise Double-Array Trie with zero dependencies
-
mzdata-bindata
read mass spectrometry data formats and a data model for mass spectra
-
akribes-types
Wire-level types shared by the Akribes SDK and core (events, values, AST shapes, errors)
-
feagi_data_structures
The most core library, defines the basic data types used by FEAGI, as well as some processors to modify them
-
pasture-core
A framework for working with point cloud data
-
snowball_stemmers_rs
all Snowball stemming algorithms
-
symbol_table
A symbol table that's fast, concurrent, and gives stable references
-
notatype
Types for Ordinary
-
naija-geo
Nigerian geopolitical zones, states and local government areas (LGAs) — all 6 zones, 37 states and 774 LGAs with navigation helpers
-
short-id
Tiny crate for generating short, URL-safe, random or time-ordered IDs
-
ndshape
fast linearization of N-dimensional array indices
-
slimvec
Dynamic array with a smaller inline-size
-
modmap
Universal module map schema for codebase structure representation
-
eytzinger-interpolation
Eytzinger array layout with interpolative search support
-
ucm-core
Core types and traits for the Unified Content Model
-
multigraphrs
A versatile, strategy-pattern based MultiGraph library supporting directed, undirected, and weighted graphs
-
rumpsteak-types
Core session types for Rumpsteak - matching Lean definitions
-
ranged_bitmap
A high-performance bitmap library
-
deep_causality_tensor
Tensor data structure for for deep_causality crate
-
crusty_cards
Playing Card and Deck Library
-
solvent
Dependency Resolver library
-
idlset
Fast u64 set operations library
-
pi_append_vec
Only supports append vectors, lock free
-
pdatastructs
probabilistic data structures
-
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
-
stratifykit-core
Domain-agnostic distribution control: quota/bucket sampling, group-aware fill, coverage classification
-
isx
Traits for checking certain conditions of values
-
layered
Build composable async services with layered middleware
-
ref_str
Compressed borrowed-or-shared string types for no_std Rust
-
range-mutex
A
Mutex<[T]>-like type, that allows locking different ranges separately -
html-mumu
HTML manipulation and tools plugin for the Lava/MuMu language
-
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. -
scepter
Composable primitives for planet-scale time-series routing, indexing, and aggregation
-
post-cortex-mcp
Model Context Protocol (MCP) tool definitions for post-cortex. Pure library — embed in rmcp, custom MCP servers, or anywhere else; no rmcp / axum / tonic transport dependencies.
-
domain-lookup-tree
A tree structure in Rust optimized for looking up domain names, with wildcard support
-
sim-codec-binary
SIM workspace package for sim codec binary
-
typeid_prefix
that implements a type-safe version of the TypePrefix section of the
TypeIDSpecification -
ruvector-metrics
Prometheus-compatible metrics collection for Ruvector vector databases
-
klingt
Lock-free audio graph library with message-passing parameter control
-
tagid
Defines a newtype labeled tagging for different types of ids
-
moduforge-model
不可变数据结构与事务系统基础
-
slotmap_microlib
A micro library for slot map data structure
-
nostr-bbs-pod-worker
Pod Worker: Solid pods + R2 storage + WAC ACL (nostr-bbs)
-
incremental-topo
Data structure to maintain an incremental topological ordering over a collection of values
-
rustdoc_ir
An Intermediate Representation for Rust types and functions
-
anima-tagger-core
Data model, project config, and sidecar I/O for anima-tagger — a tag/caption editor for local Stable Diffusion LoRA datasets
-
splinter-rs
A compressed bitmap format optimized for small, sparse sets of u32s with zero-copy querying
-
ryu-spaces
Spaces primitive for Ryu: named document collections with a sqlite-vec (
vec0) vector store, a content-addressed blob store, per-space embedder, and a GraphRAG (entity/relation) retrieval strategy… -
rust-tls-duplex-stream
Full Duplex stream Wrapper around rust-tls
-
rotbl
Read Only Table
-
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… -
cfixed-string
Pass Rust strings to C with potentially not needing heap allocation
-
rskit-dataset
Dataset collection framework: source, transform, target, collector
-
any-rope
A fast and robust arbitrary rope for Rust. Based on Ropey.
-
mappy-core
Core maplet data structure implementation
-
idbag
A bag of integers
-
keymaps
standardized encoding for key codes
-
splinify
Rust-wrapper for Dierckx' B-Splines Curve and Surface Fortran Library
-
arena-terms
A lightweight, arena-backed representation of Prolog–like terms
-
zotron-types
Shared types for the Zotron Zotero bridge (OCR/embedding providers, RPC protocol, PDF evidence)
-
lib-sokoban
Sokoban: compact, efficient data structures packed into contiguous byte arrays
-
random-detached
A random byte and char generator that doesn't keep breaking because different crates use different versions of rand
-
ch-pivot
A high-performance generic data pivoting and aggregation engine for raw datasets
-
robinxx_map
High-performance, thread-safe open-addressing hash map using Robin Hood displacement & xxHash3
-
petricheck
symbolic model checker for Petri Nets
-
tensors-rs
Compact NumPy-like dense tensor primitives for safe numerical Rust
-
slotted-egraphs
E-Graphs with name binding
-
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…
-
mako-gabi-gas
GaBi Gas process engine for German gas market balancing communication (Gasbilanzierung)
-
intervalmap
An interval set/map library inspired by Boost.Icl
-
ooroo
A fast, compiled rule engine with a text-based DSL
-
dagex
A pure Rust DAG executor supporting implicit node connections, branching, and config sweeps
-
adflib
handle amiga disk files
-
persister
A generic persistent data container. Auto-save, dirty tracking, atomic writes, multiple codecs (RON, JSON, TOML, YAML, custom).
-
canadensis_dsdl_frontend
Compiler front-end for the Cyphal Data Structure Description Language
-
hamcty
Load and search country data for ham radio callsigns in the CTY database
-
dsq-functions
Built-in functions and registry for dsq
-
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…
-
mdcs-compaction
Compaction, pruning and stability subsystem for the Carnelia MDCS
-
kevy-vector
Approximate nearest-neighbor core: HNSW graph with cosine/L2/inner-product distances, tombstone deletes, bounded rebuild
-
key-node-list
Doubly-linked list that stores key-node pairs
-
widetorah
Rust SDK for WideTorah -- Tanakh, Talmud, Mishnah, Rashi commentary, parashot, and Jewish encyclopedia via the widetorah.com API
-
dot-structures
The structrures to support graphviz-rust library
-
disjoint
Fast and safe implementation of the disjoint-set data structure
-
eastl-rs
EASTL binary-compatible Rust implementations
-
takeable
Container type that allows for temporarily moving out of the container, or permanently moving out and invalidating the container
-
c_vec
Structures to wrap C arrays
-
vicardi
JSON VCardArray Generator that uses Serde
-
tiny-counter
Track event counts across time windows with fixed memory and fast queries
-
alopex-dataframe
Polars-compatible DataFrame API for Alopex DB (v0.1)
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
graph-clonable-ref
A fast, thread-safe cloneable reference that preserves reference structure during deep cloning
-
use-reaction
Chemical reaction representation primitives for RustUse
-
merc_data
Defines data expressions on top of terms that are compatible with the mCRL2 toolset
-
moa_collections
硬实时友好的侵入式容器套件：双向链表 / 红黑树 / 哈希表（零分配、确定性 WCET）
-
type-set
A set of heterogeneous types
-
geoff-ontology
Vocabulary loading, fuzzy matching, and mapping resolution for Geoff
-
stack_collections
Stack-allocated collections for Rust
-
ndarray-layout
definitions and transformations for multi-dimensional array data layouts
-
bhc-data-structures
Common data structures for the BHC compiler
-
ttgraph
Typed/Transactional Graph container
-
monstertruck-assembly
Assembly data structures using a directed acyclic graph (DAG)
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
elephantry-extras
A collection of additional components for elephantry
-
kempt
Ordered collection types with no unsafe code and no_std support
-
assoc
Treat vectors like associative arrays
-
feagi_connector_core
Adds Caching and Processing systems that are used by Feagi Connector
-
filetreelist
filetree abstraction based on a sorted path list, supports key based navigation events, folding, scrolling and more
-
whale
A lock-free, dependency-tracking primitive for incremental computation
-
better_peekable
Peekable iterator like std::iter::Peekable but allows for peeking n items ahead instead of just one
-
nestmap
Ergonomic nested hashmap trees for hierarchical config and namespace management
-
rocketman
A modular(ish) jetstream consumer
-
command-trie
A compact radix trie for command-line tab completion and longest-prefix matching
-
thunderation
Fast arena-based map with compact generational indices
-
plain-ds
Plain data structures
-
paginator-utils
Shared pagination response structures
-
vigil-ui-protocol
IPC protocol types for Vigil desktop UI — Tauri command request/response schemas with capability gating
-
cvkg-vdom
Cyber Viking Kvasir Graph (CVKG) - High-fidelity agentic UI framework
-
pleat
Ribbon filters with pleated (partition-instead-of-sort) construction: build at Bloom-filter speed, verify by checksum
-
zakat-ledger
Event sourcing, timeline simulation, and Hawl tracking for Zakat calculations
-
count-min-sketch-rs
A high-performance, zero-allocation Count-Min Sketch implementation for frequency estimation
-
crabka-voters
KIP-853 voter-set value types for Crabka (id, directory-id, endpoints, kraft.version)
-
bumpish
A set of collections using bump allocations
-
btree-ondisk
BTree structure on persistent storage in userspace
-
agb_hashmap
no_std hashmap implementation intended for use in the
agblibrary -
gap-buf
Generic gap buffer
-
multi-index-container
procedural macro for collections that can be efficiently looked up, mutated, and removed by multiple indexes simultaneously
-
grovedb-version
Versioning library for Platform
-
lnc-core
Core types and primitives for LANCE - TLV, SortKey, LoanableBatch, buffer pool
-
streamies
More features for your streams
-
io_core
A no_std I/O foundation for Rust
-
ans-types
Shared types for the Agent Name Service (ANS) ecosystem
-
brarchive
Bedrock Archives in Rust
-
disjoint-sets
Three union-find implementations
-
smart_led_effects
A collection of effects for LED strips
-
browser-controller-types
Shared protocol types for browser-controller CLI and mediator
-
nested
A memory efficient container for nested collections (like
Vec<String>orVec<Vec<T>>) -
llattice
A minimal lattice trait (join/meet) with built-in implementations for integers, floats, bool, Option, HashSet, and Vec
-
chronoflake
Generate unique IDs based on the Snowflake algorithm
-
min-max-heap
An efficient, double-ended priority queue
-
omena-incremental
Salsa-style incremental invalidation primitives for Omena
-
strict
collections with strict bounds
-
rten-onnx
ONNX model parser
-
refgraph-domains
Domain type definitions for RefGraph (insurance, medical, legal, finance)
-
sorbus
A tree manipulation library
-
midi-flux-bridge
Bridges tensor-midi timing schedules to FLUX coordination bytecode
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
psrutils
few utilities to facilitate pulsar science projects in rust
-
const-array-concat
Concatenate fixed-size arrays at compile time without copying
-
bumparaw-collections
A small set of bumpalo-backed collections for low-level operations
-
sley-rev
Native-Rust Git revision walker and rev-list argument resolution for the sley engine
-
inputx-fsa
Minimal acyclic finite-state automaton — a compact, zero-dependency ordered byte-key → u64 map with prefix/range scan. Built for the Inputx IME's dictionaries (clean-room replacement…
-
bitvek
bit vector implementation
-
stac-io
Input and output (I/O) for the SpatioTemporal Asset Catalog (STAC)
-
copc-core
Shared COPC metadata, hierarchy, streaming point, and error types
-
sui-intern
String interning for the sui Nix evaluator — Symbol(u32) handles for O(1) comparison
-
openligadb
API
-
sim-expr-tree-calc
Bounded incremental calculation of ordinary SIM expressions and values
-
linear-hashtbl
Linear probing hash table
-
malwaredb-api
Common API endpoints and data types for MalwareDB components
-
ggen-domain
Domain logic layer for ggen - pure business logic without CLI dependencies
-
navan
Rust type bindings for the Navan (formerly TripActions) Bookings API
-
bitarena
A bitset-accelerated generational arena optimized for sparse iteration
-
opejson
Surgical JSON manipulation macros for Rust. (Strict, Genesis, and Law modes)
-
singletonThread
thread in a singleton
-
malt
Merkle Append-Only Log Tree (RFC 9162 §2.1)
-
cseq
compact sequences
-
pretty_graph
toolbox to build and working with graphs
-
flake-schemas
inspecting the contents of a flake
-
tailcall-chunk
persistent data structure for efficient append and concatenation operations
-
oats-rs
Short, unique ids without the hassle of random uuids
-
oxigdal-core
Core abstractions for OxiGDAL - Pure Rust GDAL reimplementation with zero-copy buffers and cloud-native support
-
ocel-etl
ETL engine for OCEL 2.0 process mining: staging representation with a validation gate
-
hodgepodge
Lightweight dataset crate of enums for prototyping, teaching, and experimentation
-
bigraph
Different representations with implemented operations on bigraphs
-
small-collections
A collection of data structures optimized for small-buffer scenarios that reside on the stack and seamlessly spill to the heap
-
serde_single_or_vec2
Type which can be deserialized from either a sequence or a single value
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
titans_memory
Titans Memory: Neural-inspired memory system for AIngle AI agents
-
binary-util
A panic-free binary utility crate to read/write binary streams over the wire
-
penrose-memory
Aperiodic memory palace for AI agents with tile lifecycle, simulation-first predictions, and Lamport clocks
-
eventfold
Lightweight, append-only event log with derived views — your application state is a fold over an event log
-
opensearch_query_builder
Opensearch query builder
-
u24
An unsigned 24-bit integer type
-
bed-utils
manipulating genomic range objects
-
lox
Fast polygon mesh library with different data structures and traits to abstract over those
-
ceres-core
Core types, harvesting logic, and services for Ceres
-
dndtree
DND-Tree dynamic connectivity data structure
-
cerulean
A collection of 2,500+ beautiful color palettes
-
slice-cell
A
Cell<[T]>-like mutable slice, that allows slice-like APIs -
simd_aligned
Safe and fast SIMD-aligned data structures with easy and transparent 'flat' access
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
blocklist
The project is based on blocklistproject. It provides perfect hash map/set structures for fast lookup of blocklisted items.
-
cap_vec
A no_std heap-backed vector with fixed compile-time maximum capacity
-
uuid-rs
Universally Unique IDentifier (UUID)
-
rb_tree
A Red Black Tree implementation in Rust
-
widegita
Rust SDK for WideGita -- Bhagavad Gita, Upanishads, Yoga Sutras, Hindu deities, and Sanskrit encyclopedia via the widegita.com API
-
xorfilter-rs
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
-
bilock
A minimal spin-lock based two-handle
Arc<Mutex<T>>replacement -
superintervals
Interval overlap library
-
stash
An amortized
O(1)table for cases where you don’t need to choose the keys and want something faster than a HashTable -
skenion-contracts
Generated Skenion v0 wire contracts
-
expanding_slice_rb
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
-
owl-dl-reasoner
Hybrid saturation+tableau OWL DL reasoner — public API for rustdl
-
typekin
new-type pattern with concept of Friends borrowed from c++
-
cel-contracts
Shared Rust contracts for AI agent actions, planning views, runtime capabilities, and execution receipts
-
packo
Packed datastructure with self referential indexing
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
ec-validator
High-performance validation for Ecuadorian government IDs (cédula, RUC) and financial data (IBAN)
-
hashheap
data structures that combine a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
gtars-scoring
Small, rust utility to compute read overlaps of fragments files over a universe
-
etl-unit
Semantic data model for ETL units — qualities and measurements over subjects and time. Built on Polars.
-
image-ndarray
Zero-copy implementations for the Image crate to convert to and from ndarrays
-
uroboros
Rust ouroboros-style self-referential string windows for Knott utilities
-
bplus_store
Copy-on-write B+ tree with page-aligned storage, split/merge, and crash-safety primitives
-
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
-
omega-core
Core types and traits for ExoGenesis Omega universal intelligence orchestration system
-
astrodyn_quantities
Phantom-tagged typed quantities (Position, Velocity, ...) for orbital dynamics
-
jesterky-contract
The pinned jesterky workflow contract: topology, event, artifact, replay schemas
-
oxidd-rules-bdd
Binary decision diagrams (BDDs) for OxiDD
-
rdf-types
Data-structures and traits definitions for RDF
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
mdcs-delta
Delta-state CRDT machinery for the Carnelia Merkle-Delta CRDT Store
-
aatree
in Rust
-
formspec-lint
Formspec Linter — 8-pass static analysis pipeline
-
agentic-evolve-core
Pattern library engine for AI agents - crystallizes and reuses verified code patterns
-
mco-gen
Stackfull Generator Library in Rust
-
linked-hash-table
A linked hash table implementation for insert-order iteration and efficient lookups
-
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…
-
xsd
XSD.rs
-
ergo_avltree_rust
cryptographically authenticated dictionary based on AVL tree
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
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.
-
chiralmap
Left-Right map using IndexMap
-
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.
-
edifact-primitives
Shared EDIFACT primitive types — zero dependencies
-
rust_cascade
bloom filter cascade implementation in Rust
-
open-bcif
A high-performance streaming toolkit for BinaryCIF (BCIF) files
-
ews
Data structures and operations relating to the Exchange Web Services API
-
matten-data
CSV/table-to-Tensor preparation companion for matten (small PoC datasets)
-
tinyvec_string
tinyvec based string types
-
statekit
An immutable state-machine for validating predefined transitions
-
numeric-array
Wrapper around generic-array that adds efficient numeric trait implementations
-
slack-blocks
Models + clientside validation for Slack's JSON Block Kit
-
rose_bloom
A concurrent growing element size linked list with stable pointers
-
unbound
Locally nameless representation with automatic capture-avoiding substitution and alpha equivalence
-
microkelvin
tree traversal over annotated data structures
-
mirror_id
Decentralized 128-bit ID generator for distributed systems
-
thermogram
Plastic memory capsule with 4-temperature tensor states (hot/warm/cool/cold), bidirectional transitions, and hash-chained auditability
-
migs
A SQL migration script collection library with compile-time registration
-
dpp-domain
EU Digital Product Passport domain types, port traits, and per-field disclosure policy
-
gaze-types
Shared value contracts for Gaze
-
praborrow
framework - A distributed systems framework for Rust
-
retworkx
A python graph library implemented in Rust
-
indextreemap
A BTreeMap-like ordered map with key and positional lookup
-
sim-codec-json
SIM workspace package for sim codec json
-
vec-collections
Rust collections that are newtype wrappers around smallvec
-
somatize-agent
Autonomous research agent for the Soma runtime
-
nexus-bits
Bit field packing for integer IDs
-
normalize_interval
Normalizing interval library
-
spatialtree
A fast and flexible generic spatial tree collection (Octree, Quadtree, etc)
-
subms-hdr-histogram
submillisecond.com cookbook recipe - observability: subms-hdr-histogram. Log-linear bucket histogram with significant-digit precision.
-
oximedia-pipeline
Declarative media processing pipeline DSL — typed filter graph, node composition, and execution planning for OxiMedia
-
compact-calendar
Compact representation of a set of days based on a bit-maps
-
sparse-merkle-tree
Sparse merkle tree implement in rust
-
tickbar
High-performance tick-to-bar aggregator for market data
-
sigma-types
Types checked for an invariant
-
dmfr-dataset-reader
Reads transitland folder and outputs graph of valid feeds and operators
-
flex
Flexible borrowing and ownership for Rust
-
orbweaver
designed for effortless construction and analysis of graph data structures
-
walker-extras
Additional functionality for SBOM and CSAF walker
-
valkyrie-ast
Strong typed abstract syntax tree of valkyrie language
-
structured
Data structures to handle large, structured data
-
smol_bit_vec
A tiny, bit-packed bit vector with Small Vector Optimization (SVO)
-
gotgraph
A type-safe, scope-aware graph library that leverages Rust's type system to prevent common graph-related bugs at compile time
-
rt_ref
Internal
Reftypes forrt_refandrt_vec -
disjoint-ranges
Ranges with gaps
-
pimalaya-tui
Collection of crossterm widgets shared accross Pimalaya projects
-
adif_io
read and write ADIF formated files
-
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…
-
suffixarrayview
Creates a view of a suffix array
-
superposition-assets
Superposition Assets supported on Arbitrum One
-
orx-pseudo-default
PseudoDefault trait allows to create a cheap default instance of a type, which does not claim to be useful
-
cbsk_socket
socket callback tool
-
normalize-package-index
Package index ingestion from distro and language registries
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
static-lang-word-lists
Runtime decompressed statically-included word lists
-
luaur-common
Foundational data structures and flags for the luaur Luau-in-Rust toolchain
-
xtri
A fast, memory-efficient radix tree (compressed trie) implementation in Rust with UTF-8 support
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
threshold
data structures
-
wae-schema
WAE Schema - 数据结构定义与验证
-
dyncollections
bunch of collections to store trait objects and retrive concrete types from them
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
wrapbin
binary newtype as wrapped Cow u8 array
-
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
-
tarot-card-meanings
Complete 78-card tarot deck with all card meanings, daily tarot card, yes or no readings. Includes upright and reversed meanings, love and career interpretations. By Deckaura (https://deckaura.com)
-
signvec
Vector implementation for fast, sign-based manipulation of dynamic collections
-
onlyq
A cyclic data structure that allows the oldest value to be overwritten by the newest one
-
jaggedarray
Multidimensional jagged array
-
weighted-list
Data structures for weighted randomisation
-
ferro-projections
Service projection definitions for the Ferro framework
-
overwrite-ring-buffer
A fixed-size and resizable overwrite ring buffer for Rust
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
graphlink
A memory-safe, relational in-memory graph database
-
fastbit
A fast, efficient, and pure Rust bitset implementation for high-performance data indexing and analytics
-
corevm-codec
CoreVM codec collection. Used to encode and decode output streams produced by the guest.
-
signalk
parse signalk maritime data
-
re_tf
Rerun spatial transform processing
-
libcint-src
libcint (C library) source or build specification
-
goldleaf
A thin wrapper over MongoDB to make it shine!
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
wtools
Single entry-point for collection utilities. Re-exports collection_tools: variadic constructors and unified HashMap/HashSet/Vec support.
-
omega-memory
12-tier cosmic memory system with automatic consolidation (Instant → Omega)
-
powerio-pkg
The .pio.json document model: one PowerIO model JSON object with explicit model kind, provenance, source maps, structured diagnostics, validation, and lowering history
-
fandwill-vo
Serde, garde, and utoipa value objects for the Fandwill platform API
-
heapless_graphs
composable graphs for no_alloc environments
-
bytetable
High-performance data structures indexed by u8
-
cordage
Generic graph core: typed overlays, deterministic ordering, channel propagation
-
staticvec
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics
-
fugue-iset
Map and set with interval keys (x..y)
-
list_ordered_hashmap
An insertion-ordered hash map that provides O(1) (amortized) insertion, lookup, update and removal
-
indexmap_store
Persistent IndexMap for Rust — embedded key-value store with in-memory hash map + append-only WAL on disk. O(1) get/insert/remove, insertion-order iteration, crash-safe recovery, automatic log compaction…
-
uid_store
Generate random uid strings containing letters, numbers, or base62 values
-
xtask-toolkit
A collection of useful tools for xtask building
-
crtx-store
SQLite persistence: migrations, repositories, transactions
-
llmtask
Engine-agnostic Task abstraction for LLM structured-output: Task trait + Grammar (JSON Schema, Lark, Regex) + ImageAnalysis
-
python-packed-resources
Manage data structures containing Python resources
-
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
unigraph_turbopack
Turbopack module graph integration for unigraph
-
bt_anytype_map
Basic HashMap to store any data type in a thread-safe manner with zero dependencies
-
pulith-resource
Composable resource description types for Pulith
-
tree-haver
Tree substrate and binary location contracts for Structured Merge
-
veks-anode
Self-describing binary wire formats for structured metadata (MNode), predicate trees (PNode), and annotation nodes (ANode)
-
diffsol-c
A diffsol wrapper featuring runtime scalar/matrix/solver types and a C API
-
graphcore
Base data structure to represent and manipulate property graph
-
nori_inference
Fast probabilistic inference for ambiguous observation-entity mappings
-
intrusive-avl-tree
A high-performance, zero-allocation, intrusive AVL for Rust
-
weathergrid
Wire-contract types for the weather forecast API — gridded wind/weather data with interpolation and a shared bincode codec
-
slotmapd
orlp/slotmap fork where serialization cycle doesn't change observable behavior
-
skippy
Highly flexible worst-case O(log n) intrusive skip list
-
generational-indextree
Arena based tree structure by using indices instead of reference counted pointers
-
vecdeque-stableix
Deque with stable index values
-
queues
Efficient FIFO Queue data structures
-
nzfcc
New Zealand Financial Category Codes (NZFCC) library
-
dyn-slice
&[dyn Trait] implementation, inspired by a Reddit thread
-
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
-
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
ism
ODNI ISM (Information Security Marking) schema package, vendored. Designed as a build-dependency for codegen. SHA-256 verified at compile time.
-
risc0-povw
Core library for RISC Zero Proof of Verifiable Work (PoVW)
-
forrust_fire_tracing
Tracing integration for
forrust_fire_tree -
sacp-cbor-abi
Stable ABI schema and codegen layer for sacp-cbor
-
smartbuf
A high-performance buffered reader with background thread pre-fetching and full seek support
-
formualizer-common
Core value, reference, and error types shared across the Formualizer parser and engine
-
ware
middleware chains
-
prost-unwrap
A procedural macro for prost-generated structs validation and type-casting
-
post-cortex-embeddings
Embedding engines (Model2Vec static + BERT via Candle + static-hash fallback) and HNSW vector database for post-cortex. Self-contained ML stack — depend on this crate when you need…
-
drainlib
DRAIN log parsing algorithm
-
safecheckpoint
A Rust-native ML model checkpoint library replacing torch.save() with zero-copy mmap-based serialization and parallel shard writes
-
structupdate_support
Type definitions used by the structupdate crate
-
mc-oblivious-ram
Implementations of Oblivious RAM data structures
-
collect_failable
A trait for collecting values into a container which has an invariant to uphold and whose construction may fail
-
wenlan-types
Shared wire-format types for Wenlan, the local-first personal agent memory system
-
reliakit-collections
Bounded and reliability-oriented collection types for Rust
-
ic-stable-roaring
Persistent Rust Roaring Bitmap for the Internet Computer
-
higher
Functors, Applicatives, Monads and other bad ideas
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
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…
-
box-collections
A no_std compatible implementation of the collection crate
-
coca
Data structures with constant capacity
-
relib-bss
Binary-state system (BSS) reliability analysis over BDDs: probability, path/cut enumeration, minimal solutions, k-of-n, counting. Engine behind the relibmss Python package.
-
typeshift
Zod-like parse, validation, and JSON Schema flow for Rust types
-
evict
Page eviction policies: LRU, LRU-k, LIRS, SLRU etc
-
hibitset
Hierarchical bit set structure
-
libutils-array
A maximum-sized array stored on the stack
-
polytype
A Hindley-Milner polymorphic typing system
-
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.
-
varlen
Ergonomic variable-length types
-
lutra-arrow
Arrow format conversion for Lutra: converting between Arrow RecordBatch and Lutra binary values
-
cutoff-common
A collection of common utilities and helpers used across Cutoff projects
-
oracle_omen_core
Core types and abstractions for oracle.omen deterministic agent framework
-
svd-rs
A CMSIS-SVD base structures
-
mergle
A data structure with fast merging and comparison
-
ecsx
Entity Component System eXtended
-
slice_ring_buf
A ring buffer implementation optimized for working with slices
-
tedium
A fast and easy TDMS Library for Rust
-
neco-tree
Generic ID-bearing tree with cursor-based navigation
-
stack-queue
Heapless auto-batching queue
-
tinyflow-api
Core traits, types, and abstractions for Tinyflow streaming framework
-
medea-reactive
Reactive mutable data containers
-
deputy-core
Domain types, the dependency-artifact state machine, and trait contracts for Deputy. No I/O.
-
smodel
Symbol semantic modeling for Rust
-
ironstate-aggregate
Deterministic aggregates: decide/evolve, entropy, redaction, StableHash
-
luka
working with graphs
-
garlic
A collection of random side projects
-
ordvec-manifest
Manifest verifier for ordvec index provenance and sidecar artifacts
-
tugger-file-manifest
Interact with lists of files through a storage-agnostic interface
-
gen-models
Models for the gen sequence graph and version control system
-
succparen
Succinct data structures library for balanced parentheses representation
-
zed-sum-tree
A sum tree data structure, a concurrency-friendly B-tree
-
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… -
rt-pods-client
Official Client for RtPods
-
fwob-v1
Reader, writer, verifier, and editor for the FWOB v1 binary format
-
redwing
A copy-on-write, branching byte-stream library backed by a piece table and delta log
-
vortex-vector
Vortex in-memory canonical data format
-
fixed-slice-deque
A fixed size deque implementation
-
converge-embassy-commerce-csl
Commerce CSL port — US Department of Commerce Consolidated Screening List (BIS Entity List, Denied Persons, Unverified List)
-
widebible
Rust SDK for WideBible -- Bible verses, books, people, places, cross-references, and study tools via the widebible.com API
-
no_debug
Helper types to omit debug info for select values
-
cbsk_base
locked version cargo crates
-
zngur-def
Data types that define the structure of a zng file
-
lru-mem
An LRU cache implementation bounded by memory
-
fffl
A contiguous First-fit Freelist
-
kael_collections
Fast deterministic collection aliases and standard collection re-exports for Kael
-
sim-lib-sequence
Sequence operations, lazy streams, and collection transforms for SIM
-
composable-indexes
In-memory collections with composable indexes
-
shogiesa-stratify
Adapter mapping shogiesa PositionRecords onto stratifykit-core's generic feature/bucket/group concepts
-
semi-persistent
data structures, e-graphs, and recursion schemes
-
rune-graph-gremlin
Gremlin-inspired graph traversal engine for rune-graph: typed step pipeline, predicates, repeat, path tracking
-
rust-keypaths
A static dispatch, faster alternative to rust-key-paths - Type-safe, composable keypaths for Rust with superior performance
-
veclite
A lightweight, ergonomic wrapper around Vec<T> that implements Display
-
use-molecule
Molecular identity primitives for RustUse
-
asbytes
Traits for viewing data as byte slices or consuming data into byte vectors. Relies on bytemuck for POD safety.
-
cds
Collection of Optimized Data Structures
-
obzenflow-idkit
Phantom-typed ULID identifiers for ObzenFlow - type-safe IDs for native and WASM
-
boolvec
A vector of boolean stored contiguously in memory
-
lignin
A virtual DOM structure, primarily for web use
-
multi-map
Like a std::collection::HashMap, but allows you to use either of two different keys to retrieve items
-
ibuilder
Interactive builder for Rust types
-
deep_causality_data_structures
Data structures for for deep_causality crate
-
generic-btree
Generic BTree for versatile purposes
-
mako-geli-gas
GeLi Gas process engine for German gas market communication (Geschäftsprozesse Lieferantenwechsel Gas)
-
approx_collections
Collections using approximate floating-point comparison
-
uintx
Unaligned unsigned integers with exact size in memory and arithmetic operations for them
-
id_effect_optics
Functional optics — Lens, Prism, Traversal, JSON patch, and schema field paths for id_effect
-
xuko
Rust utility library
-
prefix-sum-vec
Compressed storage for highly repeating elements, with
O(log n)lookups -
auto-concat-array
Concatenate fixed-size arrays on stable Rust with automatic array length inference
-
datafrost
Data format and acceleration structure management
-
hit-data
Hierarchical Indexed Typed data structure
-
bitboard64
A 64-bit bitboard useful for chess programming
-
my_vector
Lightweight no-std dynamic resizable array (Vec)
-
tree-flat
TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust
-
kcode-task-board
Kennedy's persistent graph-shaped task board
-
adar-registry
Advanced Architecture (ADAR) is a collection of architectural tools that help you write more readable and performant code
-
pyvoxelis
Python bindings for voxelis, a high-performance sparse voxel octree library
-
logvec
A cache-friendly Bentley-Saxe logarithmic array data structure
-
sugars_builders
Builder pattern utilities and abstractions for the cyrup-sugars ecosystem
-
attribute-search-engine
Generic search engine for rows with attributes using different matchers
-
bplus-index
Arena-backed B+Tree for in-memory sorted indexes. Zero unsafe, cache-friendly, supports non-unique keys.
-
signal-space
Signal Space graph, timeline, inspector, and intent types for Rust
-
re_string_interner
string interning library
-
traiter
Traits collection
-
polydigest-storage-fjall
Fjall-backed storage backend for the EML append-only library
-
uniques
Analyze items in a slice and calculate the unique, first, duplicate, and subsequent items and their indices
-
wybr
Collection of preferential voting methods
-
digit-sequence
Sequence of u8 digits
-
bun_collections
A Rust-native programmable browser runtime built on Servo and SpiderMonkey
-
extarray
Space-Efficient Extensible Arrays
-
semx_cpumask
CPU 位掩码，支持原子操作与迭代
-
griddle
A HashMap variant that spreads resize load across inserts
-
pi_slot
lock free Slotmap data structure
-
simple-grid
2d-grid structure
-
rc-u8-reader
A tiny implement for reading
u8data from a reference counted instance -
dcel
doubly-connected edge list
-
quotient-set
compated datastucture
-
mif-ontology
Ontology resolution for the MIF (Modeled Information Format) ecosystem
-
graph-api-petgraph
Integration between graph-api and petgraph - use graph-api's traversal system with petgraph structures
-
linksql
Rust reference implementation of LinksQL — an associative query language built around a single substitution operation
-
text-span
Struct covering areas of text
-
intrex
Intrusive collections with items addressed by indices
-
sigmars
sigmahq rule collections
-
f1r3fly-rspace-plus-plus
F1r3fly Tuple Space implementation in Rust - high-performance storage and pattern matching
-
llmcc-collect
Node and edge collection for llmcc graph rendering
-
qutee
A quadtree implementation
-
pbn
Programming by Navigation types and traits
-
lattice-graph
Set of Lattice(Grid) based Graph Structures
-
subms-lsm-tree
submillisecond.com cookbook recipe - storage: subms-lsm-tree. A working LSM tree (memtable, immutable SSTables, bloom-filter trailer) with sub-millisecond reads at p99 on a 50k-entry workload.
-
mashmap
A flat HashMap that supports multiple entries per key
-
offset-vec
Packer for Vec and String etc, for all methods index add a offset
-
chat-prompts
Chat prompt template
-
code_location
UNMAINTAINED! Use std::panic::Location instead!
-
intrusive-listeners
A compact reentrant type-erased event-listener registry
-
hitchmark-core
Core library for hook:// URI links, stable bookmark IDs, and purple-number paragraph addressing
-
runner-protocol
Versioned JobSpec, JobResult and failure protocol for AI Kodu Runner
-
bv
Bit-vectors and bit-slices
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
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).
-
rez-next-suites
Suite management for Rez Next - manages collections of resolved contexts
-
aograph
AND-OR graph data structures and algorithms
-
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.
-
graphix
representing undirected graphs using a compressed adjacency list
-
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
-
chemfiles
Modern library for chemistry trajectories reading and writing
-
gpui_collections
Standard collection type re-exports used by Zed and GPUI
-
bitstring-trees
Trees based on bitstrings
-
compactvec
Vec<u32> that auto-selects 1/2/3/4-byte storage per element, upgrading in place when values grow
-
flow-mumu
Stream transform tools plugin for the Lava language
-
purrdf-events
Permissive RDF 1.2 ingestion protocol: the object-safe event sink/source seam both the GTS container and the IR engine depend ON
-
indexed_arena
index-based arena without deletion
-
relib-mss
Multi-state system (MSS) reliability analysis over MTMDD2: state probability, minimal path/cut vectors, counting. Rust engine behind the relibmss Python package.
-
range_map_vec
range map data structure backed by a Vec
-
floating_bar
Representing rational numbers using the floating-bar number type
-
anchors
async incremental computations
-
g-type
Generic types with bounds and validation
-
loc_api
interact with the loc.gov API
-
zbq
Linux SPMC zero-copy shared-memory IPC queue, with optional FD passing
-
array-queue
Fixed size bidirectional queues based on arrays
-
bbox
Managing axis aligned Bounding Boxes
-
scanstate
Generic scan checkpoint, journal, and progress primitives for pause/resume workflows
-
cell-grid
2d grid container
-
gtfs-geojson
converter for GTFS to GeoJSON formats
-
geiserx_ts_array256
fast sparse 256-element array with configurable backing storage
-
xtrie
A high-performance Adaptive Radix Tree (ART) — memory-efficient trie with prefix search, range queries, and ordered iteration
-
hashslab
A hash table with data accessible by index
-
orx-meta
Meta structures such as statically typed queues of heterogeneous elements
-
oxgraph-snapshot
Topology-agnostic byte-level snapshot container
-
beap
Bi-parental heap data structure implementation in Rust
-
arrow-message
implements a way to define messages according to the Arrow format in both Rust and Python
-
palindromeda
Palindrome number generator and checker at blazing speed
-
slice-init-transact
Mostly safe interface to initialize values in collections of MaybeUninit in a transactional style
-
rune-graph
Embedded directed property graph: nodes, edges, labels, key-value properties, traversal, algorithms, and optional snapshot persistence
-
nexcore-id
Zero-dependency UUID implementation for NexVigilant Core ecosystem
-
suff_collections
Fast realization of suffix array and suffix tree
-
roadmap
model a project roadmap as a directed acyclic graph
-
fhirpathrs
Fhirpath implementation in Rust
-
phf_macros
Macros to generate types in the phf crate
-
retaker
ecs implementation
-
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…
-
rustac
Command line interface for rustac
-
standing-relations
Standing relations over a shifting dataset optimized for 'feedback loop' scenarios
-
hash_cons
A type-safe hash-cons library
-
bytes-rc
Single-threaded, Rc-based byte buffers compatible with bytes::Buf and BufMut
-
reinterpret
Low level utility functions to reinterpret arrays of data
-
sim-lib-lang-scheme
Scheme surface profile for the SIM expression runtime
-
syntastica-themes
A collection of themes for syntastica
-
crdt-merge
Conflict-free merge, dedup & diff for any dataset. Powered by CRDTs.
-
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 -
quickbloom
An industry-grade, highly scalable Bloom filter with lock-free concurrency, blocked layout, and automatic persistence
-
more_ranges
Range types not provided in the standard library
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
zkcg-verifier
ZKCG proof verifier supporting Halo2 circuits and zkVM execution receipts
-
tiled_parse_tree
Tree data structure
-
gpui_rn_sum_tree
A sum tree data structure (fork for React Native GPUI)
-
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
-
mirtal
Native, explicit-stream Rust API for Apple Metal
-
kg-tree
Generic object tree with Opath query language, similar to XPath
-
triple_buf_64
A cheap lock-free triple buffer data structure that stores 64 bits of data
-
rust_identified_vec
Ordered collection with O(1) id lookup — Rust counterpart to UDF IdentifiedArray
-
formualizer-eval
High-performance Arrow-backed Excel formula engine with dependency graph and incremental recalculation
-
pulz-arena
A generational arena allocator with compact generational indices
-
rtdlib
TDLib for rust
-
point-nd
flexible no-std struct to model points on axes of any dimensions
-
deep_causality_sparse
Spare matrix data structure for for deep_causality crate
-
heapix
providing heap data structures
-
hlc_id
generating and managing Hybrid Logical Clock (HLC)-based IDs
-
safe_index
Type-safe indexes
-
strumbra
Umbra-style strings (also known as German strings)
-
nibble_vec
Vector data-structure for half-byte values
-
guppy-summaries
Build summaries for Cargo, created by guppy
-
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.
-
lodtree
help create octrees and quadtrees for chunked level of detail
-
higher-graphen-reasoning
Reasoning primitives and engines for HigherGraphen invariants, obstructions, completion, model checking, and abstract interpretation
-
alot
A forbid-unsafe, generational slot map with usize-sized IDs
-
hexga_generational
GenVec, ideal for MAS (Multi-Agent System), where each agent can be removed at any time and has references to other agents
-
spimdisasm
MIPS disassembler
-
sum_tree-gpui-standalone
A sum tree data structure, a concurrency-friendly B-tree
-
noetl-arrow-flight-client
NoETL Arrow Flight client — Rust consumer for the noetl-server's /api/result Flight gRPC endpoint (R-2.3 Phase B + C1 + C2.2)
-
ratio-interner
Ratio's value interner library
-
uv-once-map
internal component crate of uv
-
yslib
ysaf standard library
-
range-tree-rs
A range tree implement for slab allocator
-
sevec
A fast, pure Rust implementation of the segmented array data structure
-
digits
Custom “numeric” incrementor without u64 MAX limit in size. Like a score flipper for a custom character set.
-
typed-bytes
Fully typed data size units (IEC and SI) with operator overloading
-
range_bounds_map
[
RangeBoundsMap] and [RangeBoundsSet], Data Structures for storing non-overlapping intervals based of [BTreeMap] -
aviutl2-alias
AviUtl2のエイリアスデータを操作するためのライブラリ
-
use-element
Small chemical element primitives and lookup helpers for RustUse
-
rust_flightweather
Decodes METAR and TAF
-
predisposition
Three-valued boolean types with different predispositions for the unknown case
-
slab_tree
A vec-backed tree structure with tree-specific generational indexes
-
sif-kdtree
immutable, flat k-d tree
-
map_vec
The Map and Set APIs backed by Vec
-
dsq-shared
Shared types and utilities for DSQ crates
-
fugue-tinyset
Size-optimized sets
-
seq-map
Sequential Map
-
attuned-cli
CLI tool for Attuned development and testing
-
rustac-py
pyo3 bindings for the rustac family of crates
-
nu-plugin-engine
Functionality for running Nushell plugins from a Nushell engine
-
patina_internal_collections
Collection types to the DXE Core
-
sarif_rust
A comprehensive Rust library for parsing, generating, and manipulating SARIF (Static Analysis Results Interchange Format) v2.1.0 files
-
generational_token_list
A doubly-linked list backed by generational-arena
-
pypinindia
Indian pincode lookup and geographical information
-
matchy-ip-trie
Binary IP trie for matchy database lookups (internal)
-
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…
-
sorted_vector_map
maps and sets backed by sorted vectors
-
qrqrpar
A QR code generator supporting rMQR
-
mif-store
SQLite vector store for document embeddings in the MIF (Modeled Information Format) ecosystem
-
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
bidiff
A bsdiff-derived binary patching tool - patch library
-
webdav-request
a lightweight webdav client library
-
reflow_assets
Content-addressed asset database conventions for Reflow workflows
-
progscrape-application
progscrape.com application logic
-
ux-dx
3D Graphics Primitives for Angular Rust
-
median-accumulator
fast, space-efficient, generic accumulator for computing median
-
panoradix
A generic map and a set, both backed by a Radix tree
-
sliding_window_alt
A structure that holds the last N items pushed to it
-
CartesianTree
Build hierarchical Cartesian coordinate systems to easily transform poses
-
zhifeng_impl_barnes_hut_tree
implements Barns-Hut Tree for accelerated N-body force calculation
-
safety-pass
Compiler pass infrastructure for safety-net
-
bunpack
(un)packing binary data into structured formats like python's struct module
-
hexga_array_vec
A vector with fixed capacity, backed by an array based on arrayvec
-
regexto-validators
A zero-dependency collection of battle-tested regex patterns for Rust, backed by regex.to
-
use-finance
Facade crate for RustUse practical finance primitives
-
circbuf
A growable circular buffer for working with bytes
-
gufo-tiff
Data structure for TIFF images
-
ggapi
communicating with start.gg's API
-
oxirs-vec
Vector index abstractions for semantic similarity and AI-augmented querying
-
sharded
Safe, fast, and obvious concurrent collections
-
kdtree-simd
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
-
selmr
Package to create and use Simple Explainable Language Multiset Representations
-
recycle_vec
method for Vec to recycle it's backing allocation for use with another Vec of different type
-
diffkit
diffing and patching sequences and nested structures
-
crdt-data-types
High-performance CRDT library with dual pathways: JSON-native for web APIs and Cap'n Proto zero-copy for binary transport
-
wadachi-spec
Wadachi (轍) frecency-ranking core — the typed-spec triplet (Rust border + authored Lisp spec + interpreter with a mockable Environment). One ranking formula, shared by every consumer (directories…
-
moka-cht
Lock-free resizeable concurrent hash table
-
tuplities-option
Traits for working with tuples of Options
-
shannon-nu-plugin-engine
Functionality for running Nushell plugins from a Nushell engine
-
fixed-macro
Macros for creating fixed-point constants for types in the
fixedcrate -
kn0sys_ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
scp-event-log
Verifiable Merkle event log for SCP (Shared Context Protocol)
-
seedling
hierarchical seeded pseudo-random number generators
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
triple-r
Macros to for the recuerdame crate
-
arbitrary-chunks
An iterator that allows specifying an input array of arbitrary chunk-sizes with which to split a vector or array
-
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
-
waterslide-rs
A tiny Rust sketch of WaterSlide-style tuple pipelines
-
entid
generating and validating type-safe, prefixed entity identifiers based on UUIDs and ULIDs
-
merkle_light
Light merkle tree implementation with SPV support and dependency agnostic
-
widesutra
Rust SDK for WideSutra -- Buddhist scriptures, Tipitaka, Pali Canon, Buddhist concepts, and figures via the widesutra.com API
-
kcr_workloads_kubeblocks_io
Kubernetes Custom Resource Bindings
-
raphy
A graph data structure library
-
irange
A data structure to store and manipulate ranges of integers with set operations
-
clvec
Experimental implementation of const length Vec-like datastructure CLVec with corresponding finite index type Fin
-
rexsgdata
Scatter-Gather Data Descriptors
-
deep_flat
macro for deep flattening objects
-
gen_value
indexes and values with generations for vectors
-
tritools
A collection of tools
-
wideholy
Rust SDK for WideHoly -- cross-religion scripture search, verse comparison, religious calendar, and commentary via the wideholy.com API
-
type-rules
easily constrain a struct
-
copy-stack-vec
A no_std, fixed-capacity, stack-allocated Copy vector for Copy types, with no unsafe code by default
-
espalier
Very simple flattened tree structure
-
broomfilter
A bloom filter that sweeps away your certainty. Probably.
-
type_slicer
型付きメモリスライサー
-
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.
-
enum-tag
Proc. macro for generating enum discriminant types.
-
snid
Polyglot sortable identifier protocol with UUID v7-compatible ordering and extended identifier families
-
ezu-graph
Typed DAG evaluator for the Ezu Style Spec
-
rdftk_skos
data model for the Simple Knowledge Organization System (SKOS) vocabulary
-
cityjson-types
Types and accessor methods for representing semantic 3D city models in Rust, implementing the CityJSON specifications
-
unsized-vec
Like Vec, but for unsized values
-
swiss-table
An educational Rust implementation of the Swiss Table hash map algorithm
-
numen
portable field-primitive definitions for a graph-canvas physics substrate: the scalar/vector field algebra as data, the Field truth primitive (definition + extent + lifecycle), and…
-
dugong-graphlib
Graph data structure APIs used by dugong (port of dagrejs/graphlib)
-
contack
easy contact library
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
cntp_config
support for reading Contemporary.toml files
-
rtree_rs
R-tree for Rust
-
ternary-compiler
Compiles ternary strategy descriptions into optimized lookup tables
-
arora-behavior-tree
The Arora behavior tree: Groot-compatible trees ticking Arora modules
-
simple_tables
An easy to use rust crate for creating table structures. Including macros for easily creating these table structures.
-
collectable
Fallible, no_std-friendly collection traits
-
rinq
Type-safe, zero-cost LINQ-inspired query engine for Rust — filter, sort, aggregate, window analytics, parallel execution, and statistical extensions
-
fp-columnar
Columnar storage primitives (Column, ValidityMask) for pandas-parity dataframes — the storage layer behind fp-frame
-
kool_bloom_filter
A standard and scalable Bloom filter implementation in Rust with configurable error tolerance and automatic scaling
-
enso-data
A collection of useful data structures
-
gram-diagnostics
Shared LSP-compatible diagnostic types for gram-data and cypher-data
-
persist-o-vec
A Vec type that aims to have stable indices and memory location
-
sortedlist-rs
A fast sorted list data structure in rust
-
pvec
RRB-Tree based persistent vector implementation
-
blas-array2
Parameter-optional BLAS wrapper by ndarray::Array (Ix1 or Ix2)
-
gapbuf
Generic gap buffer
-
echelon
O(1) amortized priority queue. Adaptive Ladder Queue for heavy-tailed distributions.
-
axhash-map
High-performance HashMap and HashSet backed by hashbrown (SwissTable) and fueled by axhash
-
reflow_asset_registry
Asset registry client for Reflow — resolves content-addressed URIs and ML model manifests
-
hnsw_vector_search
High-performance semantic search using HNSW and ONNX embeddings
-
type-check
runtime validation of dynamic values against a Haskell-like type-expression string
-
nodedb-types
Portable type definitions shared between NodeDB Origin and NodeDB-Lite
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
pi_ordmap
Ord Map
-
enum_vec
Efficiently store a vector of enum variants as a packed n-bit vec
-
backgammon_engine
Backgammon engine in Rust: state representation, legal move generation, and deterministic afterstate transitions for agent/RL development
-
bypond
A highly untested and undocumented complete tree library
-
nornir-graph
backend-neutral graph seam: a BULK trait (nodes/edges with pure SCC, topological order and reachability closure defaults) and a QUERY trait (contains/node/neighbours/pivot/shortest-path)…
-
dayendar
advanced days calendar operations
-
assertive
Collection of assertions
-
schema-registry-analytics
Analytics engine for usage tracking, metrics collection, and reporting
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
sim-lib-view-codec
Codec-aware and Shape-aware lenses for SIM Web
-
plane-2d
Continuous 2D data structure representing infinite 2d plane
-
indexed_vec
IndexVecfromlibrustc_data_structures -
drtahash
A non-cryptographic hash function using AES-NI for high performance
-
arr_deque
Deque implemented by array
-
moritzbrantner-finance-data
Provider-neutral financial market data types, validation, indexing, and derived series
-
dequemap
A no_std compatible implementation of the dequemap crate
-
ordag
A high-performance DAG engine with static alias proofing. Validates graph topology before execution to eliminate runtime borrow checks and data races.
-
task-local-extensions
Task-local container for arbitrary data
-
ab-riscv-interpreter
Composable and generic RISC-V interpreter
-
unordered-pair
A tuple struct representing an unordered pair
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
bcinr-powl
POWL 2.0 model, compiler, concurrency guards, executable scheduler, and cryptographic execution evidence
-
radix_route_matcher
A high-performance route matching library based on Radix Tree
-
wabi_tree
Order-statistic B-tree map and set with O(log n) rank operations. Drop-in replacements for BTreeMap/BTreeSet.
-
tinysetqueue
A tiny, allocation-free FIFO queue with direct-mapped membership tracking for dense integer domains
-
fungi-lang
Fungi: A typed, functional language for programs that name their cached dependency graphs
-
lookupvec
Container with Vec-like properties that also offers O(1) lookup of items based on an id field
-
xapi-data
Rust bindings for the Experience API (xAPI) data structures
-
cow_vec_item
Copy-on-write Vec, available on stable rust
-
pocketbase-sdk
Pocketbase SDK
-
cistring
A string type that preserve case, but compares insensitiveley
-
aph_disjoint_set
Disjoint set implementation with optimized memory usage and ability to detach elements
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
puruda
Pure Rust DataFrame
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
iot_driver_core
iot driver core
-
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…
-
ref_kind
Different reference kinds
-
exo-temporal
Temporal memory coordinator with causal structure for EXO-AI cognitive substrate
-
context69-contracts
Shared request and response types for the Context69 API
-
gpipe_ast
Generic Pipelines AST - Abstract syntax tree for workflow definitions
-
settrie
Fast subset and superset queries
-
rasn-smi
Data types for handling Structure for Management Information
-
intervals-rs
intervals
-
arr-rs
arrays library
-
linear_collections
Map and Set types backed by linear data structures
-
ocm-types
Types required to implement the OpenCloudMesh filesharing protocol
-
sparsemap
A sparse, compressed bitmap with run-length encoding, optimized for long runs of consecutive bits. 100% safe Rust, no_std, zero dependencies; reads the C sparsemap library's serialized format.
-
flagged_cl_args
Command line argument parsing
-
slabmap
HashMap-like collection that automatically determines the key
-
prefix_array
A generic container for searching on prefixes of keys
-
space_engineers_compat
Compatibility types for Space Engineers data structures (DateTime, Guid, math, bitfields, etc.)
-
open_menu_standard
OpenMenuStandard (OMS) specification
-
vp-avl
A combined Vantage-Point AVL tree, to make VP trees updateable
-
lockerroom
Readers-writer access to individual cells of your collection!
-
neco-history
Tree-based edit history with undo/redo and automatic checkpointing
-
arraylist
wrapper built on top of rust vector implementation. Taste like Java Arraylist, and intuitive to use like Python list and JavaScript array.
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
pulith-source
Composable source abstractions and planning for Pulith
-
mutable
keep track of changes in structures
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
beehive
collections for 3D hexagonal maps
-
ndtensor
An n-dimensional tensor
-
bsp-tree
Binary Space Partitioning (BSP) tree useful for 3D rendering. Works with flat polygons (triangles, quads, etc.).
-
kumiko-core
Core domain model and business semantics for Kumiko
-
bitvector
in Rust
-
parselnk
Parse windows .lnk files in pure rust
-
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!
-
ordinary-types
Types for Ordinary
-
vigil-runner-types
Pure types + env policy for Vigil sandbox runner — ExecutionPlan, SandboxProfile, RunnerError, RunnerAuditSink, apply_native_env_policy
-
ax-sym
High-performance scoped symbol table for compilers, linters, and LSP servers — backed by axhash-map
-
text-style
Types and conversions for styled text
-
metrovector
A high-performance, compact binary format for storing and querying vector embeddings
-
unsafe-tools
A collection of tools making safer unsafe Rust
-
write_x86_64
help you write x86_64 assembly code
-
gridly
managing fixed-size 2D spaces
-
id_effect_fsm
Typed finite-state machines, sagas, and session types for id_effect programs
-
verdant-themes
A collection of themes for verdant
-
eight-booleans
A small Rust library to store and manipulate 8 booleans in a single byte
-
flex-algo
Rust commonly used data structure and algorithms
-
rstared
decorator that adds rstar::RTree to arbitrary collections
-
ryo-spec
Domain specification and type hierarchy system for ryo
-
rucksack-lib
The rucksack core library
-
commitlog
Sequential, disk-backed commit log library
-
dsq-core
Core functionality for dsq - data processing with jq syntax
-
dia-i18n
-
arity-arrays
Fixed and pointer-sized heap-packed arrays over a generic arity, indexed without bounds checks
-
rostl-oram
Oblivious RAM (ORAM) implementations
-
cve
Mappings for parsing the CVE JSON files
-
broom
An ergonomic tracing garbage collector that supports mark 'n sweep garbage collection
-
gecs
A generated entity component system
-
multi_containers
Ergonomically work with multiple values per key
-
ts_dynbitset
dynamically-growable bitset based on ts_bitset
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
simploxide-bindgen
SimpleX-Chat API types and client generator
-
intextus
Inline collections
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
fingertrees
Immutable persisten finger trees
-
struct-reflection
obtaining struct field names at runtime through reflection-like capabilities
-
large_int
An ease-of-use unbounded signed integer
-
stateset-primitives
Strongly-typed primitive types for StateSet iCommerce
-
mindset
A pure functional state machine library built on Stillwater's Effect system
-
prism3-value
Type-safe value container framework with unified abstractions for single values, multi-values, and named values with complete serde support
-
frunk-enum-core
Implemenation of genericized enums for use with frunk
-
rustkernel-temporal
RustKernels Temporal domain kernels
-
merc_ldd
Implements algorithms and I/O for list decision diagrams
-
ffi-toolkit
A collection of functions useful for working with the Rust FFI
-
mgrad
A minimal automatic differentiation library
-
luru
A custom implemented hash map that has a fixed amount
-
weak-table2
Weak hash maps and sets, with a fast backend
-
axess-strings
Short, hot-path string primitive for the axess workspace. ShortString is optimized for the workload of short identifiers that are hashed, compared, and cloned at high volume: event taxonomy tags…
-
rstl-queue
Queue data structures for rstl crates
-
metalcraft-flows
Specification and reference types for Flows — a serializable DAG format for AI agent workflows
-
variant-rs
VARIANT support for Rust. Clean, idiomatic handling of WinAPI/COM results.
-
use-ion
Ion identity and charge primitives for RustUse
-
segtri
Segment tree with customizable data type and update operations
-
pin-list
A safe
Pin-based intrusive doubly linked list -
avl
A map and a set implemented with an AVL tree
-
uuidv5
A zero-allocation UUID v5 (SHA-1 based) implementation
-
entity
that provides entity-like constructs
-
rship-entities-nodes
Binding node execution system and scene graph entities for rship
-
seg_lib
A collection of segment tree variants
-
crdf-dpo
Double Pushout (DPO) graph rewriting for CRDF RDF graphs
-
arrow-view-state
High-performance columnar permutation index and filter engine for Apache Arrow
-
sequencetree
a new type of collection to store keys and their corresponding values
-
hextree
Location to value mapping
-
data-source
that fetches data from different sources
-
aleph-filter
The Aleph Filter — an infinitely expandable probabilistic data structure with O(1) insert, query, and delete
-
grid-tree
Pixel quadtrees and voxel octrees
-
labeledarray
labeled n-dimensional arrays with spatial-aware helpers for geospatial and scientific workflows
-
lace_codebook
Contains the Lace codebook specification as well as utilities for generating defaults
-
sum
General-purpose sum types
-
multiset
Multisets/bags
-
spaghetto
making double-ended data structures, like an always-contigouous double-ended queue (deque) and double-ended string
-
mif-embed
Local sentence-embedding inference for the MIF (Modeled Information Format) ecosystem
-
snowflake-ng
Dead easy and high performance
snowflakeimplemented in Rust -
succinct
data structures for Rust
-
csv-data-quality
Streaming CSV validator against a data-contract-registry contract. Async, line-by-line, structured violation report. The fourth cross-ecosystem hook in the Kinetic Gain portfolio.
-
rep
A small tool for representation/class invariants
-
bidimap
Bijective maps
-
char_index
efficient charwise indexing into a string
-
field-collex
A block-slot based ordered collection with O(1) extremum queries
-
js_like_eq
JavaScript-style loose equality, strict equality, relational comparison, and truthiness for serde_json::Value
-
queue-file
lightning-fast, transactional, file-based FIFO
-
tokmd-analysis-types
Analysis receipt contracts for tokmd
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
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 -
rotated-array-set
An ordered set supporting O(1) rank and O(√n) inserts and deletes
-
art-tree
The Adaptive Radix Tree
-
noetl-events
NoETL shared event envelope types — wire-format ExecutorEvent + pluggable EventSink shared between the CLI's local-mode runner, the noetl-worker NATS pull consumer, and the noetl-server's POST /api/events endpoint
-
hotel
Collection Data-structure to associate values with keys
-
radixmap
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
-
arrayset
An array-backed ordered set type
-
theymx
A small Rust library for handling DMX data
-
flow_arena
A HashMap managed Graph Model with the concept of ownership
-
mutcursor
Safely stores mutable references to parent nodes, for backtracking during traversal of tree & graph structures
-
orx-imp-vec
ImpVecstands for immutable push vector 👿, it is a data structure which allows appending elements with a shared reference -
contigious-tree
Write and read tree graphs to and from contigious blocks of memory
-
paft-market
Market data models and requests for paft
-
tree-ds
manipulate tree data structures
-
roughly
Probabilistic data structures for Rust — because sometimes close enough is good enough
-
trie
A highly general and customizable trie library
-
task-collection
Types for managing and waiting on groups of tasks
-
ooecs
Object-oriented entity-component-system
-
bmap
A bitmap with an internal counter
-
patricia_router
Radix Tree implementation for Rust
-
sorla-provider-core
Shared SoRLa provider contracts and metadata
-
isideload-simple-file-manifest
Interact with lists of files through a storage-agnostic interface
-
boost_charconv
Boost C++ library boost_charconv packaged using Zanbil
-
cock-tier
Measure the power level of a peen
-
total-maps
Maps where every possible key has an associated value
-
jgd-rs
generating realistic JSON data using declarative schema definitions
-
object-collection
A collection that can store multiple values of types
-
collections-gpui-standalone
Standard collection types used by Zed and GPUI
-
tallystick
talling votes
-
ternary-reef
Coral reef ecosystem pattern for long-lived collective intelligence in ternary fleets
-
veripb-formula
VeriPB library to handle pseudo-Boolean constraints, formulas, and more data structures
-
fav_utils
Fav's utils crate; A collection of utilities and data structures for the fav project
-
triangle_matrix
Triangle matrix indexing operations
-
odsek
Lazy, pull-based composition of mathematical interval sets with open/closed endpoints, no_std-compatible
-
elizaos-plugin-experience
Experience learning plugin for elizaOS - Rust implementation
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
exo-resource-tree
WeftOS exo-resource-tree: hierarchical resource namespace with Merkle integrity
-
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…
-
use-address
Primitive address component vocabulary for RustUse
-
compt
A complete binary tree visitor library
-
sortedvec
a sorted vector that enables quick lookups
-
z_table
lookup functions for the standard normal table, also called Z table
-
materials
Data on rocks, elements, metals, etc
-
yrs_tree
implementing a CRDT-based tree data structure powered by Yrs
-
parametrized
Supply useful iterating methods for user-defined types which are parametrized by type parameters
-
cvkg-svg-serialize
Cyber Viking Kvasir Graph (CVKG) - High-fidelity agentic UI framework
-
ttmap
Trivial implementation of type map
-
wasm_macro
Collections of useful macros for wasm
-
unigraph_metric_history
Metric history tracking for graph nodes over time
-
geiserx_ts_bitset
compact, efficient, non-allocating bitset
-
ironstate-journal
Event journal for ironstate aggregates: append/snapshot/replay/fork/subscribe
-
tetengo_trie
A trie library implemented with a double array
-
hl7v2-model
Core data model for HL7 v2 messages
-
packable
packing and unpacking binary representations
-
nucleus-mechanism-vcg
Economic-projection lifter for the Nucleus substrate, specialized to Pigouvian-VCG auctions. Lifts a cleared auction (single-good Vickrey or knapsack-VCG with Clarke-pivot payments)…
-
flix-db
Types for storing persistent data about media
-
monarch_data
Data types and utilities handling
-
efin
6-digit IRS Electronic Filing Identification Number (EFIN) type
-
tinybox
Like
Box, but with an optimization that avoids allocations for small data-structures -
gqls
GQL Schema, with support for ORB-style API generation
-
tinymap
A map structure that stores its data on the stack
-
siraph
A node-based digital signal processing crate
-
typwire
Rust types for the Typst plugin system
-
reactive-signals
dx-first scope-based fine-grained reactive system
-
libwebnovel-storage
A complement to libwebnovel: this package handles downloading and organizing collections of followed webnovels
-
cirno_store
containing motivational phrases in Japanese and Russian
-
holyhashmap
A hash map with stable indices
-
calcit_fingertrees
(Calcit fork of )Immutable persisten
fingertrees -
rsplug-dag
Directed acyclic graph (DAG) data structure library
-
school_library
structures to manage school-related data, including students, classes, and schools
-
rok-ids
CUID2, ULID, UUID v7, Snowflake, and NanoID generators for the rok ecosystem
-
dsa64
64-byte aligned data structures for high-performance computing
-
file-backed-value
lazily generated persistent values backed by a file, with the option to require a recomputation after a certain amount of time
-
stack-allocator
A stack-based memory allocator with optional fallback to a global/secondary allocator
-
arena_tree_rs
A high-performance, feature-rich Arena Tree library for Rust
-
semi-persistent-containers
Semi-persistent core data structures with O(1) snapshots and O(k) restore
-
wplot
Plot interface
-
recoverable
Recovery information and classification for resilience patterns
-
mori
orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data analysis…
-
union-fn
Proc. macro for creating efficient "inline closures".
-
tree-sitter-traversal2
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
orange-trees
Tree data structure with several methods to query and manipulate nodes
-
minimizer-iter
Iterate over minimizers of a DNA sequence
-
wt-indexset
Fork of original indexset which is used for worktable
-
word-dictionary
data structure for word mapping. It can be used for language translation.
-
bitemporal-runtime
Bitemporal truth primitives — valid_time/recorded_time tracking, append-supersede, as-of queries, temporal snapshots
-
soulseed-agi
Soulseed AGI kernel: S1S2 error codes and types per RULE-500 series
-
msg-store
A fast and light-weight message store designed to work as a priority queue in low hardware equiped devices
-
medianheap
A median heap for keeping track of a running median
-
atomic_ptr_cell
Safe no_std repr(transparent) wrapper for AtomicPtr and &AtomicPtr with an api similar to a cell
-
crabka-ids
Canonical newtypes for Crabka's cross-crate Kafka identifiers (offset, partition index, …)
-
simd-lookup
High-performance SIMD utilities for fast table lookups, compression and data processing
-
minsize
Collections with a statically known minimum size (using const generics)
-
spanley
my generic string span, his name is Spanley
-
strid-examples
Examples demonstrating usage of the
stridcrate -
implies
A parser for logical formulas
-
ploc-bvh
A Bounding Volume Hierarchy based on PLOC
-
jmt-pq
PQ Jellyfish Merkle Tree
-
oximedia-clips
Professional clip management and logging system for OxiMedia
-
iowrap
Small helpers for using io::Read/io::Write
-
determinizable_collections
Hash collections that can be switched between std and deterministic implementations via a feature flag
-
vecgraph-store
Persistent storage module for vecgraph, built on top of kvwrap
-
fenwick
tree: data structure that efficiently calculates prefix sums in a changing array of numbers
-
cynos-incremental
Incremental View Maintenance (IVM) for Cynos database
-
tinyvecdeq
VecDeque-like data structures -
uninum
A robust, ergonomic unified number type for Rust with automatic overflow handling, type promotion, and cross-type consistency
-
agentic-reality
Existential grounding system for AI agents — deployment awareness, resource proprioception, reality physics
-
fey_grid
2D grid data structure and related traits
-
statevec
Facade crate for building schema-first deterministic StateVec domain plugins
-
opt_struct
Optional collections
-
ascent-byods-rels
data structures for Ascent relations, made possible by Ascent's BYODS feature
-
try-lazy-init
Fallible lazy initialization
-
sipha-analysis
Grammar-agnostic scope extents and definition collection for sipha syntax trees (LSP support)
-
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…
-
fixed_bitmaps
A small crate implementing bitmap functionality around primitive Rust unsigned integers
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
re_blueprint_tree
The UI for the blueprint tree in the left panel
-
dappnode-types
Shared DAppNode Rust types
-
strand-errors
Error types and utilities for strand operations
-
designal
Procedural macro for use with futures-signals
-
triple_arena
Regular, Chain, Surjection, and Ordered Arenas supporting non-Clone types, deletion, and more
-
ts_array256
fast sparse 256-element array with configurable backing storage
-
circular_doubly_linked_list
A high-performance Circular Doubly Linked List implementation in Rust
-
nested_containment_list
A data structure for efficiently storing and querying nested intervals
-
v2rmp-embed
Standalone Graph Embedding engine for road networks (GraphSAGE inference)
-
uuid-suffix
Git-style short IDs for UUIDs using suffixes
-
ordsearch
A data structure for efficient lower-bound lookups
-
sbol-ontology
Offline ontology facts (EDAM, SBO, SO, GO, CHEBI, CL) for SBOL validation, plus a runtime cache for opt-in extension ontologies (NCIT, custom)
-
phyz-gravity
Layered gravity solver from constant-g to post-Newtonian corrections for phyz
-
hashmap-mem
Fast, low-overhead in-memory hashmap implementation optimized for performance using fxhash
-
mikel_binary_tree
search binary tree implementation
-
gevi_error
A flavor of error types and error handling that I like
-
omango-util
Utililites
-
enum_meta
Add metadata to Enum Variants
-
rbtset
A set based on a RB-Tree for efficient operations
-
mih-rs
Multi-index hashing (MIH) for neighbor searches on binary codes in the Hamming space
-
bayesic
A string matching library similar to NaiveBayes but optimized for many small classifications
-
simple-update-in
Immutable nested update with structural sharing
-
delta-collections
Data structures with revertable operations called deltas
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
ism-data
ODNI public XML schema metadata: package list and namespace registry. For schema files, see the per-package ism-{pkg} crates.
-
minivec
A version of Vec that's only the size of a single pointer
-
barectf-parser
parse barectf-generated CTF trace data
-
bdaddr
Bluetooth Device Address
-
sedimentree_core
Sedimentree: a hash-linked CRDT storage structure with fragments, commits, and content-addressed blobs
-
cortenforge-capture-utils
Capture helpers and recorder sinks (JSON, overlays, pruning) for the CortenForge stack
-
watermark
watermarking set for in-order insertions
-
shortlist
An efficient data structure to track the largest items pushed to it
-
gpui_sum_tree
A sum tree data structure, a concurrency-friendly B-tree
-
smooth-bytes
Convenience bit operations for byte slices
-
limited-queue
a limited queue that overrides the oldest data if trying to push a data when the queue is full
-
muds
Minimalistic Data Structures and Entity-Component-System Library
-
compact-rc
Low-memory reference-counting pointers
-
HArcMut
mutable arc
-
hash_ring
Consistent Hashing library for Rust
-
mut_set
A safe implementation for HashSet with iter_mut and get_mut
-
ferogram-session
Session persistence types and storage backends for ferogram
-
kcr_k8up_io
Kubernetes Custom Resource Bindings
-
quantor
Declarative quantifiers for filtering, validation, and testing in Rust
-
vecmin
VecMinandVecOnenewtype wrapper aroundVecthat enforces a minimum length at compile time -
closed-interval-set
Unions of closed intervals as containers of pairs
-
amber-arena
A minimal two-phase append-only arena: write into a builder, seal it into a read-only structure addressed by stable, typed indices
-
modular-bitfield-msb
Allows to easily define bitfield types with modular building blocks. MSB-first version.
-
tincan
A lightweight reactive state management library for Rust
-
advanced_collections
advanced data structures (collections). Includes counter (hash-bag, multiset), disjoint set (union-find, merge-find), circular buffer (cyclic buffer) and interval (range)
-
construe
Compile-Time Growable Array: Vec & String for const!
-
tpntree
A N-dimensional generalization of region quad/oc-trees
-
ittybitty
An itty bitty bitset to hold your itty bitty bits
-
cbsk_log
log tool
-
serde_save_lib
JSON handler for serde data with I/O capabilities
-
gldf-search-schema
Document, filter, and facet types for the gldf-search index. Reference predicates that the index must agree with.
-
astro-math
Astronomy math algorithms for telescope control and sky transforms
-
purrdf-sparql-eval
Native, RDF-1.2-first multiset SPARQL evaluator over the DatasetView read trait in interned TermId space — the runtime that consumes purrdf-sparql-algebra and replaces the oxigraph-family spareval on the query path
-
pinned_vec
Vec-like data structure whose elements never move
-
bit-byte-bit
Implements a bit string using a collection of bytes
-
array_buf
Highly optimized fixed-capacity deque buffer stored on the stack
-
aversion
Versioned data structures with auto-upgrading
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
scope-cell
temporary, scope-bound, and thread-safe mutation of data in Rust
-
sequence_trie
Trie-like data-structure for storing sequences of values
-
array-plus-extra
An array type that holds N+EXTRA elements with const generic parameters, providing safe slice access to contiguous memory
-
truncate-integer
Truncate integers
-
emap
A map with a fixed capacity and integers as keys
-
mako-markt
Market data library for German energy market (MaKo/marktd)
-
pachash
space-efficient static hash index over an on-disk variable-size object store
-
listfree
lockfree prepend-only list
-
rust-bloomfilter
bloom filter implementation in Rust programming language
-
mappy-client
Client library for mappy maplet data structures
-
fukurow-rules
Rule traits and constraint validation (SHACL equivalent) for Fukurow reasoning
-
ppar
Persistent immutable array
-
unionfind
A union find library made for building type inference engines. Can be used as general purpose datastructure.
-
bom-kit
A flexible Bill of Materials (BOM) management library for assembly planning with substitutes and unit conversions
-
miracle-reappearance
Miracle Reappearance Cognitive System: immutable Ed25519-signed ledger, HNSW semantic vector index, 7-dimensional affect engine, and ethics auditing for embodied AI
-
parallel_vec
A generic contiguous collection of heterogenous values
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
bit-int
An arbitrary fixed bit-width integer library
-
inplace-vec-builder
Build a vec from a vec, in place
-
hashbrown_tstd
port of Google's SwissTable hash map
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
axil-bundle
Central registry of Axil's built-in Extensions — the single registration site for CLI, MCP, and the audit test
-
set_genome
A genetic data structure for neuroevolution algorithms
-
search_trail
manager of variables that can save and restore their values
-
exhaustigen
exhaustive test generator
-
aligned-utils
Common utilities to work with aligned values and allocation
-
optempty
Tools for working types that may be empty. E.g., an empty
String,Vec,HashMap, etc. -
jvs-packets
that provide structures for JVS protocols
-
linear-map
A map implemented by searching linearly in a vector
-
ternary-flux
Flux/state-flow engine for tracking ternary value propagation through a system
-
impl-rlp
RLP serialization support for uint and fixed hash
-
discord-indexmap
A fork of the popular
indexmaplibrary that adds a few extra APIs that are yet to be upstreamed -
boxing
cross-platform implementations for NaN and ptr boxes
-
giftbox
A fun Rust crate called
giftboxto help Rustlings learn and explore generics -
simple_dto_mapper_derive
A derive macro for mapping DTOs with rename/transform/skip support
-
periodic-rs
Bounded datastructures
-
index_many
A proof of concept for indexing an slice at multiple locations at once
-
philharmonic
workflow orchestration system — meta-crate re-exporting the entire crate family. Depends on all published library crates; feature-gates connector implementations so consumers can…
-
graphix_io
reading and writing graphs from and to text files, based on the graphix crate
-
support
A collection of helper methods for Rust projects
-
bucket_vec
A vector-like data structure that guarantees to never move its contained elements
-
rj
reactive json
-
partial-array
potentially partially-filled arrays
-
fwob-v2
Fixed-page compressed storage for fast FWOB range queries and bulk append
-
widequran
Rust SDK for WideQuran -- Quran surahs, ayahs, hadith, tafsir, and Islamic encyclopedia via the widequran.com API
-
thincollections
Alternative implementations for vector, map and set that are faster/smaller for some use cases
-
ztimer
A block-based, non-circular double-linked list implementation for Rust
-
facett-graph
facett — graph (node/edge) viewer component, on facett-core
-
optarray
Resizable Arrays in Optimal Time and Space
-
win-variant
that aims to provide a more ergonomic way of working with variants in winapi based projects
-
faststr-fork
Faststr is a string library that reduces the cost of clone
-
oxigdal-temporal
Multi-temporal raster analysis for OxiGDAL - Time series, change detection, phenology, and data cube operations
-
eure-tree
Eure tree data structure
-
vec_extract_if_polyfill
Polyfill for Vec::extract_if
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
infinite-db-frp
A unified facade for the infinite-db frp backend: graph modeling, weaving, signals, runtime, and storage with feature-gated subsystems
-
slas
Static Linear Algebra System
-
jse
JSE (JSON Structural Expression) interpreter for Rust - AST-based architecture
-
stac-validate
json-schema validation for the Rust implementation of the STAC specification
-
netlist
generic netlist data structure for VLSI design
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any char iterator
-
ligature
Ligature's data model in Rust
-
mzdata-spectra
A subset of
mzdata’s traits and spectrum data model -
tld
Top Level domain static hash map, tld list is obtained from of iana.org
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
knut-build
knut’s build-thing: its build space as data, plus the two rules only knut knows — that three of its four binaries carry
required-features(so a plaincargo build --all-targetssilently produces one of four)… -
mtgjson
Unofficially provided lightweight models of the data provided by MTGJSON
-
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.
-
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… -
rdf-reader
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
grid-engine
A flexible and efficient library for managing 2D grid-based layouts with automatic collision handling and dynamic vertical expansion
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
pofk_algorithm
A collection of efficient algorithms implemented in Rust for real-world projects
-
csc411_rpegio
A collection functions to handle rpeg data i/o. Intended for use in URI's CSC 411 class.
-
winpty-rs-windows-collections
Windows collection types
-
rocketsplash-formats
Shared data types and serialization formats for Rocketsplash TUI animations
-
stable-map
A hash map with temporarily stable indices
-
rc-writer
A tiny implement for writing data to a reference counted instance
-
msgpack_simple
Simplified, easy to use, pure Rust MessagePack implementation focused on handling dynamic data structures
-
flatarray
flattened iterator, that acts as if it still was an iterator of iterator
-
crtx-context
Context pack assembly, token budgeting, and mandatory citation metadata
-
a2ui-core
Core logic for the A2UI protocol: traits, negotiation, validation, prompt building
-
dda-rs
Pure Rust Delay Differential Analysis engine
-
binarystream
binary stream for Node.js
-
nopetgraph
Graph data structure library. Provides graph types and graph algorithms.
-
sim-codec-bitwise
SIM workspace package for sim codec bitwise
-
oxgraph
General-purpose, zero-copy graph and hypergraph engine for Rust
-
lazy-cogs
Lazy Cogs is a implementation of lazy clonable data structures
-
mif-problem
RFC 9457 Problem Details envelopes for the MIF (Modeled Information Format) ecosystem
-
taskchain
A block-based, non-circular double-linked list implementation for Rust
-
blockset-lib
BLOCKSET internal library
-
singletons
Type-keyed data structures: SingletonSet stores one instance per type, SingletonMap<V> maps types to values
-
hop-hash
hash table using 8-way hopscotch hashing with constant-time worst-case lookups, and SIMD acceleration
-
gamma
Graph primitives and traversals for Rust
-
prehash
storing values with precomputed hashes
-
rustywallet-bloom
Fast and memory-efficient Bloom Filter with counting support for rustywallet
-
kg-utils
Various collections and utilities
-
split_slice
accessing (&[T], &[T]) as if it were a single slice
-
memtally
A wrapper for some collection types that keeps track of indirectly allocated heap memory
-
codedash-schemas
Stable public schema for codedash code metrics output — JSON Schema + Rust types
-
rosary
About Rose Trees
-
ternary-btree
SuperInstance ecosystem crate
-
smallbitset
series of allocation free sets capable of holding small integer values
-
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:… -
seq_watcher
A pair of structures for monitoring a stream of data for one or more sequences
-
densevec
Map like collection with usize indices that stores values contiguosly
-
phtm
Re-exports for common uses of
PhantomData -
neco-nodegraph
necosystems series node graph data model with port-typed nodes and edges
-
replicante_logging
Replicante common logging logic
-
grove
A segment tree library enabling generic user-defined queries and actions on segments of your data
-
wasm4pm-types
Binary data structures for wasm4pm process mining platform
-
reputation-types
Core types and data structures for the KnowThat Reputation Engine
-
simple-graph
Graph library with ability to serialize/deserialize Trivial Graph Format
-
fixed-index-vec
A vector-like data structure whose indices do not change when elements are removed
-
light-curve-common
Common tools for light-curve-* packages
-
compact-dict
A highly customizable, open-addressing dictionary in Rust
-
lumberjack
Read and modify constituency trees
-
colorthief-dataset
Static xkcd color-hierarchy table with pre-computed LAB used by
colorthieffor human-vocabulary color naming -
galemu
workaround for generic associated types (GAT) limited to lifetimes (GAL)
-
anymap2
A safe and convenient store for one value of each type
-
pathmod
Re-export crate for pathmod
-
landfill
Various types for dealing with on-disk data
-
trybox
stable,
no_std-compatible, fallible heap allocation -
export-resolver
A PE (Portable Executable) parser which will dynamically resolve virtual addresses of functions loaded in a PE. It will store these function virtual addresses in a structure for retrieval at the developers behest.
-
pi_sinfo
used to describe the 'structure', that is, the meta information of the structure
-
runtime-context
A runtime context providing type storage and management
-
ring_pair
Tiny fixed-size ring buffer specialized for exactly two elements
-
id_collections
Index-oriented programming in Rust
-
intarsia
An extensible Rust optimization framework
-
jerky
Succinct on-disk data structures in Rust
-
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
no-copy
packer, but no implement copy
-
redmaple
offers an oppinionated yet extremely flexible data modeling system based on events for backend applications
-
distri-a2a
A2A protocol types for the Distri ecosystem
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
general_storage_static
general_storage::Storage where backend is chosen statically by a feature
-
sequenced-broadcast
Async structure to allow sequenced broadcasts with history
-
ineru
Neural-inspired memory system for AIngle AI agents
-
lull-spec
Lull spec library
-
default-vec2
Vec-like data structure with default elements and a bitset built using it -
hgg
Approximate nearest neighbor search collection
-
bstree-file-readonly
Query read-only binary-search tree file, supporting billions of entries in files of tens of GB
-
froop
A functional reactive stream library for rust
-
oxrdf_elevont
Basic data structures related to RDF
-
llm-response-window
Sliding window of recent LLM responses for context tracking
-
fwdlist
A simply linked (forward) list
-
flatcontainer
A flat container representation for Rust
-
tool-side-effects-tag
Declare what an LLM agent tool actually does (read, write, idempotent, destructive, external, expensive, network) so the scheduler / retry layer can decide what's parallel-safe and retry-safe…
-
swamp-script-source-map-lookup
Source map lookup for Swamp
-
literally
Macro literals for members of std::collections
-
apma
Adaptive Packed Memory Array (APMA) — a cache-efficient sorted associative container
-
regroup
regrouping arrays
-
value_pool
implements a ValuePool struct that makes the creation of self-referential data structures easier and safer
-
subms-hyperloglog
submillisecond.com cookbook recipe - probabilistic: subms-hyperloglog. Distinct-count cardinality estimator. ~1% standard error at ~16 KB.
-
oxigdal-qc
Quality control and validation suite for OxiGDAL - Comprehensive data integrity checks for geospatial data
-
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
-
statiki
Static friendly data structures
-
openrouter-provider
Type definitions for the OpenRouter Provider API contract (https://openrouter.ai/docs/guides/for-providers)
-
graphlib
powerful rust library for the graph data-structure
-
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… -
bluetape-rs-collections
Focused collection and iterator helpers for bluetape-rs
-
crispii_bits
Bit-related functionality for Rust's native u{int} types (usize excluded)
-
bktree
BK-tree datastructure
-
chronofold
A conflict-free replicated data structure (a.k.a CRDT) for versioned text
-
options
The package provides a data structure for managing named parameters
-
michis_undo_redo
undo/redo system, inspired by Godot Engine's UndoRedo object
-
open-payments-iso20022-acmt
Open Payments - Message Parsing Library - ISO20022 ACMT
-
fuid
A UUID-compatible identifier in a friendly base-62 format
-
bitset-core
Straightforward, no-std compatible, simd optimized, BitSet API
-
merkle-tree-bulletin-board
A public bulletin board based upon Merkle trees
-
hash-rings
Implementations of various hash rings
-
teo-generator
SDK generators for Teo
-
zellij_widgets
A wiget library for zellij
-
tf_playlist
The playlist feature used in Tubefeeder
-
kcr_dataprotection_kubeblocks_io
Kubernetes Custom Resource Bindings
-
smartstring
Compact inlined strings
-
diffo
Semantic diffing for Rust structs via serde
-
baz-tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
densemap
A collection data structure that is permanently accessible by unique keys and fast iterable
-
foyer-intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
rostl-datastructures
Oblivious data structures for secure and efficient computation
-
delatin
Fast TIN generation using Delaunay triangulation
-
deep_causality_ast
AST data structure for deep_causality crate
-
open-coroutine-timer
The time utils
-
merkle
tree implementation with support for generation of inclusion proofs
-
stavec
Stack-allocated vector with static capacity
-
incremental-map
combinators for incremental immutable maps (see crate
incremental) -
id-map
Data structure of values indexed by IDs
-
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
extended-rational
implementations of high-accuracy projectively-extended rational numbers and macros for creating them
-
static-heap-array
A statically sized array which lives on the heap, allowing it to have a size that does not need to be known at runtime
-
shiplog-schema
Canonical shiplog schema: events, coverage manifests, workstreams, and bundle types
-
ghost_slice
Permission-carrying Indices and some collections that support them
-
bellande_format
Bellande File Format
-
arrow
Apache Arrow
-
liblet
learning about formal languages and grammars
-
pokeapi-model
Data structures for PokéAPI v2
-
dependency-graph
building and resolving dependency graphs
-
chain-map
A chain of maps with a single view into the aggregated values
-
sweeper
A foundation for Minesweeper implementations in Rust
-
civs
Controllably Increasing/Inflating VectorS
-
segment-tree
Quickly perform interval queries or modifications
-
sum-tree-gpui-unofficial
A sum tree data structure, a concurrency-friendly B-tree
-
agentic-commerce-protocol
Type definitions for the Agentic Commerce Protocol specification
-
slashcrux
Shared vocabulary types for the Slash and Crux agentic Rust ecosystem
-
arraysetcell
A fixed-capacity, vector-like array with interior mutability and no ordering guarantees
-
origin-types
Shared wire-format types for Origin, the local-first personal agent memory system
-
emcee
Python's emcee affine-invariant mcmc ensemble sampler
-
gpui_rn_collections
Standard collection type re-exports (fork for React Native GPUI)
-
graphrepresentations
providing efficient abstract implementations of different graph representations
-
exprz
An Expression Library
-
rahashmap
Fork of standard library HashMap with additional functionality
-
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>.
-
lending-library
A key-value store that loans full ownership of items
-
soavec
A vector-like data structure for conventient growable Struct-of-Arrays creation and manipulation
-
sparse-hash-map
Open-addressing hash map and set that stay small at low load factor
-
snowflake
A module for generating guaranteed process unique IDs
-
sized-vec
Type level sized vectors
-
cli-tilemap
that provides basic functionality of Tilemap for CLI-based games!
-
petitset
An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap
-
compactor
A collection which compresses old data
-
croaring-sys
Raw bindings to CRoaring
-
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
-
purse
Bag data structure implementation in Rust
-
fallback
A helper library to implement fallback mechaism
-
cphf
Compile-time perfect hash function data structures
-
patternize
provide macros and traits to create design pattern
-
mlua-swarm-schema
Blueprint schema types for mlua-swarm — Swarm IF SoT (Blueprint / AgentDef / AgentKind / Hints / Strategy / Metadata)
-
plod
deriving plain old data
-
v9
A slim data engine for Data Oriented Design
-
appendlist
An append-only list that preserves references to its elements
-
pulse-system-types
Shared contract types for the pulse-null plugin ecosystem
-
rand_pool
Create a pool of random numbers pre generated thread safe
-
mandible-core
Shared intermediate representation (IR) for mandible: CommandNode, Flag, Text sanitization, Provenance, Authority, and merge logic. Not independently useful outside the mandible workspace.
-
ord-collections
offering collections which are pre-sorted automatically
-
tudi
There, inside the game's two-dimensional universe, life was simple
-
libdawg
A fast, memory-efficient DAWG (Directed Acyclic Word Graph) for word validation and prefix queries
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
eml
Epoch Merkle Log: the EML library instantiated at k=2, no prefix
-
searchy
Search index (in-memory), that can be constructed and searched using a bag of words model, with cosine similarity scoring based on tf-idf. Supports multiple search terms, permissions…
-
axhash-indexmap
IndexMap and IndexSet powered by indexmap (SwissTable) and the axhash engine
-
fluxus-api
High-level API for Fluxus stream processing engine
-
beetle_bits
A collection of bit-based types. Currently only u1 (1bit uint) and f3 (3bit float) are implemented
-
xenon_types
Common types for Xbox 360 (Xenon) file formats and protocols
-
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…
-
copyspan
An alternative to
Range<T>that has a defined memory layout and implementsCopy -
canadensis_bit_length_set
A bit length set type used to calculate data type sizes when processing Cyphal data structure description language files
-
unsafe_list
Linux 风格侵入式双向链表
-
mdcs-core
Core CRDT types and traits for the Carnelia Merkle-Delta CRDT Store
-
higher-graphen-runtime
Runtime workflow orchestration APIs for HigherGraphen
-
sequential-id-alloc
sequential ID allocator that guarantees sequential allocation
-
owl-dl-tableau
Tableau-based reasoning engine for SROIQ used by rustdl
-
aether-memory
AetherMemory: hot-cold hierarchical memory architecture for embodied AI with LRU hot layer, K-Means cold partitioning, two-phase atomic migration and reinforcement-learning importance updates
-
shrink-to-fit
Recursively calls
shrink_to_fiton all elements of the container -
brownstone
building fixed-size arrays
-
zrl
zrl (zhrexx's Rust Library) is a collection of smaller and bigger handwritten libraries
-
singletonset
SingletonSetdata structure, which makes it easy to store a single instance each of various types within a single set -
clustered-fast-trie
Ordered integer set (u32/u64/u128) for data with locality. O(1) range counting. Stable O(log log U) latency.
-
hlc-rs
Hybrid Logical Clocks for causally correct distributed event ordering
-
bitf
procedural macro to easily create a bitfield out of a struct
-
cursorvec
Cursored vector container
-
agent-state-machine
Generic labeled state machine for AI agent control flows
-
ordered_hashmap
Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
-
rustz
functional programming in Rust
-
polars-structpath
dynamically accessing nested Rust structures using path notation
-
hydroperfox-smodel
Semantic modeling for Rust
-
a-tree
A dynamic data structure for efficiently indexing arbitrary boolean expressions
-
kurobako_problems
A collection of black-box optimization problems
-
unobtanium-text-pile
Turns HTML into externally annotated plain text that is optimized for being serialized to the postcard format
-
kcr_rocketmq_apache_org
Kubernetes Custom Resource Bindings
-
use-compound
Chemical compound identity primitives for RustUse
-
nucleus-flow-projection
Flow projection lifter for the Nucleus substrate. Lifts a Denning-lattice FlowTracker snapshot into a Projection::Flow body that the substrate Receipt envelope can carry. Verifier checks…
-
embed-constvec
Inline fixed capacity vec/array
-
nonempty_tools
优雅的 Rust 非空集合类型库，在编译时保证集合非空
-
verdant-cache-core
Persistent agent-trace dependency graph with content-hashed nodes over incr-concurrent (part of the verdant agent-loop cache)
-
shortguid
Short URL-safe Base64 encoded UUIDs
-
flange-flat-tree
A tree that can be expanded by attaching new values to the node without mutability of the old ones
-
ux-dataflow
Data Processing Library
-
serde-ordered
A procedural macro for deserializing ordered arrays into keyed structs using Serde
-
range_union_find
A union-find data structure for ranges
-
mako-mabis
MABIS process engine for German electricity market balance group accounting (Marktprozesse Bilanzkreisverantwortlicher)
-
neighborhood-diversity
computing the neighborhood diversity of simple, undirected graphs
-
forensicnomicon-core
Stable engine layer of the ForensicNomicon: the normalized DFIR report model (Finding/Severity/Observation) and structural format constants. Zero deps.
-
quilibrium-verkle
Verkle trie implementation with KZG commitments for Quilibrium
-
cbloom
Concurrent implementation of Bloom filters
-
frp-domain
Domain model for the frp graph: atoms, blocks, ports, edges, and metadata
-
nakadi-types
A connector for the Nakadi Event Broker
-
vslab
container with persistent unique keys to access stored values
-
csvenum
Generate code for enums with associated constants from a .csv in your command line
-
perfgate-types
Versioned receipt/config contracts and JSON schemas for perfgate
-
oxc_index
Newtype-style helpers for
Vecandusize -
zer-adapters
Type adapters for zer, bridging Polars, Arrow, and other data-frame libraries to zer-core Records without a string round-trip
-
rudac
common data structures and algorithms
-
cortenforge-models
Burn-based model definitions (LinearDetector/ConvolutionalDetector) for the CortenForge stack
-
serde_map
Mapbased onVecfor serialization purposes -
easy_collections
Wrappers around standard collections for ease of use and quick prototyping
-
neoset
Compact RLE-encoded event sets for efficient peer sync
-
index-db
B+tree indexing primitive for Rust storage engines - ordered keys, range scans, and concurrent access over paged storage
-
bitlab
Extracting a range of bits from a binary data source
-
nstree
construct branched 'namespace strings' for nested subcomponents, often for logging
-
wccg-models
WCCG Data
-
sea-plus
A collection of useful extensions for SeaORM
-
stack-map
constant-size associative container for building higher-level data structures out of
-
isomorphism
2 directional hashmaps
-
enumoid
Enum Indexed Containers
-
python-objects
that implements the architecture of the CPython objects. with this crate you can crate a list with any data type from rust
-
yoa-graph-runtime
Shared Graph Runtime IR, node runtime, and Nautilus GraphStrategy for YOA services
-
geosite-rs
that parses geosite.dat file format
-
ping-openmls-sdk-mls-store
Persistent OpenMLS provider — SQLite (native) / memory backends ([CR-4])
-
re_set-lib
Data structure library for ReSet
-
map-macro
Declarative macros for statically initializing collections
-
hirpdag
procedural macros for Hash Consed, Immutable, Reference Counted, Persistent, Directed Acyclic Graph data structures
-
formualizer-sheetport
SheetPort runtime: bind manifests to workbooks, validate IO, and run sessions deterministically
-
squads-rustfsm
Define state machines that can accept events and produce commands
-
tobz1000-petgraph
Pseudo-namespaced fork of
petgraph: Graph data structure library. Provides graph types and graph algorithms. -
indexed-table
A tiny in-memory indexed table
-
bitvec_simd
bitvec with SIMD
-
enum-toggles
A generic Rust library for managing toggles/flags using enums and bitvec
-
eqlog-runtime
Datalog with equality
-
numeric-statistics
Numeric Statistics: functions for min, max, average, variance, standard deviation, and more to come
-
dendron
Generic tree data structure
-
bst-rs
Recursive & Iterative Binary Search Tree Implementations within Rust
-
keratin
A quick setup/quick development, embedded, modular database
-
forrustts
Tools for forward simulation with tree sequence recording
-
swink-agent-memory
Session persistence and memory management for swink-agent
-
pointcloud
An accessor layer for goko
-
amadeus-streaming
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
graphy-search
Full-text and fuzzy search for graphy
-
weak-map
BTreeMap with weak references
-
frp-plexus
Shared primitives for the infinite-db frp backend: typed IDs, SPC encoding, types, and values
-
nucleus-substrate-core
Categorical core of the Nucleus substrate: Session (the agent action), Projection (the verifiable record functor — Identity, Capability, Flow, Economic, …), and Receipt (the Ed25519-signed colimit)…
-
file-mumu
File handling function and steams plugin for the Lava language
-
predicates
boolean-valued predicate functions
-
double-map
A HashMap with double key to single data/value
-
mini_uuid
A small and URL-safe UUID crate for Rust
-
concise_vec
A concise, highly optimized vector implementation leveraging const generics in Rust
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
boarddown
Local-first, file-based Kanban storage engine with sync capabilities
-
corresponding
Move corresponding fields between structs
-
array-box
Create Rust vector from C data, either owned or not owned
-
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…
-
hdrhistogram
A port of HdrHistogram to Rust
-
oxigdal-index
Pure-Rust spatial index (R-tree) for OxiGDAL vector data
-
eqmap
Technology Mapping w/ E-Graphs
-
seq-str
Flat collections of strings etc
-
quarb-compose
Adapter composition: parseable leaf content grafts an inner arbor
-
genesis
generating statically-typed ECS worlds
-
paramodel-trials
Paramodel trial-set and trial-result layer: TrialSet, SamplingStrategy, TrialStatus, TrialResult, Metrics, ArtifactRef, TrialProvenance
-
bo4e
BO4E (Business Objects for Energy) - Rust implementation
-
ndim
N-dimensional array for numerals in Rust similar to NumPy
-
data_privacy_core
Core data classification types and traits for the data_privacy ecosystem
-
rive-models
Revolt API models for the Rive ecosystem
-
char-list
A persistent string type with the same API as a linked-list of characters
-
cdl-list-rs
A circular doubly linked list implementation using Rc<T> and RefCell<T>
-
magnetise
asses the similarity between SQL queries
-
tuplities-debug
A trait for debug formatting of tuples
-
fp-types
Core Scalar, DType, NullKind primitives for the frankenpandas workspace — the universal type system behind fp-frame
-
xsparseset
sparse set
-
histogram-sampler
Sampling from a distribution given by a histogram
-
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 -
fid
FID (Fully Indexable Dictionary) implementation for Rust
-
convergent
Lightweight, composable CRDTs for decentralized systems
-
rstl-collection
Core collection and disposable traits for rstl crates
-
gfa-reader
Reading gfa format v1
-
make-message-bus
Generate a pub-sub bus for use in async applications
-
simd-intervaltree
A SIMD-accelerated interval tree with zero-allocation queries
-
traitgraph
Abstracting over different graph representations
-
bonzai
An abstraction for optimizing the memory layout and pointer aliasing of trees
-
string_manipulation_utf8
String manipulation functions using character indexing (UTF-8) instead of bytes
-
oxistore-cache
OxiStore cache eviction primitives: Pure-Rust LRU and full ARC (Adaptive Replacement Cache)
-
bfield
B-field datastructure implementation in Rust
-
html-json-extract
A package for parse some data from html.scripts
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
yyid
Yyid generator (random tokens like UUIDv4, but using all the bits)
-
slablit
Literal for slab creation
-
smartcardfyi
Smart card platform reference, EMV standard lookup, and Java Card encyclopedia -- async API client for smartcardfyi.com
-
ndcopy
Fast N-dimensional array memcpy
-
indexed_json
Index json files like a database
-
sheaf-io
Weights (safetensors), golden fixtures (.npz), data views, and the maze generator
-
omega-persistence
SQLite-based persistence layer for ExoGenesis Omega with schema migrations and transactions
-
dynsequence
Sequence-Like data-structure for storing dynamically sized types
-
agileplus-domain
Typed intent graphs for engineering work — convert prompts into validated DAGs of intents, features, tasks, tests, and edges, then store, query, and serve them from Rust, HTTP, or MCP
-
cocktailfyi
Cocktail recipes, ABV calculation, calorie estimation, and flavor profiling — async API client for cocktailfyi.com
-
chematic-core
Core types (Atom, Bond, Molecule) for chematic — pure-Rust RDKit alternative, WASM-compatible
-
ct-demo
Pythagorean triple snapping via sorted-Vec binary search (snap_kdtree)
-
chinese-rand
Random generation of data structures in Chinese, using Rust
-
vec-strings
Store any string efficiently in an immutable way
-
tree-table
A high performance core for a treeview table widget
-
tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
sdsl
interface for the Succinct Data Structure Library
-
coeus-tensor
Tensor data structures and kernels for Coeus
-
miniconf_coap
CoAP interface for
miniconf -
zcstring
High-performance zero-copy string handles for Serde, backed by arcstr
-
rune-graph-match
Pattern matching engine for rune-graph: filter (node, edge, node) triples by label, property, or node id
-
use-ach
Conservative ACH and NACHA-oriented primitives for RustUse finance crates
-
coalesced_intervals
Data structure for maintaining maximally-coalesced 1D intervals
-
bose_einstein
A data structure that efficiently partitions elements into two sets
-
sugars_collections
Efficient collection types including ZeroOneOrMany and OneOrMany with array tuple syntax support
-
fdec
A collection of macros for generating fixed-size fixed-point numeric types for Rust
-
tensoren-cpu
CPU-based implementations of
tensorentraits -
afterautism-core
Core data structures and traits for the AfterAutism engine
-
gldf-search-index
Search index for gldf-search. v0 is a linear-scan reference implementation; fst+roaring index lands in v1.
-
etin
5-digit IRS Electronic Transmitter Identification Number (ETIN) type
-
fastgraph
Graph abstraction providing a generic interface and powerful parallelized traversals
-
bufferring
Ring buffers for Rust
-
sightloom-index
VisionIndex storage, masks, packages, queries, and evidence reels for SightLoom
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
fixedvec
A heapless version of the Rust vector type
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
membuffer
A very fast flat memory buffer used to deserialize at a fast speed
-
key-paths-iter
Query builder and iteration over rust-key-paths KpType for Vec collections
-
ds-bst
Binary search tree implementation
-
envish
Search for environment variables
-
generic_graph
implementing general purpose graphs. Including some default implementation (the latter are still WIP)
-
chesspos
Basic structs for representing chess squares
-
collectivity
Generic collection traits
-
extindex
Persisted immutable index
-
miny
Box<T> with small value optimization
-
xml-schema
Structure generator from XSD source file
-
hash-link
Keep elements insert order while searchable by hash
-
zkcg-common
Shared types, errors, and utilities for the ZKCG protocol
-
scarf-syntax
A helper crate of scarf for expressing a SystemVerilog concrete syntax tree
-
cumulfreqtable
A Cumulative Frequency Table implemented with a Binary Indexed Tree
-
pathlink
A URL type whose path can also be used as a filesystem path, for Rust
-
discrete_range_map
DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap
-
kotoba-schema
Graph Schema Definition and Validation for Kotoba
-
cosmolkit-core
Redesigned COSMolKit core with value-style molecule state and explicit topology operation contracts
-
fenny
working with Fenwick trees
-
ministd
Rewriting Rust's standard library for fun (no_std)
-
daedalus-registry
Node registry and plugin bundle loader for Daedalus graphs
-
kodiak-taxonomy
manage generic taxonomies supporting unique features
-
u64_array_bigints
biginteger library based on u64 arrays
-
erased_set
A set of erased types
-
elizaos-plugin-trajectory-logger
Trajectory logging plugin for elizaOS - Rust implementation
-
block-array-cow
In memory array de-duplication, useful for efficient storing of a history of data versions
-
foreign_vec
Unofficial implementation of Apache Arrow spec in safe Rust
-
try_reserve
Stable implementation of the TryReserveError from std for custom collections
-
data_tree
Hierarchical data tree with pathing and search support
-
swap-queue
A lock-free thread-owned queue whereby tasks are taken by stealers in entirety via buffer swapping
-
alist
Small insertion-ordered association list for keys with cheap equality
-
nihonshufyi
Sake guide with rice varieties, breweries, and tasting notes — async API client for nihonshufyi.com
-
arc-string-interner
An efficient cuncurrent string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
relib-common
Shared primitives and traits for the relib decision-diagram crates (the Rust reliability-analysis engine behind the relibmss Python package)
-
wacore-appstate-ng
Appstate for WhatsApp protocol
-
roers
prepare augmented annotations for single-cell RNA-seq analysis
-
weak-self
WeakSelf is simple way to have a Weak pointer to yourself
-
inline-css
Embed CSS directly in your Rust code
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16coordinates. -
embed-struct
embedding data structures
-
zetamesh_flags
zetamesh-flags is a minimal Rust library for rule-based validation of state combinations
-
simple-matrix
generic matrix library
-
relational_types
Manage relations between objects
-
wrapped_slab
WrappedSlab: Auto-generate newtype idiom based on a Slab
-
kando-core
Core library for kando, a keyboard-first Kanban board
-
numas
multidimensional array for efficient computing
-
iati-transform
Transformations and rollups for IATI Activity data (sum by type/year/currency)
-
building_blocks_partition
Acceleration structures for spatial queries on voxel data
-
rive
ecosystem crate
-
fqdn-trie
FQDN (Fully Qualified Domain Name) lookup structures (based on tries)
-
populated
Collection types that are guaranteed to be populated (i.e. non-empty). Based on std::collections types.
-
waremax-metrics
Metrics collection and reporting for Waremax
-
incrementalmerkletree-testing
Common types, interfaces, and utilities for testing Merkle tree data structures
-
canadensis_dsdl_parser
Parser for the Cyphal Data Structure Description Language
-
qualified_do
Composable _qualified_ do expressions for Rust, supporting monad- and applicative-like structures
-
dent8-core
Core fact-event model and invariants for dent8
-
bitint
Integer types that have a logical size measured in bits
-
nimble-steps
Nimble Steps Collections
-
gctree
cache-friendly, graph-like, arena-allocated datastructures
-
subms-adaptive-radix-tree
submillisecond.com cookbook recipe - ordered-index: subms-adaptive-radix-tree. ART over byte-string keys: Node4 / Node16 / Node48 / Node256 adaptive child storage plus path compression.
-
displays_types
Shared display-related data types used across the displays crate and platform backends
-
tool-call-batcher
Queue multiple pending tool calls and flush them as a batch
-
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"
-
zjctl-proto
Protocol types for zjctl RPC communication
-
b-k-tree
Burkhard-Keller tree data structure for finding items separated by a small discrete distance
-
bankarr
Array-like but growable vectors
-
pbt-tests
Property-based testing with
derivemacros, aware of mutual induction & instantiability -
limq
Queue with a controller for monitoring queue elements
-
syntastica-queries
Collection of tree-sitter queries for syntastica
-
osmgraph
Convert OSM queries into graphs
-
latency-buckets
Streaming histogram + percentile estimator for LLM call latencies. Fixed log-scale buckets, O(1) record, p50/p90/p95/p99 in microseconds. Zero deps.
-
acdp-server
Registry-side building blocks (PublishValidator, RegistryServer, store, pagination) for the Agent Context Distribution Protocol (ACDP)
-
identified_vec
Like HashSet but retaining INSERTION order and without
Hashrequirement on the Element type -
array2ds
Package for handling sized 2d arrays in rust, without the usage of the keyword unsafe cuz why not
-
admissibility-kernel
Deterministic context slicing with cryptographic admissibility verification for conversation DAGs
-
boomerang_tinymap
A tiny, fast, and simple Slotkey-type map implementation for Boomerang
-
meld-execution
Execution authority contracts and runtime ports for Meld
-
generic_constants
Traits providing type-generic numeric constants (Zero, One, ..., OneHundredTwentySeven) implemented across common integer and float types
-
type-freak
Collection of typed data structures, trait operators and aliases
-
smart_access
A minimalistic "lazy bidirectional pointer" framework
-
activitist
Models of ActivityPub
-
identity_map
Identity-based maps
-
statevec-model
Core schema, record, command, event, IDL, and registry types for StateVec
-
nlist
inline-allocated list with statically tracked length
-
planck
Lightweight, modular utility crates for Rust
-
lau-quipu
Inca quipu-inspired hierarchical tensor encoding
-
pgm_index
Ultra-fast learned PGM-Index for efficient sorted key lookup with bounded error
-
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…
-
sparse_map
A sparse map with stable generational keys
-
pogo-masterfile-types
Generated Rust types for the Pokémon GO masterfile, with a typed parse_masterfile dispatcher
-
whiskeyfyi
Whiskey encyclopedia with expressions, distilleries, and regions — async API client for whiskeyfyi.com
-
re_backoff
retrying operations with backoff
-
bucket_queue
A Bucket Queue data structure that can be used as a Priority Queue
-
multi-stash
Vector-based arena data structure that reuses vacant slots
-
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.
-
quickphf_codegen
Code generator for creating static maps and sets for use with quickphf
-
pacr-types
The PACR 6-tuple — physically annotated causal records for AI agents
-
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)
-
kcr_cloudwatch_aws_amazon_com
Kubernetes Custom Resource Bindings
-
dynp
Dynamic property system that emphasizes the use of the Newtype pattern
-
lambda-runtime-types
Common structures for lambda architecture
-
pureflow-workflow
Workflow graph structure — nodes, edges, port directions, and structural validation for Pureflow
-
equivalent-flipped
Similar to
equivalentcrate, but flipsKandQ -
grangers
working with genomic ranges and annotations
-
fairqueue
Spatially distancing fair queue. A kind of queue for sequential round-robin processing.
-
ternary-sketch
Ternary sketch data structure for approximate GPU workload analysis. Count-Min sketch with ternary counters {-1,0,+1} for streaming frequency estimation.
-
axion-data
A high-performance data processing library written in Rust, providing DataFrame and Series functionality similar to pandas
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
ef_rs
Elias-Fano encoding scheme
-
tinystr-raw
Raw string-to-integer conversions for tinystr
-
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
-
threshold-dict
A data structure to find smallest key that is larger than the query
-
architectai-crate
Agents<T> where T implements the Package trait
-
light-curve-interpol
Interpolations tools for time series
-
doubly
Doubly-linked lists in Rust
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
hora-id
A 64-bit time-based sorted unique ID generator that includes the current time in the ID
-
lim-bit-vec
Limited bit vectors
-
weight-cache
A cache that holds a limited number of key-value-pairs according to a user defined criterion
-
roussillon-type-system
A type system for a programming language
-
arrav
Sentinel-based heapless vector
-
merkle-cbt-lean
Special implementation of Complete Merkle Binary Tree for minimal memory footprint
-
art
adaptive radix trie
-
mlua-lshape
mlua wrapper for lshape — Schema-as-Data validator + LuaCATS codegen, Pure Lua vendored via include_str!
-
barcodefyi
Barcode format lookup, symbology reference, and standard encyclopedia -- async API client for barcodefyi.com
-
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
range-filters
High-performance range filter implementation - DIVA (VLDB 2025 Best Research Paper)
-
double_linked_list
High-performance doubly-linked list with smart pointer support and memory pool optimization
-
rust_redux
A Redux-like state management library for Rust
-
graphrefly-structures
GraphReFly reactive data structures (reactiveMap, reactiveList, reactiveLog, reactiveIndex)
-
atlas-rb-tree
A textbook implementation of a Red-Black Tree
-
compare
Experimental comparators for collections to be generic over
-
chemrust-core
The core modules defining the flow and structs of data in computational chemistry routines
-
span-map
A data structure for efficiently managing sets of values over spans/ranges
-
handy
providing handles and handlemaps
-
sweetrpg-kv-objects
Objects for Key-value store
-
brewfyi
Coffee variety guide with roasting, brewing methods, and origins — async API client for brewfyi.com
-
elizaos-plugin-planning
Planning and task management plugin for elizaOS (Rust)
-
data_structure_traits
data structure collection traits
-
persistent-kv
Persistent key-value store
-
tdlg
Generates a grid of cells that could be used to build a top-down game map. Used by me to learn Rust.
-
rs-statemachine
COLA-style state machine with fluent API
-
string-wrapper
A possibly-stack-allocated string with generic bytes storage
-
binartree
Binary Tree realisation
-
linked-vector
A hybrid linked list and vector data structure
-
rdf-format
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
banyan
Persistent indexable tree data structure
-
arraystring
Fixed capacity stack based generic string
-
rshyper-algo
implements various algorithms for the rshyper framework
-
debounce
Data structures and helpers for debouncing a stream of events: removing duplicate events occurring closely in time
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
loro_fractional_index
Fraction index for Loro. Fork and modified from jamsocket/fractional_index
-
oxidart
High-performance Adaptive Radix Tree with TTL, DFA pattern matching, and atomic counters
-
cortenforge-data-contracts
Data contracts for run manifests and capture metadata used across the CortenForge stack
-
gpui-box-sum-tree
A sum tree data structure, a concurrency-friendly B-tree
-
union-find-rs
Disjoint-set forest implementation to support the union-find algorithm in Rust
-
rt-events-dag
Type-safe event DAG topology. Edges are event types; structural checks are walks.
-
secretmangle
mangling sensitive data in memory with a random key
-
hifa-xml-schema
Structure generator from XSD source file
-
butterfly-common
Common utilities for the butterfly-osm toolkit
-
one_way_slot_map
SlotMap with minimal restrictions on Keys and Values
-
open-payments-iso20022-camt
Open Payments - Message Parsing Library - ISO20022 CAMT
-
std_collections_reexport
Re-exports of std HashMap, HashSet, and DefaultHasher for use by determinizable_collections
-
hson
JSON like format for HTML. Allow querying the data through searching methods similar to client-side DOM queries methods
-
range-split
splitting sequences with range parameters
-
spaceindex
-
dade
data definition for Rust structures
-
linked-list
An alternative implementation of std::collections::LinkedList
-
priq
Array implementation of the min/max heap
-
btreemultimap
A multimap implementation with range support
-
distancefyi
Haversine distance calculation and travel time estimation — async API client for distancefyi.com
-
uniqer_rs
flexible library for generating various types of unique IDs using a builder pattern
-
rust_multistack
Support for two-dimentional stacks for the Rust programming language
-
binary-reader
A binary reader for rust-lang. for step by step. It’s a minimal
byteorderwrapper for read bytes. -
verdant-queries
Collection of tree-sitter queries for verdant
-
likelihood
Probabilistic schema extractor — infers database schemas from unstructured JSON data streams
-
nb-tree
Very simple tree structure with generic node and branch data
-
itc
Interval Tree Clocks as described in the itc2008 paper
-
atelier_dcml
Distributed Convex Machine Learning for the atelier-rs engine
-
struct-compression-analyzer
Analyzes the bit distribution of packed structures
-
eldek-tad
A project for learning Abstract Data Types (ADTs) in Rust. Heavily inspired by Java's implementation.
-
cosmic_undo_2
Undo and redo done the right-way
-
graphlib_rust
Dagre's Graphlib implementation in Rust
-
flatbuffers-owned
that enables a more flexible usage of FlatBuffers
-
subms-count-min-sketch
submillisecond.com cookbook recipe - probabilistic: subms-count-min-sketch. Frequency-estimation sketch with conservative update and Kirsch-Mitzenmacher hashing.
-
k2_tree
A space-efficient representation of sparsely populated bit-matrices
-
validbr
data structure and validation for Brazilian Registries, such as CPF, CNPJ and CNH (currently only CPF and CNPJ is supported)
-
kollect
Collections made ergonomic for gamedev usecases
-
dsa_abc
basic data structure and algorithms. Usability and performance is priority
-
partitions
A disjoint-sets/union-find implementation that allows for efficient iteration over elements of a set
-
dashmap-shard
port of Google's SwissTable hash map
-
cloudr
that offers an abstract data structure for storing and managing values without moving them. It provides efficient key-value insertion, retrieval, and removal operations, allowing you to conveniently handle your data…
-
uts-bmt
Binary Merkle Tree implementation for Universal Timestamps in Rust
-
named_colors
that provides named colors in RGB and Hexadecimal formats
-
bitrush-index
A serializable bitmap index library able to index millions values/sec on a single thread
-
omega-loops
7 temporal cognitive loops from Reflexive (1ms) to Transcendent (10y) for multi-scale processing
-
abstract-bits
Turn any combination of bit and byte fields into a structs
-
cbsk_timer
rayon thread runtime
-
higher-graphen-projection
Projection definitions, selectors, results, and renderers for HigherGraphen
-
hashed-array-tree
Hashed Array Trees
-
gridd-euclid
euclid-compatible grid data structure (forked from Frosh_VII's gridd)
-
tree_by_path
A tree data structure featuring nodes addressable using a &Vec<usize> path and avoiding recursion and run-time borrow checking
-
sharedvec
A fast but limited collection for storing values of a single type
-
array_map
Map backed array for fixed size keys with O(1) performance
-
ironflow-types
Shared API envelope types for the Ironflow ecosystem
-
internode
Smart references to your graph nodes
-
zer-core
Core traits and types for the zer entity-resolution library
-
raw-btree
Generic B-Tree implementation
-
swiss-eph-data
Embedded ephemeris data files for swiss-eph (Swiss Ephemeris)
-
append-only
Append only versions of std data structures
-
use-currency
Lightweight currency code primitives for RustUse finance crates
-
touch-selection
Selection data structure intended for touch and single button devices
-
multipeek
An adapter to peek at future elements in an iterator without advancing the iterator cursor
-
attuned-core
Core types and traits for Attuned - human state representation for LLM systems
-
mif-core
Shared foundational types for the MIF (Modeled Information Format) ecosystem
-
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.
-
cursed-collections
Collections that (seem to) break Rust safety
-
tinyid
A tiny ID type that's like UUID except shorter and easier for a user to type in
-
untis
accessing the Untis API
-
jsondiffpatch
JSON diff & patch (object and array diff, text diff, multiple output formats)
-
im-pathtree
Immutable, path-addressable tree data structure
-
holidayfyi
Holiday dates, Easter calculation, and 200+ country calendars — async API client for holidayfyi.com
-
arbitrary-int
Modern and lightweight implementation of u2, u3, u4, ..., u127
-
agent-epoch-counter
Named counters that reset on epoch boundaries for per-session rate tracking
-
ensure
target state of an object
-
hprtree
A Hilbert-Packed-R-Tree implementation for rust
-
pas
strided slice
-
booking_kit
A powerful and extensible booking toolkit for Rust — featuring core data structures, flexible status logic, and seamless integration into any reservation system
-
chartulary
generic content-addressed container graph (aka chart). Graph<N, E> on petgraph with capability traits (Identified, Addressed, ContentBearing, Labeled, Classified, Predicated) and default Container/Relation payloads…
-
yuuang_petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
mdcs-merkle
Merkle-Clock DAG for causal history tracking in the Carnelia MDCS
-
ra-ap-rustc_graphviz
Automatically published version of the package
rustc_graphvizin the rust-lang/rust repository from commit 5113ed28ea1451a13eae3a05dca0dbabfd56f587 The publishing script for this crate lives at:… -
artful
Low-memory overhead and high-performance adaptive radix tree
-
ladata
& modular data model
-
kd-tree-rs
k-d tree
-
bpht
A bit-packed hash table implementation using hopscotch hashing for 32-bit keys and values
-
tokmd-substrate
Shared repo substrate context for cross-sensor coordination
-
stac-duckdb
Client for querying stac-geoparquet using DuckDB
-
expiration_list
A datastructure for items that expire
-
cbsk_log_tokio
log tool, using tokio as the runtime
-
workit
single-threaded work queueing utility
-
purrdf-slice
PurRDF native slice catalog: manifest-based discovery, typed artifact inventory, content-addressed IDs
-
fionn-diff
JSON diff/patch/merge for fionn
-
blefyi
Bluetooth Low Energy chip reference, GATT profile lookup, and beacon encyclopedia -- async API client for blefyi.com
-
varpulis-runtime
Runtime execution engine for Varpulis — Rust stream processing with pattern matching, forecasting, and real-time detection
-
range-traits
Ranges related traits
-
crtx-retrieval
Hybrid retrieval over memory views (lexical + salience; vectors later)
-
lykoi_data
data
-
ternary-bloom-filter
Ternary Bloom filter for GPU-accelerable membership testing. {-1,0,+1} weighted bits allow boost/block/neutral membership. 16x denser than FP32.
-
rs_transducers
transducers for Rust
-
hedel-rs
A Hierarchical Doubly Linked List
-
tc-value
TinyChain's representation of a value which can be collated and stored
-
mem-vec
Vector store trait and Qdrant implementation for MemOS
-
subranges
manage non-interssecting integer intervals
-
sparseset
A Sparse Set
-
faster_bloom
A standard and scalable Bloom filter implementation in Rust with configurable error tolerance and automatic scaling
-
stateset-protocol
Wire-format types for StateSet sync protocol — envelopes, batches, Merkle proofs
-
bloom-filter-yss
bloom filter for me or you
-
non_empty_continuous
Non-empty continuous collections
-
tensoren
Traits for multidimensional arrays
-
bitmaps
Fixed size boolean arrays
-
phago-agents
Reference agent implementations using Phago biological primitives
-
indexland
Rust Collections with Newtype Indices
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
ahtable
Array Hash Table implementation
-
iter-group
grouping (key,value) iterators into maps of collections
-
staticsort
Implements a macro providing a compile-time quicksort function for arrays of any length, containing any primitive Copy type with a PartialOrd implementation
-
equivalence
Trait and derive macro for comparing and hashing types modulo an equivalence relation
-
rsor
Reusable slice of references
-
golomb-coded-set
BIP158 Golomb-Coded Set data structure
-
sys-mumu
System calls and tools plugin for the Mumu ecosystem
-
monistode-assemblers
A collection of assemblers for the monistode set of architectures
-
keylist
Elixir keyword list in Rust
-
use-geology
Composable geology primitives for RustUse
-
forest-ds
secure tree structure
-
faex
A fast and efficient Compact Data Structures Library
-
fast-ordered-buffer
A faster buffering implementation for asynchronous streams, trading off memory usage for speed
-
sparse-bin-mat
A sparse implementation of a binary matrix optimized for row operations
-
sliding_tree
A tree that grows from the leaves and recedes from the root
-
uuid47
lightweight library for converting between UUIDv7 and UUIDv4 facade
-
apint
Arbitrary precision integers library
-
colony
A fast associative data-structure that chooses its own keys
-
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.
-
st_ring_buffer
A fixed-size String implementation using a ring buffer
-
markov-generator
Highly customizable library for building Markov chains and generating random data
-
kodiak-sets
manage generic sets supporting unique features
-
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
chat4n6-plugin-api
Shared plugin API types for the chat4n6 forensic toolkit
-
interval-tree-rs
Interval tree data structure with stabbing queries, range queries, and overlap detection
-
stac-extensions
Manage STAC extensions (https://stac-extensions.github.io/)
-
timefyi
Timezone operations, business hours, and sunrise/sunset — async API client for timefyi.com
-
fplist
An immutable, persistent, singly-linked list
-
chronicle-graph
Event-centric narrative knowledge graphs with temporal verification
-
vecbool
bit vector built on top of Vec<u8>
-
nodedb-crdt
CRDT engine with SQL constraint validation and dead-letter queue
-
faultline_diff
Diff and change classification contracts for FaultLine
-
bin-tree
Building Binary Tree
-
displays_logical_types
Shared logical display data types used by the displays crate and platform backends
-
a2ui-types
Typed data models for the A2UI protocol (v0.8 & v0.9)
-
hashcons
Hash cons'ing for compact representations of shared, immutable data structures
-
gentrix
that adds the Matrix typed using generics that is basically a wrapper around a 2D Vector
-
smallbigint
Big integer types that have a small on-stack representation for small values. Uses num-bigint internally.
-
btree_graph
A generic graph data structure
-
expiring-atomic-filter
Thread-safe approximate membership filter with time-based expiration
-
owl-dl-core
Core IR, normalization, and shared utilities for the rustdl OWL DL reasoner
-
bitworks
meant to provide easy to use bitsets with emphasis on safety
-
stride
A strided slice type
-
anvaya
ECS like dynamic storage in ~500 LOC
-
fionn-crdt
CRDT implementations for fionn
-
dotreds-binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps. Makes some previously internal function public
-
persistent_rope
An immutable persistent rope data structure
-
either-both
An enum similar to the well-known
Either, but with aBothvariant -
datazoo
Bitset and jagged array data structures
-
const-vec
Vec-like data structure with immutable push method
-
simple-file-manifest
Interact with lists of files through a storage-agnostic interface
-
bitarr
A fast and efficient Rust implementation of a BitSet, supporting multiple backing stores
-
qlrumap
An LRU HashMap with an optional passive ttl feature
-
mem_btree
A Data Structure of BTree Implemented with Rust, support snapshot. not use any unsafe lib.
-
outils
Graph and tree data structure library. Providing utilities which aren't easily available in Rust.
-
big_unsigned_ints
Big Unsigned Integers ranging from U256 to U2048 using u64 arrays all under a fixed-size of 32
-
id_sys
data structures which can be marked such that they only work with similarly marked integer data types
-
fontfyi
Google Fonts metadata, CSS generation, and font pairing — async API client for fontfyi.com
-
brie-tree
A fast B+ Tree implementation that uses integer keys
-
zond
standard rust collections but with collecting statistics
-
rocstr
An immutable fixed capacity stack based generic copy string
-
frp-signal
Lifecycle and telemetry signal contracts for frp persistence flows
-
foldlist
A mutable list with fast folding
-
sliceable-ring-buffer
A double-ended queue that Deref's into a slice
-
typescript-definitions-ufo-patch
serde support for exporting Typescript definitions
-
validiter
Iterator adapters for validating iterations
-
typed_index_collection
Manage collection of objects
-
smallbytes
= SmallVec + impl BufMut (from the bytes crate)
-
big_enum_set
creating sets of enums with a large number of variants
-
tui-vfx-types
Framework-agnostic foundation types for the tui-vfx ecosystem
-
poetrie
Poetic trie crafted with intention to ease searching of rhymes for poems
-
hibit_tree
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
-
path-value
Universal type and access property(s) by path
-
steel-imbl
Immutable collection datatypes
-
ts_bitset
compact, efficient, non-allocating bitset
-
obsessive_peek
An iterator adapter to peek at future elements without advancing the cursor of the underlying iterator
-
slots
Fixed size data structure with constant-time operations
-
offset
Glorified offsets for arbitrary structures
-
graphrefly-graph
GraphReFly Graph container, describe/observe, content-addressed snapshots
-
traitgraph-algo
Graph algorithms based on the traitgraph crate
-
telltale-types
Core session types for Telltale - matching Lean definitions
-
combinations
give you all the combinations of values in a vec
-
bitaccess
Macro for efficient and type-checked access to individual bits of a variable
-
ab-merkle-tree
High-performance Merkle Tree and related data structures (Merkle Mountain Range, Sparse Merkle Tree)
-
subms-bloom-filter
submillisecond.com cookbook recipe - probabilistic: subms-bloom-filter. A tiny zero-dependency bloom filter (FNV-1a + double hashing, ~10 bits/key, k=7). Reusable component; pairs with subms-lsm-tree.
-
drthashbrown
port of Google's SwissTable hash map
-
ringo-buff
Ring buffers for bytes, with heap and stack storage
-
mako-gpke
GPKE process engine for German electricity market communication (Lieferbeginn, Lieferende, Netznutzungsabrechnung)
-
exhaustive-map
An exhaustive map for types with finite inhabitants
-
median-heap
A median heap implementation in Rust, used to keep track of a running median of a sequence of numbers
-
mif-rh
Compiled ontology resolution/review engine for research-harness-template corpora
-
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
-
serde_either
set to enums to deserialize and serialize data that can either be string, struct or vec
-
gix-worktree-stream
generate a byte-stream from a git-tree
-
cvx-graph
Knowledge graph for ChronosVector — typed entities, relations, and multi-hop reasoning
-
atomic_lifo
Lock free thread-safe lifo for rust
-
merkle-lite
fast, and composable binary Merkle tree and proof for Rust Crypto hash functions
-
kcr_instana_io
Kubernetes Custom Resource Bindings
-
stackvector
StackVec: vector-like facade for stack-allocated arrays
-
sparse_set
sparse set data structure
-
pulith-lock
Deterministic lock file model and lock diff for Pulith
-
iron_runtime_state
Runtime state management for Iron Cage agents
-
segmented_string
an immutable string type built from array segments, similar to clojure's persistent vector, with unicode grapheme/width support
-
pipebuf
Efficient byte-stream pipe buffer
-
rcbytes
Rc version bytes crate
-
sum-queue
Queue struct that keeps a fixed number of items by time, not capacity, and allows to get summarized stats of its content
-
unique-pointer
UniquePointerdata structure that makes extensive use ofunsaferust to provide a shared pointer across other data structures -
bytering
A ring buffer specialized for vectored reading and writing in blocking and async I/O
-
campo
Easily create and handle bit fields
-
prust-lib
Persistent & Immutable Data Structures in Rust
-
hv-alchemy
Heavy Alchemy - the black arts of transmutation, wrapped for your safe usage and enjoyment
-
onigiri
handling chars
-
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 -
pretree
package for storing and querying routing rules with prefix tree. Pretree 是一个用于存储和查询路由规则的包。它用前缀树存储路由规则，支持包含变量的路由。
-
freezable
immutable data
-
kotoba-cid
Content ID (CID) system for Kotoba graph processing
-
synesthetic-validator
Validation helpers for Synesthetic operator and graph definitions
-
fast_forward
Quering collections blazing fast
-
weakheap
Weak Heap data structure implementation in Rust
-
rust-prelude-plus
Higher-order functions built on top of keypaths for type-safe functional programming
-
packbytes
Convert structures to and from packed representavises - byte arrays of fixed size that live on stack
-
jsonpath-rust
basic functionality to find the set of the data according to the filtering query
-
chinese-validator
Core validation logic for Chinese data (address,id_card, license_plate,name, phone, postal_code,qq,username,etc.)
-
zynk-schema
Canonical in-memory schema representation for Zynk bindings and generators
-
oxgraph-db
Standalone OxGraph-native database engine above the topology substrate
-
qrcodefyi
QR code type reference, version lookup, and encoding encyclopedia -- async API client for qrcodefyi.com
-
fido-types
Shared types for Fido's GitHub repo communities
-
decoded-char
wrapper to keep track of the original byte length of a decoded character in the encoded source file
-
restor
A dynamic resource storage system in rust
-
tsil_cev
LinkedList on Vec
-
mrkl
Generic, minimalist, parallelizable Merkle tree
-
ordered-map
A HashMap, with the capability of accessing the keys and values in order
-
firstpass-core
Firstpass domain contract: trace schema, verdicts, features, tamper-evident hash chain, routing config, and cost model. Pure — no I/O.
-
Xorfilter
No alloc membership approximation
-
ism-ismcat
ODNI ISMCAT schema package, vendored. Designed as a build-dependency for codegen. SHA-256 verified at compile time.
-
agileplus-trace-validator
Typed intent graphs for engineering work — convert prompts into validated DAGs of intents, features, tasks, tests, and edges, then store, query, and serve them from Rust, HTTP, or MCP
-
hash-trie
Hash Array Mapped Trie (HAMT) Immutable Set Implementation
-
frp-loom
Storage traits and in-memory implementations for the frp graph layer
-
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.
-
vinofyi
Wine encyclopedia with grapes, regions, and food pairings — async API client for vinofyi.com
-
slotmap-fork-otter
Slotmap data structure - temporary fork for Otter
-
ax_banyan
Persistent indexable tree data structure
-
collect-rs
Special and custom Collections and Containers (for Rust)
-
indexlist1
A doubly linked list, backed by a vector
-
json-node
A way to work with JSON as a node tree
-
elizaos-plugin-memory
Memory management plugin for ElizaOS (Rust)
-
eclectic
Experimental collection traits
-
sim-lib-lang-cl
Common Lisp surface profile for the SIM expression runtime
-
symbolfyi
Symbol encoding in 11 formats and Unicode property lookup — async API client for symbolfyi.com
-
engcon
macros to define (eng)ineering (con)tracts on data-structure level
-
scoped_stack
A scoped stack data structure
-
string-newtype
New Type idiom helper for string-like types
-
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
-
lz_diet
An AVL balanced Discrete Interval Encoding Tree
-
oxionnx-core
Core types for OxiONNX — Tensor, Graph, OpKind, Operator trait, and error types
-
cycle_map
Implementations of bi-directionally accessible hashmaps
-
structbuf
Capacity-limited structured data buffer
-
zbq-sys
SPMC zero-copy IPC queue
-
slotmap-slice-fork
Fork of slotmap
-
dge-runtime
executing distributed computational graph
-
lazy_simd
Trait based SIMD acceleration and safe abstraction
-
fix_float
Fixed floating types that allows useful trait implementations and datastructures on float numbers
-
open-payments-iso20022-reda
Open Payments - Message Parsing Library - ISO20022 REDA
-
rfidfyi
RFID tag and reader reference, EPC standard lookup, and frequency band encyclopedia -- async API client for rfidfyi.com
-
pi_ext_heap
Extending the heap supports deleting and modifying the elements at the specified location. When the elements in the heap move, the callback function will be called
-
mumu-test
Test suite plugin for the Lava language
-
trie_hard_rs
Fast, memory-efficient Trie (prefix tree) implementation with autocomplete support - Rust implementation
-
applejack
Radix tree
-
beerfyi
Beer style guide with BJCP styles, hops, malts, and yeast — async API client for beerfyi.com
-
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…
-
flat_enum
Expand nested enum into flattened enum
-
dcosl-core
Pure DCoSL protocol types, tag builders, and utilities — no network, no CLI
-
deterministic_collections
HashMap and HashSet with deterministic iteration order for reproducible testing
-
subset-map
A map where the keys are subsets of an initial set of elements
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
rshyper-hmap
implements the hypermap implementation (a map-based hypergraph) for the rshyper framework
-
kn0sys-ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
mako-wim-gas
WiM Gas process engine for German gas metering-point operator change processes (Wechselprozesse im Messwesen Gas)
-
bittyset
A BitSet type for manipulating bit sets
-
mako-redispatch
Redispatch 2.0 process engine for German grid congestion management (§§ 13, 13a, 14 EnWG)
-
vexy-json-core
Core parser for Vexy JSON's forgiving JSON syntax
-
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
grit-bitvec
BitVec, a vector type that can store fixed-width data with irregular bit widths
-
index-map
A map with automatically generated usizes as keys
-
rdf-writer
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
statevec-api
Runtime host APIs and plugin ABI types for StateVec domain plugins
-
triskell
A tri-partite ring buffer
-
token_trie
A high-performance Radix Trie implementation with sorted children for efficient binary search operations
-
structures
collection data structures
-
faultline_core
Canonical domain models, identifiers, and manifests for FaultLine
-
min-heap
A Min Priority Queue implemented as a Thin Wrapper around BinaryHeap from the Standard Library
-
pinus
A prickly BTreeMap. You can insert through shared references and values are pin-projected.
-
global-registry
A global type registration system for Rust
-
bipbuffer
Simon Cooke's Bip-Buffer
-
kg-store
In-memory knowledge-graph store backing the yah daemon's arch.* RPCs
-
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.
-
sbbf-rs-safe
Split block bloom filter implementation
-
data-buffer
low-level data buffer type useful for IO and in homogeneous collections
-
agent-event-emit
Structured event emitter for agent runs. Append-only, JSON-line-serializable events with monotonic ids, run id, and timestamps. Zero deps beyond serde_json.
-
intsplit
splitting numeric types into their binary component arrays
-
tbytes
A tiny library for reading and writing typed data into buffers
-
forrust_fire_tree
A tree data structure
-
tokmd-types
Core data types and contracts for tokmd. Tier 1 stability.
-
growable-bitmap
A growable (and shrinkable) compact boolean array
-
cervine
A slightly more flexible Cow; roughly to T: Borrow<R> as alloc::borrow::Cow is to B: ToOwned
-
chainbuf
Fast chained buffers
-
vec_key_value_pair
A drop-in replacement for std::HashMap and std::HashSet that use Vec on the backend
-
zed-collections
Standard collection type re-exports used by Zed and GPUI
-
kael_sum_tree
A sum tree data structure, a concurrency-friendly B-tree for Kael
-
swamp-core-extra
Rust runtime implementations for Swamp core library collections (Vec, Map, Grid, Stack, etc.)
-
higher-graphen-core
Shared primitive types and contracts for HigherGraphen
-
hicollections
C-liked Collections
-
namefyi
Korean romanization, Five Elements, and CJK stroke lookup — async API client for namefyi.com
-
string-mumu
String functions and tools plugin for the Lava / Mumu language
-
tiny-artnet-bytes-no-atomic
Vendored copy of Bytes fork for use in tiny-artnet. Types and traits for working with bytes
-
bitsvec
A bit vector with the Rust standard library's portable SIMD API
-
secured_linked_list
A cryptographically secured and provable linked list
-
broomdog
A type-erased map with 'indefinite loanership'
-
dcl_data_structures
Moved to: https://crates.io/crates/deep_causality_data_structures
-
use-molar-mass
Molar mass calculation primitives for RustUse chemistry crates
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
no_std_collections
Auxiliary structures and traits for using dynamically resizable arrays (Vectors) in flexible environments, supporting both std and no_std contexts
-
local_vec
fixed-capacity vector allocated on the stack
-
tuplities-flatten-nest
Traits for flattening nested tuples and nesting flat tuples
-
hattrie
A high-performance, cache-conscious, ordered map for string keys, based on the HAT-trie paper
-
nurku-rs_container
Derive macros for different kinds of containers
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it's own. Very similar to Slab.
-
rstl-trie
Generic trie data structure for rstl crates
-
phago
Self-evolving knowledge substrates through biological computing primitives
-
signaldock-core
Shared domain types for the SignalDock agent messaging platform
-
hopscotch
A FIFO queue for efficiently hopping and skipping between tagged items
-
stable_node_set
An ordered set with handles to values
-
vector2
2D vector library
-
vec-x
structure
VecXto manage fixed-length arrays, supporting numeric operations and assignment operations betweenVecXand scalar values -
backtracking_iterator
generic iterator with an item history, capable of backtracking and forgetting
-
nonempty-containers
Fast, zero-cost conversion, and fully inter-operable nonempty container types
-
emojifyi
Emoji metadata, encoding, and Unicode Emoji 16.0 lookup — async API client for emojifyi.com
-
front-vec
Efficiently-prependable Vec and String types
-
cost-meter
Aggregate LLM API cost across providers, models, and time windows. Provider-agnostic — pairs with claude-cost, openai-cost, gemini-cost, bedrock-cost. No SDK dependency.
-
trying
Basic trie crate
-
acdp-primitives
Foundational types and error vocabulary for the Agent Context Distribution Protocol (ACDP)
-
aabel-identifier-rs
defines identifier behavior, such comparing them, or generating sequences of identifiers
-
small-ord-set
A set data-structure represented by a sorted
SmallVec -
nfcfyi
NFC chip reference, NDEF type lookup, and contactless standard encyclopedia -- async API client for nfcfyi.com
-
array-mumu
Array tools plugin for the Mumu ecosystem
-
gpu-annealing
GPU-accelerated simulated annealing orchestration layer — pure data structures and scheduling
-
polars-structpath-types
Common objects for polars-structpath and polars-structpath-derive
-
contextual
deal with data in context
-
unsure
handling unsure (optional) values that might fail, with an additional rejection variant
-
bytes
Types and traits for working with bytes
-
fenwick-tree-rs
Fenwick/BIT tree, 2D BIT, range updates, prefix sums
-
palettevec
A palette compressed vector library for potentially insane runtime compression ratios
-
byte_set
Efficient sets of bytes
-
crtx-verifier
Pure independent-witness reducer for trusted release/compliance evidence (ADR 0041)
-
staticstep
truly zero-cost alternatives to
Iterator::step_byfor both incrementing and decrementing any type that satisfiesRangeBounds<T: Copy + Default + Step> -
dyn_list
A linked list that can hold dynamically sized values in its nodes
-
reversible
A generic wrapper struct that provides reversible editing capabilities
-
sprsdata
Data structures based on sparse and dense arrays
-
vec-dimension-shift
N-Dimension shift features for Vec<T>
-
nanoset-py
A memory-optimized wrapper for Python sets likely to be empty
-
ternary-tree-wasm
A simplified Wasm binding to ternary-tree crate
-
use-formation
Primitive geologic formation vocabulary for RustUse
-
sbbf-rs
Split block bloom filter implementation
-
emt
Epoch Merkle Tree — the EMT instantiated at k=2 with no prefix
-
no_vec
modifying sized arrays
-
ecstatic
Statically-typed ECS library
-
bloom
Fast Bloom Filter and Counting Bloom Filter implementation
-
cbor-tag-index
Tag index
-
frp-weave
Graph weaving policy contracts for the frp domain layer
-
shelves
Storing values referenced by a unique typed index
-
use-iban
IBAN validation and formatting primitives for RustUse finance crates
-
thin-string
A String with a smaller stack footprint
-
segmented_array
Segmented array (growable, append-only) data structure
-
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
-
btree_network
A generic network (undirected graph) data structure
-
unthbuf
Unsigned N-bit Buffer: A structure that holds a fixed buffer of
bits-sized unsigned integer elements -
network-science
Network science in Rust — centrality, community detection (Louvain, Girvan-Newman), epidemic models, PageRank, degree distributions
-
list-zipper
a zipper data structure for sequenceable data types
-
s3vectors-metadata-filter
A flexible and efficient Rust library for filtering data using S3 Vectors Metadata Filter
-
mucell
A cell with the ability to mutate the value through an immutable reference when safe
-
llist
Lisp-style singly-linked list
-
dogged
Persistent vector, similar to Clojure
-
heapq
Priority Queue with scoring function
-
memcell
providing a MemoryCell struct, which stores a current and previous value
-
miniconf
Serialize/deserialize/access reflection for trees
-
cbsk_log_rayon
log tool, using tokio as the runtime
-
arc-bytes
A reference-counted byte buffer
-
rusted_list
A ever sorted list for rust that is operating on binary search
-
mapack
mapbox vector tiles
-
nanobox
NanoBoxoptimization: store small item on stack and fallback to heap for large item -
merkle-log
"Merkle Tree-Structured Log" defined in the paper "Transparent Logs for Skeptical Clients." https://research.swtch.com/tlog
-
worldinterface-core
Core domain types for WorldInterface: FlowSpec, IDs, Descriptor, Receipt
-
omega-meta-sona
Self-Optimizing Neural Architecture (META-SONA) with evolutionary search and fitness evaluation
-
usize-set
Set data structures optimized to store sparsely distributed usize values
-
rvf-runtime
RuVector Format runtime -- RvfStore API, compaction, and streaming I/O
-
loaf
Why have a slice when you can have a loaf?
-
quotient-filter
A quotient filter implementation
-
scratchbuffer
A Vec<u8> like data-structure, that can be used as slices of different types
-
kcr_kafka_banzaicloud_io
Kubernetes Custom Resource Bindings
-
disjoint-collections
Disjoint-set data structures
-
displays_physical_types
Shared physical display data types used by the displays crate and platform backends
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
use-bic
Bank Identifier Code primitives for RustUse finance crates
-
trie-generic
A trie with generic content
-
agent-task-queue
Priority queue of agent tasks with status tracking
-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
enum-ref
Proc. macro for generating enum discriminant types.
-
compressed_vec
Floating point and integer compressed vector library, SIMD-enabled for fast processing/iteration over compressed representations
-
segment-tree-rs
Segment tree with point updates, range queries (sum/min/max/gcd), and lazy propagation
-
final
Wrap a value in a type that does not give out mutable references
-
portable-string
Static-length strings without any allocations
-
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
-
colorfyi
Color conversion, WCAG contrast, and color space lookup — async API client for colorfyi.com
-
smolvec
A lightweight vector implementation with small-vector optimization for rust
-
cons-rs
containing a Cons data structure
-
simple-collection-macros
configurable macros for maps and sets
-
teafyi
Tea variety guide with brewing parameters and teaware — async API client for teafyi.com
-
agent-sdk-foundation
Shared contract types for the Agent SDK (IDs, events, LLM messages, turn outcomes)
-
ABtree
AVL and Btree for rust
-
terrain-graph
Graph Library for Rust
-
soul-base
Data contract primitives for the Soul platform (IDs, Subject, Scope, Consent, Envelope, ...)
-
nebz
an immutable non-empty bytes container
-
twie
fast and compact prefix tries
-
unrolled-linked-list
unrolled linked list in rust
-
phago-rag
Biological RAG — query interface on self-organizing Hebbian knowledge graph
-
zhihun
v2.0: life memory and embodied skill execution engine with polar-resonance HNSW indexing, xi-coefficient bilateral skill generalization, and multi-agent consensus for embodied AI
-
mapro
A tiny macro library for creating std::collections
-
owl-dl-datatypes
Datatype reasoners (xsd:boolean, xsd:integer, xsd:string, ...) for rustdl
-
fenwick-tree
binary indexed tree (Fenwick tree) data structure in Rust
-
nslice
Structures for interpreting slices of variable length as arrays
-
nimrodshn-btree
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite
-
gpsd-json
parsing GPSD JSON protocol messages without dependencies on libgps
-
jmt-blake3
Jellyfish Merkle Tree based on BLAKE3 hash function
-
gauze
Probabilistic set membership filters with a simple interface
-
anyval
A lightweight, dynamically‑typed value container for Rust that works like a scripting language
-
parley-core
Core types, signing, and proof-of-work primitives for the Parley agent-to-agent messaging protocol
-
id-vec
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
-
tzarrays
Optimal resizable Arrays
-
aabb-quadtree
A quadtree that maps bounding-boxes to elements
-
modern-multiset
A hash multiset implementation
-
swaybar-types
building swaybar status commands in rust
-
deep-diff
A small crate to deeply diff serde_json::Value trees
-
kcr_volsync_backube
Kubernetes Custom Resource Bindings
-
use-meteorology
Facade crate for primitive RustUse meteorology vocabulary
-
tiny-bitstream
Standard implementation of a classic bitstream library
-
mako-nbw
Netzbetreiberwechsel process engine for German energy market DSO concession change (PARTIN-based market location transfer)
-
memstead-schema
Schema types for Memstead — entity definitions, vocabulary, and validation rules. Internal library surface consumed by the memstead binaries — pre-1.0, experimental, no API stability promise.
-
arrow-graph-git
Graph-native git primitives on Arrow RecordBatches — commit, checkout, merge, diff, blame, rebase
-
mumu-array
Array tools plugin for the MuMu/Lava language
-
bit-set-omnitool
A set of bits
-
oxgraph-hyper-bcsr
Borrowed bipartite CSR hypergraph views implementing oxgraph-hyper traits
-
lurk-elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
dawg
Directed Acyclic Word Graph
-
smallstr
String-like container based on smallvec
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
nexum
collection of commonly used data structures
-
slotmap_fork_lmondada
Slotmap data structure
-
higher_order_functions
A small collection of traits for implementing higher order functions
-
jsonmap
store values of multiple types value in one Map
-
unitfyi
Unit conversion across 220 units and 20 categories — async API client for unitfyi.com
-
std_collection_traits
Abstraction of operations in std collection types
-
altdeque
An alternative deque implementation
-
use-geography
Composable geography primitives for RustUse
-
automatic-relations
Tree automatic relations
-
sesstype
Multiparty Session Types
-
rstrie
A generalized Trie implementation for Rust
-
libreda-splay
Splay map and splay set data structures
-
typerat
Type-level rational numbers based on
typenum -
merkl-redb
MerkleTree, embedded friendly implementation with redb backend
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
weak-lists
Lists with weak references and concurrent iteration and modification
-
german-str-borrow
German/Umbra-style strings. Data is borrowed, static, or inlined
-
typed_graph
Staticly typed graph library
-
seg-tree
segment tree library
-
fp-index
Flat and multi-level row index types (Index, MultiIndex) for pandas-parity dataframes
-
rdf-vocab
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
eitherq
Queue which support two different types
-
serde_single_or_vec
Type which can be deserialized from either a sequence or a single value
-
kcr_operator_knative_dev
Kubernetes Custom Resource Bindings
-
lesbar
String types that must encode legible text
-
field-ref
Field reference (like a member pointer to non-static data field in C++) for Rust
-
compressed-sparse-fiber
Compressed sparse fiber implementation for Rust
-
btree_experiment
implements a BTreeMap similar to std::collections::BTreeMap
-
dge-gen
building a computational graph to be executed distributely
-
higher-graphen-interpretation
Domain interpretation packages, templates, mappings, projections, and lift adapters for HigherGraphen
-
groupex
Syncronization primitive that allows acquire lock by index
-
seq-set
A Set collection that maintains insertion order
-
banyan-utils
work with banyan trees
-
chunked-bytes
A rope-like non-contiguous buffer for efficient data structure serialization and vectored output
-
fwob-core
Shared schema, frame, and key types for the FWOB binary format
-
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
-
lookups
Improve the data retrieval operations for collections
-
tinybitset
Generic implementation of small, fixed size, copyable bitsets
-
avl-tree-rs
AVL self-balancing BST with LL/RR/LR/RL rotations, balance factor tracking, insert/delete/contains, and inorder traversal
-
radix_trees
Various radix tree (trie) data structures
-
ism-ic-genc
ODNI IC-GENC schema package, vendored. Designed as a build-dependency for codegen. SHA-256 verified at compile time.
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
ix-id
Hash-based ID generation for Ixchel
-
fcsd
Front-coding string dictionary
-
compressed_map
'Static functions': compressed maps with the keys removed
-
linkedin-csv
Structs defined to hold the data as exported from LinkedIn
-
unicodefyi
Unicode character lookup with 17 encodings — async API client for unicodefyi.com
-
plato-fleet-graph
Fleet graph engine — adjacency lists, centrality, community detection, shortest paths
-
pgat
Proxy GAT: Abstractions for generic proxy views with GAT to enable generic container types
-
semx_unsafe_list
Linux 风格侵入式双向链表
-
fixedbitset-stack
A forked version of FixedBitSet that supports const generics
-
collect
An experimental extension of std::collections
-
tree-mumu
Creates Linux
tree-style renderings of MuMu values -
faultline_sync
Local-first synchronization models and operation envelopes for FaultLine
-
knot0-types
Rust types generated from Knot0 JSON Schemas
-
use-event
Feature-gated facade crate for RustUse event primitives
-
treers
Sedgewick's tree maps
-
ledvar-core
Reference implementation of the Ledvar protocol: data model, canonical content-addressed hashing, and well-formedness
-
omega-agentdb
Advanced vector database with ruvector integration for agent storage and skill management
-
light_bitmap
A minimal, fixed-size bitmap library written in pure Rust
-
oxa-types
Rust types generated from the OXA schema
-
tongrams
Tons of N-grams
-
faultline_compute
Execution backend abstractions for FaultLine
-
arboriter
A tree traversal primitive for Rust, inspired by Tyler Glaiel's blog post
-
pulz-bitset
bitset implementation
-
vector_mapp
A Vec based map
-
paged
Read and create read-only paged database files
-
netz-checker
Pure Anmeldung validation library for German energy market NB STP decisions
-
prefix-tree-rs
A Trie (prefix tree) implementation
-
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
-
cobt
A Cache-Oblivious B-Tree implementation in Rust
-
calf-vec
Small copy-on-write arrays, essentially combining
SmallVecandCow -
dynvec
DynVectype that acts like a vector to store any datatype -
container_traits
Traits for container types
-
bloomy
Bloom filter using only two hash functions
-
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.
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
crtx-reflect
Reflection orchestration, prompts, candidate parsing, and schema validation
-
strune
directional knowledge structure library for building linked references and word books
-
todue
Git-backed todue document index, validation, and queries
-
plato-ghostable
Ghostable lifecycle — mark tiles/agents for active/ghost/resurrected states
-
faultline_geometry
Geometry abstractions and spatial metric contracts for FaultLine
-
artsy
ART Tree data structure library
-
use-geographical-projection
Primitive map projection vocabulary for RustUse
-
tree-iter
iterating over tree structures
-
tuplities-from
Traits for converting values into tuples
-
index-utils
working with indices
-
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
-
grdf
Generalized RDF graphs and datasets
-
oxgraph-csr
Borrowed CSR graph views implementing oxgraph-graph traits
-
mnema-core
Zero-dependency core of mnema: the egress-filter privacy invariant, the memory model, and pure-logic retrieval/semantic/vector/working stores
-
flat_map
A compact map stored as a vector of key, value pairs
-
higher-graphen-evidence
Evidence, confidence, causal, and prover bridge records for HigherGraphen
-
ctxmap
A collection that can store references of different types and lifetimes
-
rdf-store-turso
A Turso storage adapter for RDF.rs knowledge graphs
-
use-ecology
Facade crate for primitive RustUse ecology vocabulary
-
shared-vec
Efficient shared container types
-
drinkfyi
Beverage encyclopedia hub for cocktails, wine, beer, and more — async API client for drinkfyi.com
-
sakurai
Performant, general-purpose data structures
-
b-tree-rs
B-tree of order t with node splitting, deletion via merge/borrow, search, and range queries
-
bounded-vec-deque
A double-ended queue|ringbuffer with an upper bound on its length
-
dst-container
Containers for DST objects
-
use-chemistry
Composable chemistry primitives for RustUse
-
stack-array
A maximally-sized array stored on the stack
-
bloomz
A fast, flexible Bloom filter library for Rust with parallel operations support
-
sliced
A segmented vector for iterating over slices
-
tree-automata
Term Rewriting Systems
-
bitset-matrix
Space-efficient, row-major 2D bitset matrix with fast bitwise ops
-
enum-set
A structure for holding a set of enum variants
-
dgrambuf
A fixed capacity ring buffer for datagrams (byte slices)
-
mut-binary-heap
Enhanced version of std::collections::BinaryHeap that supports increase and decrease key, max, min, and custom-order heaps
-
fast_collections
noheap zero copy collections
-
rdf-reader-jsonld
A JSON-LD file reader for RDF.rs knowledge graphs
-
content-tree
An efficient data structure for compacted RLE data
-
a2ui-validation
JSON Schema validation engine for A2UI protocol messages
-
use-astronomy
Facade crate for primitive RustUse astronomy vocabulary
-
generic-arrayvec
Interop between the arrayvec and generic_array crates
-
minimizer-queue
Fast computation of minimizers using a monotone queue
-
bs
bitset with small-set (single-word) optimization
-
microstr
Stack-allocated string with fixed capacity
-
id-set
A bitset implementation that stores data on the stack for small sizes
-
store-interval-tree
A balanced unbounded interval-tree in Rust with associated values in the nodes
-
im
Immutable collection datatypes
-
bitsetium
One stop shop for all bitset needs
-
kcr_ripsaw_cloudbulldozer_io
Kubernetes Custom Resource Bindings
-
fp-python
PyO3 Python bindings for FrankenPandas — import frankenpandas from Python
-
use-test
Primitive testing vocabulary facade for RustUse
-
agileplus-sqlite
Typed intent graphs for engineering work — convert prompts into validated DAGs of intents, features, tasks, tests, and edges, then store, query, and serve them from Rust, HTTP, or MCP
-
kcr_disaggregatedset_x_k8s_io
Kubernetes Custom Resource Bindings
-
astack
offers a Stack data structure with fixed capacity capable of fast LIFO operations
-
owl-dl-saturation
Consequence-based saturation engine for the EL fragment, used by rustdl
-
test-mumu
Test suite plugin for the Lava language
-
rust-ds
Custom data structures crate for Rust
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
mumu-file
File handling function and steams plugin for the Lava language
-
phago-viz
Browser-based real-time visualization for Phago colonies
-
bitmaptrie
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
-
hamt-rs
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell
-
index-set
bitset implementation with support for atomic operations
-
crtx-session
Session-close pipeline: ingest, reflect, and commit memories to pending_mcp_commit
-
rdf-store-sqlite
A SQLite storage adapter for RDF.rs knowledge graphs
-
btreelist
A list data structure that has efficient insertion and removal in the middle
-
stack-buf
Vector-like facade for arrays allocated entirely on the stack
-
tc-collection
TinyChain's collection types
-
small_vec2
Vector on the stack or heap need nightly rustc
-
mumu-flow
Stream tranform tools plugin for the Lava language
-
tuplities-try-from
Traits for fallible conversion of values into tuples
-
gtrie
Generic trie implementation with a support of different key and value types
-
use-tectonic-plate
Primitive tectonic plate vocabulary for RustUse
-
inline-str
Efficent and immutable string type, backed by inline-array
-
oxgraph-algo
Substrate-agnostic graph algorithms over oxgraph-topology traits
-
eidos-memory
EIDOS v2.0: frequency-aware memory compression engine with 32x footprint reduction, multi-level residual reconstruction, and adaptive EWMA decay for embodied AI
-
rdf-reader-ntriples
An N-Triples file reader for RDF.rs knowledge graphs
-
stac-async
Asynchronous I/O for stac-rs
-
trait-map
Rust map for dynamic trait storage and references
-
marisa-ffi
Rust FFI bindings for libmarisa - a space-efficient trie data structure
-
json-mumu
JSON tools and JSON Schema plugin for the Mumu ecosystem
-
utf8char
that supplies a utf8 encoded char
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
use-atomic-number
Atomic-number validation and lookup helpers for RustUse chemistry crates
-
vecless
A minimal, Vec-free, singly linked list with Display support and ergonomic APIs
-
ckb_multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
bytesstr
An immutable reference-counted UTF8 String
-
kotoba-core
Core data structures and algorithms for the Kotoba distributed graph database system
-
specado-schemas-temp
Provider and prompt schema validation helpers for Specado
-
rdf-store
An in-memory storage adapter for RDF.rs knowledge graphs
-
attuned-store
Storage traits and in-memory backend for Attuned
-
littlechestnutgames-trie
A generalized trie implementation for quick prefix searching
-
use-stratum
Primitive stratum vocabulary for RustUse
-
kcr_leaderworkerset_x_k8s_io
Kubernetes Custom Resource Bindings
-
taganak-core
RDF types and interfaces from Taganak (Transactional, Aggregating Graph Architecture for Networking and Access to Knowledge)
-
btree_dag
A generic DAG (undirected graph) data structure
-
rdf-writer-jsonld
A JSON-LD file writer for RDF.rs knowledge graphs
-
mattbusel-mem-graph
Knowledge graph primitives: entities, relationships, typed properties, BFS/DFS traversal
-
interval-heap
A double-ended priority queue implemented with an interval heap
-
just-string
Container for various kinds of strings
-
oxgraph-topology
Storage-agnostic core traits for discrete topology views
-
btree_monstousity
a code port of BTreeMap but with comparator functions
-
arbutus
Trees
-
lighter
Macro for rewriting string matches as tries
-
tcgeneric
Generic data types used internally by TinyChain
-
rdf-hash
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
phago-runtime
Colony management, scheduling, and runtime for Phago biological computing
-
byte_trie
A compressed trie based on bytes with some weird child node bucket sizes
-
use-fault
Primitive fault vocabulary for RustUse
-
tibitset
bitset replacement for HashSet
-
attuned-qdrant
Qdrant storage backend for Attuned
-
rdf-reader-nquads
An N-Quads file reader for RDF.rs knowledge graphs
-
astar-mumu
A* algorithm plugin for the Lava language
-
map-trait
Generic Map trait
-
oxgraph-postgres
Postgres-backed OxGraph engine: catalog, build, artifact I/O, query, sync
-
linked_lists_rs
various data structures using linked lists in rust
-
use-rustacean
Facade crate for RustUse Fellow Friends deterministic fixture data
-
kcr_groupsnapshot_storage_k8s_io
Kubernetes Custom Resource Bindings
-
typed_index
A strongly typed Index that know what it is indexing
-
rdf-query
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
rdf-reader-turtle
A Turtle file reader for RDF.rs knowledge graphs
-
autocomplete
Auto-complete feature using Trie data structure
-
use-air-temperature
Primitive meteorological air temperature vocabulary for RustUse
-
use-food-web
Primitive food-web vocabulary for RustUse
-
use-event-envelope
Generic event envelope composed from RustUse event primitives
-
oxgraph-graph
Storage-agnostic core traits for binary graph views
-
use-money
Money primitives pairing amounts and currencies for RustUse finance crates
-
rdf-store-virtuoso
A Virtuoso storage adapter for RDF.rs knowledge graphs
-
crtx-runtime
Child agent execution, tool/process wrapper, and run capture
-
know_yaml
The KNOW Framework for Rust
-
rdf-borsh
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
use-conservation-status
Primitive conservation status vocabulary for RustUse
-
generic-json
Generic JSON traits
-
oxgraph-hyper
Storage-agnostic core traits for hypergraph views
-
use-crate
Composable crate identity and metadata primitives for RustUse
-
rdf-store-neo4j
A Neo4j storage adapter for RDF.rs knowledge graphs
-
use-population
Primitive ecological population vocabulary for RustUse
-
rdf-writer-turtle
A Turtle file writer for RDF.rs knowledge graphs
-
use-niche
Primitive ecological niche vocabulary for RustUse
-
wasm-mumu
WASM wrapper for the MuMu/Lava interpreter
-
use-biodiversity
Primitive biodiversity vocabulary for RustUse
-
rdf-store-mongo
A MongoDB storage adapter for RDF.rs knowledge graphs
-
math-mumu
Math functions plugin for the MuMu / Lava language
-
use-community
Primitive ecological community vocabulary for RustUse
-
oxgraph-csc
Borrowed compressed-sparse-column (inbound) graph views over snapshot sections
-
rdf-reader-cottas
A COTTAS file reader for RDF.rs knowledge graphs
-
rdf-store-idb
An IndexedDB storage adapter for RDF.rs knowledge graphs
-
use-ecosystem
Primitive ecosystem vocabulary for RustUse
-
rdf-writer-ntriples
An N-Triples file writer for RDF.rs knowledge graphs
-
rdf-store-postgres
A PostgreSQL storage adapter for RDF.rs knowledge graphs
-
use-habitat
Primitive habitat vocabulary for RustUse
-
oxgraph-mmap
Read-only memory-map shim: the single audited unsafe island for OxGraph's zero-copy base files
-
use-species-interaction
Primitive species interaction vocabulary for RustUse
-
rdf-writer-nquads
An N-Quads file writer for RDF.rs knowledge graphs
-
rdf-store-valkey
A Valkey storage adapter for RDF.rs knowledge graphs
-
matrix-mumu
Matrix operations for the mumu/lava language
-
rdf-reader-hdt
An HDT file reader for RDF.rs knowledge graphs
-
use-biome
Primitive biome vocabulary for RustUse
-
rdf-id
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
rdf-reader-rdfxml
An RDF/XML file reader for RDF.rs knowledge graphs
-
use-geo-coordinate
Primitive geographic coordinate vocabulary for RustUse
-
oxgraph-property
Arrow-backed named property layers for OxGraph topology views
-
use-friend
Typed Fellow Friends metadata model for RustUse fixture data
-
rdf-store-oxigraph
An Oxigraph storage adapter for RDF.rs knowledge graphs
-
use-breakpoint
Viewport and container breakpoint primitives for RustUse UI
-
rdf-reader-trig
A TriG file reader for RDF.rs knowledge graphs
-
rdf-store-qlever
A QLever storage adapter for RDF.rs knowledge graphs
-
use-trophic-level
Primitive trophic-level vocabulary for RustUse
-
use-event-metadata
Ordered string metadata entries for RustUse event primitives
-
rdf-writer-hdt
An HDT file writer for RDF.rs knowledge graphs
-
use-elevation
Primitive elevation and depth vocabulary for RustUse
-
use-spatial-reference
Primitive spatial reference vocabulary for RustUse
-
use-event-id
Lightweight event identifier primitive for RustUse
-
use-event-kind
Event kind labels for RustUse event primitives
-
crtx-core
Core IDs, errors, and schema constants for Cortex
-
use-event-name
Lightweight event name primitive for RustUse
-
rdf-writer-trig
A TriG file writer for RDF.rs knowledge graphs
-
use-event-dispatch
Dispatch status and outcome primitives for RustUse events
-
use-event-stream
Ordered in-memory event stream wrapper for RustUse events
-
use-friend-fixture
Deterministic Fellow Friends fixture records for RustUse
-
use-event-target
Lightweight event target primitive for RustUse