-
hashbrown
port of Google's SwissTable hash map
-
indexmap
A hash table with consistent order and fast iteration
-
bitvec
Addresses memory by bits, for packed collections and bitfields
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
half
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
phf
Runtime support for perfect hash function data structures
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
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
-
roaring
A better compressed bitset - pure Rust implementation
-
slotmap
data structure
-
bit-vec
A vector of bits
-
bimap
Bijective maps
-
enum-map
A map with C-like enum keys represented internally as an array
-
bit-set
A set of bits
-
zerovec
Zero-copy vector backed by a byte array
-
generic-array
Generic types implementing functionality of arrays
-
tinystr
A small ASCII-only bounded length string representation
-
rpds
Persistent data structures with structural sharing
-
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
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
wide
help you go wide
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
im
Immutable collection datatypes
-
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.
-
ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
guppy
Track and query Cargo dependency graphs
-
crdts
Practical, serializable, thoroughly tested CRDTs
-
croaring
Rust wrapper for CRoaring
-
string-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
rowan
generic lossless syntax trees
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
histogram
A collection of histogram data structures
-
tinyvec
tinyvecprovides 100% safe vec-like data structures -
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
ego-tree
Vec-backed ID-tree
-
enumset
creating compact sets of enums
-
radix_trie
Generic radix trie data-structure
-
fixedbitset
bitset collection
-
range-set-blaze
Integer sets as fast, sorted, integer ranges with full set operations
-
smartstring
Compact inlined strings
-
smallbitvec
A bit vector optimized for size and inline storage
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
bloomfilter
Bloom filter implementation
-
yrs
High performance implementation of the Yjs CRDT
-
yada
double-array trie library aiming for fast search and compact data representation
-
ena
Union-find, congruence closure, and other unification code. Based on code from rustc.
-
bitmaps
Fixed size boolean arrays
-
index_vec
Newtype-style helpers for
Vecandusize -
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
imbl
Immutable collection datatypes
-
typed-index-collections
Typed index version of Rust slice and Vec containers
-
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
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
barcoders
A barcode-encoding library
-
multimap
A multimap implementation
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
either
The enum
Eitherwith variantsLeftandRightis a general purpose sum type with two cases -
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
cita_trie
Modified Patricia Tree (aka Trie)
-
bytes-utils
Additional utilities for working with the bytes crate
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
ecow
Compact, clone-on-write vector and string
-
dlv-list
Semi-doubly linked list implemented using a vector
-
spade
Delaunay triangulations for the rust ecosystem
-
arraydeque
A ring buffer with a fixed capacity, which can be stored on the stack
-
circular-buffer
Efficient, fixed-size, overwriting circular buffer
-
narrow
Apache Arrow
-
array-init
Safe wrapper for initializing fixed-size arrays
-
ringbuffer
A fixed-size circular buffer
-
linked_hash_set
HashSet with insertion ordering
-
egg
egraphs
-
sn_registers
Safe Network Register Logic
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
thin-vec
A vec that takes up less space on the stack
-
keyed_priority_queue
Priority queue that support changing priority or early remove by key
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
hashbag
An unordered multiset implementation using a hash bag
-
smallbox
Small Boxoptimization: store small item on stack and fallback to heap for large item -
modular-bitfield
Allows to easily define bitfield types with modular building blocks
-
csaf-walker
work with CSAF data
-
orx-split-vec
An efficient constant access time vector with dynamic capacity and pinned elements
-
cdg_api
interact with api.congress.gov
-
av-data
Multimedia data structures
-
newtype-uuid
Newtype wrapper around UUIDs
-
gix-pack
Implements git packs and related data structures
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
array-macro
Array multiple elements constructor syntax
-
bridgetree
A space-efficient Merkle tree designed for linear appends with witnessing of marked leaves, checkpointing & state restoration
-
louds-rs
High performance LOUDS (Level-Order Unary Degree Sequence) library
-
any_vec
Type erased vector. Most operations can be done without type knowledge. Mostly zero overhead.
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
string
A UTF-8 encoded string with configurable byte storage
-
bitfield-struct
Struct-like procedural macro for bitfields
-
merkle-search-tree
A data structure for efficient state-based CRDT replication and anti-entropy
-
modql
Model Query Language support
-
crop
A pretty fast text rope
-
fastdivide
partial port of libdivide. It makes it possible to reduce the cost of divisions.
-
binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps
-
nonempty-collections
Correct-by-construction non-empty collections
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
lib-sokoban
Sokoban: compact, efficient data structures packed into contiguous byte arrays
-
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
-
hibitset
Hierarchical bit set structure
-
iset
Map and set with interval keys (x..y)
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
vortex-dtype
Vortex's core type system
-
vortex-scalar
Vortex Scalars
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
arrow-array
Array abstractions for Apache Arrow
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
range-set
Smallvec-backed containers of sorted integer ranges
-
blart
adaptive radix tree packaged as a BTreeMap replacement
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
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
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
sqrid
Square coordinates and grid-like arrays, with zero dependencies, in a single file
-
v_frame
Video Frame data structures, originally part of rav1e
-
queue-file
lightning-fast, transactional, file-based FIFO
-
dary_heap
A d-ary heap
-
hdf5
Thread-safe Rust bindings for the HDF5 library
-
intervallum
Generic interval and interval set library
-
array2d
A fixed sized two-dimensional array
-
tree_iterators_rs
built to provide you with the iterators to easily work with tree data structures in Rust
-
phf_codegen
Codegen library for PHF types
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
vers-vecs
A collection of succinct data structures supported by fast implementations of rank and select queries
-
cordyceps
Mycelium intrusive data structures
-
simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
trees
General purpose tree data structures
-
zerofrom
trait for constructing
-
diff-struct
A trait for diffing and applying diffs to types
-
xsd-types
XSD data types
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
btree-range-map
B-tree range map implementation
-
bounded-vec
Non-empty rust Vec wrapper with type guarantees on lower and upper bounds for items quantity
-
caches
popular caches (support no_std)
-
typed_floats
Types for handling floats with type checking at compile time
-
portgraph
Data structure library for directed graphs with first-level ports
-
idlset
Fast u64 set operations library
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
uguid
GUID (Globally Unique Identifier) no_std library
-
rust_dynamic
Support for dynamically-typed values in run-time
-
fqdn
FQDN (Fully Qualified Domain Name)
-
jaq-json
JSON values for jaq
-
vec_map
map based on a vector for small integer keys
-
bitfield-rle
A run-length-encoder that compresses bitfields
-
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
grid
Dynamic generic 2D data structure
-
kempt
Ordered collection types with no unsafe code and no_std support
-
gix-traverse
gitoxide project
-
uluru
fast, LRU cache implementation
-
tinyset
Size-optimized sets
-
bv
Bit-vectors and bit-slices
-
xml-builder
Easy and highly-configurable XML builder/writer
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
oxidd
A safe, concurrent, modular, and performant decision diagram framework
-
parsable
A trait to easily parse data structures
-
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.
-
flatcontainer
A flat container representation for Rust
-
metatensor
Self-describing sparse tensor data format for atomistic machine learning and beyond
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
iso7816
Types for ISO 7816
-
number-general
A generic number type for Rust which supports basic math and (de)serialization
-
validated
The cumulative sibling of
ResultandEither -
tracker
A macro to track changes on structs
-
baby_shark
Geometry processing library
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
-
pi_slotmap
Slotmap data structure
-
extindex
Persisted immutable index
-
ordered-multimap
Insertion ordered multimap
-
spatialtree
A fast and flexible generic spatial tree collection (Octree, Quadtree, etc)
-
array-concat
Macros for concatenating const arrays
-
algorithm
about algorithm data structure, now has ttl with lru/lru-k/lfu/arc and slab/rbtree/roaring_bitmap/timer_wheelss, 关于算法常用的数据结构
-
form_builder
building forms with various fields and validation
-
griddle
A HashMap variant that spreads resize load across inserts
-
orange-trees
Tree data structure with several methods to query and manipulate nodes
-
cactus
Immutable parent pointer tree
-
phf_shared
Support code shared by PHF libraries
-
jumprope
fast rope (fancy string) library built on top of Skiplists
-
simple-grid
2d-grid structure
-
broccoli
broadphase collision detection algorithms
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
docker-compose-types
Deserialization and Serialization of docker-compose.yml files in a relatively strongly typed fashion
-
etc-os-release
Parse /etc/os-release file
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
xor_name
Xor Type
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
equivalent
Traits for key comparison in maps
-
honeycomb-core
Core structure implementation for combinatorial maps
-
mhgl
Matts HyperGraph Library (MHGL). A straightforward library for hypergraph datastructures.
-
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).
-
vecmap-rs
A vector-based map and set implementation
-
postman2openapi
Convert a Postman collection to an OpenAPI definition
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
slabmap
HashMap-like collection that automatically determines the key
-
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… -
chat-prompts
Chat prompt template
-
chronologic
Time constraint reasoning (scheduling...)
-
warg-transparency
transparency data structures
-
libwebnovel
enabling users to get chapters of a webnovel, with multiple available backends
-
rt_ref
Internal
Reftypes forrt_refandrt_vec -
id_tree
creating and modifying Tree structures
-
rsdict
Fast static rank and select data structure
-
sucds
Succinct data structures in Rust
-
truc
Rust code generator for safe, fixed size, evolving records
-
more_collections
Additional collections not found in std::collections
-
base-traits
base traits (for Rust)
-
min-max-heap
An efficient, double-ended priority queue
-
intmap
Specialized HashMap for u64 keys
-
vortex-error
Vortex errors
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
roadmap
model a project roadmap as a directed acyclic graph
-
bitm
bit and bitmap (bit vector) manipulation
-
smallstr
String-like container based on smallvec
-
iso7816-tlv
tools and utilities for handling TLV data as defined in ISO/IEC 7816-4
-
polars-ops
More operations on Polars data structures
-
typemap_rev
A hashmap, but stores types as keys
-
manganis
Ergonomic, automatic, cross crate asset collection and optimization
-
delay_map
HashMap collections whose entries expire after a given time
-
tagged-pointer
Platform-independent space-efficient tagged pointers
-
trie-hard
Fast implementation of trie data structure
-
blas-array2
Parameter-optional BLAS wrapper by ndarray::Array (Ix1 or Ix2)
-
rc-u8-reader
A tiny implement for reading
u8data from a reference counted instance -
differential-dogs3
Advanced join patterns in differential dataflow
-
matrixable
Traits and structs extending capabilities of matrix-like structures
-
ggapi
communicating with start.gg's API
-
short-uuid
generate and parse short uuids
-
validit
Validate data structures internal state
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
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…
-
pyinrs
type library that is as easy to use as Python built-in types
-
plain
A small Rust library that allows users to reinterpret data of certain types safely
-
skiplist
in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
c_vec
Structures to wrap C arrays
-
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…
-
pasture-core
A framework for working with point cloud data
-
cantrip
Practical extension methods for standard Rust collections
-
adflib
handle amiga disk files
-
grovedbg-types
Common type definitions for data exchange over GroveDBG protocol
-
kbs-types
Rust (de)serializable types for KBS
-
hibit_tree
Hierarchical bitmap tree. Prefix tree without memory overhead that act as herarchical bitmap.
-
relend
A generalized reborrowing mechanism that extends beyond simple references. It also allows for implementing traits that work with reborrowing for custom types.
-
btree-slab
A memory compact Slab-based B-tree implementation
-
valkyrie-ast
Strong typed abstract syntax tree of valkyrie language
-
polytype
A Hindley-Milner polymorphic typing system
-
array-object
Self-describing binary format for arrays of integers, real numbers, complex numbers and strings, designed for object storage, database and single file
-
differential-dataflow-master
An incremental data-parallel dataflow platform
-
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
-
oxidd-manager-index
Index-based manager implementation for OxiDD
-
supply-chain-trust-example-crate-000006
port of Google's SwissTable hash map
-
xmltv
electronic program guide (EPG) parser and generator using serde
-
snowflake_me
A distributed unique ID generator inspired by Twitter's Snowflake
-
vsmtp-config
Next-gen MTA. Secured, Faster and Greener
-
among
The enum
Amongwith variantsLeft,MiddleandRightis a general purpose sum type with three cases -
ffi-convert
A collection of utilities to ease conversion between Rust and C-compatible data structures
-
json_dotpath
Dotted path access to nested JSON objects (serde_json::Value)
-
map_vec
The Map and Set APIs backed by Vec
-
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…
-
optional
supplies a number of Option-like primitive types
-
demand
A CLI prompt library
-
podded
Zero-copy types for constraint environments
-
bao-tree
BLAKE3 verfiied streaming with custom chunk groups and range set queries
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
authenticode
working with Authenticode (no-std)
-
orx-fixed-vec
An efficient constant access time vector with fixed capacity and pinned elements
-
edtui-jagged
A jagged array data structure for the edtui editor
-
deep_causality
Computational causality library. Provides causality graph, collections, context and causal reasoning.
-
walker-common
Common functionality for SBOM and CSAF walker
-
slotmap-careful
Wrap the slotmap crate and prevent key reuse
-
wipe-on-fork
A replacement to OnceCell, LazyCell, Once, OnceLock, LazyLock that wipes itself when being forked in Unix
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
flatk
Flat layout abstraction toolkit
-
indexset
A two-level BTree with fast iteration and indexing operations
-
sized-chunks
Efficient sized chunk datatypes
-
alot
A forbid-unsafe, generational slot map with usize-sized IDs
-
pfds
Purely Functional Data Structures
-
disjoint
Fast and safe implementation of the disjoint-set data structure
-
ux-primitives
Graphics Primitives for Angular Rust
-
slice_ring_buf
A ring buffer implementation optimized for working with slices
-
timed-map
Lightweight map implementation that supports expiring entries and fully compatible with both std and no_std environments
-
tc-value
TinyChain's representation of a value which can be collated and stored
-
ordsearch
A data structure for efficient lower-bound lookups
-
basic_trie
Trie implementation in Rust
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
doubloon
Money datatype that supports both statically and dynamically typed currencies
-
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. -
datas
data structures and algorithms and data analisys
-
bitboard64
A 64-bit bitboard useful for chess programming
-
spacetimedb-data-structures
Assorted data structures used in spacetimedb
-
enumoid
Enum Indexed Containers
-
symbol_table
A symbol table that's fast, concurrent, and gives stable references
-
bc-envelope
Gordian Envelope for Rust
-
json-number
JSON number parsing and storage
-
tskit
rust interface to tskit
-
tmflib
Interface library for processing TMF payloads
-
beach_map
slotmap
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
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…
-
prost-unwrap
A procedural macro for prost-generated structs validation and type-casting
-
cc-traits
Common collection traits
-
vart
An immutable versioned adaptive radix trie
-
entity_data
A container for entity component data
-
named_colors
that provides named colors in RGB and Hexadecimal formats
-
blazemap
Implements a vector-based slab-like map with an interface similar to that of HashMap, and also provides tools for generating lightweight identifiers that can be type-safely used as keys for this map
-
tree-ds
manipulate tree data structures
-
do-notation
Monadic do syntactic sugar
-
rbtree
the rbtree for Rust
-
jaggedarray
Multidimensional jagged array
-
edgefirst-schemas
Maivin EdgeFirst Services Schemas
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
typeid_prefix
that implements a type-safe version of the TypePrefix section of the
TypeIDSpecification -
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
fingertrees
Immutable persisten finger trees
-
frunk_laws
contains laws for algebras declared in Frunk
-
hotel
Collection Data-structure to associate values with keys
-
arbutus
Trees
-
decomp
Components of a decompilation pipeline
-
gtfs-geojson
converter for GTFS to GeoJSON formats
-
snowflake-ng
Dead easy and high performance
snowflakeimplemented in Rust -
horizon_data_types
The Horizon data types library for third-party integrations
-
signalk
parse signalk maritime data
-
unordered-pair
A tuple struct representing an unordered pair
-
bevy_spatial
tracking bevy entities in spatial indices
-
normalize_interval
Normalizing interval library
-
slab_tree
A vec-backed tree structure with tree-specific generational indexes
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
pdatastructs
probabilistic data structures
-
graphrs
package for the creation, manipulation and analysis of graphs
-
hvec
A Vec-like structure that can store different types of different sizes contiguous with each other in memory
-
weak-table
Weak hash maps and sets
-
suggest
A minimal library to provide similar name suggestions like "Did you mean?"
-
binary-util
A panic-free binary utility crate to read/write binary streams over the wire
-
cve
Mappings for parsing the CVE JSON files
-
enum-collections
Collections data structures optimized for Enum, initializable at runtime
-
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…
-
epsg
EPSG Coordinate Reference System tools & data
-
ball-tree
K-nearest neighbors
-
slice-dst
Slice-based custom DSTs
-
nestac
access nested structures using path-like string format
-
ofdb-boundary
Serializable, anemic data structures for accessing the OpenFairDB API in a type-safe manner
-
sync42
synchronization tools
-
fiftyonedegrees
A wrapper around the 51Degrees device detection C library
-
depends
Ergonomic, performant, incremental computation between arbitrary types
-
qutee
A quadtree implementation
-
primitive_fixed_point_decimal
Primitive fixed-point decimal types
-
radixmap
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
-
tetengo_trie
A trie library implemented with a double array
-
dot2
generating Graphviz DOT language files for graphs
-
trane
An automated system for learning complex skills
-
scapegoat
Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.
-
pipebuf
Efficient byte-stream pipe buffer
-
bittle
Zero-cost bitsets over native Rust types
-
rust_flightweather
Decodes METAR and TAF
-
rust_multistack
Support for two-dimentional stacks for the Rust programming language
-
tuplez
Tuples represented in recursive form
-
svd-rs
A CMSIS-SVD base structures
-
atomicow
A
Cow-like data structure where owned data is stored inside anArc -
simple-triplestore
graph database for storing triples with support for custom node and edge properties
-
undo
An undo-redo library
-
keyvi
key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
minimizer-iter
Iterate over minimizers of a DNA sequence
-
tea-core
Core data structures and traits for tevec
-
boomerang_tinymap
A tiny, fast, and simple Slotkey-type map implementation for Boomerang
-
data_reader
A data loading library for data scientist
-
field_access
Dynamically access struct fields
-
gix-diff
Calculate differences between various git objects
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
stack-queue
Heapless auto-batching queue
-
numeric-array
Wrapper around generic-array that adds efficient numeric trait implementations
-
i_shape
iShape is a compact and efficient library specifically designed for representing 2D data structures using IntPoint
-
ladata
& modular data model
-
rdf-types
Data-structures and traits definitions for RDF
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
stacked_errors
high level error propogation with programmed backtraces
-
ttgraph
Typed/Transactional Graph container
-
any-rope
A fast and robust arbitrary rope for Rust. Based on Ropey.
-
ordered
A wrapper for adding arbitrary partial/total order to a type
-
endpoints
A collection of data structures for the OpenAI-compatible endpoints
-
tailvec
Split Vec to mutable slice and TailVec, the TailVec can push or pop etc
-
defer-drop
Defer dropping large types to a background thread
-
cheap-clone
A trait which indicates that such type can be cloned cheaply
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
awint
Arbitrary width integers
-
stack-map
constant-size associative container for building higher-level data structures out of
-
gctree
cache-friendly, graph-like, arena-allocated datastructures
-
libreda-db
Layout and netlist datastructures for chip design
-
nary_tree
A vec-backed tree structure with tree-specific generational indexes
-
indexical
indexed collections
-
ocpp_rs
Protocol implementation for Open Charge Point Protocol (OCPP) in Rust
-
sigmars
sigmahq rule collections
-
cmsketch
A count min sketch implementation in Rust
-
rust-box
odd set of tools for Rust programming
-
lsph
Learned Spatial HashMap
-
supply-chain-trust-example-crate-000039
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
anchors
async incremental computations
-
scope-cell
temporary, scope-bound, and thread-safe mutation of data in Rust
-
adapton
programming abstractions for general-purpose incremental computations
-
compact-rc
Low-memory reference-counting pointers
-
fvm_ipld_kamt
Sharded IPLD Map implementation with level skipping
-
ethbloom
Ethereum bloom filter
-
mssmt
Merkle-Sum Sparse Merkle Tree (MS-SMT)
-
datafrost
Data format and acceleration structure management
-
phf_generator
PHF generation logic
-
odht
hash tables that can be mapped from disk into memory without the need for up-front decoding
-
exhaustive-map
An exhaustive map for types with finite inhabitants
-
atelier
a Computational Workshop for Market Microstructure Modeling, Synthetic Simulation and Historical Replay
-
raft-log
Raft log implementation
-
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
owning_ref
creating references that carry their owner with them
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
ndata
Thread-safe, self-owned JSON-like data with manual garbage collection
-
shortguid
Short URL-safe Base64 encoded UUIDs
-
rchess
A Chess Library Written In Rust
-
sharded
Safe, fast, and obvious concurrent collections
-
parametrized
Supply useful iterating methods for user-defined types which are parametrized by type parameters
-
strict
collections with strict bounds
-
heavykeeper
finding the top-k elements of a stream of data
-
hypergraph
data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices
-
trie-root
In-memory patricia trie operations
-
HArcMut
mutable arc
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
persian-rug
Framework for bringing together disparate objects with inconvenient relationships
-
crdt-lite
CRDT library for Rust
-
seoul
trait Isomorphism
-
flex-alloc
Data structures with extra flexible storage
-
balanced-tree-index
constant-time manipulation of a complete binary tree with a flat in-memory representation
-
statiki
Static friendly data structures
-
tcgeneric
Generic data types used internally by TinyChain
-
pstd
parts of Rust std library ( different implementations, features not yet stabilised etc )
-
mmdb
A std-collection-like database
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
bondrewd
Bit-Level field packing with proc_macros
-
populated
Collection types that are guaranteed to be populated (i.e. non-empty). Based on std::collections types.
-
index-ext
Index slices with arbitrary ints and as arrays
-
hello_egui
A collection of useful crates for egui
-
non_empty_continuous
Non-empty continuous collections
-
hextree
Location to value mapping
-
pi_slot
lock free Slotmap data structure
-
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
-
cistring
A string type that preserve case, but compares insensitiveley
-
packed-uints
Array of uints that scales from u4 to u32 to minimize wasted space while still being fast
-
netlist
generic netlist data structure for VLSI design
-
taskchain
A block-based, non-circular double-linked list implementation for Rust
-
prefix-sum-vec
Compressed storage for highly repeating elements, with
O(log n)lookups -
slabigator
A linked list that doesn't do dynamic memory allocations
-
simd_aligned
Safe and fast SIMD-aligned data structures with easy and transparent 'flat' access
-
stavec
Stack-allocated vector with static capacity
-
hightorrent
High-level torrent library which supports Bittorrent v1, v2 and hybrid torrents
-
enum_meta
Add metadata to Enum Variants
-
mem_btree
A Data Structure of BTree Implemented with Rust, support snapshot. not use any unsafe lib.
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
one-dto-mapper
One DTO mapper
-
farmfe_core
Core types and data structures for farm
-
type-map
typemap container with FxHashMap
-
scribe
Text editor toolkit
-
ndstruct
Structures for N-dimensions
-
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.
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
dia-i18n
-
im-pathtree
Immutable, path-addressable tree data structure
-
compact_strings
A more compact but limited representation of a list of strings or bytestrings
-
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.
-
lambda-runtime-types
Common structures for lambda architecture
-
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.
-
hifa-xml-schema
Structure generator from XSD source file
-
ptr-union
Pointer union types the size of a pointer by storing the tag in the alignment bits
-
csf
compressed static functions (maps) that use perfect hashing and value compression
-
sync-ptr
Sync & Send wrappers for raw pointer's
-
gchemol
Graph-based CHEMical Objects Library
-
kg-tree
Generic object tree with Opath query language, similar to XPath
-
re_string_interner
string interning library
-
timer_list
A list of timed events that will be triggered sequentially when the timer expires
-
vector
The package provides a vector database allowing for efficient search of nearest neighbors
-
stash
An amortized
O(1)table for cases where you don’t need to choose the keys and want something faster than a HashTable -
uid_store
Generate random uid strings containing letters, numbers, or base62 values
-
beat_saber_map
Read and write Beat Saber maps with Rust
-
tld
Top Level domain static hash map, tld list is obtained from of iana.org
-
fuid
A UUID-compatible identifier in a friendly base-62 format
-
code_generator
A code generator (Currently only targets C)
-
bitstring
traits and implementations
-
ninjabook
A lightweight and high performance orderbook
-
enum2egui
derive macro that creates a set of egui ui databindings from arbitrary data structures. Supports egui v0.29.1
-
historian
a high performance zero-config histogram implementation
-
search_trail
manager of variables that can save and restore their values
-
orbweaver
designed for effortless construction and analysis of graph data structures
-
gridly
managing fixed-size 2D spaces
-
tri-mesh
A triangle mesh data structure including basic operations
-
rstmt-neo
focuses on building a music theory library that can be used to generate music theory data structures and algorithms
-
emap
A map with a fixed capacity and integers as keys
-
rtree_rs
R-tree for Rust
-
know
Framework for Rust
-
whirlybird
generic type implementations for RedMaple library, that offers workflows for different events compatible with common contents like todos, blogs and etc
-
itybity
An itty bitty crate providing bit iterators and bit iterator accessories
-
boa_interner
String interner for the Boa JavaScript engine
-
fixed-macro
Macros for creating fixed-point constants for types in the
fixedcrate -
smallbitset
series of allocation free sets capable of holding small integer values
-
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…
-
rotbl
Read Only Table
-
twovec
A data structure for storing 2 types of data in a packed, heap allocated array
-
graphplan
planning algorithm from Avrim L. Blum and Merrick L. Furst in Rust
-
standard_card
A Lightweight Library for Efficient Card Representation
-
blaze-common
Blaze common shared types
-
avl
A map and a set implemented with an AVL tree
-
grovedb-path
Path extension crate for GroveDB
-
reqray
Log ‘request x-rays’ for rust programs instrumented with
tracing -
pi_spatial
sparial octtree quadtree
-
threshold
data structures
-
roussillon-type-system
A type system for a programming language
-
smart_led_effects
A collection of effects for LED strips
-
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…
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
radicle-cob
Radicle Collaborative Objects library
-
minivec
A version of Vec that's only the size of a single pointer
-
rasn-smi
Data types for handling Structure for Management Information
-
chinese-rand
Random generation of data structures in Chinese, using Rust
-
microkelvin
tree traversal over annotated data structures
-
vortex-runend
Vortex run end encoded array
-
aliasable
Basic aliasable (non unique pointer) types
-
trybox
stable,
no_std-compatible, fallible heap allocation -
unionfind
A union find library made for building type inference engines. Can be used as general purpose datastructure.
-
orx-selfref-col
SelfRefColis a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees -
smodel
Symbol semantic modeling for Rust
-
i24
working with 24-bit integers
-
chemrust-core
The core modules defining the flow and structs of data in computational chemistry routines
-
interavl
An optimised interval tree for efficient interval stabbing
-
token-lists
token list representation
-
implies
A parser for logical formulas
-
ipld-dagpb
IPLD DAG-PB codec
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
permafrost
Write. Macros. Everywhere.
-
plane-2d
Continuous 2D data structure representing infinite 2d plane
-
linear_collections
Map and Set types backed by linear data structures
-
cfpyo3_rs_core
a collection of performant utilities
-
lox
Fast polygon mesh library with different data structures and traits to abstract over those
-
osmgraph
Convert OSM queries into graphs
-
host-port-pair
Host-port pair type
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
to_markdown_table
An easy way to format any data structure into a Markdown table
-
singletonThread
thread in a singleton
-
broomdog
A type-erased map with 'indefinite loanership'
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
byte_converter
converting bytes to various units (KB, MB, GB, etc.)
-
rbitset
A bit set, being able to hold a fixed amount of booleans in an array of integers
-
grit-data-prison
providing the struct Prison<T>, a Generational Arena that allows full interior mutability to each and every element
-
triangle_matrix
Triangle matrix indexing operations
-
cdll
A circular doubly linked list
-
task-group
manage groups of tokio tasks
-
variant-rs
VARIANT support for Rust. Clean, idiomatic handling of WinAPI/COM results.
-
awid
Small, simple, universally unique identifiers
-
td-shim-interface
TD-shim metadata data structures and related functions. UEFI Platform Initializaiton data structures and accessors
-
slack-blocks
Models + clientside validation for Slack's JSON Block Kit
-
digit-sequence
Sequence of u8 digits
-
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…
-
committable
Keccak256-based structured commitments
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
space
providing abstractions for spatial datastructures and search
-
value-ext
Serde Json Value Extension Trait (more Value type later)
-
oca-presentation
Lib providing struct for OCA presentation
-
no_std_collections
Auxiliary structures and traits for using dynamically resizable arrays (Vectors) in flexible environments, supporting both std and no_std contexts
-
libpna
PNA(Portable-Network-Archive) decoding and encoding library
-
orx-pseudo-default
PseudoDefault trait allows to create a cheap default instance of a type, which does not claim to be useful
-
gpt_disk_types
GPT (GUID Partition Table) disk data types no_std library
-
matreex
matrix implementation
-
quickselect
基于rust的选择算法
-
iterlist
Linked list with a cursor based api
-
neighborhood-diversity
computing the neighborhood diversity of simple, undirected graphs
-
rive-models
Revolt API models for the Rive ecosystem
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
messaging
two-way messaging crate
-
easy-tree
efficient tree structure library for Rust with recursive traversal
-
token-parser
parsing texts into data structures
-
nt-list
Compatible, type-safe, and idiomatic Rust implementations of Windows NT Linked Lists
-
ztimer
A block-based, non-circular double-linked list implementation for Rust
-
entity
that provides entity-like constructs
-
value_pool
implements a ValuePool struct that makes the creation of self-referential data structures easier and safer
-
opt_struct
Optional collections
-
ndim
N-dimensional array for numerals in Rust similar to NumPy
-
loro-rle
A internal library of loro for storing and manipulating run-length encoded data. Do not use it directly.
-
disjoint-sets
Three union-find implementations
-
splay-safe-rs
Splay implemented with safe rust
-
dotwalk
Traits to traverse structures and generate DOT graphs
-
delta-collections
Data structures with revertable operations called deltas
-
supply-chain-trust-example-crate-000019
A hash table with consistent order and fast iteration
-
python-packed-resources
Manage data structures containing Python resources
-
codas
Compact and streamable data format that works anywhere--from web apps to robots
-
phf_mut
Perfectly hashed mutable containers
-
uintx
Unaligned unsigned integers with exact size in memory and arithmetic operations for them
-
sentry-contrib-breakpad
Unopinionated crash collection for Sentry reporting purposes
-
kollect
Collections made ergonomic for gamedev usecases
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
egui-multiwin
that allows for multiple windows with egui
-
spatialize
collection of spatial data structures used for efficent spatial partitioning
-
ftree
A very fast fenwick tree implementation
-
div-int
Rational numbers with a compile-time denominator
-
entoli
A functional programming library inspired by haskell
-
lp-pack-scanner
scanner library
-
akita
Mini orm for rust
-
circbuf
A growable circular buffer for working with bytes
-
index_many
A proof of concept for indexing an slice at multiple locations at once
-
digits
Custom “numeric” incrementor without u64 MAX limit in size. Like a score flipper for a custom character set.
-
artie_common
Common Library for Artie Rust Projects
-
anymap2
A safe and convenient store for one value of each type
-
etwin_dinoparc_store
Dinoparc store implementation
-
validiter
Iterator adapters for validating iterations
-
loaned
Safely move values with live inner borrows
-
cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
trk-io
TrackVis (*.trk) reader and writer
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
zk-kit-smt
Sparse Merkle Tree
-
diffogus
calculate the difference between 2 instances of a type
-
tf-semver
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
clone_cell
A Cell that works with a restrictive form of Clone
-
datamorph-rs
Data transformation library using declarative specifications
-
hit-data
Hierarchical Indexed Typed data structure
-
rust-tls-duplex-stream
Full Duplex stream Wrapper around rust-tls
-
graff
manipulating graphs
-
confiner
A config language for things that look like trees
-
walker-extras
Additional functionality for SBOM and CSAF walker
-
mc-oblivious-ram
Implementations of Oblivious RAM data structures
-
iterable
collection like types
-
kv6
Collection of structs to allow reading of Ken Silverman's voxel formats
-
strumbra
Umbra-style strings (also known as German strings)
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
maelstrom-base
Fundamental data structures used by all Maelstrom code
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
yyid
Yyid generator (random tokens like UUIDv4, but using all the bits)
-
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… -
rustc_data_structures
Reuse rustc_data_structures for compiler_base
-
hashheap
data structures that combine a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
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
-
type-set
A set of heterogeneous types
-
grovedb-epoch-based-storage-flags
Epoch based storage flags for GroveDB
-
prepona
A graph crate with simplicity in mind
-
honeycomb-kernels
Meshing kernel implementations using combinatorial maps
-
forest-ds
secure tree structure
-
cfgmap
A special hashmap made with configuration in mind
-
cbsk_socket
socket callback tool
-
school_library
structures to manage school-related data, including students, classes, and schools
-
quadtree_simple
quadtree implementation
-
rs-bush
Bush data structure
-
debruijn
Tools for DNA sequences: efficient k-mer manipulation, De Bruijn graph construction and compaction and handling of DNA strings
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
hrtb-lending-iterator
A lending iterator trait based on higher-rank trait bounds (HRTBs)
-
fm-index
FM index and its variant implementations for Rust
-
grdf
Generalized RDF graphs and datasets
-
header-vec
Vector with user-specified header, length, capacity, and array elements all stored on the heap together
-
ordinal-map
Ordinal trait to map values to integers and efficient maps and sets for such types
-
iowrap
Small helpers for using io::Read/io::Write
-
codas-flow
Low-latency, high-throughput bounded queues ("data flows") for (a)synchronous and event-driven systems
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
spenso
A tensor (n-dim array) network, iterating, and contraction (using automatic abstract index matching) library
-
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
deinterleave
your datastructures
-
vortex-alp
Vortex ALP array
-
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 -
floating_bar
Representing rational numbers using the floating-bar number type
-
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
-
imbl-sized-chunks
Efficient sized chunk datatypes
-
typerat
Type-level rational numbers based on
typenum -
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
competitive-programming-rs
Competitive Programming Library in Rust
-
dst-container
Containers for DST objects
-
sequential_gen
sequential generator
-
gw_signal
Package with signal processing tools for graviational waves studies
-
mini-rx
bare-bones "reactive programming" (change propogation) using a central data dependency graph
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
arraystring
Fixed capacity stack based generic string
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
flat-tree
Series of functions to map a binary tree to a list
-
latestmap
latest map
-
expiremap
Key-Value map where each value has a custom expiry time
-
slablit
Literal for slab creation
-
rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 9a27044f42ace9eb652781b53f598e25d4e7e918 The publishing script for this crate lives at: https://github… -
fid
FID (Fully Indexable Dictionary) implementation for Rust
-
arr-rs
arrays library
-
color-operators
Color data structures, converters, and arithmetic operators
-
ux-dx
3D Graphics Primitives for Angular Rust
-
comparer
track changes in a HashMap over several iterations
-
magnetise
asses the similarity between SQL queries
-
colibri
Rust data structures for Jitsi Meet Colibri messages
-
mini_uuid
A small and URL-safe UUID crate for Rust
-
iter-tree
Convert between iterators and tree structures in both directions
-
exact-covers
Knuth's algorithm for solving the exact cover problem with colors
-
ibuilder
Interactive builder for Rust types
-
rive
ecosystem crate
-
hashstash
It's like git but for your Rust data structures
-
libwebnovel-storage
A complement to libwebnovel: this package handles downloading and organizing collections of followed webnovels
-
tord
Data structure to store transitive relations
-
cube-rotations
Models the rotations that can happen on a cube without changing the set of planes to which its faces are parallel
-
ascent-byods-rels
data structures for Ascent relations, made possible by Ascent's BYODS feature
-
sti
STd Improved
-
gen_value
indexes and values with generations for vectors
-
structures
collection data structures
-
cbsk_mut_data
ref mut tool
-
pinocchio-token
Pinocchio helpers to invoke Token program instructions
-
radix-heap
Fast monotone priority queues
-
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…
-
commitlog
Sequential, disk-backed commit log library
-
lace_stats
Contains component model and hyperprior specifications
-
automerge-test
testing automerge libraries
-
cmus-status
structure cmus status data
-
small_iter
A 3-pointer iterator that moves out of a
Vec<T>orBox<[T]> -
zetacore
in-memory vector store library with Python bindings
-
std-ext
Extend the standard library functionality
-
super-struct
structofRustin the same way thatdictofPython -
sliding_tree
A tree that grows from the leaves and recedes from the root
-
expiringdict
A dict / HashMap whose items expire over time
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
dcl_data_structures
Data structures for for deep_causality crate
-
influxdb-dispatcher
Batch metrics collection using influxdb
-
eventio
A collection of event I/O processors for event-processing applications
-
kdtree-simd
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
-
pi_densevec
重定向映射表，一个使用usize作为key的映射表
-
av-codec
Multimedia format decoding and encoding
-
pimalaya-tui
Collection of crossterm widgets shared accross Pimalaya terminal-based projects
-
regroup
regrouping arrays
-
xot
Full-featured XML tree library for Rust
-
portdiff
Data structure for fast local graph rewriting
-
mantra-rust-trace
Collects requirement traces from rust code for the
mantraframework -
ux-dataflow
Data Processing Library
-
coalesced_intervals
Data structure for maintaining maximally-coalesced 1D intervals
-
bittyset
A BitSet type for manipulating bit sets
-
incremental-topo
Data structure to maintain an incremental topological ordering over a collection of values
-
crater
Very generic containers including KD trees, fibonacci heaps, minmax heaps,
-
oxidd-cache
Apply cache for OxiDD
-
exegraph
no_std execution graph library
-
xorfilter-rs
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
-
leetcode-trees-rs
Tree Node LeetCode problems
-
uniquevec
A
Vec-like datastructure which only contains unique entries. It is no_std and has optional serde support. -
coca
Data structures with constant capacity
-
idbag
A bag of integers
-
zhifeng_impl_barnes_hut_tree
implements Barns-Hut Tree for accelerated N-body force calculation
-
mphf_benchmark
The program for benchmarking Minimal Perfect Hash Functions
-
vec-collections
Rust collections that are newtype wrappers around smallvec
-
flo_rope
An attributed and streaming implementation of the rope data structure
-
text-style
Types and conversions for styled text
-
meminterval
interval-tree in Rust made to store memory mappings
-
canadensis_dsdl_frontend
Compiler front-end for the Cyphal Data Structure Description Language
-
enso-data
A collection of useful data structures
-
safer_owning_ref
creating references that carry their owner with them
-
fdec
A collection of macros for generating fixed-size fixed-point numeric types for Rust
-
rtdlib
TDLib for rust
-
parallel_vec
A generic contiguous collection of heterogenous values
-
orn
A general implementation of the sum type. Meant to be a generic counterpart to tuples.
-
chesspos
Basic structs for representing chess squares
-
serde_ipld_dagjson
IPLD DAG-JSON support for Serde
-
typeslice
type-level slices
-
safe_index
Type-safe indexes
-
supertrees
Supervision trees for Tokio-based services inspired by Erlang/OTP
-
ndarray-ndimage
Multidimensional image processing for ArrayBase, the n-dimensional array data structure provided by ndarray
-
sif-itree
immutable, flat interval tree
-
raphy
A graph data structure library
-
cmdtree
(Rust) commands tree
-
dayendar
advanced days calendar operations
-
fenwick
tree: data structure that efficiently calculates prefix sums in a changing array of numbers
-
bigraph
Different representations with implemented operations on bigraphs
-
sql-json-path
SQL/JSON Path implementation in Rust
-
medianheap
A median heap for keeping track of a running median
-
msg-store
A fast and light-weight message store designed to work as a priority queue in low hardware equiped devices
-
smolvec
A lightweight vector implementation with small-vector optimization for rust
-
swaybar-types
building swaybar status commands in rust
-
data_model
[highly unstable] data model for virtualization
-
supply-chain-trust-example-crate-000058
Generic types implementing functionality of arrays
-
signvec
Vector implementation for fast, sign-based manipulation of dynamic collections
-
vss-rs
Voxel storage system for rust ported from cpp
-
value-log
Value log implementation for key-value separated LSM storage
-
structured
Data structures to handle large, structured data
-
loaded_dice
sampler for loaded dices, implementing the alias method
-
shiftnanigans
contains different iteration data structures for either iterating or for shifting iteratively forward and backward
-
sum
General-purpose sum types
-
non-random-state
Deterministic HashMap and HashSets
-
vlcb-defs
VLCB protocol core library containing important value definitions and data structures
-
uuidv7
UUIDv7 implementation
-
queues
Efficient FIFO Queue data structures
-
dipa
dipa makes it easy to efficiently delta encode large Rust data structures
-
crio
An easy to use persistent data storage library
-
jsonmap
store values of multiple types value in one Map
-
mset
/ multiset / bag implementation
-
cow_vec_item
Copy-on-write Vec, available on stable rust
-
higher
Functors, Applicatives, Monads and other bad ideas
-
rust_twostack
Support for two-dimentional stacks for the Rust programming language
-
vec-string
To print Vec<Display>
-
supply-chain-trust-example-crate-000048
Types and traits for working with bytes
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
mih-rs
Multi-index hashing (MIH) for neighbor searches on binary codes in the Hamming space
-
zond
standard rust collections but with collecting statistics
-
smallvec-wrapper
Macro and common structs to play with
smallvec -
progress-streams
Progress callbacks for types which implement Read/Write
-
variant-set
A set-like data structure for enum variants, allowing you to store at most one value for each variant of an enum
-
golomb-coded-set
BIP158 Golomb-Coded Set data structure
-
tangu-lints
A collection of lints for the Tangu language
-
libkv
building data structures atop key-value stores
-
lru-mem
An LRU cache implementation bounded by memory
-
bitstring-trees
Trees based on bitstrings
-
generic-btree
Generic BTree for versatile purposes
-
rexsgdata
Scatter-Gather Data Descriptors
-
graphlib_rust
Dagre's Graphlib implementation in Rust
-
i_tree
Red-black tree implementation for rust. Only for uniq elements
-
sbbf-rs
Split block bloom filter implementation
-
defaultmap
HashMap with an automatic default for missing keys
-
range_bounds_map
[
RangeBoundsMap] and [RangeBoundsSet], Data Structures for storing non-overlapping intervals based of [BTreeMap] -
genmap
generational map data structure with no dependencies
-
flat_collections
Lightweight and memory-efficient associative data structures
-
spring-sms
基于spring-rs 0.2.1 版，简单实现了短信发送功能，未来将完善，目前只支持阿里云短信发送
-
lodtree
help create octrees and quadtrees for chunked level of detail
-
wasmrs-frames
WasmRS RSocket frame decoding, encoding, and data structures
-
tensorism
Multidimensional arrays with bounds included in the type system
-
xbinser
binary structure transporation
-
code_location
UNMAINTAINED! Use std::panic::Location instead!
-
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
-
ssd-data
A service and data description format + a code generator based on rhai scripts and templates
-
im-lists
Persistent unrolled linked lists and vlists
-
modular-bitfield-msb
Allows to easily define bitfield types with modular building blocks. MSB-first version.
-
nsrb
Nifty Simple Ring Buffer (aka circular buffer) is a no_std library that provides 2 macros to easily create fixed circular buffer on the stack
-
rt_map
Runtime managed mutable borrowing from a map
-
rust_examples
rust 的学习中的一些例子
-
slotgraph
Graph implementation built with slotmap and petgraph
-
nimbusqueue
fifo collection
-
malwaredb-api
Common API endpoints and data types for MalwareDB components
-
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
incrstruct
Build self-referencing structs using two-phase initialization
-
graph_process_manager_core
explore parts of a tree-like or graph-like structure that is not known in advance
-
fallback
A helper library to implement fallback mechaism
-
msgpack_simple
Simplified, easy to use, pure Rust MessagePack implementation focused on handling dynamic data structures
-
url-hash
types that provide secure and stable hash values for Urls
-
grovedb-version
Versioning library for Platform
-
point-nd
flexible no-std struct to model points on axes of any dimensions
-
cbsk_base
locked version cargo crates
-
rj
reactive json
-
vecdeque-stableix
Deque with stable index values
-
deepmesa
fast Data Structures and Algorithms in Rust. Every data structure is hand crafted for performance, well tested and has an extensive API.
-
rt-lists
Link lib
-
histogram-sampler
Sampling from a distribution given by a histogram
-
filey
A collection of utilities to make file operations more convenient
-
itc
Interval Tree Clocks as described in the itc2008 paper
-
mist-lib
Juniper Mist Schema Definitions
-
pin_array
Tiny crate providing an array with structurally projected pinning
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
ord-collections
offering collections which are pre-sorted automatically
-
orchestrator
Orchestration sequences
-
tuple_list
macro-free variadic tuple metaprogramming
-
open-coroutine-timer
The time utils
-
dartlib
Disk backed concurrent Adaptive Radix Tree implementation, with optional generations
-
onebuck
An efficient unordered dynamically-sized data structure
-
type-rules
easily constrain a struct
-
vec-x
structure
VecXto manage fixed-length arrays, supporting numeric operations and assignment operations betweenVecXand scalar values -
hashrevise
hashing data structures and then caching results and avoiding work
-
diamond-types
The world's fastest text CRDT
-
siraph
A node-based digital signal processing crate
-
gecs
A generated entity component system
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16coordinates. -
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.
-
touch-selection
Selection data structure intended for touch and single button devices
-
arc-bytes
A reference-counted byte buffer
-
pax-properties-coproduct
Static container for program-variable data structures and polymorphic components
-
ast2str
pretty-printing ASTs and other recursive data structures
-
ldtk_map
reading ldtk maps for usage in games
-
rc-writer
A tiny implement for writing data to a reference counted instance
-
smart_access
A minimalistic "lazy bidirectional pointer" framework
-
big_unsigned_ints
Big Unsigned Integers ranging from U256 to U2048 using u64 arrays all under a fixed-size of 32
-
nslice
Structures for interpreting slices of variable length as arrays
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
heapless_topo
no-std topological sort using
heapless -
tryingarraylist
arraylist implementation
-
rep
A small tool for representation/class invariants
-
gix-hashtable
that provides hashtable based data structures optimized to utilize ObjectId keys
-
steiner-tree
Fast construction of rectilinear steiner minimal trees (RSMT) in two dimensions
-
amalgamator
A set/map like data structure that allows you to combine members together
-
alt-std
Alternative Lightweight Std library for making small executables and shared objects
-
prefix_array
A generic container for searching on prefixes of keys
-
caffeine
Collection of data structures I'm writing for fun. Originally written for use with my crafting interpeters tutorial implementation.
-
ioc
An Inversion-of-Control library in Rust
-
ttmap
Trivial implementation of type map
-
collect-rs
Special and custom Collections and Containers (for Rust)
-
dusa_collection_utils
A common library with standardized functions that the ais_platform, dusa, recs and others will depend on
-
find-all-the-kitty-cats-in-charlotte
A collection of crates for working with cats
-
nybbles
Efficient nibble-sized (4-bit) byte sequence data structure
-
alignment-exporter
Proc macro providing alignment info for a user-defined struct
-
plexus
2D and 3D mesh processing
-
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
bitlab
Extracting a range of bits from a binary data source
-
phylo
An extensible Phylogenetics library written in rust
-
try-lazy-init
Fallible lazy initialization
-
yuuka
A helper library to generate complex and nested structures by a simple macro
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
euui
An Extended Universal Unique Identifier
-
syzlang-parser
Parse Syzlang language
-
groupex
Syncronization primitive that allows acquire lock by index
-
byteview
Thin, immutable zero-copy slice type
-
mco-gen
Stackfull Generator Library in Rust
-
suff_collections
Fast realization of suffix array and suffix tree
-
intervaltree
generic implementation of an immutable interval tree
-
minsize
Collections with a statically known minimum size (using const generics)
-
erased_set
A set of erased types
-
bucket_vec
A vector-like data structure that guarantees to never move its contained elements
-
samplify-rs
A procedural macro to generate sample data for Rust structs
-
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
bdaddr
Bluetooth Device Address
-
kvv-efa-api
Rust bindings for the KVV (Karlsruher Verkehrs Verbund) "EFA"-API
-
u64_array_bigints
biginteger library based on u64 arrays
-
sortedvec
a sorted vector that enables quick lookups
-
disk-ringbuffer
lock free on disk ringbuffer to be used in the implementation of Franz
-
index-from-end
Allow indexing arrays and Vecs from the end using expressions like array[Len-1]
-
dmfr-dataset-reader
Reads transitland folder and outputs graph of valid feeds and operators
-
tinybox
Like
Box, but with an optimization that avoids allocations for small data-structures -
rooting-forms
Generates HTML (rooting) forms from structures
-
mut-rc
Temporarily mutable
Rc<T>that decays intoRc<T> -
rmat
minimal implementation of two-dimensional matrix algebra
-
magiclist
List with O(log n) random access, insertion, splitting, and merging
-
structo
Data structures made in Rust
-
total-maps
Maps where every possible key has an associated value
-
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…
-
logisheets_controller
the core of LogiSheets
-
text-document
Text document structure and management
-
lurk-elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
hydroperfox-smodel
Semantic modeling for Rust
-
streaming_algorithms
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
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 -
data_nostd
Structures and data types definitions for dinvoke_nostd
-
galemu
workaround for generic associated types (GAT) limited to lifetimes (GAL)
-
rust-3d
2D/3D library written in rust
-
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
contack
easy contact library
-
crdt_tree
Tree Conflict-free Replicated Data Type (CRDT)
-
retworkx
A python graph library implemented in Rust
-
sparse-merkle-tree
Sparse merkle tree implement in rust
-
xsparseset
sparse set
-
varlen
Ergonomic variable-length types
-
graphia
graph data structure
-
rotated-array-set
An ordered set supporting O(1) rank and O(√n) inserts and deletes
-
aversion
Versioned data structures with auto-upgrading
-
ordered_hash_map
HashMap which preserves insertion order
-
either_of
working with enumerated types that contain one of 2..n other types
-
binary-tree-view
A binary tree visualization application built in Rust
-
voxtree
A sparse voxel octree for rust & rust-gpu
-
sbom-walker
work with SBOM data
-
baz-tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
pulz-arena
A generational arena allocator with compact generational indices
-
anyid
ambiguous identifier
-
vec-btree-map
Basically just a sorted Vec that can be used as a HashMap
-
write_x86_64
help you write x86_64 assembly code
-
compt
A complete binary tree visitor library
-
bit-vec-omnitool
A vector of bits
-
gw2timers
Iterate and collect Guild Wars 2 map meta event times
-
rosary
About Rose Trees
-
undo_2
Undo and redo done the right-way
-
resizing-vec
An automatic resizing vector for data with linear increasing ids
-
bgp-models
Structs and other building blocks for BGP and MRT related Rust projects
-
grids
2D grid data structure for games
-
morton-index
Types and functions for efficiently and easily work with Morton indices
-
rblist
A block-based, non-circular double-linked list implementation for Rust
-
sorbus
A tree manipulation library
-
isx
Traits for checking certain conditions of values
-
frunk-enum-core
Implemenation of genericized enums for use with frunk
-
netcrab
creating and exporting Petri nets
-
merkle-root
calculating the Merkle root of either a file, or walked directory
-
tinyvecdeq
VecDeque-like data structures -
staticvec
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics
-
tinybitset
Generic implementation of small, fixed size, copyable bitsets
-
seq-map
Sequential Map
-
redmaple
offers an oppinionated yet extremely flexible data modeling system based on events for backend applications
-
pi_sinfo
used to describe the 'structure', that is, the meta information of the structure
-
pna
PNA(Portable-Network-Archive) decoding and encoding library
-
periodic-rs
Bounded datastructures
-
boolvec
A vector of boolean stored contiguously in memory
-
literally
Macro literals for members of std::collections
-
spaceindex
-
ord-uuid
Creates lexically sortable uuid values of size 16 bytes
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
grid-tree
Pixel quadtrees and voxel octrees
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
y-sync
Yrs synchronization protocol
-
overtone
An API for creation and management of rich (as in rich-text) musical-ish projects
-
hj_ds
A data structure library for Rust
-
omango-util
Utililites
-
precedence-net
Create and analyse precedence networks
-
evento-store
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
eastl-rs
EASTL binary-compatible Rust implementations
-
scoped_stack
A scoped stack data structure
-
inplace-vec-builder
Build a vec from a vec, in place
-
sparse_set_container
A container based on sparse set. Stable keys, O(1) lookup, cache-friendly iterations, and no hashing.
-
pi_dirty
Record hierarchy dirty
-
moka-cht
Lock-free resizeable concurrent hash table
-
piece_table_rs
piece table data structure
-
median-heap
A median heap implementation in Rust, used to keep track of a running median of a sequence of numbers
-
extensions-rs
File extension types in Rust
-
ergo_avltree_rust
cryptographically authenticated dictionary based on AVL tree
-
union-fn
Proc. macro for creating efficient "inline closures".
-
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.
-
darts-clone-rs
Rust binding of a clone of Darts (Double-ARray Trie System)
-
compare
Experimental comparators for collections to be generic over
-
arc-string-interner
An efficient cuncurrent string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
holyhashmap
A hash map with stable indices
-
fixed_deque
A fixed size VecDeque to match Python Deque
-
flange-flat-tree
A tree that can be expanded by attaching new values to the node without mutability of the old ones
-
word-dictionary
data structure for word mapping. It can be used for language translation.
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
nimble-steps
Nimble Steps Collections
-
art-tree
The Adaptive Radix Tree
-
hashable-map
Wrappers for HashMap and HashSet that implement Hash
-
ofilter
fast thread-safe Bloom filter
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
pas
strided slice
-
cseq
compact sequences
-
optempty
Tools for working types that may be empty. E.g., an empty
String,Vec,HashMap, etc. -
multi_containers
Ergonomically work with multiple values per key
-
slice-rbtree
A slice-based Red-black tree
-
bmap
A bitmap with an internal counter
-
purse
Bag data structure implementation in Rust
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
expiringmap
a HashMap-backed TTL map
-
tracing-rc
Cycle-aware reference-counted pointers with a safe, simple api
-
bitvek
bit vector implementation
-
veho
a iterable toolset
-
luka
working with graphs
-
merkle
tree implementation with support for generation of inclusion proofs
-
quickscope
Multi-layer HashMap and HashSet implementations for performant representation of variable scopes
-
serde_either
set to enums to deserialize and serialize data that can either be string, struct or vec
-
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
-
fn-map
Abstraction around HashMap. Uses closure to compute and store value.
-
pac_cell
Parent and child cell
-
symbolic-sets
Sets that are stored symbolically
-
tpntree
A N-dimensional generalization of region quad/oc-trees
-
queued_rust
queue type for better privacy managment and data orginization
-
stdng
An enhancement for Rust standard library
-
validbr
data structure and validation for Brazilian Registries, such as CPF, CNPJ and CNH (currently only CPF and CNPJ is supported)
-
twitter/rustcommon-time
getting current and recent timestamps
-
prefix_dictionary
Data structure similar to a dictionary, but enabling search for prefixes
-
supply-chain-trust-example-crate-000085
tinyvecprovides 100% safe vec-like data structures -
bit-parallelism
Small integer specialized, word level, parallel algorithms and data structures
-
esl01-indexedlog
Append-only on-disk storage with integrity checks and indexing support
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
sbwt
Indexing sets of DNA k-mers with the spectral Burrow-Wheeler transform
-
arbitrary-chunks
An iterator that allows specifying an input array of arbitrary chunk-sizes with which to split a vector or array
-
b-tree
A persistent B+ tree using freqfs
-
croaring-sys
Raw bindings to CRoaring
-
sorted_vector_map
maps and sets backed by sorted vectors
-
moving_min_max
Tracking minimum or maximum of sliding windows
-
vec-entries
Entry API for iterating over and removing elements from a
Vec -
udgraph
Universal dependency graphs
-
lru-slab
Pre-allocated storage with constant-time LRU tracking
-
hashable_weak
A hashable weak pointer
-
billios
A soil library
-
light-curve-interpol
Interpolations tools for time series
-
graphlib
powerful rust library for the graph data-structure
-
hdf5-hl
High level bindings to HDF5 High Level API
-
raw-btree
Generic B-Tree implementation
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
bitval
For packing booleans in variables using bitwise operations
-
v9
A slim data engine for Data Oriented Design
-
rstmt
focuses on building a music theory library that can be used to generate music theory data structures and algorithms
-
vicardi
JSON VCardArray Generator that uses Serde
-
mazer-data-structures
A minimal, simple math markup language that compiles to HTML, written in Rust
-
fixed_bitmaps
A small crate implementing bitmap functionality around primitive Rust unsigned integers
-
hst-tw-images
working with Twitter profile images
-
froop
A functional reactive stream library for rust
-
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
oop
Object-Oriented Inheritence in Rust
-
segment-tree
Quickly perform interval queries or modifications
-
bayesic
A string matching library similar to NaiveBayes but optimized for many small classifications
-
memvec
Memory-backed vector, not buffer. Designed for for mmap. Not MemMap, but MemVec!
-
append-only
Append only versions of std data structures
-
nanotweaks-proc
moved to https://crates.io/crates/spread_macros
-
collect-me
Additional collections not included in the Rust standard library
-
btree_experiment
implements a BTreeMap similar to std::collections::BTreeMap
-
mikel_binary_tree
search binary tree implementation
-
pi_append_vec
Only supports append vectors, lock free
-
membuffer
A very fast flat memory buffer used to deserialize at a fast speed
-
brownstone
building fixed-size arrays
-
timer-queue
Pure, minimal, and scalable timers
-
python-objects
that implements the architecture of the CPython objects. with this crate you can crate a list with any data type from rust
-
serde_single_or_vec
Type which can be deserialized from either a sequence or a single value
-
range-mutex
A
Mutex<[T]>-like type, that allows locking different ranges separately -
atlv
Algebraic Tag Length Value encoding
-
wccg-models
WCCG Data
-
subranges
manage non-interssecting integer intervals
-
data_tree
Hierarchical data tree with pathing and search support
-
fe_data
Data structures for FE
-
relational_types
Manage relations between objects
-
giftbox
A fun Rust crate called
giftboxto help Rustlings learn and explore generics -
rustz
functional programming in Rust
-
stealth-lib
functions for ZKP
-
omnitool
A curated respository of algorithms and data structures. The libraries are included as forks of Rust codebases
-
filetrack
persistent logrotated reading and other useful io things
-
ref_kind
Different reference kinds
-
rutenspitz
А procedural macro to be used for testing/fuzzing stateful models against a semantically equivalent but obviously correct implementation
-
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
-
beehive
collections for 3D hexagonal maps
-
bit-array-rs
Bit Array
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
aleo-agent
Agent library to communicate with the Aleo Blockchain, following the Public Specification
-
incremental-map
combinators for incremental immutable maps (see crate
incremental) -
succinct
data structures for Rust
-
rs-car
CAR v1 and v2 specifications
-
valord-map
A dictionary sorted by values
-
multiset
Multisets/bags
-
intervals-rs
intervals
-
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
kushi
A queue built for the Dango Music Player and Oden Music Bot
-
dependency-graph
building and resolving dependency graphs
-
make-message-bus
Generate a pub-sub bus for use in async applications
-
identified_vec
Like HashSet but retaining INSERTION order and without
Hashrequirement on the Element type -
arctree
A 'DOM-like' tree implemented using atomic reference counting
-
bytesstr
An immutable reference-counted UTF8 String
-
chainmap
mutability of intermediate maps
-
qualia
Basic semi-schemaless document store
-
merkle-cbt-lean
Special implementation of Complete Merkle Binary Tree for minimal memory footprint
-
lignin
A virtual DOM structure, primarily for web use
-
bitset-core
Straightforward, no-std compatible, simd optimized, BitSet API
-
pgdb_to_struct
CLI application to generate Rust struct files from PostgreSQL database tables
-
unsized-vec
Like Vec, but for unsized values
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
nakadi-types
A connector for the Nakadi Event Broker
-
identifier
Generate 128 bits id structs easily
-
tiled-json-rs
parse and interact with Tiled editor JSON files
-
double-map
A HashMap with double key to single data/value
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
ndshape
fast linearization of N-dimensional array indices
-
limq
Queue with optional maximum number of elements constraint
-
structdb
Persistent data structures using RocksDB
-
cbsk_log
log tool
-
teardown_tree
A binary search tree that supports fast clone and delete-range operations
-
awint_ext
Externally allocating
awintfunctionality -
dectree-rs
A decision tree implementation in Rust
-
lim-bit-vec
Limited bit vectors
-
index-map
A map with automatically generated usizes as keys
-
oxidd-test-utils
Test utilities for OxiDD
-
chainbuf
Fast chained buffers
-
tinymap
A map structure that stores its data on the stack
-
constructivism
Simplify the construction of structured data
-
wplot
Plot interface
-
generational-indextree
Arena based tree structure by using indices instead of reference counted pointers
-
thot-core
Core functionality and types for Thot data management and analysis software
-
yagraphc
working with Graph data structures and common algorithms on top of it
-
nanovec
Arrays and Vec-likes of small integers packed in an integer or two
-
recursive_reference
way to walk on recursive structures easily and safely
-
cervine
A slightly more flexible Cow; roughly to T: Borrow<R> as alloc::borrow::Cow is to B: ToOwned
-
sesstype
Multiparty Session Types
-
chronoflake
Generate unique IDs based on the Snowflake algorithm
-
sidex
A format- and language-agnostic data structure and API definition language
-
pl-lens
support for lenses, which are a mechanism in functional programming for focusing on a part of a complex data structure
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
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.
-
rdc
generating Java code from rust structs
-
datazoo
Bitset and jagged array data structures
-
array_map
Map backed array for fixed size keys with O(1) performance
-
pointcloud
An accessor layer for goko
-
cvrdt-exposition
Understanding Convergent Replicated Data Types
-
froggy
prototype for the Component Graph System programming model. It aims to combine the convenience of composition-style Object-Oriented Programming with the performance close to Entity-Component Systems
-
cast-rs
A collection of types cast for Rust
-
vortex-bytebool
Vortex byte-boolean array
-
cubic-bezier
Create and modify cubic bezier curves
-
mipmap-1d
A small data structure to perform 1d-mipmapping (downsampling)
-
dsa_sport
revision material for undergrads
-
prototty_common
Definition of common ui elements and views for use with prototty
-
screech
A collection of helpers for handling audio data in real time
-
anylist
a list type for any type
-
qualomat_schema
Rust bindings for the *Qual-O-Mat* open data format for the german voting advice tool *Wahl-O-Mat*
-
large_int
An ease-of-use unbounded signed integer
-
persist-o-vec
A Vec type that aims to have stable indices and memory location
-
dakv_skiplist
skiplist for dakv
-
listfree
lockfree prepend-only list
-
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 -
statemachine-rs
A statemachine crate which have zero dependencies
-
range-map
Maps and sets implemented using ranges
-
clap_flags
Collection of reusable flags for Clap
-
bit-set-omnitool
A set of bits
-
extended-rational
implementations of high-accuracy projectively-extended rational numbers and macros for creating them
-
poppy-filters
providing serializable Bloom filters implementations
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
numas
multidimensional array for efficient computing
-
cpclib-tokens
cpclib libraries related to assembly tokens. Only structures are provided there. Intelligence is within cpclib-asm
-
luthor
A collection of lexers for various languages/formats, and the tools required to build them
-
chain-map
A chain of maps with a single view into the aggregated values
-
gpt_disk_io
GPT (GUID Partition Table) disk IO no_std library
-
tilecoding
Dr. Richard S. Sutton's tile coding software.
-
array-const-fn-init
Initializes an array with constant values calculated by a
const fn -
st2-logformat
Adapter-agnostic definitions for data types used by ST2
-
rs-tree-sitter-languages
Collection of Tree-Sitter parsers
-
quickphf_codegen
Code generator for creating static maps and sets for use with quickphf
-
graphster
High-performance DataGraph Library
-
seq_watcher
A pair of structures for monitoring a stream of data for one or more sequences
-
comprende
Python-style collection comprehensions in Rust
-
array2ds
Package for handling sized 2d arrays in rust, without the usage of the keyword unsafe cuz why not
-
traitgraph
Abstracting over different graph representations
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
minimizer-queue
Fast computation of minimizers using a monotone queue
-
lumberjack
Read and modify constituency trees
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
vmcircbuf
A circular buffer that magically wraps around without any copying
-
markov-generator
Highly customizable crate for building Markov chains and generating data from them
-
pq-tree
consecutive ones property (C1P) and graph planarity testing
-
acme-types
Types for implementing ACME (RFC 8555) providers and clients
-
settrie
Fast subset and superset queries
-
pvec
RRB-Tree based persistent vector implementation
-
generic_event_queue
generic event-queue API
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
mc-oblivious-map
Oblivious Hash Map data structures on top of Oblivious RAM
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
trying
Basic trie crate
-
pciids
parse the pci.ids data file
-
slas
Static Linear Algebra System
-
modupipe
A modular and extensible ETL-like pipeline builder
-
cbsk_timer
rayon thread runtime
-
supply-chain-trust-example-crate-000029
'Small vector' optimization: store up to a small number of items on the stack
-
monitor-common
Basic data structure and algorithm of linux-monitor tool
-
mine_sweeperr
Minimalist interface to manage the backed of a mine sweeper game
-
helgoboss-midi
Interfaces, data structures and utilities for dealing with MIDI messages according to the MIDI 1.0 specification
-
rahashmap
Fork of standard library HashMap with additional functionality
-
shogiutil
A collection of tools to handle shogi data
-
pages
A dynamically-sized heap-backed data page. Comprises a user-chosen header and data array packed into a single allocation.
-
ndcopy
Fast N-dimensional array memcpy
-
hedge
An index based half-edge mesh implementation
-
lxc
Linux Containers API
-
multipath
split file path, like
/home/{user,admin}/file.txt -
landfill
Various types for dealing with on-disk data
-
skog
Adobe's stlab::forest data structure
-
sparsevec
Compress vectors using row displacement
-
dade
data definition for Rust structures
-
win-variant
that aims to provide a more ergonomic way of working with variants in winapi based projects
-
reactive-signals
dx-first scope-based fine-grained reactive system
-
sweeper
A foundation for Minesweeper implementations in Rust
-
ware
middleware chains
-
nvpair-rs
Safe and rustic wrapper around nvpair
-
object-collection
A collection that can store multiple values of types
-
finite-automata
A collection of extendable finite automata with immutable state and transition data
-
actions
Software without side-effects. Redo and Undo. Macro's.
-
bitstr
contiguous sequence of bits in memory
-
transit_model_relations
Modeling the relations between objects
-
optimistic_lock_coupling
A General Lock following paper 'Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method'
-
vec-option
A space optimized version of
Vec<Option<T>>that stores the discriminant seperately -
tree_collections
A collection for tree data structures. It provides APIs that allows users to create memory efficient binary search trees, red-black trees and avl trees.
-
id_collections
Index-oriented programming in Rust
-
type-freak
Collection of typed data structures, trait operators and aliases
-
retaker
ecs implementation
-
sequence_trie
Trie-like data-structure for storing sequences of values
-
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
-
canadensis_bit_length_set
A bit length set type used to calculate data type sizes when processing Cyphal data structure description language files
-
reunion
A generic implementation of the Union-Find w/ Rank data structure
-
sliding_window_alt
A structure that holds the last N items pushed to it
-
insrcdata
Embed static data as source code
-
mofurun
Multi variant Optimized Fun U....okay Mofu is just a cute name okay. Experimental implementation of Vec that stores the state of the underlying array through its enum.
-
learn_together
Curated collection of lists of useful resources to learn Rust together
-
transient_map
Hashmap with eviction of unused elements
-
rimu-value
A data structure template system
-
bookfile
A container file format with chapters and an index
-
thin-string
A String with a smaller stack footprint
-
circular-queue
A circular buffer-like queue
-
crfsuite-sys
Rust binding to crfsuite
-
proptest-recurse
Helper for defining mutually recursive strategies with proptest
-
mivim
-
kubizone-common
Typed Rust structures for representing partially and fully qualified domain names
-
liblet
learning about formal languages and grammars
-
mergle
A data structure with fast merging and comparison
-
driftdb
A real-time data backend for browser-based applications (core library)
-
tag-vec
A vector used for storing tags
-
viral32111-xml
XML parser crate for my Rust projects
-
folketinget-api-models
Autogenerated Rust structures based on the Danish Parliament's OData metadatafile
-
indextree-ng
Arena based tree structure by using indices instead of reference counted pointers. Fork of indextree by Sascha Grunert which allows to remove nodes
-
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…
-
strawberry_fields
Consume, read, and mutate struct fields with an iterator-like api
-
bin-tree
Building Binary Tree
-
list_tools
一个自己研发的Vec<T>
-
nested_containment_list
A data structure for efficiently storing and querying nested intervals
-
supply-chain-trust-example-crate-000044
The enum
Eitherwith variantsLeftandRightis a general purpose sum type with two cases -
bit_mask_ring_buf
A ring buffer implementation with cheap indexing
-
path-value
Universal type and access property(s) by path
-
patricia_router
Radix Tree implementation for Rust
-
partial
Optional monad with fake variant
-
interval-map
A vector-based, non-duplicate range-keyed, sorted array
-
tan-lints
A collection of lints for the Tan Language
-
simple-rate-limit
Rate limit enforcement as simple data structures, no atomics
-
usage
A convenient alternative to the newtype pattern
-
pinus
A prickly BTreeMap. You can insert through shared references and values are pin-projected.
-
reql-types
Some useful types to use along with the reql crate
-
augurs-core
Core data structures and traits for the augurs time series library
-
distant-protocol
Protocol library for distant, providing data structures used between the client and server
-
dinvoke_data
Structures and data types definitions for dinvoke
-
skiplist-rs
Skip list is a kind of ordered map and can store any value inside. See skip list wikipedia page to learn more about this data structure.
-
tbytes
A tiny library for reading and writing typed data into buffers
-
quadboard
Typed fixed-length buffers of chess pieces
-
range_union_find
A union-find data structure for ranges
-
pi_ordmap
Ord Map
-
inexor-rgf-model-binary
Inexor - Reactive Graph Flow - Model - Binary
-
hamst
Hash Array Mapped Shareable Trie
-
redox_simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
render_as_tree
visualizing tree data structures via text
-
contextual
deal with data in context
-
upair
Unordered pair data structure
-
astack
offers a Stack data structure with fixed capacity capable of fast LIFO operations
-
takeable
Container type that allows for temporarily moving out of the container, or permanently moving out and invalidating the container
-
wrapping
slices and arrays
-
zaplib_components
The widget toolkit for Zaplib
-
try-push
A trait for attempting potentially expensive actions
-
hash-rings
Implementations of various hash rings
-
gapbuf
Generic gap buffer
-
syntastic
Generic abstract syntax representation
-
bengbenge
inifity array for round-robin dns, beng, beng
-
graphrepresentations
providing efficient abstract implementations of different graph representations
-
rolling_norm
Computes the rolling mean, variance, standard derivation and norm
-
voml-collection
Collections for VOML
-
RustyDSA
A libary for Rust data structure
-
rocstr
An immutable fixed capacity stack based generic copy string
-
isomorphism
2 directional hashmaps
-
erased-type-arena
A type-erased allocation arena with proper dropping
-
atree
An arena based tree structure with removal support
-
leetcode-solutions
A collection of leetcode solution in rust
-
colours
Color types for different color models with conversions between it
-
restorable
An iterator adapter for saving and restoring iterator state
-
aabel-identifier-rs
defines identifier behavior, such comparing them, or generating sequences of identifiers
-
lazy-seq
constructing lazily evaluated sequences
-
cycler
A simultainious write/read data structure
-
collectable
Fallible, no_std-friendly collection traits
-
processing_chain
set up processing chains of large amounts of data
-
simple-graph
Graph library with ability to serialize/deserialize Trivial Graph Format
-
mkargs
Build command arguments
-
tiny-test
tiny-testis collection of functions simplifying test assertions in rust -
fqdn-trie
FQDN (Fully Qualified Domain Name) lookup structures (based on tries)
-
corresponding
Move corresponding fields between structs
-
buffer-trigger
A data collection trigger based on the maximum number and refresh time
-
cnctd_smart_home
A collection of Smart Home APIs
-
prototty
Wrapper crate for frontend-independent prototty crates
-
counted_map
a hashmap that automatically assigns keys to pushed values
-
amadeus-streaming
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
fwdlist
A simply linked (forward) list
-
another-option
option data type; useful when allocations are expensive
-
deltastruct
Allows defining deltas for tagged structs for later application
-
simple-undo
Easy to use undo-redo library
-
read-copy-update
locking primitive
-
unicase_collections
Collection of UniCase datastructures
-
indextreemap
A BTreeMap implementation that allows for key and or positional insertion and retreival
-
sot
Object Tree
-
collect_result
collecting an iterator of results into a result of a collection
-
xdag
DAG(Directed Acyclic Graph) lib
-
arbtree
A small library for general purpose tree data structures
-
l6t-file
A part of l6t library: reading, writing and deconding for L6T IFF data
-
construe
Compile-Time Growable Array: Vec & String for const!
-
epoch-timestamp
Boilerplate collection for epoch timestamping
-
grapes
Persistent graph data structures: Tree, Graph, Arena & more
-
lanyard
UTF-8 C string types
-
ittybitty
An itty bitty bitset to hold your itty bitty bits
-
synthax
Synthesize syntax with quasiquoting plugins
-
bitworks
meant to provide easy to use bitsets with emphasis on safety
-
grovedb-visualize
Debug prints extension crate for GroveDB
-
changed
change detection
-
cdragon-prop
Work with BIN files used by Riot
-
armory
a fast pool for storing lots of objects of one type without fragmenting
-
goodreads
deserializing a Goodreads library export
-
hkalbasi-rustc-ap-rustc_graphviz
Automatically published version of the package
rustc_graphvizin the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
bloomfx
Bloom filter implementation backed by fxhash
-
bktree
BK-tree datastructure
-
shortlist
An efficient data structure to track the largest items pushed to it
-
once-list
an append-only per-item list
-
weak-self
WeakSelf is simple way to have a Weak pointer to yourself
-
bubbletree
Bubble-tree
-
casbin-arangors-adapter
ArangoRs adapter for casbin-rs
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
cds
Collection of Optimized Data Structures
-
hyperbitbit
data structure
-
ic-stable-memory
Internet Computer's stable memory collections and tools
-
ultragraph
Hypergraph data structure
-
outils
Graph and tree data structure library. Providing utilities which aren't easily available in Rust.
-
handy
providing handles and handlemaps
-
designal
Procedural macro for use with futures-signals
-
dynsequence
Sequence-Like data-structure for storing dynamically sized types
-
diskmap
disk based HashMap-like for shared concurrent memory usage
-
char_index
efficient charwise indexing into a string
-
rust_fixed_width
that allows for easier manipulation of fixed width files allowing for the ability to name fields and such using specs
-
generational_token_list
A doubly-linked list backed by generational-arena
-
applejack
Radix tree
-
llist
Lisp-style singly-linked list
-
rustic_core
fast, encrypted, deduplicated backups that powers rustic-rs
-
loki-logger
A loki logger for the log facade
-
string-wrapper
A possibly-stack-allocated string with generic bytes storage
-
eirproject/libeir_ir
Erlang ecosystem common IR
-
starbase-tools
A collection of tools created to help with ship building in the game Starbase by FrozenByte
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
empty_type
Tools to define and convert between types and their corresponding "maybe types"
-
terees
a collection of tree-like data structures
-
bitvec_simd
bitvec with SIMD
-
run-loop
Run loop for thread, provide message post, deadline timer and future executor
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
mqfilters
Highly optimized approximate membership query filters (bloom, cuckoo, xor, quotient) with SIMD support
-
treez
A collection of useful data structures
-
indexed-bitfield
An indexed bitfield, to track presence or absence of up to 128 elements
-
scopegraphs-lib
A port of scopegraphs to Rust
-
dyn_vec
A Vec<T: ?Sized>
-
ts_lib
A collection of functions I find useful for my projects
-
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:… -
simple_tables
An easy to use rust crate for creating table structures. Including macros for easily creating these table structures.
-
ro
stuff read-only
-
union-find-rs
Disjoint-set forest implementation to support the union-find algorithm in Rust
-
implhm
Simplified library of collision-handling HashMaps
-
tree-flat
TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust
-
raii-map
Map and set types in Rust in which the presence of the entry in the data structure is tied to the lifetime of a RAII handle returned by the insertion
-
bit-index
A little-endian zero-indexed bitstring representation
-
short-lease-map
A map collection optimized for brief internship of values
-
boxing
cross-platform implementations for NaN and ptr boxes
-
amazed
A graph maze building library
-
windowed-futures
Helpers for windowed parallel execution of collections of futures
-
plurals
singular/plural forms, mostly in English
-
errling
A collection of intrinsically useful errors
-
inditech
A set of technical indicators for time series analysis
-
milvus-sdk-rust
The official Milvus Rust SDK
-
funnel
data structure that makes it easy to read from multiple channels from a single source
-
opt_vec
A wrapper around Vec<Option<T> that makes deletion fast
-
char-buf
A writable, fixed-length
charbuffer usable inno_stdenvironments -
hexarr
working with hexagonal grids
-
sif-kdtree
immutable, flat k-d tree
-
type-pools
A data structure to store values of multiple types
-
whistlinoak
Annotated even-arity trees backed by mmaps
-
bitarr
A fast and efficient Rust implementation of a BitSet, supporting multiple backing stores
-
superset_map
Map that stores distinct supersets based on the total order defined
-
petal-clustering
A collection of clustering algorithms
-
linked-vector
A hybrid linked list and vector data structure
-
graphs
Graph data-structure implementations based off graph-traits
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
pure-hfsm
A finite state machine library with a clear separation between the machine definition and its changing state
-
goya
morphological analyzer for Rust and WebAssembly
-
puruda
Pure Rust DataFrame
-
linker-set
Declarative programming via linker-constructed arrays
-
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.
-
smallobjectpool
A small object pool for Rust
-
win-idispatch
that aims to provide a more ergonomic way of working with idispatch in winapi based projects
-
Project2
Implementations of red black tree and AVL tree
-
yptoscr
writing yptoscr
-
field_accessor
A procedural macro to get and set a struct field by String dynamically
-
mori_parallel
parallel orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data…
-
torro
A correct and easy-to-use BitTorrent library
-
terrain-graph
Graph Library for Rust
-
tree_by_path
A tree data structure featuring nodes addressable using a &Vec<usize> path and avoiding recursion and run-time borrow checking
-
table
A specialized map for storing values of varying types
-
mutable
keep track of changes in structures
-
hilbert_curve_generator
A WIP Hilbert Space-Filling Curve Coordinate Generator
-
cliquers
Manage filesequences with a common numeric component
-
mashmap
A flat HashMap that supports multiple entries per key
-
aph_disjoint_set
Disjoint set implementation with optimized memory usage and ability to detach elements
-
semver-store
An HashMap structure that uses semver strings as keys
-
cueue
High performance SPSC circular byte buffer with batch operations
-
fufu
-
ljprs_async_pool
async-friendly pool data structure using tokio
-
grove
A segment tree library enabling generic user-defined queries and actions on segments of your data
-
dynamic_graph
graph processing
-
chemrust-scanner
The core modules defining the flow and structs of data in computational chemistry routines
-
neurarbor
manipulating tree graphs, for the analysis of neuronal arbors
-
tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
temporary-annex
Helper for creating temporary annex on a collection
-
ordmask
To check if a value is included efficiently
-
exosphere-core
Core crate for Exosphere
-
protect
A protected data structure
-
evento-query
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
treemap
Squarified Treemap algorithm
-
typed_graph
Staticly typed graph library
-
fervid_core
The core structures and utilities of fervid
-
recursive_array
arrays using recrusive data structures to avoid limitations of the rust compiler
-
orx-imp-vec
ImpVecstands for immutable push vector 👿, it is a data structure which allows appending elements with a shared reference -
ypwt
ypwang's personal toolbox
-
skootrs-model
module contains the various data structures used by the other Skootrs modules. This is also setup to make it easy to generate schemas from this code for the purposes of easily implementing…
-
aterm
Annotated Terms data structure
-
aspiesolutions_core
core types used by many crates
-
datastruct
A pure-data structure builder
-
vec_key_value_pair
A drop-in replacement for std::HashMap and std::HashSet that use Vec on the backend
-
zotero
Communicate with Zotero API
-
foba
A test crate
-
ditto
CRDTs for common data structures like maps, sets, vecs, strings, and JSON
-
sparse-bin-mat
A sparse implementation of a binary matrix optimized for row operations
-
combinations
give you all the combinations of values in a vec
-
sss_fft
FFT and IFFT for arrays and iterateable collections with modular algorithm interface
-
expire
data structure for data maybe expired
-
myopic
A possibly bad lens library for Rust
-
dsalgo
A package for Datastructures and Algorithms
-
tf2-types
a collection of types for tf2
-
version-lp
a version struct library for use with version comparing, and wildcard resolving
-
motivations
a collection of motivating messages
-
cset
Fine-grained and reversible struct transactions
-
fast_id_map
fast map
-
rand_map
A map that creates a random handle on insertion to use when retrieving
-
vivalaakam_seattle_collection
Collection provider
-
gumbel-top-bucket
A bucket data structure that is sampled using the Gambel-Top trick, which allows for O(1) sampling from a softmax-like distribution
-
hdrhistogram
A port of HdrHistogram to Rust
-
aoc-framework-utils
such as data types, algorithms and functions for aoc-framework-rs
-
gfa-reader
Reading gfa format v1
-
dag_compute
construction of arbitrary computation DAGs and the expression of dataflow graphs
-
jec
My collection of general-purpose crates
-
latticequeries
Allows for fast hierarchical queries on Vecs
-
nonoverlapping_interval_tree
Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate).
-
assoc
Treat vectors like associative arrays
-
bloomfilter-rust
A bloomfilter implementation in Rust
-
deepmesa-collections
A collection of data structures and algorithms designed for performance
-
modular-bitfield-ordering
Provide u8be..u128be, u8le..u128le for modular-bitfield
-
granite
Generic backing storage framework for building data structures
-
ucd-trie
A trie for storing Unicode codepoint sets and maps
-
visit_diff
Efficiently finding differences between data structures
-
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
foxy_types
Types for
foxy -
charcoal
Implements tree data structures and interfaces to work with them
-
competitive-programming-lib
Competitive Programming Library
-
dyn-slice
&dyn [Trait] implementation, inspired by a Reddit thread
-
bst-rs
Recursive & Iterative Binary Search Tree Implementations within Rust
-
openpgp-keylist
An OpenPGP Keylist data structure
-
l6t-symbolic
A part of l6t library: symbolic data model for different known devices
-
kukoo
lockfree cuckoo hashmap
-
dd_statechart
A Data-Driven implementation of Harel Statecharts designed for high-reliability systems
-
awint_dag
DAG
awintfunctionality -
fuzzy_trie
Key-value collection to make fuzzy searches
-
willowtree
Lazily evaluated trees
-
foliage
Abstract syntax tree for first-order logic with integer arithmetics
-
fenny
working with Fenwick trees
-
rust-fsm
A framework and a DSL for building finite state machines in Rust
-
crdt
Conflict-free Replicated Data Types for Rust
-
doublets-decorators
Decorators for doublets
-
diskdata
A catalog of on-disk data structures
-
motivation
A collection of motivating messages
-
rs-arboretum
A study in trees
-
chunky-vec
A pin safe, append only vector never moves the backing store for an element
-
staticsort
Implements a macro providing a compile-time quicksort function for arrays of any length, containing any primitive Copy type with a PartialOrd implementation
-
simid
Universally Unique IDentifier (UUID)
-
twie
fast and compact prefix tries
-
serde_single_or_vec2
Type which can be deserialized from either a sequence or a single value
-
sliding_extrema
Queue data structure with support for an O(1) extrema function over contents (for example, to obtain min and max over a sliding window of samples)
-
geogrid
Manipulate geographic data on a grid
-
binary_sort_tree
二叉树的new,insert,del,search等方法
-
atomic_swapping
An arbitrary type atomic storage with swap operations
-
ra-ap-rustc_graphviz
Automatically published version of the package
rustc_graphvizin the rust-lang/rust repository from commit 5113ed28ea1451a13eae3a05dca0dbabfd56f587 The publishing script for this crate lives at:… -
ternary-tree-wasm
A simplified Wasm binding to ternary-tree crate
-
dynprops
Creating and extending objects with typed dynamic properties
-
om2
A set of classes generated from the OM2 RDF schema (mainly Unit)
-
rust_release_artefact
Safely extract installable files from Rust release artefacts
-
fixedbitset-stack
A forked version of FixedBitSet that supports const generics
-
arraylist
wrapper built on top of rust vector implementation. Taste like Java Arraylist, and intuitive to use like Python list and JavaScript array.
-
kodiak-taxonomy
manage generic taxonomies supporting unique features
-
smart-string
A collection of string types and traits designed for enhanced string manipulation
-
persistence
A resizable, mutable array type implemented on top of mmap, providing persistence for arrays of data in memory
-
type-info
Meta type information and type reflection at compile-time and runtime
-
fxd
Fixed-point decimal implementation
-
icu-data
International Components for Unicode (ICU) data in Rust structures
-
soa-vec
Vec-like API over a struct of arrays layout
-
stackbt
A small collection of crates for game AI
-
rudac
common data structures and algorithms
-
restor
A dynamic resource storage system in rust
-
kd_interval_tree
Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups.
-
hash_table_datastruct
Adds a HashTable type, allowing to store values in a table with integer-indexed rows and hashable keys for columns
-
generic-cursors
A generic way to mutably traverse acyclic recursive data structures
-
rpos
Cursor Manager on Table
-
bit-vec_serde
A vector of bits
-
ndtensor
n-dimensional tensor library for Rust
-
rangelist
A representation of sets as lists of inclusive ranges
-
twitter/rustcommon-streamstats
Statistics calculated for a stream of samples
-
zeen_filter
A fast and optimized Bloom Filter implementation in Rust
-
cursed-collections
Collections that (seem to) break Rust safety
-
type-erased-table
A column-oriented based raw data storage
-
rolling-set
A first in first out set that never grows above a certain size
-
tree-index
Index a flat-tree
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
dlist
List data structure based on AVL tree. It can store elements which have dimension and quickly search for elements by distance from 0.
-
nested
A memory efficient container for nested collections (like
Vec<String>orVec<Vec<T>>) -
ds-bst
Binary search tree implementation
-
nereon
Riboseinc configuration library for Rust
-
ensure
target state of an object
-
ketsugou
merges two arrays
-
gridd-euclid
euclid-compatible grid data structure (forked from Frosh_VII's gridd)
-
priority-expiry-cache
A cache that evicts items based on their priority and expiry time (LRU + TTL) Add (O(1)), Get (O(1)), Evict (O(1)) in both time and space
-
entry_put_ext
Map entry extension for put operations
-
moc
made to create and manipulate HEALPix Multi-Order Coverages maps (MOCs), see https://ivoa.net/documents/MOC/
-
priq
Array implementation of the min/max heap
-
const-oid
Const-friendly implementation of the ISO/IEC Object Identifier (OID) standard as defined in ITU X.660, with support for BER/DER encoding/decoding as well as heapless no_std (i.e. embedded) support
-
dequemap
A no_std compatible implementation of the dequemap crate
-
simple-ref-fn
function wrappers that do not require virtual tables
-
hgg
Approximate nearest neighbor search collection
-
struct_mapping
Token StructMapping for testing StructMapping implementations
-
graus-db
A high-performance, thread-safe key-value embedded data store
-
cad_import
importing CAD data from different formats into a uniform in-memory structure
-
content-tree
An efficient data structure for compacted RLE data
-
fusebox
Mostly safe and sound append-only collection of trait objects
-
intpack
collection of functions for packing/unpacking unsigned integers into other unsigned integers of different sizes. For example, packing 4 u8's into a u32.
-
rcbytes
Rc version bytes crate
-
pl-hlist
support for heterogeneous lists (known as
HLists), which are functional, tuple-like, strongly-typed data structures that can contain elements of differing types -
contiguous_collections
collections backed by flat contiguous arrays
-
roaring-graphs
Graph data structure backed by roaring bitmaps
-
app_properties
reading application properties from a file
-
vector-map
VecMap<K, V>: a Linear Search with Map API
-
cosmic_undo_2
Undo and redo done the right-way
-
enum_vec
Efficiently store a vector of enum variants as a packed n-bit vec
-
arrsingh-lists
A test crate to test publishing
-
enum-tag
Proc. macro for generating enum discriminant types.
-
f1d2d2f924e986ac86fdf7b36c94bcdf32beec15
Test for XSS on docs.rs
-
keylist
Elixir keyword list in Rust
-
anti-r
A spatial data structure outperforming r-trees for low numbers of elements
-
fenwick-tree
binary indexed tree (Fenwick tree) data structure in Rust
-
rb_tree
A Red Black Tree implementation in Rust
-
predicates
boolean-valued predicate functions
-
anat-rs
represent natural numbers as well-founded sets
-
codemap2
maintained fork of the codemap crate that contains a data structure for efficiently storing source code position and span information (e.g. in a compiler AST), and mapping it back to file/line/column locations for error…
-
zngur-def
Data types that define the structure of a zng file
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any string
-
rimu-parse
A data structure template system
-
riblt
Rateless Invertable Bloom Lookup Table (RIBLT) data structure
-
epoch32
32-bit Epoch with specified starting year
-
nullvec
Rust nullable vector, which can contain null(missing) values as element
-
libpaprika
read and generate Paprika recipe files and recipe collections
-
k2_tree
A space-efficient representation of sparsely populated bit-matrices
-
hashcons
Hash cons'ing for compact representations of shared, immutable data structures
-
scored_set
A scored sorted set data structure for Rust
-
list-any
Type erased slices and Vecs
-
data_structure_traits
data structure collection traits
-
rustupolis
tuple space data structure in Rust
-
json_tables
A structure that eases operations with a local json storage of undetermined items
-
partial_const
way to handle constant and non-constant values in a unified way
-
merkletree
Light merkle tree implementation with SPV support and dependency agnostic
-
codas-macros
Macros for Codas
-
graphiti
macro dsl and builder for creating and describing arbitrary sets of related data using a serializable description type
-
bb-qol
Small collection of quality-of-life functions
-
aggregate-map
Collect key-values pairs into a mapping from keys to collections of values
-
tongrams
Tons of N-grams
-
break_array
For breaking array indexing
-
dendron
Generic tree data structure
-
simple-observable
observable pointer for mutable and immutable data
-
arenas
Arena data structure for efficiently adding & removing items with stable IDs
-
id_sys
data structures which can be marked such that they only work with similarly marked integer data types
-
blobary
place for blobs
-
system-config
storing application properties on disk
-
rust-fp-pfds
A Functional Programming Library in Rust, Purely Functional Data Structure
-
non-empty-vec
NonEmptyvector implementation, ensure non-emptiness by construction -
okasaki
A collection of peristent datastructures
-
disk-mpmc
on-disk mpmc
-
fastgraph
Graph abstraction providing a generic interface and powerful parallelized traversals
-
set_genome
A genetic data structure for neuroevolution algorithms
-
naq_domain
Domain library for nordic air quality (naq) that defines shared domain data structures
-
embedded-async-helpers
staticfriendly helpers for async on embedded -
anystruct
that provides traits for converting between JSON and Protocol Buffers (Proto) data structures
-
swap-queue
A lock-free thread-owned queue whereby tasks are taken by stealers in entirety via buffer swapping
-
map-to-const
Easily convert HashMap<K, V> to constant [(K, V); N] values
-
utf8char
that supplies a utf8 encoded char
-
datastreams-rs
DataStreams container
-
binary-search
General binary search implementation
-
char-list
A persistent string type with the same API as a linked-list of characters
-
num-bigint
Big integer implementation for Rust
-
graphstack
Graph-structured stack
-
simple_bitfield
Create bitfields with the same memory structure as integers using a simple macro
-
scratchbuffer
A Vec<u8> like data-structure, that can be used as slices of different types
-
madeleine
Transparent object persistence with predefined operations and state containers
-
treeflection
that provides reflection for tree structures
-
hdf5-dst
DST extensions for HDF5
-
hashbrown_tstd
port of Google's SwissTable hash map
-
static_merkel_tree
Static Merkel Tree is dedicated for generating Merkle Root and Merkle Proof for a static list of items
-
zang
A test crate which is also a collection of some libraries which I tend to use for hobby projects
-
sdsl
interface for the Succinct Data Structure Library
-
jagged_array
Owned
[[T]]-like 2D array where each row can differ in length -
cell-grid
fixed-size 2d grid container suitable for
no_stdgame development -
standards
A collection of standards for international trade facilitation
-
elaru
Memory safe implementation of LRU cache
-
blocklist
The project is based on blocklistproject. It provides perfect hash map/set structures for fast lookup of blocklisted items.
-
field-ref
Field reference (like a member pointer to non-static data field in C++) for Rust
-
sum-queue
Queue struct that keeps a fixed number of items by time, not capacity, and allows to get summarized stats of its content
-
ahtable
Array Hash Table implementation
-
nonasync
A set of utilities useful for building a non-blocking non-async APIs
-
castle_api
Castle API, graph api
-
hkalbasi-rustc-ap-rustc_serialize
Automatically published version of the package
rustc_serializein the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
lookups
Improve the data retrieval operations for collections
-
laizy
stable and thread-safe implementation of a lazy value
-
rustifact_extra
Extra features for Rustifact
-
equivalence
Trait and derive macro for comparing and hashing types modulo an equivalence relation
-
rustupolis_server
using space tuples in fog computing
-
nopetgraph
Graph data structure library. Provides graph types and graph algorithms.
-
zot
Option-like enums for working with ordered collections of zero, one, or two items (
Zot), or ordered collections of one or two items (Ot) -
nolan
Commitlog/WAL Implmentation and Powerful Abstractions
-
collidea
Collision-prone memory-efficient collections
-
vec-dimension-shift
N-Dimension shift features for Vec<T>
-
bucket_queue
A Bucket Queue data structure that can be used as a Priority Queue
-
courgette
Colour manipulation/conversion library
-
discrete_range_map
DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap
-
art
adaptive radix trie
-
to-offset
developer-friendly methods to manipulate strings with character indices
-
intsplit
splitting numeric types into their binary component arrays
-
handler_map
Map from types to functions that receive them
-
chtholly
Tree, a data structure originated from CF896C
-
miniqueue
A minimalistic single-thread job queue based on fold/reduce
-
typed_id
Make your IDs strongly typed!!
-
cbsk_log_tokio
log tool, using tokio as the runtime
-
raddy
A collection of useful functions
-
flats
flattens nested structures into a flat single dimension map
-
geomprim2d
2D geometric primitive types
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
smallbigint
Big integer types that have a small on-stack representation for small values. Uses num-bigint internally.
-
abbrev-tree
highly inefficient data structure for text completion
-
advancedresearch-max_tree
maximizer library based on a maximum tree structure
-
advanced_collections
advanced data structures (collections). Includes counter (hash-bag, multiset), disjoint set (union-find, merge-find), circular buffer (cyclic buffer) and interval (range)
-
foxy_utils
Common types and utilities for
foxysubmodules -
mismatch
abstract mismatching. Useful for error propagation.
-
uwheel
Embeddable Aggregate Management System for Streams and Queries
-
grit-bitvec
BitVec, a vector type that can store fixed-width data with irregular bit widths
-
fenwick-bit-tree
Slighly over-engineered FenwickTree implmentation
-
ctxmap
A collection that can store references of different types and lifetimes
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
byte-sequence
A little marco that creates structs to be used as byte sequences (for ApiKeys, SessionIds and so on)
-
libdhcp
safe and idiomatic API for working with DHCP data structures
-
adts
Common abstract data type traits and implementations
-
hash_ring
Consistent Hashing library for Rust
-
mtgjson
Unofficially provided lightweight models of the data provided by MTGJSON
-
quantized-density-fields
Quantized Density Fields data structure
-
paged
Read and create read-only paged database files
-
cess-sp-core
CESS Storage Proofs - Core parts for proofs of storage
-
parse_tree
A non-abstract syntax tree type
-
map_split
providing simultaneous mutable access to disjoint portions values stored in a hash map
-
vecset
A vector-based sorted map, set and keyed-set implementation
-
tc-state
TinyChain's general state enum
-
lending-library
A key-value store that loans full ownership of items
-
ABtree
AVL and Btree for rust
-
contigious-tree
Write and read tree graphs to and from contigious blocks of memory
-
spectacle
Opt-in runtime introspection
-
linked_lists
Different types of linked lists
-
eytzinger
implements the "eytzinger" (aka BFS) array layout
-
db_meta_derive
db-meta-derive is a wrapper around PostgresSOL using tokio-postgres
-
range-traits
Ranges related traits
-
forged-in-lost-lands
Forged in Lost Lands is a simple game engine built in Rust that focuses on data control and ease of use
-
sbf-blake3
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
ranno
Annotations over recursive data structures
-
rtlp-lib
This create provide structures to parse PCI TLPs
-
hv-alchemy
Heavy Alchemy - the black arts of transmutation, wrapped for your safe usage and enjoyment
-
simple-canvas
generic 2 dimensional canvas struct
-
stringvec
macro for creating Vec<String> from various types
-
model
model-based testing for data structures, with linearizability checking
-
eztd
Quick start Rust
-
board
creating a single vector with coordinate based access, and a few nice functions for easy use
-
espalier
Very simple flattened tree structure
-
linked-syntax-tree
A doubly-linked syntax tree
-
jirachi
A collision resistant runtime agnostic key-generator
-
read-write-pipe
A trait for objects implementing Write, to write all content from a Read object
-
tinystr-raw
Raw string-to-integer conversions for tinystr
-
libreda-splay
Splay map and splay set data structures
-
las
Reads and writes point clouds stored in the ASPRS las file format
-
vbox
type erased Box of trait object
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
halfling
A collection of basic utilities for working with nibbles
-
tracker-macros
Macros for the tracker crate
-
vec-strings
Store any string efficiently in an immutable way
-
debounce
Data structures and helpers for debouncing a stream of events: removing duplicate events occurring closely in time
-
anycollections
Rust Vec and HashMap which can contain arbitrary types
-
yuuang_petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
batbox-approx
Approximate comparison
-
slotmap-map
Slotmap data structure
-
old_norse_alphabet
Old Norse alphabet constants & sort for Rust
-
map_err
map error values
-
kserd
Kurt's Self-Explanatory Rust Data
-
bitf
procedural macro to easily create a bitfield out of a struct
-
sharedvec
A fast but limited collection for storing values of a single type
-
const_std_vec
const std vec
-
ramp_table
RampTable, a data structure useful for certain specialized situations
-
dastral
Reduce boilerplate code, learn data structures & algorithms with Dastral
-
simple-collection-macros
configurable macros for maps and sets
-
causal-length
CRDT's based on causal length sets
-
ultrametric_matrix_tools
Toolbox that provides functions and data structures to generate and handle ultrametric matrices
-
pin-list
A safe
Pin-based intrusive doubly linked list -
cycle_cursor
Cyclic cursor implementation over generic iterators
-
pinned_vec
Vec-like data structure whose elements never move
-
fill_canvas
FillCanvas is a wrapper around a matrix with special methods to fill the cells
-
packed_array
Packed Array aka sparse set structure with compile-time known size
-
benchmark-counters
Light-weight data structures to help with monitoring and benchmarking
-
vfs-tools
A collection ofttools to work with VFS
-
dpc-simplemap
map with default value and compacting
-
rust-datastructures
some datastructures in rust
-
threshold-dict
A data structure to find smallest key that is larger than the query
-
bndpresbufq
Bounds-preserving, optionally limited, buffer queue
-
arenavec
An arena backed implementation of vectors and related types
-
artful
Low-memory overhead and high-performance adaptive radix tree
-
segmentmap
A collection that maintains insertion order
-
setting
The styles of all graphics elements
-
fixedvec
A heapless version of the Rust vector type
-
object-chain
Ad-hoc structure builder
-
data-query
Query library that allows for Querying Serializable data using string queries
-
segmap
Map and set data structures whose keys are stored as ranges. Contiguous and overlapping ranges that map to the same value are coalesced into a single range. Originated as a fork of Jeff Parsons' "rangemap"
-
graph-rs
graph library
-
cmp_wrap
Let you compare structes by context
-
microcrates-bytes
Types and traits for working with bytes (with no_std support by default)
-
blend-bindgen-rs
generated Blender's data structures
-
aoc-framework-parsers
Compilation of input parsers for aoc-framework-rs
-
arc-atomic
atomic pointer to an
Arc -
prcn_lib
private library for atcoder
-
treers
Sedgewick's tree maps
-
indexed_vec
IndexVecfromlibrustc_data_structures -
graphed
implement graph-based functionality
-
bigvec
A really big vec
-
multipeek
An adapter to peek at future elements in an iterator without advancing the iterator cursor
-
dot_tree
Create, query and store binary trees
-
grafite
Range Filter
-
flag_set
FlagSet can process operations of the infinite complementary sets and the origin sets
-
bfield
B-field datastructure implementation in Rust
-
re_types_core
The core traits and types that power Rerun's data model
-
pati
Image data structure and format for the Patica editor
-
lattice-graph
Set of Lattice(Grid) based Graph Structures
-
segment-map
A self-balancing binary search tree for mapping discrete, disjoint segments to values
-
mycelial-crdt
mycelial crdt
-
id-pool
Create and recycle integer ids using a ranged pool
-
trie-standardmap
Standard test map for profiling tries
-
catalan
binary tree of n variables where the parent node represents a function and the child node represents a value
-
collectivity
Generic collection traits
-
disjoint_set_forest
A disjoint set data structure implemented using a disjoint set forest
-
swimmer
Thread-safe object pool type
-
grid_trait
2D and 3D grids with combinators
-
tobz1000-petgraph
Pseudo-namespaced fork of
petgraph: Graph data structure library. Provides graph types and graph algorithms. -
lockerroom
Readers-writer access to individual cells of your collection!
-
multi-stash
Vector-based arena data structure that reuses vacant slots
-
streamhist
streaming histogram
-
ringbahn
an experimental safe API for io-uring
-
bitvector
in Rust
-
bstree-file-readonly
Query read-only binary-search tree file, supporting billions of entries in files of tens of GB
-
qt-json
JSON library for QT
-
jsonnlp
JSON-NLP data structure
-
pinned-bucket
Mutable container for pinned and immutable items
-
hylo-fix
Fixed-point number types with Solana Anchor support
-
front-vec
Efficiently-prependable Vec and String types
-
wrapped_slab
WrappedSlab: Auto-generate newtype idiom based on a Slab
-
hdf5-hl-sys
Bindings to HDF5 High Level API
-
hedel-rs
A Hierarchical Doubly Linked List
-
nibble_vec
Vector data-structure for half-byte values
-
tinysearch-cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
array-init-cursor
help keep track of arrays of MaybeUninit
-
no_vec
modifying sized arrays
-
cbsk_log_rayon
log tool, using tokio as the runtime
-
delete_if_not
unsafely in-place delete function
-
labelgraph
graph implementation, allowing random access to nodes via labels
-
bsp-pathfinding
Runtime path finding using Binary Spatial Partitioning
-
m6coll
Small Smart Collections using prefix m6
-
ccl_owning_ref
creating references that carry their owner with them
-
pasture-derive
Macro implementations for #[derive(PointType)]
-
bstree
A Binary Search Tree written in Rust
-
vlsm-tree
Versioned Log Stream Merkle Tree
-
lineartree
tree data structure for rust
-
flow_arena
A HashMap managed Graph Model with the concept of ownership
-
algae-rs
A collection of abstract algebraic structures implemented in Rust
-
gml_parser
A fast and simple Graph Modeling Language (GML) parser
-
rstructure
A thread-safe data structure library
-
pds
Probabilistic Data Structures efficiently implemented in Rust
-
judy-wrap
Judy arrays FFI mid-level binding
-
two-sided-vec
Double ended vectors for rust, which can grow in both the front and back
-
mycelium-bitfield
Structured bitfields, courtesy of Mycelium
-
sequencetree
a new type of collection to store keys and their corresponding values
-
truncate-integer
Truncate integers
-
holium-rs-sdk
Holium Rust SDK
-
automap
pattern to implement key-value maps where the value type contains the key type
-
slots
Fixed size data structure with constant-time operations
-
id-map
Data structure of values indexed by IDs
-
asdl
Parser for ASDL format. Describes the abstract syntax of compiler intermediate representations and other tree-like data structures
-
uuid-timestamp
UUID timestamp
-
aatree
in Rust
-
twodarray
A 2D array library
-
tree-graphviz
Generate GraphViz DOT directed trees, based on an arbitrary tree structure
-
building_blocks_mesh
Fast meshing algorithms for voxel data structures
-
treena
Tree stored in an arena
-
offset
Glorified offsets for arbitrary structures
-
intersection
Find the intersection over a collection of sets; when you need more than the intersection between two sets
-
artsy
ART Tree data structure library
-
extensions
typemap container with FxHashMap
-
growable-bitmap
A growable (and shrinkable) compact boolean array
-
bittree
O(1) find functions in a special data structure called a bit tree
-
polystore
Polymorphic data store
-
itermap
Iterator tools for maps (
HashMap,BTreeMap, etc.) -
bpht
A bit-packed hash table implementation using hopscotch hashing for 32-bit keys and values
-
bugu
Cuckoo Filter: Practically Better Than Bloom
-
cognitive-frames
Managing windows for
cognitive -
chtholly_tree
Rust bindings for Chtholly Tree
-
baggie
Container for storing mixed / heterogeneous values in a common structure
-
id-vec
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
-
sexpr_parser
Generic S-Expression parser
-
hicollections
C-liked Collections
-
gardiz
integer geometry on 2D planes, focused on games
-
strchunk
Data types for working with UTF-8 text in I/O
-
largeint
that supports large integer arithmetic
-
loro-preload
Loro internal lib for loading data
-
genindex
Generational index library
-
flatbuffers-owned
that enables a more flexible usage of FlatBuffers
-
apint
Arbitrary precision integers library
-
map1
@ErichDonGubler's fancy template for new Rust projects
-
passive
A trio of marker traits to classify passive data structures
-
rt_vec
Runtime managed mutable borrowing from a vec
-
schemes
cache-aware recursion schemes in rust
-
soak
Transform a struct into arrays of its fields
-
fix_float
Fixed floating types that allows useful trait implementations and datastructures on float numbers
-
hirpdag
procedural macros for Hash Consed, Immutable, Reference Counted, Persistent, Directed Acyclic Graph data structures
-
dotreds-binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps. Makes some previously internal function public
-
unsized_enum
Unsized enum implementation
-
hecs
A fast, minimal, and ergonomic entity-component-system library
-
my-stack
stack implementation in Rust
-
simple-matrix
generic matrix library
-
packbytes
Convert structures to and from packed representavises - byte arrays of fixed size that live on stack
-
linked-list
An alternative implementation of std::collections::LinkedList
-
jui_file
file tool
-
hlist2
Compile-time heterogeneous list implementation
-
unthbuf
Unsigned N-bit Buffer: A structure that holds a fixed buffer of
bits-sized unsigned integer elements -
hopscotch
A FIFO queue for efficiently hopping and skipping between tagged items
-
bitsvec
A bit vector with the Rust standard library's portable SIMD API
-
hashmap-entry-ownable
Variation of HashMap::entry() that accepts borrowed forms of keys
-
rose_tree
An indexable tree data structure with a variable and unbounded number of branches per node. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
-
simple_event_bus
A basic, simple event bus in Rust
-
batbox-collection
Collection of identifiable objects
-
atlas-rb-tree
A textbook implementation of a Red-Black Tree
-
triskell
A tri-partite ring buffer
-
disjoint-set
Tarjan's Union-Find Data Structure
-
cola
A text CRDT for real-time collaborative editing
-
data_registry
An unordered data structure with immediate insertion, removal and access
-
hkalbasi-rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
plain_trie
Basic Trie is trie capable of mapping any T to string composed of English alphabet letters
-
colony
A fast associative data-structure that chooses its own keys
-
roaring_bitmap
Roaring bitmap data structure implemented in Rust
-
version-rs
A struct for Versions, with the methods you expect
-
packedvec
Store vectors of integers efficiently
-
btree-vec
A growable array (vector) implemented using a B-tree
-
densevec
Map like collection with usize indices that stores values contiguosly
-
banyan
Persistent indexable tree data structure
-
traitgraph-algo
Graph algorithms based on the traitgraph crate
-
id-set
A bitset implementation that stores data on the stack for small sizes
-
ulid-generator-rs
generating ULIDs
-
p8n-types
Basic types for representing binary programs
-
valet
Stores your objects and gives you a tag to retrieve them later
-
pi_async_graph
async graph
-
higher_order_point
An experimental higher order data structure for 3D points
-
pathlink
A URL type whose path can also be used as a filesystem path, for Rust
-
sbbf-rs-safe
Split block bloom filter implementation
-
one_way_slot_map
SlotMap with minimal restrictions on Keys and Values
-
composite_types
Compose type definitions in the style of typescript
-
push-while-ref
push while having a reference
-
cbor-tag-index
Tag index
-
panoradix
A generic map and a set, both backed by a Radix tree
-
kdt
k-dimensional tree implemented with const generics
-
better_peekable
Create a Peekable structure like Rust's Peekable except allowing for peeking n items ahead
-
rstmt-core
focuses on building a music theory library that can be used to generate music theory data structures and algorithms
-
backtracking_iterator
generic iterator with an item history, capable of backtracking and forgetting
-
traitgraph-tsplib-io
Functions to read and write graphs in TSPLIB format
-
hashtree
A Merkle Tree implementation in Rust
-
multi_key_map
a hash table that shares one value across multiple keys
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
nimrodshn-btree
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite
-
binary-data-schema
Meta language for raw binary serialization
-
go-heap-rs
Golang's heap written in Rust
-
bytes-expand
Types and traits for working with bytes
-
bitmac
Structure for accessing to single bits
-
guppy-summaries
Build summaries for Cargo, created by guppy
-
secured_linked_list
A cryptographically secured and provable linked list
-
taskforge
Task management shared functions and structures for the taskforge family of tools
-
fid-rs
High performance FID (Fully Indexable Dictionary) library
-
tournament-kway
k-way merge using a tournament tree
-
stack-array
A data structure for storing and manipulating fixed number of elements of a specific type
-
rudy
Judy array implementation in pure Rust
-
checked
Implements a wrapper over the primitive Rust types that better indicates overflow during arithmetic
-
lazy-cogs
Lazy Cogs is a implementation of lazy clonable data structures
-
internode
Smart references to your graph nodes
-
gap_query_interval_tree
that provides a gap-query optimized interval-tree data-structure
-
forgetful
Track and forget values within a specific scope, enabling detection of repeated values
-
flex-algo
Rust commonly used data structure and algorithms
-
fsort
sort files in a fast, OS-independent and 'rusty' way
-
iron_rose
Invertable Bloom Filters & Strata Estimators as found in https://www.ics.uci.edu/~eppstein/pubs/EppGooUye-SIGCOMM-11.pdf
-
weakheap
Weak Heap data structure implementation in Rust
-
moretypes
Named tuples, records, and more!
-
decoded-char
wrapper to keep track of the original byte length of a decoded character in the encoded source file
-
fixed-slice-deque
A fixed size deque implementation
-
bitrush-index
A serializable bitmap index library able to index millions values/sec on a single thread
-
common-tree
common tree lib
-
automatic-relations
Tree automatic relations
-
hyper-tree-router
Routing middleware for Hyper http library using Prefix tree (trie) for path finding
-
know_yaml
The Know Framework for Rust
-
flatten_objects
A container that stores numbered objects. Each object can be assigned with a unique ID.
-
bitint
Integer types that have a logical size measured in bits
-
tinyvec_string
tinyvec based string types
-
bloom_filter_plus
rust_bloom_filter
-
rimu-eval
A data structure template system
-
suffix_trie
Suffix trie for searching
-
dynamic-matrix
work with matrices
-
typemap_core
A no_std typemap with trait-based value-presence guarantees (on nightly)
-
fera
An aggregation of algorithms, data structures and supporting crates
-
u64_array_bigints_core
Core library for
u64_array_bigints -
memcell
providing a MemoryCell struct, which stores a current and previous value
-
weight-cache
A cache that holds a limited number of key-value-pairs according to a user defined criterion
-
molecule
Rust bindings for molecule
-
projected-hash-map
projected HashMap over HashSet
-
rust-bloomfilter
bloom filter implementation in Rust programming language
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
solana_libra_canonical_serialization
Libra canonical serialization
-
arrsingh
A top level crate in the workspace
-
more_ranges
Range types not provided in the standard library
-
collect-once-hashmap
A hashmap that can be collected only when there are unique keys in the iterator
-
cons-rs
containing a Cons data structure
-
collect-mac
collect!macro, which can be used to easily construct arbitrary collections, includingVec,String, andHashMap. It also endeavours to construct the collection with a single allocation, where possible. -
trie
An ordered map and set based on a trie
-
ux
Implement the following non standard integers: u2, u3, u4, u5, u6, u7, u9, u10, u11, u12, u13, u14, u15, u17, u18, u19, u20, u21, u22, u23, u24, u25, u26, u27, u28, u29, u30, u31, u33…
-
reusable-vec
A Vec wrapper that allows reusing contained values
-
leetcode_for_rust
leetcode for rust
-
aoc-framework-rs
A framework for AdventOfCode coding competition, that handles input, output and provides some core utilities
-
apid
Collection of type definitions from several APIs
-
supply-chain-trust-example-crate-000097
generate and parse UUIDs
-
truetree
Trees in Rust
-
bonzai
An abstraction for optimizing the memory layout and pointer aliasing of trees
-
stride
A strided slice type
-
enum-ref
Proc. macro for generating enum discriminant types.
-
insert_multiple
insert multiple items into a stream in reasonable runtime
-
circular_vec
A fixed length vector that provides a next function that loops infinitely
-
solomondb
An embedded and distributed Gremlin-compatible graph database
-
biheap
A heap group that supports efficient removal of extreme elements
-
onigiri
handling chars
-
range-split
splitting sequences with range parameters
-
triemap
Triemaps for Rust
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
expanding_slice_rb
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
-
compact-map
'Small map' optimization: store up to a small number of key-value pairs on the stack
-
wasmflow-interface
Types used by the Wasmflow tool chain
-
crdt_rs
work with Conflict-free replicated data types (CRDT) in Rust
-
indexmap-amortized
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
dgrambuf
A fixed capacity ring buffer for datagrams (byte slices)
-
arrayset
An array-backed ordered set type
-
ensured_bufreader
A Bufreader ensures N bytes in buffer
-
prototty_storage
Interface to persistent storage
-
xio_base_datatypes
XIO base data structures
-
chunked-bytes
A rope-like non-contiguous buffer for efficient data structure serialization and vectored output
-
fplist
An immutable, persistent, singly-linked list
-
discord-indexmap
A fork of the popular
indexmaplibrary that adds a few extra APIs that are yet to be upstreamed -
nave
Thinking about the construction of distributed systems starting from the *consistent hash* algorithm
-
workit
single-threaded work queueing utility
-
tree-cursor
non-intrusive tree cursor that supports node mutation without Cell/RefCell
-
pretree
package for storing and querying routing rules with prefix tree. Pretree 是一个用于存储和查询路由规则的包。它用前缀树存储路由规则，支持包含变量的路由。
-
librualg
Collection of basic algorithms for everyday development
-
kermit-ds
Kermit, the Leapfrog Triejoin algorithm with associated data structures
-
sparseset
A Sparse Set
-
binartree
Binary Tree realisation
-
pui-arena
Generalized Arenas that can be used on
no_std -
nodegraph
A data structure in rust describing a graph of nodes, where each node may contain arbitrary data
-
fusefilter
No alloc membership approximation
-
easy_graph
Data structure that represent generic vertices and undirected connections
-
history-buffer
A fixed capacity, write-only, ring buffer
-
bidirectional-map
A two-way map data structure for small keys and values
-
densemap
A collection data structure that is permanently accessible by unique keys and fast iterable
-
disjoint-hash-set
A disjoint set / union-find data structure suitable for incremental tracking of connected component identified by their hash
-
ttm-rs
CLI to turn tuples into adjacency matrices
-
enum_from_variant
macro to generate From<T> trait implementations for enum variants, simplifying error conversions and enum mapping
-
trailer
Store a type with an associated buffer in contiguous memory
-
aabb-quadtree
A quadtree that maps bounding-boxes to elements
-
miny
Box<T> with small value optimization
-
ov
a collection of traits that allow you to chain off of anything
-
box-collections
A no_std compatible implementation of the collection crate
-
free-ranges
An efficient data structure for keeping track of indices which are either free or not
-
cdl-list-rs
A circular doubly linked list implementation using Rc<T> and RefCell<T>
-
hash-trie
Hash Array Mapped Trie (HAMT) Immutable Set Implementation
-
tdb-succinct
succinct data structures used by terminusdb
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
frbf
robust, and efficient implementation of the Bloom Filter data structure in Rust
-
lhlist
Labeled heterogeneous lists
-
cbsk_unique
unique value generator
-
ident
wrapping types with an immutable identifier and storing/accessing such types in collections
-
head
Common types with inline headers, such as HeaderVec for Vec
-
prust_core
encoding/decoding PUS-C packet data structures with ease
-
partial-array
potentially partially-filled arrays
-
queue-rs
queue
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
miniconf
Serialize/deserialize/access reflection for trees
-
plain-map
map that uses small_vec as backing storage, which is useful for having many tiny maps. For storing non-Copy types please use v1.x which is also supported.
-
dyn_array
easy to use N-dimensional dynamic array
-
vector2
2D vector library
-
fast_collections
noheap zero copy collections
-
set-trie
A trie for fast subset and superset queries
-
varset
an any type set of items
-
htmldom_read
HTML reader that parses the code into easy-use tree
-
higher-cat
Functors, Applicatives, Monads and other bad ideas
-
seg-tree
segment tree library
-
dashmap-shard
port of Google's SwissTable hash map
-
same_elements
Function to test if two collections contain the same values
-
ckb_multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
domain-lookup-tree
A tree structure in Rust optimized for looking up domain names, with wildcard support
-
bitsetium
One stop shop for all bitset needs
-
functional_list
A functional, immutable list for Rust
-
collection
Deterministic, copy-on-write balanced search trees
-
ppar
Persistent immutable array
-
simple_ringbuf
Ringbuf is a speedy lightweight fixed-size infinite-use collection optimized for straightforward single threaded use
-
containerof
Macros and traits facilitating the use of intrusive structures in Rust
-
pointer_vec
The PointerVec works same as the std Vec structure except the Vec has a size of 3 usize (pointer, length, capacity). This crate provides a replacement that has a size of 1 pointer.
-
calcit_fingertrees
(Calcit fork of )Immutable persisten
fingertrees -
algods
A collection of data structures and algorithms
-
shelves
Storing values referenced by a unique typed index
-
igraph
A graph representation data structure with a built in index on keys
-
header-slice
Definitions for slices with headers, and a vec-like type with a header allocated inline
-
xtree
general purpose tree data structure
-
gridd
A generic, dirt-simple, two-dimensional grid
-
owned_chunks
a collection of traits and iterators to get owned chunks from collections
-
avl-cont
A contiguous AVL Tree
-
autocomplete
Auto-complete feature using Trie data structure
-
c_linked_list
handling NULL-terminated C linked lists
-
fast_trie_tree
A fast
TrieTreefor multiple data types -
dag-cbor-references
Extract blake3 ipld links from dag-cbor blocks
-
bounded-vec-deque
A double-ended queue|ringbuffer with an upper bound on its length
-
trait-map
Rust map for dynamic trait storage and references
-
map_ext
Extensions to std::collections::HashMap and std::collections::BTreeMap
-
dst
Data structures for DSTs
-
easy_collections
Wrappers around standard collections for ease of use and quick prototyping
-
sortedcontainers
An experimental sorted data structure
-
rustgym-util
handy macros, data types and traits for rustgym
-
vector-trees
Vector backed B and AVL trees
-
dot_json
Tools for dot map representations of serde_json Maps
-
treesome
tree creation, manipulation, traversal and visualization
-
smallbytes
= SmallVec + impl BufMut (from the bytes crate)
-
batbox-android
Helper crate for android
-
easy_strings
Ergonomic, garbage collected strings for Rust
-
fricgan
performing basic input and output on bytes
-
variant-map
defines maps to store variants of enums
-
static-box
A stack-allocated box that stores trait objects
-
graphific
graph data structure library
-
prioq
Priority Queue implemented using std::collections::BinaryHeap
-
qt-json-rs
JSON library for QT
-
repc
APIs to calculate the layout of C types
-
key-node-list
Doubly-linked list that stores key-node pairs
-
cbloom
Concurrent implementation of Bloom filters
-
treelike
A trait to abstract over trees, and simplify implementing them, all in one handy crate
-
spigal
fixed-length ring buffer implementation, intended to be no-frills and easy to use, especially for embedded applications
-
json-node
A way to work with JSON as a node tree
-
map-macro
Declarative macros for statically initializing collections
-
hodgepodge
enums
-
tapestry
Generic 2D grid data structure and utilities
-
runtime-sized-array
A variable-length array, also called runtime-sized
-
ethers-impl-rlp
RLP serialization support for uint and fixed hash
-
sized-vec
Type level sized vectors
-
fast_forward
Quering collections blazing fast
-
arrav
Sentinel-based heapless vector
-
dfb
Dynamic-Fifo-Buffer, like AnyMap but uses a VecDeque to store values and treats access as a Fifo
-
linear-hashtbl
Linear probing hash table
-
copy-range
core::ops::Range et al, but Copy and IntoIterator
-
fremkit
broadcast log
-
len-trait
Len trait for collectons
-
get-many-mut
Stable polyfill for slice::get_many_mut
-
aligned-utils
Common utilities to work with aligned values and allocation
-
mut_set
A safe implementation for HashSet with iter_mut and get_mut
-
any_handle
A thread-safe, type-safe smart pointer that can share, store and downcast a
dyn Any -
shifted_vec
A growable datastructure with positive and negative indexing built on top of
std::vec::Veccalculating the offset automatically -
woodland
Easy to use implementations of popular tree data structures such as Binary, Binary Search, AVL, Red-Black, and more
-
hayami
general use symbol table
-
static_map
A static hashmap implementation, based on the Round-Robin hashing algorithm found in rustc
-
cyclic_data_types
Cyclic data types are series of structs, enums, types and functions to create a series of fast data types
-
btree-map
A data structure for storing and manipulating fixed number of elements of a specific type
-
hashmap_ext
Extensions to std::collections::HashMap
-
bet
parsing and evaluating binary expression trees
-
lazy_concat
Lazy concatenation for Strings and Vecs
-
flat-zip
An iterator adaptor to help traverse two-level collections
-
serde-ordered-collections
Ordered serialization/deserialization serde functionality
-
graphsearch
graph search and representation library
-
shared-string
Split a string without another allocation
-
vector_mapp
A Vec based map
-
tranche
Tranches are an alternative to slices
-
vhr_serde
A serde (de)serializer crate for the simplist possible binary format
-
btreelist
A list data structure that has efficient insertion and removal in the middle
-
gsrs
Generic Self Referencing Struct
-
collect
An experimental extension of std::collections
-
upto
Fixed-capacity and variable length stack allocated arrays
-
rbtree-arena
A cache friendly red black tree where nodes live on sequential memory
-
unrolled-linked-list
unrolled linked list in rust
-
hprtree
A Hilbert-Packed-R-Tree implementation for rust
-
tsil_cev
LinkedList on Vec
-
byte_set
Efficient sets of bytes
-
deferred_vector
A deferred vector implementation
-
prefix_sum
prefix sum data structure
-
enumap
A HashMap and HashSet like interface for enums backed by an array
-
bytes-quilt
data structure for tracking random-access writes to a buffer
-
bfilters
bloom filter implementation in Rust
-
tagged-tree
A tree-like data structure where the values are tagged
-
pathtrie
A specialised trie for paths in the style of a Patricia or radix trie
-
dark-std
asynchronous containers build on tokio. It uses a read-write separation design borrowed from Golang
-
lz_diet
An AVL balanced Discrete Interval Encoding Tree
-
cursieve
that makes it easy to deserialize byte arrays into annotated Rust structures
-
bitaccess
Macro for efficient and type-checked access to individual bits of a variable
-
nexum
collection of commonly used data structures
-
skew-forest
Skew-binary random access lists
-
bloom_filter_plush
rust_bloom_filter
-
mvbitfield
Generates types to work with bit-aligned fields
-
rope_rd
A Read/Seek rope implementation
-
fibheap
but actually useful Fibonacci Heaps
-
guzzle
A derivable trait for consuming key value pairs into structs
-
asyncapi
aims to provide data structures that represent the AsyncAPI specification easily deserializable with serde
-
hamt-rs
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell
-
tree-experiments
Experiments with tree-like data structures
-
pi_phf_map
phf_map
-
batbox-range
Helpers for working with ranges
-
final
Wrap a value in a type that does not give out mutable references
-
include-lua
that allows the embedding of a lua source tree into a Rust application binary
-
ttgraph_macros
Proc-macros for TTGraph
-
seq
The module 'seq' provides the lightweight, generic sequence container 'Seq' for unmovable data and is embedded into the program during compile time
-
street_index
small utility crate for working with road name / street indexing for cartographic purposes
-
priority-set
A no_std Priority Set
-
arraylike
trait for using arrays without needing const expressions
-
explicit-discriminant
Macro for enforcing enum discriminants
-
rs-bucket-filter
Skips slow scans using cache, bloom filter,
-
atom_table
Assign easy-to-handle typed IDs to large, hard to handle things like strings
-
jmt-blake3
Jellyfish Merkle Tree based on BLAKE3 hash function
-
vortex-flatbuffers
Flatbuffers definitions for Vortex types
-
indexmap-rmw
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
tadm
A collection of algorithms and data structures wrote out while reading The Algorithm Design Manual book
-
bytes_to_type
facilitate byte conversion to specified types using macro generation
-
fcsd
Front-coding string dictionary
-
ransel
rank/select succinct data structures
-
stl-rs
STL like features in idiomatic rust
-
sorting-vec
Sorts a vector using a btreemap
-
Xorfilter
No alloc membership approximation
-
sparse_set
sparse set data structure
-
btree_monstousity
a code port of BTreeMap but with comparator functions
-
bufferring
Ring buffers for Rust
-
dynamization
Fast insertion for static containers
-
unsized-stack
Fast heterogeneous / unsized stack
-
map-trait
Generic Map trait
-
collection_macros
Collection of macros for collections
-
extended-collections
An extension to the collections in the standard library with various data structures
-
pegitan
A bunch of random algorithms library
-
simple-octree
octree implementation written in Rust
-
structurray
Easy psuedo-array generation for database optimization
-
pair_macro
Create types consisting of the same type values such that Pair, Triplet, and so on
-
power_map
A map with finite key and fixed size
-
prefix-tree
A map and set interfaces using trie data structure
-
dyobj
improved version of the ECS pattern
-
kodiak-sets
manage generic sets supporting unique features
-
slotmapd
orlp/slotmap fork where serialization cycle doesn't change observable behavior
-
stacking
using a stack datastructure in rust
-
kurve
Adjacency list graph data structure
-
retrace
Safe, generic rollback log with predictable latency
-
generic-arrayvec
Interop between the arrayvec and generic_array crates
-
quickphf
Runtime code for static data structures based on the PTHash perfect hash function
-
deqmap
A double-ended queue with optional keys
-
mmap_json_file
parse, count, filter JSON files using memory mapped io library
-
store-interval-tree
A balanced unbounded interval-tree in Rust with associated values in the nodes
-
bloom
Fast Bloom Filter and Counting Bloom Filter implementation
-
fixed-queue
no_std, no_alloc, use [T; N]. support
Vec/VecDeque/History -
rimu-ast
A data structure template system
-
bytes
Types and traits for working with bytes
-
ropey
A fast and robust text rope for Rust
-
recasting
traits for one-to-one recasting of values in data structures
-
bit-long-vec
Vector with fixed bit sized values stored in long
-
grafferous
graph library with a focus on generic data in nodes
-
linked_list_c
Safely work with c compatible linked lists
-
inspector
General purpose inspection for popular data structures
-
indexed_json
Index json files like a database
-
neighborgrid
A 2-D grid datastructure with easy to use iterators and adjacent cell methods
-
hashable_rc
Hashable wrappers for reference countings
-
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!
-
pokeapi-model
Data structures for PokéAPI v2
-
reservoir-buf
Dead simple interning
-
simple-tree
Create, edit and iterate over tree structures
-
terms
Tree terms and patterns data structures
-
an-rope
an rope for large text documents
-
tyght-map
A static type map implementation
-
kermit-algos
Kermit, the Leapfrog Triejoin algorithm with associated data structures
-
flat_enum
Expand nested enum into flattened enum
-
twice-cell
Like
once-cell, except you set the value twice -
cycle_map
Implementations of bi-directionally accessible hashmaps
-
last-git-commit
wrapper arround git2-rs to get info about the last commit. Useful for when you want to show the git hash in a program.
-
btree_dag
A generic DAG (undirected graph) data structure
-
hashed
type you can convert any hashable type into and still do equality checks on
-
pq-bincode
A wrapper crate of queue-file for bincode serializable structs
-
lightning-containers
A set of lock-free data structures
-
sliced
A segmented vector for iterating over slices
-
murmurhash64
MurmurHash2 (64bit version)
-
wheelbuf
wheelbuffer crate offers a ringbuffer-like structure without a read pointer, making multiple reads of a buffer possible. The store behind the buffer is flexible and can be a static array…
-
indexed_bitvec
An indexed bitvector with (hopefully) fast rank and select operations
-
to_any
Auto derive ToAny trait for any structure
-
sortedlist-rs
A fast sorted list data structure in rust
-
stackvector
StackVec: vector-like facade for stack-allocated arrays
-
const-vec
Vec-like data structure with immutable push method
-
bytestruct
parsing bytes into structs
-
altdeque
An alternative deque implementation
-
hamt
Purely functional hash array mapped tries
-
fallacy-hash
fallible hash collections
-
rbtset
A set based on a RB-Tree for efficient operations
-
btree_network
A generic network (undirected graph) data structure
-
simple-bitrange
manipulating bit ranges which is common when working with IC registers
-
flowerbloom
fast bloom filter implementation with thorough documentation and tests
-
mucell
A cell with the ability to mutate the value through an immutable reference when safe
-
single_byte_hashmap
HashMap for storing singular bytes as keys
-
clampf
Clamped floating-point types
-
congruence
closure
-
vec-2-10-10-10
A 32-bit vector, where 2 bits are dedicated for alpha, and 30 bits are dedicated for color. Compatible with GL_UNSIGNED_INT_2_10_10_10_REV vertex attribute format.
-
blfilter
Bloom filter implementation using farmhash
-
st_ring_buffer
A fixed-size String implementation using a ring buffer
-
queueue
Queue-like data structures used in rCore
-
thincollections
Alternative implementations for vector, map and set that are faster/smaller for some use cases
-
sliding_window
A fixed size, heapless sliding window
-
cinnabar
graph algorithms and data strctures
-
ommui_data
OMMUI data structures
-
local_vec
fixed-capacity vector allocated on the stack
-
dimension_shiftable_buffer
A dimension shiftable buffer
-
immer-rs
A wrapper around the C++ library immer for persistent datastructures
-
map-of-indexes
A compact key-value map for unique but not dense indexes
-
recollection
implementations and reimplementations of common data structures and algorithms, and other personally commonly used utilities
-
butils
shared by software included in BSuccinct
-
provenance
Container structures that generate key upon insertion that only works with the map that generated it
-
lobby-queue
Const-size queue-like data structure
-
stack-stack
stack-allocated stack
-
sac
A macro for constructing collections
-
nom-midi
Parse a simple midi file into data structures using nom
-
subset-map
A map where the keys are subsets of an initial set of elements
-
parity-hash
A collection of fixed-size byte array representations
-
tampon
Contains SAFE Rust functions, macro and trait to serialize / deserialize data structure and/or object and generate buffer
-
closures
Abstraction for seperating code and state in closures
-
arith
containers with arithmetics
-
string-err
String error type
-
gentrix
that adds the Matrix typed using generics that is basically a wrapper around a 2D Vector
-
bucket
Offers a very simple container for any value without mutation
-
simple_trie
array backed trie
-
nanoset-py
A memory-optimized wrapper for Python sets likely to be empty
-
prust-lib
Persistent & Immutable Data Structures in Rust
-
ttl-queue
A queue that drops its content after a given amount of time
-
bloomy
Bloom filter using only two hash functions
-
bigsi_rs
A in-memory implementation of a BIGSI-like data structure
-
alo
ALO means At Least One. It could contain any number of item like
Vecbut it does not heap allocation if it contains only one item -
noindexmap
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
big_enum_set
creating sets of enums with a large number of variants
-
pinned-queue
Queue-like data structure whose elements can never move
-
gvec
Very simple implementation of generational indexing for vectors written in Rust
-
hashmap_union
Allows the union and intersection of hashmaps
-
cacaos
Core library for CACAO traits and data structures
-
tapa-trait-serde
A collection of Tapalogi's reusable crates
-
trashmap
A HashMap and HashSet that operate directly on hashes instead of keys, avoiding rehashing
-
compressed-sparse-fiber
Compressed sparse fiber implementation for Rust
-
another_radix_trie
Rust built radix tree library
-
boxed_array_ringbuffer
A ring buffer of fixed size, that uses a boxed array as storage, therefore avoiding re-allocations when converting from Vec or to VecDeque
-
doubly-linked-list
double link list
-
many-to-many
creating many-to-many data structures with the ability to query either side, useful for applications such as pubsub. Like a fusion between
bimapandmultimap. -
cli_tree
A CLI tool to generate a tree of user defined nodes
-
ego-binary-tree
Binary tree API built by wrapping ego-tree
-
svec
Dart-style list in Rust
-
flashtext
algorithm to search and replace keywords in given text
-
banyan-utils
work with banyan trees
-
safer-bytes
safe, non-panicking wrappers around the 'bytes' crate
-
routee-compass-core
The core routing algorithms and data structures of the RouteE-Compass energy-aware routing engine
-
leonardo-heap
Heap structure supporting fast in-place partial sorting
-
feature-set
User defined feature set
-
im_interval_tree
An immutable data structure for storing and querying a collection of intervals
-
yuuang_dominators
null
-
empty-collections
Correct-by-construction empty collections
-
ngds
Rust bindings for AVFounation
-
trips
generic triple store written in Rust
-
traitgraph-dimacs-io
Functions to read and write graphs in DIMACS format
-
simple-binary-tree
binary tree view representation
-
bipbuffer
Simon Cooke's Bip-Buffer
-
flow-graph
A representation of a graph data structure for flow-based programming
-
plum
Probabilistic data structures for rust
-
mitsein
Strongly typed APIs for non-empty collections, slices, and iterators
-
btree_graph
A generic graph data structure
-
rustgym
solutions
-
locale-decoder
Parser and data structure for dealing with locale strings
-
splay
native implementation of a Splay Tree for Rust. Splay Trees are self-balancing binary search trees which adapt dynamically to lookups over time to allow common access patterns to frequently have better than log(n)…
-
gtrie
Generic trie implementation with a support of different key and value types
-
crdt-list
Abstract CRDTs for lists
-
unempty
Non-empty data structures for Rust
-
sortbuf
Data structure for sorting large numbers of items
-
algotrees
VERY early stage project to implement a library of algorithms and data structures in Rust. It has very little features and only supports one data structure (binary trees) at the moment…
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it's own. Very similar to Slab.
-
trie-generic
A trie with generic content
-
branchless
Algorithms and data structures designed to maximize performance on superscalar processors
-
index_graph
Graph library that only stores indexes from a base array
-
nanobox
NanoBoxoptimization: store small item on stack and fallback to heap for large item -
moonlight_collections
Collections for Rust
-
ninja-files-data
Core data structures for ninja files
-
batbox-cmp
Traits & functions related to Ord
-
lazy-array
An array where entries are lazily initialized in any order
-
persistent_rope
An immutable persistent rope data structure
-
maybe-cell
An UnsafeCell optionally containing a value, with the state externally managed
-
vsf
Versatile Storage Format
-
stringz
A way to use strings in generic paramters
-
grafana-dashboard
grafana import/export data serializable structures
-
pathtree
An immutable tree data structure for fast path operations
-
hubs
The horribly unsafe buffer structure
-
dogma
Dogma.rs
-
petitset
An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap
-
faex
A fast and efficient Compact Data Structures Library
-
indexvec
Simplified copy of rustc's index crate
-
unrecurse
Helper crate for rewriting your recursive code in iterative way
-
simple-stack
linked list-based implementation of the Stack data type
-
digger
A trait for extracting data from recursive data structures
-
mini-linked-list
A package containing a minimal i32 LinkedList implementation
-
phf_macros
Macros to generate types in the phf crate
-
serde_fs
[De]serializing data structures as files
-
static-bytes
Bytes for embedded devices
-
batching-queue
An Israeli Queue implementation
-
flexible-string
A stack heap flexible string designed to improve performance
-
pulz-bitset
bitset implementation
-
littlechestnutgames-trie
A generalized trie implementation for quick prefix searching
-
winvec
Windowed Vector (TTL) Collection for Rust
-
compacts
compact data structures
-
kvptree
a lightweight library for sending data around
-
watermark
watermarking set for in-order insertions
-
ax_banyan
Persistent indexable tree data structure
-
sorted-list
SortedList data structure which allows mapping an Ord key to multiple distinct PartialEq values
-
trie_map
A trie with good iterator support backed by a hashmap
-
tree_multiset
A tree-based multiset for Rust
-
mut-binary-heap
Enhanced version of std::collections::BinaryHeap that supports increase and decrease key, max, min, and custom-order heaps
-
qlrumap
A HashMap with an LRU feature
-
const-size-flatten
Flatten and FlatMap with constant inner iterator size
-
xsl-rs
A simple library
-
pointer-value-pair
A pair of a pointer and a small integer packed into a pointer-sized object
-
smol_str
small-string optimized string type with O(1) clone
-
priority-matrix
A matrix that supports per-row, per-column and whole-matrix maximum key queries
-
option_vec
Vec<Option<T>>-like container
-
const-arrayvec
A vec-like type backed by an array on the stack
-
ord-by-set
providing a weakly ordered multi-set with compile-time configurable ordering scheme
-
small_vec2
Vector on the stack or heap need nightly rustc
-
lupine
A bloom filter using FX Hash with Kirsch and Mitzenmacher optimization
-
tree-rizzen-yazston
Tree Library using the Any trait for data
-
siebencorgie/jakar-tree
-
stacked_type_map
Compile time map of any type
-
iostream
the project is rust io stream.you can easily use it to manipulate files stream and memory stream
-
event-queue
crates.io için bir paket nasıl hazırlanırın ele alındığı öğrenme amaçlı modüldür
-
querable
Quer(y)able data structure implementation
-
rankmap
rust hash table supporting key ranking
-
const-buffer
A fixed-capacity memory buffer allocated on the stack using const generics
-
linked_lista
LinkedList data structure
-
one-stack-vec
OneStackVec could contain any number of item like
Vec, and it does heap allocation only when it contains more than one item -
any_key
Dynamically typed keys for associative arrays
-
unflatter
unflatteris a Rust library providing extension traits for flattening and unwrapping nested structures, including nestedOptionandResulttypes. It simplifies working with deeply… -
binary_tree_zy
binary tree
-
lineup_rust
queue implementation in Rust. This is a learning and a hobby project and is not intended for production use.
-
generic-json
Generic JSON traits
-
dogged
Persistent vector, similar to Clojure
-
trait-based-collection
A trait-based collection library that implement different data structures using the same trait
-
calf-vec
Small copy-on-write arrays, essentially combining
SmallVecandCow -
blocked-vec
A vector of byte blocks behaving like files
-
packed_str
Store immutable strings in a single packed allocation
-
bitmaptrie
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
-
velect
A Vec with item / index selection
-
collections-more
Common data structure and algorithms for rust-lang to complete the already excellent std::collections
-
rimu-meta
A data structure template system
-
containers-rs
'Collections' interfaces for describing objects that contain other objects
-
sn-trie-proofs
Starknet Transaction Trie Proofs
-
default-vec
A specialized vector that has a default value
-
loaf
Why have a slice when you can have a loaf?
-
indexed-vector
that implements vector container that can be indexed with specified function
-
bitsets
BitSet implementations: Dense, Compressed, Memory-Mapped, and Roaring
-
tibitset
bitset replacement for HashSet
-
id_cache
A cache data structure which generates sequentially-assigned ids for unique values
-
justly
justified containers
-
intrusive-containers
intrusive data structures
-
array-ops
Automatic method implementations for array data types
-
freezable
immutable data
-
byte_trie
A compressed trie based on bytes with some weird child node bucket sizes
-
stack-buf
Vector-like facade for arrays allocated entirely on the stack
-
valued
Describe your data in terms of basic data structures. Get serialization and other facilities for free
-
phf_mac
Compiler plugin for perfect hash function data structures
-
holodeque
Array- and slice-backed double-ended queues in 100% safe Rust
-
kvstructs
General basic key-value structs for Key-Value based storages
-
cseq_benchmark
The program for benchmarking compact sequences and bitmaps
-
scell
A smart container for objects in recursive data structures
-
functional_vec
Owning versions of mutable Vec methods
-
twilio-data
Twilio API data structures
-
gtfs-translations
Reads GTFS translations.txt into structures
-
shared_bytes
Owned string and byte slices
-
clouseau
A query language for inspecting Rust data structures at runtime
-
sequence_buffer
Sequence buffer data structure implementation
-
dimsum
multi-dimensional array library
-
mutuple
Replace items in Python's immutable tuples
-
uvector
access two slices as a single continuous vector
-
opt_arrayvec
Vector-like container with fixed capacity, using options instead of stored length
-
dynvec
DynVectype that acts like a vector to store any datatype -
dynstr
A string implementation optimized for manipulations
-
html-types
HTML Data structures
-
string32
A string that is indexed by u32 instead of usize
-
init_trait
A small helper trait to simplify the initialisation of 'indexable' data structures
-
mrslac
sparse matrix data structures
-
ring_queue
A double-ended queue implemented using a vector that reuses space after elements are removed
-
kermit-iters
Kermit, the Leapfrog Triejoin algorithm with associated data structures
-
capillary
HashMap-like storage of key-value pairs, but allowing for step-by-step (partial) search of value
-
cranelift-entity
Data structures using entity references as mapping keys
-
raw-vec
A Raw utility for managing contiguous heap allocations
-
stable-bloom-filter
A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams
-
aximate
core data structures and utilities
-
vizz
creating GraphViz/DOT visualizations of Rust data structures
-
maybe-string
newtype wrapper that represents a byte vector that may be a valid UTF-8 string
-
sif-rtree
immutable, flat R-tree
-
enum-map-derive
Macros 1.1 implementation of #[derive(Enum)]
-
dsll
Fast Thread Safe Doubly Sorted Linked List
-
fera-graph
Graph data structures and algorithms
-
flat-multimap
A multimap and multiset implementation using a flattened hash table
-
toboggan-kv
abstraction layer over multiple KV stores
-
hff-core
Hierarchical File Format: core structure
-
slice-deque
A double-ended queue that Deref's into a slice
-
adjacency-list
Adjacency List and Adjacency Graph
-
vortex-dict
Vortex dictionary array
-
hoop
Fixed ring buffer that allows non-consuming iteration both ways
-
immutable-seq
Immutable sequence data structure
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
lfbs
Lock-free stack with batched pop
-
alloc-checked
Collections that don't panic on alloc failures
-
flattree
A series of functions to map a binary tree to a list
-
sqa-bounded-spsc-queue
A bounded SPSC queue (temporary version so I can publish sqa-engine)
-
priority-queue-rs
Priority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by…
-
key_set
KeySet representing concepts of All, None, Some(list), and AllExceptSome(list), with basic set calculations (intersection, difference, inverse)
-
slice-cell
A
Cell<[T]>-like mutable slice, that allows slice-like APIs -
unstorable
An interface for requiring that a type is only used on the current stack frame
-
eitherq
Queue which support two different types
-
slicedvec
A segmented vector for iterating over slices
-
hashmap_vec
A HashMap with lists a values
-
binary_search_tree
Binary search tree implementation
-
elastic-array-plus
Elastic vector backed by fixed size array
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
ati
Introduces the
Attrait, which allows collections to be indexed byu|i{8,16,32,64,128}andisize. Supports Python-like negative index, where -1 is last element. -
recursion-schemes
cache-aware stack safe recursion (this is the really haskell brained one)
-
graph-arena
Collection type to store immutable graph structures efficiently
-
abi_stable
For doing Rust-to-Rust ffi,writing libraries loaded at program startup
-
lighter
Macro for rewriting string matches as tries
-
datastructures
A variety of data structures for learning purpose
-
prio-queue
priority queue implemented as a heap stored in a Vec
-
smallvec-stableunion
Fork of the crate smallvec. Uses unions in stable rust. Please note that it can only store Copy types. No functional differences apart from that.
-
gvc-sys
graphviz rust bindings
-
vortex-schema
Vortex file schema abstraction
-
fast-btree
A fast B-tree implementation ported from tlx library
-
flit
Bloom filter backed by xxHash
-
low-map
A convenient wrapper around a vector of options
-
embedrs-bytes
Types and traits for working with bytes
-
csgo-gsi-payload
Data structures for CSGO Game State Integration
-
pyrpds
Python Wrapper for Rust Persistent Data Structures
-
compressed_map
'Static functions': compressed maps with the keys removed
-
keyed
Implement comparison traits by specifying a key
-
quetta
Immutable, reference-counted strings for rust
-
immutable-avl
An Immutable map and set implement for rust based on an AVL tree
-
immutable_string
Immutable Single Instance Strings for Rust
-
comprehend
Python like list, set and hashmap comprehensions via macros
-
quarkrs
A collection of small life improvements for rust
-
prima
Generic 2D library used to handle graph structures and basic geometry
-
two_three
A two-three (2-3) tree implementation in Rust. Includes a map and set interface
-
randsort
A sorting library with an optimal complexity of O(n) (!!) by randomly sorting Vectors until they are sorted
-
stacked
Stack-allocated data structures. This was a good learning experience, and these container types work well, but in the end, I was not able to beat the performance of Vec
-
tdf_utils
such as tree
-
atlist-rs
LinkedList which is allowed to insert/remove element by immutable iterator.Adding, removing and moving the elements within the list or across several lists does not invalidate the iterators or references…
-
const_queue
A stack-only, no_std queue using const generics
-
eclectic
Experimental collection traits
-
flat-veb
Fast implementation of vEB trees without internal allocation
-
enum-set
A structure for holding a set of enum variants
-
gavl
A fast implementation for a map and a set using an AVL tree
-
doubly
linked lists in rust
-
std_collection_traits
Abstraction of operations in std collection types
-
simple-vec-collections
Collections implemented using Vec
-
stable_node_set
An ordered set with handles to values
-
ringvec
ring buffer implementation based on a vector
-
rs-collections
generic collections (no dependency on std)
-
stonks
Sets that allow borrowing while inserting entries
-
rbloom
efficient and minimalistic bloom filter
-
fp-collections
An alternate collections library for rust
-
arae
Cursed data structures
-
tournament_tree
A tournament tree library
-
ordered-vecmap
Ordered map and set based on vectors and binary search
-
mapro
A tiny macro library for creating std::collections
-
poison
writing poisoned types
-
handlebox
A map-like collection that reuses unused keys
-
vortex-zigzag
Vortex zig zag array
-
array_stump
A data structure mixing dynamic array and sorted set semantics
-
vortex-datetime-dtype
Vortex datetime extension dtype
-
texcraft-stdext
Rust data structures and algorithms used in the Texcraft project
-
im-rope
Unicode strings backed by RRB vectors
-
radixdb
a radix tree data structure for in memory or zero copy on disk storage
-
vortex-sampling-compressor
Vortex compressor that uses statistical sampling
-
triple_arena
Regular, Chain, Surjection, and Ordered Arenas supporting non-Clone types, deletion, and more
-
vortex-fastlanes
Vortex fastlanes arrays
-
cursorvec
Cursored vector container
-
kudzu
concurrent, grow-only data structures
-
bloomy-rs
Fast bloom filter implementation
-
heapq
Priority Queue with scoring function
-
token_deque
A double-ended queue backed by a vector that allows access to interior values
-
algostru
Algorithms (algo) and Data Structures (stru)
-
lifetimed-bytes
Bytes, but with attached lifetime
-
history_stack
A collection of containers that support generic history tracking mechanisms
-
bitset-fixed
Bitset for DP
-
louds
LOUDS implementation for Rust
-
geen
Hashed based Accumulators
-
fral
Functional random-access lists
-
selmr
Package to create and use Simple Explainable Language Multiset Representations
-
mexset
Implementing a set with MEX support
-
cons-list
An immutable singly-linked list, as seen in basically every functional language
-
smolbox
Like a Box, but small objects are stored on the stack
-
sealingslice
A mutable slice that can seal its initial part off from mutability, and hand out the sealed parts as immutable references
-
symbolmap-trait
A trait for generic implementation of symbol tables
-
lenses
An optics library loosely inspired by Julien Truffaut's Monocle
-
bintrie
A performant binary trie data structure that doesnt store data or keys
-
ast2str-lib
pretty-printing ASTs and other recursive data structures
-
j2ds
A small collection of data structures not found in the standard library
-
bytebufrs
A ring buffer for bytes implementing io::Read and io::Write
-
bagofholding
collection types. Efficient data structures that look bigger on the inside.
-
ziku-pds
probabilist data structures
-
cedarwood
efficiently-updatable double-array trie in Rust (ported from cedar)
-
negatable-set
Wrapper for sets that allows full boolean operations including negation
-
persistent-list
A singly-linked persistent thread safe list
-
dsu-tree
A non-invasive disjoint-set-like data structure implementation
-
plant
Tree data structures
-
linked_lists_rs
various data structures using linked lists in rust
-
const_enum_map
Get const value from enum handle
-
allehanda
Miscellaneous data structures and algorithms
-
data-structures
data structures crate in rust, WIP
-
dense_bitset
A variably sized, heap allocated, dense bitset implemented using no
unsafecode -
tennis
data structures
-
sixarm_collections
Collections for HashMapToSet and BTreeMapToSet as trait extensions. By SixArm.com.
-
nd-slice
Wrapping
std::slices to represent n-dimensional arrays