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