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