-
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
-
phf
Runtime support for perfect hash function data structures
-
half
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
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
-
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
-
slotmap
data structure
-
bit-vec
A vector of bits
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
tinyvec
tinyvecprovides 100% safe vec-like data structures -
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
generic-array
Generic types implementing functionality of arrays
-
enum-map
A map with C-like enum keys represented internally as an array
-
bimap
Bijective maps
-
tinystr
A small ASCII-only bounded length string representation
-
zerovec
Zero-copy vector backed by a byte array
-
bit-set
A set of bits
-
croaring
Rust wrapper for CRoaring
-
string-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
bio
A bioinformatics library for Rust. This library provides implementations of many algorithms and data structures that are useful for bioinformatics, but also in other fields.
-
wide
help you go wide
-
elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
generator
Stackfull Generator Library in Rust
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
ego-tree
Vec-backed ID-tree
-
linked_hash_set
HashSet with insertion ordering
-
smartstring
Compact inlined strings
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
im
Immutable collection datatypes
-
ena
Union-find, congruence closure, and other unification code. Based on code from rustc.
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
histogram
A collection of histogram data structures
-
enumset
creating compact sets of enums
-
either
The enum
Eitherwith variantsLeftandRightis a general purpose sum type with two cases -
smallbitvec
A bit vector optimized for size and inline storage
-
rowan
generic lossless syntax trees
-
fixedbitset
bitset collection
-
rpds
Persistent data structures with structural sharing
-
bloomfilter
Bloom filter implementation
-
yrs
High performance implementation of the Yjs CRDT
-
guppy
Track and query Cargo dependency graphs
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
jsonptr
Data structures and logic for resolving, assigning, and deleting by JSON Pointers (RFC 6901)
-
intmap
Specialized HashMap for integer keys
-
yada
double-array trie library aiming for fast search and compact data representation
-
radix_trie
Generic radix trie data-structure
-
range-set-blaze
Integer sets as fast, sorted, integer ranges with full set operations
-
ecow
Compact, clone-on-write vector and string
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
ringbuffer
A fixed-size circular buffer
-
typed-index-collections
Typed index version of Rust slice and Vec containers
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
index_vec
Newtype-style helpers for
Vecandusize -
bitmaps
Fixed size boolean arrays
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
crdts
Practical, serializable, thoroughly tested CRDTs
-
barcoders
A barcode-encoding library
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
circular-buffer
Efficient, fixed-size, overwriting circular buffer
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
egg
egraphs
-
thin-vec
A vec that takes up less space on the stack
-
smallbox
Small Boxoptimization: store small item on stack and fallback to heap for large item -
ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
bytes-utils
Additional utilities for working with the bytes crate
-
gix-pack
Implements git packs and related data structures
-
multimap
A multimap implementation
-
hashbag
An unordered multiset implementation using a hash bag
-
imbl
Immutable collection datatypes
-
narrow
Apache Arrow
-
binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps
-
orx-split-vec
An efficient dynamic capacity vector with pinned element guarantees
-
dlv-list
Semi-doubly linked list implemented using a vector
-
spade
Delaunay triangulations for the rust ecosystem
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
nonempty-collections
Correct-by-construction non-empty collections
-
arraydeque
A ring buffer with a fixed capacity, which can be stored on the stack
-
jaq-json
JSON values for jaq
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
arrow-array
Array abstractions for Apache Arrow
-
av-data
Multimedia data structures
-
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
-
cita_trie
Modified Patricia Tree (aka Trie)
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
modql
Model Query Language support
-
array-init
Safe wrapper for initializing fixed-size arrays
-
newtype-uuid
Newtype wrapper around UUIDs
-
equivalent
Traits for key comparison in maps
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
array-macro
Array multiple elements constructor syntax
-
grid
Dynamic generic 2D data structure
-
bounded-vec
Non-empty rust Vec wrapper with type guarantees on lower and upper bounds for items quantity
-
slice-dst
Slice-based custom DSTs
-
cordyceps
Mycelium intrusive data structures
-
uluru
fast, LRU cache implementation
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
string
A UTF-8 encoded string with configurable byte storage
-
louds-rs
High performance LOUDS (Level-Order Unary Degree Sequence) library
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
csaf-walker
work with CSAF data
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
-
immutable-chunkmap
A fast immutable map and set with batch insert and update methods, COW operations, and big O efficient implementations of set and merge operations
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
fastdivide
partial port of libdivide. It makes it possible to reduce the cost of divisions.
-
tree_iterators_rs
built to provide you with the iterators to easily work with tree data structures in Rust
-
vortex-dtype
Vortex's core type system
-
hibitset
Hierarchical bit set structure
-
dary_heap
A d-ary heap
-
merkle-search-tree
A data structure for efficient state-based CRDT replication and anti-entropy
-
bittle
Zero-cost bitsets over native Rust types
-
algorithm
about algorithm data structure, now has ttl with lru/lru-k/lfu/arc and slab/rbtree/roaring_bitmap/timer_wheelss, 关于算法常用的数据结构
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
crop
A pretty fast text rope
-
indexset
A two-level BTree with fast iteration and indexing operations
-
modular-bitfield
Allows to easily define bitfield types with modular building blocks
-
fqdn
FQDN (Fully Qualified Domain Name)
-
vers-vecs
A collection of succinct data structures supported by fast implementations of rank and select queries
-
vortex-scalar
Vortex Scalars
-
iset
Map and set with interval keys (x..y)
-
caches
popular caches (support no_std)
-
deep_causality
Computational causality library. Provides causality graph, collections, context and causal reasoning.
-
portgraph
Data structure library for directed graphs with first-level ports
-
keyed_priority_queue
Priority queue that support changing priority or early remove by key
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
lattices
Lattice data types for simplifying distributed state by providing associativity, commutativity, and idempotence
-
gix-traverse
gitoxide project
-
typed_floats
Types for handling floats with type checking at compile time
-
cdg_api
interact with api.congress.gov
-
intervallum
Generic interval and interval set library
-
tinyset
Size-optimized sets
-
lib-sokoban
Sokoban: compact, efficient data structures packed into contiguous byte arrays
-
phf_codegen
Codegen library for PHF types
-
v_frame
Video Frame data structures, originally part of rav1e
-
sqrid
Square coordinates and grid-like arrays, with zero dependencies, in a single file
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
vecmap-rs
A vector-based map and set implementation
-
bridgetree
A space-efficient Merkle tree designed for linear appends with witnessing of marked leaves, checkpointing & state restoration
-
idlset
Fast u64 set operations library
-
simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
queue-file
lightning-fast, transactional, file-based FIFO
-
rsdict
Fast static rank and select data structure
-
fm-index
FM index and its variant implementations for Rust
-
keyvi
key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
-
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. -
range-collections
Sets and maps of ranges, backed by smallvec
-
range-set
Smallvec-backed containers of sorted integer ranges
-
bitfield-struct
Struct-like procedural macro for bitfields
-
spatialtree
A fast and flexible generic spatial tree collection (Octree, Quadtree, etc)
-
cactus
Immutable parent pointer tree
-
cc-traits
Common collection traits
-
blart
adaptive radix tree packaged as a BTreeMap replacement
-
vart
An immutable versioned adaptive radix trie
-
trees
General purpose tree data structures
-
zerofrom
trait for constructing
-
differential-dogs3
Advanced join patterns in differential dataflow
-
xsd-types
XSD data types
-
rust_dynamic
Support for dynamically-typed values in run-time
-
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.
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
hypergraph
data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices
-
btree-range-map
B-tree range map implementation
-
arrow-ord
Ordering kernels for arrow arrays
-
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.
-
tree-ds
manipulate tree data structures
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
toodee
A lightweight 2D wrapper around a Vec
-
array2d
A fixed sized two-dimensional array
-
xml-builder
Easy and highly-configurable XML builder/writer
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
parsable
A trait to easily parse data structures
-
ordered
A wrapper for adding arbitrary partial/total order to a type
-
orx-tree
A beautiful tree 🌳 with convenient and efficient growth, mutation and traversal features
-
map_vec
The Map and Set APIs backed by Vec
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
tracker
A macro to track changes on structs
-
baby_shark
Geometry processing library
-
starlark_map
Map implementation with starlark-rust specific optimizations
-
iso7816
Types for ISO 7816
-
alot
A forbid-unsafe, generational slot map with usize-sized IDs
-
phf_shared
Support code shared by PHF libraries
-
array-concat
Macros for concatenating const arrays
-
chronologic
Time constraint reasoning (scheduling...)
-
iso7816-tlv
tools and utilities for handling TLV data as defined in ISO/IEC 7816-4
-
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…
-
toolbox-rs
A toolbox of basic data structures and algorithms
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
docker-compose-types
Deserialization and Serialization of docker-compose.yml files in a relatively strongly typed fashion
-
chat-prompts
Chat prompt template
-
broccoli
broadphase collision detection algorithms
-
diff-struct
A trait for diffing and applying diffs to types
-
bitfield-rle
A run-length-encoder that compresses bitfields
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
block-grid
A quick, cache-conscious, tiled 2D array
-
oxidd
A safe, concurrent, modular, and performant decision diagram framework
-
honeycomb-core
Core structure implementation for combinatorial maps
-
reactive_stores
Stores for holding deeply-nested reactive state while maintaining fine-grained reactive tracking
-
ssd-data
A service and data description format + a code generator based on rhai scripts and templates
-
mzpeaks
representing peaks in mass spectrometry data
-
bitm
bit and bitmap (bit vector) manipulation
-
i256
Optimized implementations of 256-bit signed and unsigned integers
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
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.
-
griddle
A HashMap variant that spreads resize load across inserts
-
slice_ring_buf
A ring buffer implementation optimized for working with slices
-
slotmap-careful
Wrap the slotmap crate and prevent key reuse
-
metatensor
Self-describing sparse tensor data format for atomistic machine learning and beyond
-
base-traits
base traits (for Rust)
-
mhgl
Matts HyperGraph Library (MHGL). A straightforward library for hypergraph datastructures.
-
sparsevec
Compress vectors using row displacement
-
number-general
A generic number type for Rust which supports basic math and (de)serialization
-
vec_map
map based on a vector for small integer keys
-
scapegoat
Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.
-
ggapi
communicating with start.gg's API
-
uguid
GUID (Globally Unique Identifier) no_std library
-
validated
The cumulative sibling of
ResultandEither -
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… -
ordered-multimap
Insertion ordered multimap
-
delay_map
HashMap collections whose entries expire after a given time
-
boa_interner
String interner for the Boa JavaScript engine
-
matrixable
Traits and structs extending capabilities of matrix-like structures
-
tuplez
Tuples represented in recursive form
-
hibit_tree
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
-
orx-fixed-vec
An efficient fixed capacity vector with pinned element guarantees
-
beap
Bi-parental heap data structure implementation in Rust
-
walker-common
Common functionality for SBOM and CSAF walker
-
imbl-sized-chunks
Efficient sized chunk datatypes
-
tagged-pointer
Platform-independent space-efficient tagged pointers
-
either_of
working with enumerated types that contain one of 2..n other types
-
warg-transparency
transparency data structures
-
more_collections
Additional collections not found in std::collections
-
short-uuid
generate and parse short uuids
-
vortex-runend
Vortex run end encoded array
-
elusion
modern DataFrame / Data Engineering / Data Analysis library that combines the familiarity of DataFrame operations (like those in PySpark, Pandas, and Polars) with the power of SQL query building…
-
ergo_avltree_rust
cryptographically authenticated dictionary based on AVL tree
-
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
adflib
handle amiga disk files
-
roadmap
model a project roadmap as a directed acyclic graph
-
bc-envelope
Gordian Envelope for Rust
-
smallvec-wrapper
Macro and common structs to play with
smallvec -
variadics
Variadic generics on stable Rust using tuple lists
-
vortex-sparse
Vortex Sparse array
-
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…
-
truc
Rust code generator for safe, fixed size, evolving records
-
polars-ops
More operations on Polars data structures
-
stack-queue
Heapless auto-batching queue
-
interavl
An optimised interval tree for efficient interval stabbing
-
form_builder
building forms with various fields and validation
-
valkyrie-ast
Strong typed abstract syntax tree of valkyrie language
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
etc-os-release
Parse /etc/os-release file
-
stacked_errors
high level error propogation with software controlled backtraces
-
tailcall-chunk
persistent data structure for efficient append and concatenation operations
-
nam-indexmap
(Namada fork) A hash table with consistent order and fast iteration
-
pyinrs
type library that is as easy to use as Python built-in types
-
differential-dataflow-master
An incremental data-parallel dataflow platform
-
simd_aligned
Safe and fast SIMD-aligned data structures with easy and transparent 'flat' access
-
libwebnovel
enabling users to get chapters of a webnovel, with multiple available backends
-
simple-grid
2d-grid structure
-
snowflake_me
A distributed unique ID generator inspired by Twitter's Snowflake
-
numeric-array
Wrapper around generic-array that adds efficient numeric trait implementations
-
rt_ref
Internal
Reftypes forrt_refandrt_vec -
vortex-error
Vortex errors
-
tskit
rust interface to tskit
-
orx-iterable
Defines and implements Iterable, Collection and CollectionMut traits to represent types that can be iterated over multiple times
-
authenticode
working with Authenticode (no-std)
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
awint
Arbitrary width integers
-
tmflib
Interface library for processing TMF payloads
-
plain
A small Rust library that allows users to reinterpret data of certain types safely
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
postman2openapi
Convert a Postman collection to an OpenAPI definition
-
mut_set
A safe implementation for HashSet with iter_mut and get_mut
-
id_tree
creating and modifying Tree structures
-
xmltv
electronic program guide (EPG) parser and generator using serde
-
tetengo_trie
A trie library implemented with a double array
-
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
-
rc-u8-reader
A tiny implement for reading
u8data from a reference counted instance -
sn_registers
Safe Network Register Logic
-
bumparaw-collections
A small set of bumpalo-backed collections for low-level operations
-
rdf-types
Data-structures and traits definitions for RDF
-
symbol_table
A symbol table that's fast, concurrent, and gives stable references
-
pasture-algorithms
Point cloud algorithms for pasture
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
pfds
Purely Functional Data Structures
-
cbsk_base
locked version cargo crates
-
traitgraph
Abstracting over different graph representations
-
rbitset
A bit set, being able to hold a fixed amount of booleans in an array of integers
-
flatk
Flat layout abstraction toolkit
-
podded
Zero-copy types for constraint environments
-
extindex
Persisted immutable index
-
compact-rc
Low-memory reference-counting pointers
-
xor_name
Xor Type
-
cbsk_socket
socket callback tool
-
enum-collections
Collections data structures optimized for Enum, initializable at runtime
-
avl
A map and a set implemented with an AVL tree
-
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…
-
ux-primitives
Graphics Primitives for Angular Rust
-
hdf5
Thread-safe Rust bindings for the HDF5 library
-
nam-sparse-merkle-tree
(Namada fork) Sparse merkle tree implement in rust
-
trane
An automated system for learning complex skills
-
canopydb
Transactional key-value storage engine
-
btree_experiment
implements a BTreeMap similar to std::collections::BTreeMap
-
dot2
generating Graphviz DOT language files for graphs
-
json_deref
JSON internal field links resolver
-
datas
data structures and algorithms and data analisys
-
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. -
edtui-jagged
A jagged array data structure for the edtui editor
-
ball-tree
K-nearest neighbors
-
oxidd-rules-zbdd
Zero-suppressed decision diagrams (ZBDDs) for OxiDD
-
orange-trees
Tree data structure with several methods to query and manipulate nodes
-
ordsearch
A data structure for efficient lower-bound lookups
-
typeid_prefix
that implements a type-safe version of the TypePrefix section of the
TypeIDSpecification -
array-object
Self-describing binary format for arrays of integers, real numbers, complex numbers and strings, designed for object storage, database and single file
-
normalize_interval
Normalizing interval library
-
i_shape
iShape is a compact and efficient library specifically designed for representing 2D data structures using IntPoint
-
ringmap
A hash table with consistent deque-like order and fast iteration
-
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…
-
smallstr
String-like container based on smallvec
-
gix-diff
Calculate differences between various git objects
-
pin-list
A safe
Pin-based intrusive doubly linked list -
optional
supplies a number of Option-like primitive types
-
linearize
Types that are enumerable and an array-backed map
-
clone_cell
A Cell that works with a restrictive form of Clone
-
sized-chunks
Efficient sized chunk datatypes
-
spacetimedb-data-structures
Assorted data structures used in spacetimedb
-
vsmtp-config
Next-gen MTA. Secured, Faster and Greener
-
binary-greedy-meshing
A port of https://github.com/cgerikj/binary-greedy-meshing to Rust
-
rdf-borsh
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
slabmap
HashMap-like collection that automatically determines the key
-
matreex
matrix implementation
-
cmsketch
A count min sketch implementation in Rust
-
jumprope
fast rope (fancy string) library built on top of Skiplists
-
min-max-heap
An efficient, double-ended priority queue
-
bitboard64
A 64-bit bitboard useful for chess programming
-
atelier
a Computational Workshop for Market Microstructure Modeling, Synthetic Simulation and Historical Replay
-
unsized-vec
Like Vec, but for unsized values
-
mago-ast
Supplies the data structures and types for representing PHP code as an Abstract Syntax Tree (AST)
-
json_dotpath
Dotted path access to nested JSON objects (serde_json::Value)
-
ftree
A very fast fenwick tree implementation
-
attribute-search-engine
Generic search engine for rows with attributes using different matchers
-
frunk_laws
contains laws for algebras declared in Frunk
-
sync42
synchronization tools
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
intervals-general
enabling general representation of and operations on intervals over generic types (e.g. supporting units of measure or arbitrary built-in types, or any type with PartialOrd implementation).
-
jaggedarray
Multidimensional jagged array
-
byteview
Thin, immutable zero-copy slice type
-
bevy_spatial
tracking bevy entities in spatial indices
-
nybbles
Efficient nibble-sized (4-bit) byte sequence data structure
-
sync-ptr
Sync & Send wrappers for raw pointer's
-
cantrip
Practical extension methods for standard Rust collections
-
lsph
Learned Spatial HashMap
-
span-map
A data structure for efficiently managing sets of values over spans/ranges
-
c_vec
Structures to wrap C arrays
-
rust_multistack
Support for two-dimentional stacks for the Rust programming language
-
json-number
JSON number parsing and storage
-
hotel
Collection Data-structure to associate values with keys
-
unordered-pair
A tuple struct representing an unordered pair
-
mikufans-proto
gRPC APIs for Mikufans
-
edifact-types
Bindings for the Edifact standard
-
kempt
Ordered collection types with no unsafe code and no_std support
-
heavykeeper
finding the top-k elements of a stream of data
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
field_access
Dynamically access struct fields
-
rust_flightweather
Decodes METAR and TAF
-
minimizer-iter
Iterate over minimizers of a DNA sequence
-
ordinal-map
Ordinal trait to map values to integers and efficient maps and sets for such types
-
defer-drop
Defer dropping large types to a background thread
-
polytype
A Hindley-Milner polymorphic typing system
-
fingertrees
Immutable persisten finger trees
-
intrusive-lru-cache
An LRU cache implementation using intrusive data structures
-
v_queue
file based queue
-
validit
Validate data structures internal state
-
disjoint
Fast and safe implementation of the disjoint-set data structure
-
do-notation
Monadic do syntactic sugar
-
code_generator
A code generator (Currently only targets C)
-
edgefirst-schemas
Maivin EdgeFirst Services Schemas
-
pdatastructs
probabilistic data structures
-
type-map
typemap container with FxHashMap
-
std-ext
Extend the standard library functionality
-
frozen-collections
Fast partially-immutable collections
-
packed-uints
Array of uints that scales from u4 to u32 to minimize wasted space while still being fast
-
wipe-on-fork
A replacement to OnceCell, LazyCell, Once, OnceLock, LazyLock that wipes itself when being forked in Unix
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
hello_egui
A collection of useful crates for egui
-
seoul
trait Isomorphism
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
radixmap
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
-
rbtree
the rbtree for Rust
-
typemap_rev
A hashmap, but stores types as keys
-
tea-core
Core data structures and traits for tevec
-
kn0sys-ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
loro-rle
A internal library of loro for storing and manipulating run-length encoded data. Do not use it directly.
-
structured
Data structures to handle large, structured data
-
agb_hashmap
no_std hashmap implementation intended for use in the
agblibrary -
av-codec
Multimedia format decoding and encoding
-
pas
strided slice
-
eastl-rs
EASTL binary-compatible Rust implementations
-
undo
An undo-redo library
-
populated
Collection types that are guaranteed to be populated (i.e. non-empty). Based on std::collections types.
-
any-rope
A fast and robust arbitrary rope for Rust. Based on Ropey.
-
hashslab
A hash table with data accessible by index
-
uuid-rng-internal
Private implementation details of the uuid crate
-
fvm_ipld_kamt
Sharded IPLD Map implementation with level skipping
-
odht
hash tables that can be mapped from disk into memory without the need for up-front decoding
-
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.
-
es-entity
Event Sourcing Entity Framework
-
mphf_benchmark
The program for benchmarking Minimal Perfect Hash Functions
-
ndata
Thread-safe, self-owned JSON-like data with manual garbage collection
-
uid_store
Generate random uid strings containing letters, numbers, or base62 values
-
entity_data
A container for entity component data
-
data_reader
A data loading library for data scientist
-
sharded
Safe, fast, and obvious concurrent collections
-
list-fn
A generic lazy list
-
bitstring-trees
Trees based on bitstrings
-
qutee
A quadtree implementation
-
sucds
Succinct data structures in Rust
-
jupyter-serde
Serialization and Deserialization for Jupyter related data structures
-
arrayset
An array-backed ordered set type
-
decomp
Components of a decompilation pipeline
-
prost-unwrap
A procedural macro for prost-generated structs validation and type-casting
-
raft-log
Raft log implementation
-
roussillon-type-system
A type system for a programming language
-
easy-tree
efficient tree structure library for Rust with recursive traversal
-
smart_led_effects
A collection of effects for LED strips
-
to_markdown_table
An easy way to format any data structure into a Markdown table
-
ofdb-boundary
Serializable, anemic data structures for accessing the OpenFairDB API in a type-safe manner
-
cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
value-log
Value log implementation for key-value separated LSM storage
-
phf_generator
PHF generation logic
-
mem_btree
A Data Structure of BTree Implemented with Rust, support snapshot. not use any unsafe lib.
-
beach_map
slotmap
-
nestac
access nested structures using path-like string format
-
primitive_fixed_point_decimal
Primitive fixed-point decimal types
-
pi_slotmap
Slotmap data structure
-
keymaps
standardized encoding for key codes
-
suggest
A minimal library to provide similar name suggestions like "Did you mean?"
-
bitpack-vec
A vector for arbitrary bitwidth integers, densely packed
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
binary-util
A panic-free binary utility crate to read/write binary streams over the wire
-
tagid
Defines a newtype labeled tagging for different types of ids
-
libreda-db
Layout and netlist datastructures for chip design
-
mmdb
A std-collection-like database
-
ligature
Ligature's data model in Rust
-
epsg
EPSG Coordinate Reference System tools & data
-
plain_trie
Classic trie implementation capable of mapping any T to char iterator
-
fiftyonedegrees
A wrapper around the 51Degrees device detection C library
-
enontekio
solve problems with data extraction and manipulation, like Advent of Code puzzles
-
ffi-convert
A collection of utilities to ease conversion between Rust and C-compatible data structures
-
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
boomerang_tinymap
A tiny, fast, and simple Slotkey-type map implementation for Boomerang
-
bondrewd
Bit-Level field packing with proc_macros
-
rust-tls-duplex-stream
Full Duplex stream Wrapper around rust-tls
-
stack-map
constant-size associative container for building higher-level data structures out of
-
HArcMut
mutable arc
-
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
-
cve
Mappings for parsing the CVE JSON files
-
prefix-sum-vec
Compressed storage for highly repeating elements, with
O(log n)lookups -
ninjabook
A lightweight and high performance orderbook
-
endpoints
A collection of data structures for the OpenAI-compatible endpoints
-
spart
A collection of space partitioning tree data structures for Rust
-
supply-chain-trust-example-crate-000006
port of Google's SwissTable hash map
-
relend
A generalized reborrowing mechanism that extends beyond simple references. It also allows for implementing traits that work with reborrowing for custom types.
-
wavltree
An intrusive Weak AVL Tree
-
phylo
An extensible Phylogenetics library written in rust
-
enum2egui
derive macro that creates a set of egui ui databindings from arbitrary data structures. Supports egui v0.29.1
-
jomy-ap-rustc_index
Automatically published version of the package
rustc_indexin the rust-lang/rust repository from version 1.83.0 The publishing script for this crate lives at: https://github.com/rust-analyzer/rustc-auto-publish -
exhaustive-map
An exhaustive map for types with finite inhabitants
-
whale
A lock-free, dependency-tracking primitive for incremental computation
-
sigma-types
Types checked for an invariant
-
map-macro
Declarative macros for statically initializing collections
-
flatcontainer
A flat container representation for Rust
-
smodel
Symbol semantic modeling for Rust
-
blas-array2
Parameter-optional BLAS wrapper by ndarray::Array (Ix1 or Ix2)
-
ocpp_rs
Protocol implementation for Open Charge Point Protocol (OCPP) in Rust
-
fibonacci_heap
A Fibonacci Heap implementation in Rust
-
hvec
A Vec-like structure that can store different types of different sizes contiguous with each other in memory
-
scope-cell
temporary, scope-bound, and thread-safe mutation of data in Rust
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
settrie
Fast subset and superset queries
-
snowflake-ng
Dead easy and high performance
snowflakeimplemented in Rust -
horizon_data_types
The Horizon data types library for third-party integrations
-
dia-i18n
-
space
providing abstractions for spatial datastructures and search
-
linker-set
Declarative programming via linker-constructed arrays
-
ladata
& modular data model
-
bao-tree
BLAKE3 verfiied streaming with custom chunk groups and range set queries
-
bv
Bit-vectors and bit-slices
-
adapton
programming abstractions for general-purpose incremental computations
-
tld
Top Level domain static hash map, tld list is obtained from of iana.org
-
trie-hard
Fast implementation of trie data structure
-
named_colors
that provides named colors in RGB and Hexadecimal formats
-
taskchain
A block-based, non-circular double-linked list implementation for Rust
-
persian-rug
Framework for bringing together disparate objects with inconvenient relationships
-
skiplist
in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
kg-tree
Generic object tree with Opath query language, similar to XPath
-
signalk
parse signalk maritime data
-
token-parser
parsing texts into data structures
-
chemrust-core
The core modules defining the flow and structs of data in computational chemistry routines
-
rust-box
odd set of tools for Rust programming
-
hifa-xml-schema
Structure generator from XSD source file
-
singletonset
SingletonSetdata structure, which makes it easy to store a single instance each of various types within a single set -
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
madeleine
Transparent object persistence with predefined operations and state containers
-
hora-id
A 64-bit time-based sorted unique ID generator that includes the current time in the ID
-
cdll
A circular doubly linked list
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
gtfs-geojson
converter for GTFS to GeoJSON formats
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
hexroll3-scroll
HEXROLL3 Scroll - the sandbox content generator
-
aliasable
Basic aliasable (non unique pointer) types
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
im-pathtree
Immutable, path-addressable tree data structure
-
btree-slab
A memory compact Slab-based B-tree implementation
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
beat_saber_map
Read and write Beat Saber maps with Rust
-
atomic_ptr_cell
Safe no_std repr(transparent) wrapper for AtomicPtr and &AtomicPtr with an api similar to a cell
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
pipebuf
Efficient byte-stream pipe buffer
-
tri-mesh
A triangle mesh data structure including basic operations
-
a-tree
A dynamic data structure for efficiently indexing arbitrary boolean expressions
-
threshold
data structures
-
vector
The package provides a vector database allowing for efficient search of nearest neighbors
-
strict
collections with strict bounds
-
historian
a high performance zero-config histogram implementation
-
orx-pseudo-default
PseudoDefault trait allows to create a cheap default instance of a type, which does not claim to be useful
-
rtree_rs
R-tree for Rust
-
slabigator
A linked list that doesn't do dynamic memory allocations
-
splay-safe-rs
Splay implemented with safe rust
-
reqray
Log ‘request x-rays’ for rust programs instrumented with
tracing -
among
The enum
Amongwith variantsLeft,MiddleandRightis a general purpose sum type with three cases -
ic-management-canister-types
Types for calling the IC management canister
-
balanced-tree-index
constant-time manipulation of a complete binary tree with a flat in-memory representation
-
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… -
superintervals
Interval overlap library
-
voxtree
sparse voxel 64-tree implementation in rust
-
every_variant
EveryVariant trait that provides the every_variant method on types. Allows you to easily generate every combination of variants in structures that contains Enums, or in nested enum trees…
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
sigmars
sigmahq rule collections
-
rust_redux
A Redux-like state management library for Rust
-
golomb-coded-set
BIP158 Golomb-Coded Set data structure
-
openligadb
API
-
plane-2d
Continuous 2D data structure representing infinite 2d plane
-
statiki
Static friendly data structures
-
ordes
treating arrays and tuples a little bit more like vectors
-
lox
Fast polygon mesh library with different data structures and traits to abstract over those
-
tiled_parse_tree
Tree data structure
-
task-group
manage groups of tokio tasks
-
iterlist
Linked list with a cursor based api
-
mantra-rust-trace
Collects requirement traces from rust code for the
mantraframework -
gridava
2D coordinate systems
-
mago-reflection
Offers data structures and APIs to represent and inspect PHP code elements—like classes, functions, and interfaces—enabling introspection and analysis
-
cowvert
a flexible data container supporting owned, reference-counted, and copy-on-write semantics. designed for use in interpreters
-
radicle-cob
Radicle Collaborative Objects library
-
identified_vec
Like HashSet but retaining INSERTION order and without
Hashrequirement on the Element type -
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
leetcode-trees-rs
Tree Node LeetCode problems
-
re_string_interner
string interning library
-
shortguid
Short URL-safe Base64 encoded UUIDs
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
compact_strings
A more compact but limited representation of a list of strings or bytestrings
-
ttgraph
Typed/Transactional Graph container
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
parametrized
Supply useful iterating methods for user-defined types which are parametrized by type parameters
-
hextree
Location to value mapping
-
trie-root
In-memory patricia trie operations
-
slack-blocks
Models + clientside validation for Slack's JSON Block Kit
-
rb_tree
A Red Black Tree implementation in Rust
-
chinese-rand
Random generation of data structures in Chinese, using Rust
-
data_registry
An unordered data structure with immediate insertion, removal and access
-
damped-springs
damped springs for smooth and springy motion
-
shiftnanigans
contains different iteration data structures for either iterating or for shifting iteratively forward and backward
-
kollect
Collections made ergonomic for gamedev usecases
-
hashheap
data structures that combine a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
nt-list
Compatible, type-safe, and idiomatic Rust implementations of Windows NT Linked Lists
-
xskiplist
Skiplist implementation in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
ic-verifiable-credentials
Verifiable credentials issuing and verification for IC canisters
-
walker-extras
Additional functionality for SBOM and CSAF walker
-
disjoint-sets
Three union-find implementations
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
delta-collections
Data structures with revertable operations called deltas
-
mssmt
Merkle-Sum Sparse Merkle Tree (MS-SMT)
-
grit-data-prison
providing the struct Prison<T>, a Generational Arena that allows full interior mutability to each and every element
-
miny
Box<T> with small value optimization
-
pstd
parts of Rust std library ( different implementations, features not yet stabilised etc )
-
libpna
PNA(Portable-Network-Archive) decoding and encoding library
-
libwebnovel-storage
A complement to libwebnovel: this package handles downloading and organizing collections of followed webnovels
-
im-lists
Persistent unrolled linked lists and vlists
-
rasn-smi
Data types for handling Structure for Management Information
-
expiringdict
A dict / HashMap whose items expire over time
-
basic_trie
Trie implementation in Rust
-
opt_struct
Optional collections
-
closed-interval-set
Unions of closed intervals as containers of pairs
-
sk-store
SimKube trace store library
-
value-ext
Serde Json Value Extension Trait (more Value type later)
-
search_trail
manager of variables that can save and restore their values
-
enumoid
Enum Indexed Containers
-
lru-mem
An LRU cache implementation bounded by memory
-
bit_mask_ring_buf
A ring buffer implementation with cheap indexing
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
arraystring
Fixed capacity stack based generic string
-
mzdata-spectra
A subset of
mzdata’s traits and spectrum data model -
egui-multiwin
that allows for multiple windows with egui
-
python-packed-resources
Manage data structures containing Python resources
-
ztimer
A block-based, non-circular double-linked list implementation for Rust
-
host-port-pair
Host-port pair type
-
cistring
A string type that preserve case, but compares insensitiveley
-
akita
Mini orm for rust
-
sbbf-rs
Split block bloom filter implementation
-
vizia_storage
The storage data structures of vizia
-
radyx
A basic radix tree implementation
-
oca-presentation
Lib providing struct for OCA presentation
-
digits
Custom “numeric” incrementor without u64 MAX limit in size. Like a score flipper for a custom character set.
-
cell-grid
2d grid container
-
geosite-rs
that parses geosite.dat file format
-
codas
Compact and streamable data format that works anywhere--from web apps to robots
-
hightorrent
High-level torrent library which supports Bittorrent v1, v2 and hybrid torrents
-
mule-map
A hybrid between a HashMap and a lookup table
-
pi_slot
lock free Slotmap data structure
-
tf-semver
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
weak-table
Weak hash maps and sets
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
gctree
cache-friendly, graph-like, arena-allocated datastructures
-
pasture-core
A framework for working with point cloud data
-
hydroperfox-smodel
Semantic modeling for Rust
-
eventio
A collection of event I/O processors for event-processing applications
-
no_std_collections
Auxiliary structures and traits for using dynamically resizable arrays (Vectors) in flexible environments, supporting both std and no_std contexts
-
dachshund
graph mining library written in Rust. It provides high performance data structures for multiple kinds of graphs, from simple undirected graphs to typed hypergraphs. Dachshund also provides…
-
scribe
Text editor toolkit
-
standard_card
A Lightweight Library for Efficient Card Representation
-
iterable
collection like types
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
cbsk_timer
rayon thread runtime
-
indexed_arena
index-based arena without deletion
-
mikel_binary_tree
search binary tree implementation
-
tdx-guest
The tdx-guest provides a Rust implementation of Intel® Trust Domain Extensions (Intel® TDX) Guest APIs, supporting for TDX Guest specific instructions, structures and functions
-
regroup
regrouping arrays
-
mc-oblivious-ram
Implementations of Oblivious RAM data structures
-
gridly
managing fixed-size 2D spaces
-
digit-sequence
Sequence of u8 digits
-
garnish_lang_annotations_collector
organize garnish annotations with related tokens
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
const_sized_bit_set
A bitset with a const generic size parameter indicating the number of 64 bit words to use
-
lean_string
Compact, clone-on-write string
-
cses-rs
A CSES spec impl in Rust
-
trybox
stable,
no_std-compatible, fallible heap allocation -
usize-set
Set data structures optimized to store sparsely distributed usize values
-
artie_common
Common Library for Artie Rust Projects
-
expiremap
Key-Value map where each value has a custom expiry time
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
iowrap
Small helpers for using io::Read/io::Write
-
maelstrom-base
Fundamental data structures used by all Maelstrom code
-
logisheets_controller
the core of LogiSheets
-
twovec
A data structure for storing 2 types of data in a packed, heap allocated array
-
doubloon
Money datatype that supports both statically and dynamically typed currencies
-
pi_spatial
sparial octtree quadtree
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
array_list
A dynamic container that combines the characteristics of a Vec and a LinkedList
-
stavec
Stack-allocated vector with static capacity
-
linux-audit-parser
Parser for Linxu Audit logs
-
etwin_dinoparc_store
Dinoparc store implementation
-
aatree
in Rust
-
floating_bar
Representing rational numbers using the floating-bar number type
-
influxdb-dispatcher
Batch metrics collection using influxdb
-
set_genome
A genetic data structure for neuroevolution algorithms
-
trk-io
TrackVis (*.trk) reader and writer
-
competitive-programming-rs
Competitive Programming Library in Rust
-
erased_set
A set of erased types
-
monistode-assemblers
A collection of assemblers for the monistode set of architectures
-
microkelvin
tree traversal over annotated data structures
-
mini-rx
bare-bones "reactive programming" (change propogation) using a central data dependency graph
-
entoli
A functional programming library inspired by haskell
-
cfpyo3_rs_core
a collection of performant utilities
-
stash
An amortized
O(1)table for cases where you don’t need to choose the keys and want something faster than a HashTable -
hylo-fix
Fixed-point number types with Solana Anchor support
-
nullnet-libtoken
managing and interacting with NullNet token structure
-
sos-system-messages
System message notifications for the Save Our Secrets SDK
-
flammkuchen
Some data structures for fun and flammkuchen (e.g. a 2d grid which permits negative indices)
-
crdt-lite
CRDT library for Rust
-
color-operators
Color data structures, converters, and arithmetic operators
-
hit-data
Hierarchical Indexed Typed data structure
-
ibuilder
Interactive builder for Rust types
-
ux-dx
3D Graphics Primitives for Angular Rust
-
irange
A data structure to store and manipulate ranges of integers with set operations
-
rustc_data_structures
Reuse rustc_data_structures for compiler_base
-
i24
working with 24-bit integers
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
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 -
indexical
indexed collections
-
dusa_collection_utils
A common library with standardized functions that the ais_platform, dusa, recs and others will depend on
-
quadtree_simple
quadtree implementation
-
variant-rs
VARIANT support for Rust. Clean, idiomatic handling of WinAPI/COM results.
-
datafrost
Data format and acceleration structure management
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
coca
Data structures with constant capacity
-
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
-
rstmt
focuses on building a music theory library that can be used to generate music theory data structures and algorithms
-
messaging
two-way messaging crate
-
know
Framework for Rust
-
linkedin-csv
Structs defined to hold the data as exported from LinkedIn
-
hprtree
A Hilbert-Packed-R-Tree implementation for rust
-
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.
-
strumbra
Umbra-style strings (also known as German strings)
-
get-full-year
An unofficial Rust client for getfullyear.com that helps you get the full year
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
sbwt
Indexing sets of DNA k-mers with the spectral Burrow-Wheeler transform
-
linear_collections
Map and Set types backed by linear data structures
-
magnetise
asses the similarity between SQL queries
-
commitlog
Sequential, disk-backed commit log library
-
vortex-bytebool
Vortex byte-boolean array
-
timeless
storing in-memory timeseries data
-
half-2
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types. Fork of half by Kathryn Long
-
ux-dataflow
Data Processing Library
-
oxidd-manager-index
Index-based manager implementation for OxiDD
-
enum_meta
Add metadata to Enum Variants
-
micro_autotile
LDTK autotiling
-
orx-selfref-col
SelfRefCol is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees
-
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
blaze-common
Blaze common shared types
-
non_empty_continuous
Non-empty continuous collections
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
iter-tree
Convert between iterators and tree structures in both directions
-
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.
-
gpt_disk_types
GPT (GUID Partition Table) disk data types no_std library
-
unionfind
A union find library made for building type inference engines. Can be used as general purpose datastructure.
-
quickselect
基于rust的选择算法
-
rs42
collection of utilities to make programming in Rust more enjoyable
-
dcl_data_structures
Data structures for for deep_causality crate
-
defaultmap
HashMap with an automatic default for missing keys
-
bitvector
in Rust
-
queues
Efficient FIFO Queue data structures
-
mset
/ multiset / bag implementation
-
newnum
traits for number API and hierarchy
-
gw_signal
Package with signal processing tools for graviational waves studies
-
graphplan
planning algorithm from Avrim L. Blum and Merrick L. Furst in Rust
-
tord
Data structure to store transitive relations
-
arr-rs
arrays library
-
data-source
that fetches data from different sources
-
pinocchio-token
Pinocchio helpers to invoke Token program instructions
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
mapack
mapbox vector tiles
-
btree-ondisk
BTree structure on persistent storage in userspace
-
genmap
generational map data structure with no dependencies
-
lazy-cow
Copy-on-write pointers with lazy modification support to minimise clones with a cost counter to limit work duplication
-
flo_rope
An attributed and streaming implementation of the rope data structure
-
enso-data
A collection of useful data structures
-
markov-generator
Highly customizable library for building Markov chains and generating random data
-
vec-btree-map
Basically just a sorted Vec that can be used as a HashMap
-
lambda-runtime-types
Common structures for lambda architecture
-
fdec
A collection of macros for generating fixed-size fixed-point numeric types for Rust
-
ndarray-ndimage
Multidimensional image processing for ArrayBase, the n-dimensional array data structure provided by ndarray
-
parallel_vec
A generic contiguous collection of heterogenous values
-
rtdlib
TDLib for rust
-
flat-tree
Series of functions to map a binary tree to a list
-
sweetrpg-model-core
Core model definitions for SweetRPG
-
fixed-macro
Macros for creating fixed-point constants for types in the
fixedcrate -
uuidv7
UUIDv7 implementation
-
exact-covers
Knuth's algorithm for solving the exact cover problem with colors
-
timer_list
A list of timed events that will be triggered sequentially when the timer expires
-
xot
Full-featured XML tree library for Rust
-
ascent-byods-rels
data structures for Ascent relations, made possible by Ascent's BYODS feature
-
pi_append_vec
Only supports append vectors, lock free
-
incrementalmerkletree-testing
Common types, interfaces, and utilities for testing Merkle tree data structures
-
text-style
Types and conversions for styled text
-
ndstruct
Structures for N-dimensions
-
tuple_list
macro-free variadic tuple metaprogramming
-
automerge-test
testing automerge libraries
-
itybity
An itty bitty crate providing bit iterators and bit iterator accessories
-
israeli_queue_etc
various queues
-
rdf-model
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
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…
-
linked-list
An alternative implementation of std::collections::LinkedList
-
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.
-
laurier
ratatui helper library
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
td-shim-interface
TD-shim metadata data structures and related functions. UEFI Platform Initializaiton data structures and accessors
-
rust_twostack
Support for two-dimentional stacks for the Rust programming language
-
type-set
A set of heterogeneous types
-
idbag
A bag of integers
-
fenwick
tree: data structure that efficiently calculates prefix sums in a changing array of numbers
-
codes-iso-639
This package contains an implementation of the ISO 639 (Parts 1, 3, and 5) Language Code specifications
-
flatbuffers-owned
that enables a more flexible usage of FlatBuffers
-
tc-value
TinyChain's representation of a value which can be collated and stored
-
dequemap
A no_std compatible implementation of the dequemap crate
-
ofilter
fast thread-safe Bloom filter
-
vec-collections
Rust collections that are newtype wrappers around smallvec
-
compressed-intvec
A compressed integer vector with fast random access that stores values with instantaneous codes in a bitstream
-
depends
Ergonomic, performant, incremental computation between arbitrary types
-
validiter
Iterator adapters for validating iterations
-
sparse_set_container
A container based on sparse set. Stable keys, O(1) lookup, cache-friendly iterations, and no hashing.
-
safer_owning_ref
creating references that carry their owner with them
-
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
retaker
ecs implementation
-
sstable
Sorted String Tables, an on-disk format for storing immutable maps consisting of string,string pairs, and retrieving values by key efficiently. This crate also features bloom filters…
-
i_tree
Red-black tree implementation for rust. Only for uniq elements
-
ast2str
pretty-printing ASTs and other recursive data structures
-
sortedlist-rs
A fast sorted list data structure in rust
-
traitgraph-algo
Graph algorithms based on the traitgraph crate
-
safe_index
Type-safe indexes
-
smallbitset
series of allocation free sets capable of holding small integer values
-
nullnet-liberror
Logging library for NullNet
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
confiner
A config language for things that look like trees
-
gecs
A generated entity component system
-
yyid
Yyid generator (random tokens like UUIDv4, but using all the bits)
-
cmdtree
(Rust) commands tree
-
coalesced_intervals
Data structure for maintaining maximally-coalesced 1D intervals
-
big_unsigned_ints
Big Unsigned Integers ranging from U256 to U2048 using u64 arrays all under a fixed-size of 32
-
bitstring
traits and implementations
-
supply-chain-trust-example-crate-000039
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
rexsgdata
Scatter-Gather Data Descriptors
-
swaybar-types
building swaybar status commands in rust
-
json-flat-parser
Parse JSON document into a flat data structure
-
nlist
inline-allocated list with statically tracked length
-
redmaple
offers an oppinionated yet extremely flexible data modeling system based on events for backend applications
-
cbsk_mut_data
ref mut tool
-
lodtree
help create octrees and quadtrees for chunked level of detail
-
hicollections
C-liked Collections
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
hdf5-dst
DST extensions for HDF5
-
dipa
dipa makes it easy to efficiently delta encode large Rust data structures
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
lace_stats
Contains component model and hyperprior specifications
-
anchors
async incremental computations
-
tailvec
Split Vec to mutable slice and TailVec, the TailVec can push or pop etc
-
slablit
Literal for slab creation
-
atomicow
A
Cow-like data structure where owned data is stored inside anArc -
bin-it
efficient Rust library for binary serialization and deserialization
-
malwaredb-api
Common API endpoints and data types for MalwareDB components
-
higher
Functors, Applicatives, Monads and other bad ideas
-
try-lazy-init
Fallible lazy initialization
-
sentry-contrib-breakpad
Unopinionated crash collection for Sentry reporting purposes
-
cow_vec_item
Copy-on-write Vec, available on stable rust
-
loaned
Safely move values with live inner borrows
-
kn0sys_ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
canadensis_dsdl_frontend
Compiler front-end for the Cyphal Data Structure Description Language
-
suff_collections
Fast realization of suffix array and suffix tree
-
sif-kdtree
immutable, flat k-d tree
-
owning_ref
creating references that carry their owner with them
-
cmus-status
structure cmus status data
-
modular-bitfield-msb
Allows to easily define bitfield types with modular building blocks. MSB-first version.
-
minivec
A version of Vec that's only the size of a single pointer
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
cedarwood
efficiently-updatable double-array trie in Rust (ported from cedar)
-
singletonThread
thread in a singleton
-
histogram-sampler
Sampling from a distribution given by a histogram
-
pi_ordmap
Ord Map
-
pl-lens
support for lenses, which are a mechanism in functional programming for focusing on a part of a complex data structure
-
range_bounds_map
[
RangeBoundsMap] and [RangeBoundsSet], Data Structures for storing non-overlapping intervals based of [BTreeMap] -
orchestrator
Orchestration sequences
-
wasmrs-frames
WasmRS RSocket frame decoding, encoding, and data structures
-
bitvek
bit vector implementation
-
stdng
An enhancement for Rust standard library
-
umili
Mutate and observe Rust data structures
-
dayendar
advanced days calendar operations
-
school_library
structures to manage school-related data, including students, classes, and schools
-
sparse-merkle-tree
Sparse merkle tree implement in rust
-
bigraph
Different representations with implemented operations on bigraphs
-
twice-cell
Like
once-cell, except you set the value twice -
gen_value
indexes and values with generations for vectors
-
frunk-enum-core
Implemenation of genericized enums for use with frunk
-
rt_map
Runtime managed mutable borrowing from a map
-
code_location
UNMAINTAINED! Use std::panic::Location instead!
-
pax-properties-coproduct
Static container for program-variable data structures and polymorphic components
-
sortedvec
a sorted vector that enables quick lookups
-
anndata-memory
Thread-safe AnnData-like structure for single-cell genomics data in Rust. Provides controlled mutability, efficient memory management, and flexible data manipulation. Ideal for concurrent bioinformatics applications.
-
entity
that provides entity-like constructs
-
spenso
A tensor (n-dim array) network, iterating, and contraction (using automatic abstract index matching) library
-
non-random-state
Deterministic HashMap and HashSets
-
msg-store
A fast and light-weight message store designed to work as a priority queue in low hardware equiped devices
-
rive
ecosystem crate
-
index-ext
Index slices with arbitrary ints and as arrays
-
multidict
Python MultiDict implementation
-
rep
A small tool for representation/class invariants
-
seq-map
Sequential Map
-
sampling-tree
sampling tree implementation for sampling discrete distributions with sparse dynamic updates. This allows us to sample efficiently from a distribution given the relative importance of each datapoint…
-
graph_process_manager_core
explore parts of a tree-like or graph-like structure that is not known in advance
-
mago-token
Defines the data structures and enumerations representing PHP tokens
-
interval-rbtree
An interval tree implementation using Red-Black Tree as its underlying data structure
-
croaring-sys
Raw bindings to CRoaring
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
circbuf
A growable circular buffer for working with bytes
-
rust-3d
2D/3D library written in rust
-
chronofold
A conflict-free replicated data structure (a.k.a CRDT) for versioned text
-
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
chesspos
Basic structs for representing chess squares
-
kdtree-simd
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
-
ioc
An Inversion-of-Control library in Rust
-
onebuck
An efficient unordered dynamically-sized data structure
-
vec-string
To print Vec<Display>
-
riddance
retiring, recyclable, reservable IDs
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
diffogus
calculate the difference between 2 instances of a type
-
type-rules
easily constrain a struct
-
pimalaya-tui
Collection of crossterm widgets shared accross Pimalaya projects
-
arbutus
Trees
-
mut-rc
Temporarily mutable
Rc<T>that decays intoRc<T> -
incrstruct
Build self-referencing structs using two-phase initialization
-
write_x86_64
help you write x86_64 assembly code
-
honeycomb-render
Visualization tool for combinatorial maps
-
ttmap
Trivial implementation of type map
-
msgpack_simple
Simplified, easy to use, pure Rust MessagePack implementation focused on handling dynamic data structures
-
streaming_algorithms
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
arraysetcell
A fixed-capacity, vector-like array with interior mutability and no ordering guarantees
-
open-coroutine-timer
The time utils
-
generic-btree
Generic BTree for versatile purposes
-
ndim
N-dimensional array for numerals in Rust similar to NumPy
-
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
-
vecdeque-stableix
Deque with stable index values
-
sum
General-purpose sum types
-
emap
A map with a fixed capacity and integers as keys
-
easy_collections
Wrappers around standard collections for ease of use and quick prototyping
-
zngur-def
Data types that define the structure of a zng file
-
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
-
point-nd
flexible no-std struct to model points on axes of any dimensions
-
seq-set
A Set collection that maintains insertion order
-
data_model
[highly unstable] data model for virtualization
-
uniquevec
A
Vec-like datastructure which only contains unique entries. It is no_std and has optional serde support. -
deinterleave
your datastructures
-
anymap2
A safe and convenient store for one value of each type
-
union-fn
Proc. macro for creating efficient "inline closures".
-
expanding_slice_rb
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
-
tinybox
Like
Box, but with an optimization that avoids allocations for small data-structures -
xbinser
binary structure transporation
-
alignment-exporter
Proc macro providing alignment info for a user-defined struct
-
penumbra-sdk-transaction
Core transaction data structures for Penumbra
-
rj
reactive json
-
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…
-
plexus
2D and 3D mesh processing
-
flat_collections
Lightweight and memory-efficient associative data structures
-
awint_ext
Externally allocating
awintfunctionality -
netcrab
creating and exporting Petri nets
-
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…
-
compare
Experimental comparators for collections to be generic over
-
mqfilters
Highly optimized approximate membership query filters (bloom, cuckoo, xor, quotient) with SIMD support
-
permafrost
Write. Macros. Everywhere.
-
crater
Very generic containers including KD trees, fibonacci heaps, minmax heaps,
-
gix-hashtable
that provides hashtable based data structures optimized to utilize ObjectId keys
-
galemu
workaround for generic associated types (GAT) limited to lifetimes (GAL)
-
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
indexed_json
Index json files like a database
-
sbom-walker
work with SBOM data
-
rc-writer
A tiny implement for writing data to a reference counted instance
-
dyn_list
A linked list that can hold dynamically sized values in its nodes
-
token-lists
token list representation
-
scored_set
A scored sorted set data structure for Rust
-
sequential_gen
sequential generator
-
pointcloud
An accessor layer for goko
-
td-wavegen
Tower Defense mob wave generator
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
minsize
Collections with a statically known minimum size (using const generics)
-
deepmesa
fast Data Structures and Algorithms in Rust. Every data structure is hand crafted for performance, well tested and has an extensive API.
-
zond
standard rust collections but with collecting statistics
-
spatialize
collection of spatial data structures used for efficent spatial partitioning
-
codas-flow
Low-latency, high-throughput bounded queues ("data flows") for (a)synchronous and event-driven systems
-
radix-heap
Fast monotone priority queues
-
pin_array
Tiny crate providing an array with structurally projected pinning
-
bdaddr
Bluetooth Device Address
-
superset_map
Map that stores distinct supersets based on the total order defined
-
foyer-intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
syzlang-parser
Parse Syzlang language
-
mih-rs
Multi-index hashing (MIH) for neighbor searches on binary codes in the Hamming space
-
value_pool
implements a ValuePool struct that makes the creation of self-referential data structures easier and safer
-
committable
Keccak256-based structured commitments
-
csf
compressed static functions (maps) that use perfect hashing and value compression
-
flex-alloc
Data structures with extra flexible storage
-
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
contack
easy contact library
-
itc
Interval Tree Clocks as described in the itc2008 paper
-
sweetrpg-kv-objects
Objects for Key-value store
-
forest-ds
secure tree structure
-
awid
Small, simple, universally unique identifiers
-
loaded_dice
sampler for loaded dices, implementing the alias method
-
jsonmap
store values of multiple types value in one Map
-
median-heap
A median heap implementation in Rust, used to keep track of a running median of a sequence of numbers
-
ordmask
To check if a value is included efficiently
-
smart_access
A minimalistic "lazy bidirectional pointer" framework
-
intervaltree
generic implementation of an immutable interval tree
-
range-map
Maps and sets implemented using ranges
-
mist-lib
Juniper Mist Schema Definitions
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
medianheap
A median heap for keeping track of a running median
-
float16
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
comparer
track changes in a HashMap over several iterations
-
alt-std
Alternative Lightweight Std library for making small executables and shared objects
-
flatten_objects
A container that stores numbered objects. Each object can be assigned with a unique ID.
-
steiner-tree
Fast construction of rectilinear steiner minimal trees (RSMT) in two dimensions
-
ic-response-codes
Internet Computer Response Codes
-
kv6
Collection of structs to allow reading of Ken Silverman's voxel formats
-
vortex-expr
Vortex Expressions
-
alist
Association list offering fast lookups while preserving insertion order
-
fibis
fixed range bitset
-
div-int
Rational numbers with a compile-time denominator
-
shrink-to-fit
Recursively calls
shrink_to_fiton all elements of the container -
stable-map
A hash map with temporarily stable indices
-
text-document
Text document structure and management
-
compt
A complete binary tree visitor library
-
boolvec
A vector of boolean stored contiguously in memory
-
triangle_matrix
Triangle matrix indexing operations
-
gw2timers
Iterate and collect Guild Wars 2 map meta event times
-
dartlib
Disk backed concurrent Adaptive Radix Tree implementation, with optional generations
-
product-os-openapi
Product OS : OpenAPI provides a set of structs for defining the structure of an OpenAPI / Swagger specification. This crate is intended to be used with Product OS : Connector.
-
tensorism
Multidimensional arrays with bounds included in the type system
-
palettevec
A palette compressed vector library for potentially insane runtime compression ratios
-
latestmap
latest map
-
spaceindex
-
omango-util
Utililites
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
sql-json-path
SQL/JSON Path implementation in Rust
-
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… -
mco-gen
Stackfull Generator Library in Rust
-
bit-int
An arbitrary fixed bit-width integer library
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
rs-car
CAR v1 and v2 specifications
-
word-dictionary
data structure for word mapping. It can be used for language translation.
-
optempty
Tools for working types that may be empty. E.g., an empty
String,Vec,HashMap, etc. -
sparseset
A Sparse Set
-
fixed_deque
A fixed size VecDeque to match Python Deque
-
bloom-filter-yss
bloom filter for me or you
-
schema2struct
Convert a JSON schema into Rust structs for efficient and type-safe data management
-
bittyset
A BitSet type for manipulating bit sets
-
is_affected_lib
checking and listing the affected resources across a range of commits, useful when working with monorepos
-
range_map_vec
range map data structure backed by a Vec
-
hashstash
It's like git but for your Rust data structures
-
tan-lints
A collection of lints for the Tan Language
-
tracing-rc
Cycle-aware reference-counted pointers with a safe, simple api
-
raw-btree
Generic B-Tree implementation
-
bit-parallelism
Small integer specialized, word level, parallel algorithms and data structures
-
sif-itree
immutable, flat interval tree
-
fixed_bitmaps
A small crate implementing bitmap functionality around primitive Rust unsigned integers
-
pi_sinfo
used to describe the 'structure', that is, the meta information of the structure
-
nb-tree
Very simple tree structure with generic node and branch data
-
structures
collection data structures
-
serde-request-envelope
A serde request envelope with named type and data fields
-
string_manipulation_utf8
String manipulation functions using character indexing (UTF-8) instead of bytes
-
zk-kit-smt
Sparse Merkle Tree
-
lize
A stupid way of serializing and deserializing data into bytes that supports recursive data structures
-
valord-map
A dictionary sorted by values
-
varlen
Ergonomic variable-length types
-
oxidd-cache
Apply cache for OxiDD
-
holyhashmap
A hash map with stable indices
-
bitlab
Extracting a range of bits from a binary data source
-
phf_mut
Perfectly hashed mutable containers
-
orn
A general implementation of the sum type. Meant to be a generic counterpart to tuples.
-
specs-hierarchy
Scene graph type hierarchy abstraction for use with specs
-
validbr
data structure and validation for Brazilian Registries, such as CPF, CNPJ and CNH (currently only CPF and CNPJ is supported)
-
array-const-fn-init
Initializes an array with constant values calculated by a
const fn -
twitter/rustcommon-time
getting current and recent timestamps
-
bgp-models
Structs and other building blocks for BGP and MRT related Rust projects
-
ordered_hash_map
HashMap which preserves insertion order
-
proptest-recurse
Helper for defining mutually recursive strategies with proptest
-
rotated-array-set
An ordered set supporting O(1) rank and O(√n) inserts and deletes
-
collect-rs
Special and custom Collections and Containers (for Rust)
-
membuffer
A very fast flat memory buffer used to deserialize at a fast speed
-
segment-tree
Quickly perform interval queries or modifications
-
meminterval
interval-tree in Rust made to store memory mappings
-
daggy2
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.
-
output_iter
An iterator that performs calculation during iteration
-
modern-multiset
A hash multiset implementation
-
spaghetto
making double-ended data structures, like an always-contigouous double-ended queue (deque) and double-ended string
-
broomdog
A type-erased map with 'indefinite loanership'
-
inplace-vec-builder
Build a vec from a vec, in place
-
nimbusqueue
fifo collection
-
pulz-arena
A generational arena allocator with compact generational indices
-
sliding_tree
A tree that grows from the leaves and recedes from the root
-
hrtb-lending-iterator
A lending iterator trait based on higher-rank trait bounds (HRTBs)
-
memvec
Memory-backed vector, not buffer. Designed for for mmap. Not MemMap, but MemVec!
-
llist
Lisp-style singly-linked list
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
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…
-
kampu
Generic byte array parser function where you can define the structure/tree of the bytes in JSON, send it a byte array and get the parsed output in JSON
-
moving_min_max
Tracking minimum or maximum of sliding windows
-
grids
2D grid data structure for games
-
light-curve-interpol
Interpolations tools for time series
-
supertrees
Supervision trees for Tokio-based services inspired by Erlang/OTP
-
list_tools
一个自己研发的Vec<T>
-
egui_suspense
Automatically show loading and error uis for egui
-
typeslice
type-level slices
-
aversion
Versioned data structures with auto-upgrading
-
crdt_tree
Tree Conflict-free Replicated Data Type (CRDT)
-
multiset
Multisets/bags
-
flange-flat-tree
A tree that can be expanded by attaching new values to the node without mutability of the old ones
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
v9
A slim data engine for Data Oriented Design
-
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 -
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
arc-bytes
A reference-counted byte buffer
-
froop
A functional reactive stream library for rust
-
bayesic
A string matching library similar to NaiveBayes but optimized for many small classifications
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
quickscope
Multi-layer HashMap and HashSet implementations for performant representation of variable scopes
-
wccg-models
WCCG Data
-
limq
Queue with optional maximum number of elements constraint
-
arbitrary-chunks
An iterator that allows specifying an input array of arbitrary chunk-sizes with which to split a vector or array
-
art-tree
The Adaptive Radix Tree
-
gdsl
graph data-structure library including graph containers, connected node strutures and efficient algorithms on those structures. Nodes are independent of a graph container and can be used as connected smart pointers
-
b-tree
A persistent B+ tree using freqfs
-
mikufans-proto-intl
gRPC APIs for Mikufans (Intl)
-
overtone
An API for creation and management of rich (as in rich-text) musical-ish projects
-
giftbox
A fun Rust crate called
giftboxto help Rustlings learn and explore generics -
dyn_trie
Dynamic trie is trie capable of mapping any T to any char iterator
-
bucket_vec
A vector-like data structure that guarantees to never move its contained elements
-
nakadi-types
A connector for the Nakadi Event Broker
-
relational_types
Manage relations between objects
-
disk-ringbuffer
lock free on disk ringbuffer to be used in the implementation of Franz
-
merkle
tree implementation with support for generation of inclusion proofs
-
array_map
Map backed array for fixed size keys with O(1) performance
-
hst-tw-images
working with Twitter profile images
-
bitset-core
Straightforward, no-std compatible, simd optimized, BitSet API
-
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
rutenspitz
А procedural macro to be used for testing/fuzzing stateful models against a semantically equivalent but obviously correct implementation
-
serde_either
set to enums to deserialize and serialize data that can either be string, struct or vec
-
succinct
data structures for Rust
-
tryingarraylist
arraylist implementation
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
diamond-types
The world's fastest text CRDT
-
fenwick-bit-tree
Slighly over-engineered FenwickTree implmentation
-
veho
a iterable toolset
-
mirl
Miners Rust Lib - A collection of ever growing functions and structs
-
tpntree
A N-dimensional generalization of region quad/oc-trees
-
signvec
Vector implementation for fast, sign-based manipulation of dynamic collections
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
orbweaver
designed for effortless construction and analysis of graph data structures
-
cycle_map
Implementations of bi-directionally accessible hashmaps
-
uintx
Unaligned unsigned integers with exact size in memory and arithmetic operations for them
-
vlcb-defs
VLCB protocol core library containing important value definitions and data structures
-
rive-models
Revolt API models for the Rive ecosystem
-
incremental-map
combinators for incremental immutable maps (see crate
incremental) -
wplot
Plot interface
-
lurk-elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
atomic_lifo
Lock free thread-safe lifo for rust
-
ord-uuid
Creates lexically sortable uuid values of size 16 bytes
-
realhydroper-smodel
Semantic modeling for Rust
-
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:… -
listfree
lockfree prepend-only list
-
teardown_tree
A binary search tree that supports fast clone and delete-range operations
-
fid
FID (Fully Indexable Dictionary) implementation for Rust
-
bytering
A ring buffer specialized for vectored reading and writing in blocking and async I/O
-
grdf
Generalized RDF graphs and datasets
-
grid-tree
Pixel quadtrees and voxel octrees
-
tinybitset
Generic implementation of small, fixed size, copyable bitsets
-
evento-store
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
resizing-vec
An automatic resizing vector for data with linear increasing ids
-
thot-core
Core functionality and types for Thot data management and analysis software
-
cseq
compact sequences
-
id_collections
Index-oriented programming in Rust
-
mini_uuid
A small and URL-safe UUID crate for Rust
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
sidex
A format- and language-agnostic data structure and API definition language
-
typerat
Type-level rational numbers based on
typenum -
timer-queue
Pure, minimal, and scalable timers
-
chainmap
mutability of intermediate maps
-
panoradix
A generic map and a set, both backed by a Radix tree
-
fixstr
fixing strings
-
lignin
A virtual DOM structure, primarily for web use
-
tree-sitter-traversal2
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
supply-chain-trust-example-crate-000058
Generic types implementing functionality of arrays
-
grovedb-version
Versioning library for Platform
-
rarena
Lock-free allocator and data structures based on ARENA
-
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!
-
atree
An arena based tree structure with removal support
-
bevy_tiles
Bevy library for working with entities in grids
-
kubizone-common
Typed Rust structures for representing partially and fully qualified domain names
-
myopic
A possibly bad lens library for Rust
-
riblt
Rateless Invertable Bloom Lookup Table (RIBLT) data structure
-
dsa_sport
revision material for undergrads
-
xsd
XSD.rs
-
staticvec
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics
-
pac_cell
Parent and child cell
-
caffeine
Collection of data structures I'm writing for fun. Originally written for use with my crafting interpeters tutorial implementation.
-
default-vec2
Vec-like data structure with default elements and a bitset built using it -
arc-string-interner
An efficient cuncurrent string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
prototty_common
Definition of common ui elements and views for use with prototty
-
pvec
RRB-Tree based persistent vector implementation
-
cast-rs
A collection of types cast for Rust
-
nostd-bv
Bit-vectors and bit-slices
-
chain-map
A chain of maps with a single view into the aggregated values
-
grit-bitvec
BitVec, a vector type that can store fixed-width data with irregular bit widths
-
dakv_skiplist
skiplist for dakv
-
fns
add common fn, eg: debounce, throttle
-
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 -
awint_dag
DAG
awintfunctionality -
implies
A parser for logical formulas
-
villa01-data-structures
Personal crate of me trying to implement data structures and algorithms in Rust
-
extended-rational
implementations of high-accuracy projectively-extended rational numbers and macros for creating them
-
st2-logformat
Adapter-agnostic definitions for data types used by ST2
-
driftdb
A real-time data backend for browser-based applications (core library)
-
screech
A collection of helpers for handling audio data in real time
-
expiringmap
a HashMap-backed TTL map
-
circular-queue
A circular buffer-like queue
-
rosary
About Rose Trees
-
rdc
generating Java code from rust structs
-
tilecoding
Dr. Richard S. Sutton's tile coding software.
-
enum-tag
Proc. macro for generating enum discriminant types.
-
chainbuf
Fast chained buffers
-
crio
An easy to use persistent data storage library
-
kd-tree-rs
k-d tree
-
flatbuffers-retained
allows a user to validate a flatbuffer once and the move it around or store it in a data structure without keeping the buffer borrowed. Then later it can be used again without re-validation.
-
rustz
functional programming in Rust
-
make-message-bus
Generate a pub-sub bus for use in async applications
-
seq_watcher
A pair of structures for monitoring a stream of data for one or more sequences
-
nanotweaks-proc
moved to https://crates.io/crates/spread_macros
-
comprende
Python-style collection comprehensions in Rust
-
prefix_array
A generic container for searching on prefixes of keys
-
handlemap
A collection that produces handles that can be used as keys to retrieve the stored items
-
lumberjack
Read and modify constituency trees
-
minimizer-queue
Fast computation of minimizers using a monotone queue
-
supply-chain-trust-example-crate-000019
A hash table with consistent order and fast iteration
-
billios
A soil library
-
acme-types
Types for implementing ACME (RFC 8555) providers and clients
-
spannify
that produces nice-looking graphs to visualize your callstack
-
win-variant
that aims to provide a more ergonomic way of working with variants in winapi based projects
-
recursive_reference
way to walk on recursive structures easily and safely
-
beehive
collections for 3D hexagonal maps
-
rdf-format
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
ldtk_map
reading ldtk maps for usage in games
-
xsparseset
sparse set
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
nanovec
Arrays and Vec-likes of small integers packed in an integer or two
-
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
-
fn-map
Abstraction around HashMap. Uses closure to compute and store value.
-
pciids
parse the pci.ids data file
-
modupipe
A modular and extensible ETL-like pipeline builder
-
mine_sweeperr
Minimalist interface to manage the backed of a mine sweeper game
-
statemachine-rs
A statemachine crate which have zero dependencies
-
generational-indextree
Arena based tree structure by using indices instead of reference counted pointers
-
unicase_collections
Collection of UniCase datastructures
-
range_union_find
A union-find data structure for ranges
-
kushi
A queue built for the Dango Music Player and Oden Music Bot
-
python-objects
that implements the architecture of the CPython objects. with this crate you can crate a list with any data type from rust
-
sorted_vector_map
maps and sets backed by sorted vectors
-
total-maps
Maps where every possible key has an associated value
-
quickphf_codegen
Code generator for creating static maps and sets for use with quickphf
-
groupex
Syncronization primitive that allows acquire lock by index
-
skog
Adobe's stlab::forest data structure
-
landfill
Various types for dealing with on-disk data
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
double-map
A HashMap with double key to single data/value
-
periodic-rs
Bounded datastructures
-
equivalent-flipped
Similar to
equivalentcrate, but flipsKandQ -
stonks
Sets that allow borrowing while inserting entries
-
osmgraph
Convert OSM queries into graphs
-
clap_flags
Collection of reusable flags for Clap
-
finite-automata
A collection of extendable finite automata with immutable state and transition data
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
actions
Software without side-effects. Redo and Undo. Macro's.
-
luthor
A collection of lexers for various languages/formats, and the tools required to build them
-
supply-chain-trust-example-crate-000048
Types and traits for working with bytes
-
purse
Bag data structure implementation in Rust
-
literally
Macro literals for members of std::collections
-
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…
-
nslice
Structures for interpreting slices of variable length as arrays
-
persist-o-vec
A Vec type that aims to have stable indices and memory location
-
merkle-root
calculating the Merkle root of either a file, or walked directory
-
prefix-tree-rs
A Trie (prefix tree) implementation
-
scoped_stack
A scoped stack data structure
-
vec-with-gaps
A data structure that behaves like a vec of vecs, but where the subvecs are kept in one contiguous section of memory, which improves cache performance for some workloads
-
generic_event_queue
generic event-queue API
-
serde_single_or_vec
Type which can be deserialized from either a sequence or a single value
-
ultragraph
Hypergraph data structure
-
simple-vec-collections
Collections implemented using Vec
-
big-tuple
providing trait implementations for tuples of up to 128 elements
-
learn_together
Curated collection of lists of useful resources to learn Rust together
-
header-vec
Vector with user-specified header, length, capacity, and array elements all stored on the heap together
-
linear-hashtbl
Linear probing hash table
-
vicardi
JSON VCardArray Generator that uses Serde
-
cbsk_log
log tool
-
insrcdata
Embed static data as source code
-
nonempty-containers
Fast, zero-cost conversion, and fully inter-operable nonempty container types
-
mergle
A data structure with fast merging and comparison
-
small_iter
A 3-pointer iterator that moves out of a
Vec<T>orBox<[T]> -
shogiutil
A collection of tools to handle shogi data
-
nimble-steps
Nimble Steps Collections
-
crfsuite-sys
Rust binding to crfsuite
-
dade
data definition for Rust structures
-
folketinget-api-models
Autogenerated Rust structures based on the Danish Parliament's OData metadatafile
-
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.
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16coordinates. -
zhifeng_impl_barnes_hut_tree
implements Barns-Hut Tree for accelerated N-body force calculation
-
find-all-the-kitty-cats-in-charlotte
A collection of crates for working with cats
-
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
dmfr-dataset-reader
Reads transitland folder and outputs graph of valid feeds and operators
-
structdb
Persistent data structures using RocksDB
-
redox_simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
bktree
BK-tree datastructure
-
rust_examples
rust 的学习中的一些例子
-
object-collection
A collection that can store multiple values of types