-
hashbrown
port of Google's SwissTable hash map
-
bitvec
Addresses memory by bits, for packed collections and bitfields
-
indexmap
A hash table with consistent order and fast iteration
-
phf
Runtime support for perfect hash function data structures
-
num
A collection of numeric types and traits for Rust, including bigint, complex, rational, range iterators, generic integers, and more!
-
half
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
ropey
A fast and robust text rope for Rust
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
bit-vec
A vector of bits
-
bit-set
A set of bits
-
slotmap
data structure
-
rangemap
Map and set data structures whose keys are stored as ranges. Contiguous and overlapping ranges that map to the same value are coalesced into a single range
-
ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
rpds
Persistent data structures with structural sharing
-
roaring
A better compressed bitset - pure Rust implementation
-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
hdrhistogram
A port of HdrHistogram to Rust
-
bimap
Bijective maps
-
im
Immutable collection datatypes
-
enum-map
A map with C-like enum keys represented internally as an array
-
generic-array
Generic types implementing functionality of arrays
-
tinystr
A small ASCII-only bounded length string representation
-
scroll
A suite of powerful, extensible, generic, endian-aware Read/Write traits for byte buffers
-
zerovec
Zero-copy vector backed by a byte array
-
crdts
Practical, serializable, thoroughly tested CRDTs
-
tinyvec
tinyvec
provides 100% safe vec-like data structures -
rowan
generic lossless syntax trees
-
generator
Stackfull Generator Library in Rust
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
string-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
frunk
developers with a number of functional programming tools like HList, Coproduct, Generic, LabelledGeneric, Validated, Monoid, Semigroup and friends
-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
either
The enum
Either
with variantsLeft
andRight
is a general purpose sum type with two cases -
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
radix_trie
Generic radix trie data-structure
-
wide
help you go wide
-
croaring
Rust wrapper for CRoaring
-
modular-bitfield
Allows to easily define bitfield types with modular building blocks
-
elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
smartstring
Compact inlined strings
-
guppy
Track and query Cargo dependency graphs
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
yrs
High performance implementation of the Yjs CRDT
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
enumset
creating compact sets of enums
-
multimap
A multimap implementation
-
ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
bcs
Binary Canonical Serialization (BCS)
-
histogram
A collection of histogram data structures
-
bloomfilter
Bloom filter implementation
-
smallbitvec
A bit vector optimized for size and inline storage
-
arraydeque
A ring buffer with a fixed capacity, which can be stored on the stack
-
thin-vec
A vec that takes up less space on the stack
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
fixedbitset
bitset collection
-
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
-
spade
Delaunay triangulations for the rust ecosystem
-
cita_trie
Modified Patricia Tree (aka Trie)
-
weedle2
A WebIDL Parser
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
phf_codegen
Codegen library for PHF types
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
bitmaps
Fixed size boolean arrays
-
hecs
A fast, minimal, and ergonomic entity-component-system library
-
range-set-blaze
Integer sets as fast, sorted, integer ranges with full set operations
-
dlv-list
Semi-doubly linked list implemented using a vector
-
bytes-utils
Additional utilities for working with the bytes crate
-
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.
-
intervallum
Generic interval and interval set library
-
narrow
Apache Arrow
-
linked_hash_set
HashSet with insertion ordering
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
imbl
Immutable collection datatypes
-
egg
egraphs
-
any_vec
Type erased vector. Most operations can be done without type knowledge. Mostly zero overhead.
-
smallbox
Small Box
optimization: store small item on stack and fallback to heap for large item -
hashbag
An unordered multiset implementation using a hash bag
-
nuid
A highly performant unique identifier generator
-
ecow
Compact, clone-on-write vector and string
-
nonempty-collections
Correct-by-construction non-empty collections
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
csaf-walker
work with CSAF data
-
gix-traverse
gitoxide project
-
bv
Bit-vectors and bit-slices
-
ph
data structures based on perfect hashing
-
hdf5
Thread-safe Rust bindings for the HDF5 library
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
orx-split-vec
An efficient constant access time vector with dynamic capacity and pinned elements
-
ringbuffer
A fixed-size circular buffer
-
v_frame
Video Frame data structures, originally part of rav1e
-
queue-file
lightning-fast, transactional, file-based FIFO
-
keyed_priority_queue
Priority queue that support changing priority or early remove by key
-
diff-struct
A trait for diffing and applying diffs to types
-
hibitset
Hierarchical bit set structure
-
array2d
A fixed sized two-dimensional array
-
fpdec
Decimal fixed-point arithmetic
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
crop
A pretty fast text rope
-
ordered-multimap
Insertion ordered multimap
-
sqrid
Square coordinates and grid-like arrays, with zero dependencies, in a single file
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
circular-buffer
Efficient, fixed-size, overwriting circular buffer
-
modql
Model Query Language support
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
log-once
Collection of helper macros for logging some events only once
-
trie-root
In-memory patricia trie operations
-
array-init
Safe wrapper for initializing fixed-size arrays
-
range-collections
Sets and maps of ranges, backed by smallvec
-
bitfield-struct
Struct-like procedural macro for bitfields
-
immutable-chunkmap
A fast immutable map and set with batch insert and update methods, COW operations, and big O efficient implementations of set and merge operations
-
binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps
-
array-macro
Array multiple elements constructor syntax
-
bittle
Zero-cost bitsets over native Rust types
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
portgraph
Data structure library for directed graphs with first-level ports
-
bounded-vec
Non-empty rust Vec wrapper with type guarantees on lower and upper bounds for items quantity
-
grid
Dynamic generic 2D data structure
-
id_tree
creating and modifying Tree structures
-
caches
popular caches (support no_std)
-
cc-traits
Common collection traits
-
simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
file_test_runner
File-based test runner for running tests found in files
-
vec_map
map based on a vector for small integer keys
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
-
trees
General purpose tree data structures
-
algorithm
about algorithm data structure, now has lru/lru-k/lfu/slab/rbtree/roaring_bitmap/timer_wheelss, 关于算法常用的数据结构
-
lib-sokoban
Sokoban: compact, efficient data structures packed into contiguous byte arrays
-
rsdict
Fast static rank and select data structure
-
pi_slotmap
Slotmap data structure
-
broccoli
broadphase collision detection algorithms
-
value-trait
Traits to deal with JSONesque values
-
counter
package to count generic iterables
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
jumprope
fast rope (fancy string) library built on top of Skiplists
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
blas-array2
Parameter-optional BLAS wrapper by ndarray::Array (Ix1 or Ix2)
-
phf_shared
Support code shared by PHF libraries
-
index_vec
Newtype-style helpers for
Vec
andusize
-
newtype-uuid
Newtype wrapper around UUIDs
-
avro-rs
working with Apache Avro in Rust
-
docker-compose-types
Deserialization and Serialization of docker-compose.yml files in a relatively strongly typed fashion
-
orx-linked-list
An efficient and recursive singly and doubly linked list implementation
-
vers-vecs
A collection of succinct data structures supported by fast implementations of rank and select queries
-
tskit
rust interface to tskit
-
trust-graph
trust graph
-
spatialtree
A fast and flexible generic spatial tree collection (Octree, Quadtree, etc)
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
skiplist
in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
btree-slab
A memory compact Slab-based B-tree implementation
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
intmap
Specialized HashMap for u64 keys
-
sucds
Succinct data structures in Rust
-
zerofrom
trait for constructing
-
process_mining
Process Mining library for working with (object-centric) event data
-
tracker
A macro to track changes on structs
-
iso7816
Types for ISO 7816
-
merkle-cbt
generating efficient Merkle tree and combined Merkle proof based on complete binary tree
-
differential-dataflow-master
An incremental data-parallel dataflow platform
-
loro
high-performance CRDTs framework. Make your app collaborative efforlessly.
-
rc-u8-reader
A tiny implement for reading
u8
data from a reference counted instance -
simple-grid
2d-grid structure
-
cordyceps
Mycelium intrusive data structures
-
json_dotpath
Dotted path access to nested JSON objects (serde_json::Value)
-
ra_ap_tt
TBD
-
owning_ref
creating references that carry their owner with them
-
array-concat
Macros for concatenating const arrays
-
beach_map
slotmap
-
ego-tree
Vec-backed ID-tree
-
xor_name
Xor Type
-
gix-commitgraph
Read-only access to the git commitgraph file format
-
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
gix-diff
Calculate differences between various git objects
-
manganis
Ergonomic, automatic, cross crate asset collection and optimization
-
idlset
Fast u64 set operations library
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
deep_causality
Computational causality library. Provides causality graph, collections, context and causal reasoning.
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
fqdn
FQDN (Fully Qualified Domain Name)
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
polytype
A Hindley-Milner polymorphic typing system
-
typed-index-collections
Typed index version of Rust slice and Vec containers
-
gpt_disk_types
GPT (GUID Partition Table) disk data types no_std library
-
range-set
Smallvec-backed containers of sorted integer ranges
-
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.
-
walker-common
Common functionality for SBOM and CSAF walker
-
enumoid
Enum Indexed Containers
-
ffi-convert
A collection of utilities to ease conversion between Rust and C-compatible data structures
-
equivalent
Traits for key comparison in maps
-
iset
Map and set with interval keys (x..y)
-
bridgetree
A space-efficient Merkle tree designed for linear appends with witnessing of marked leaves, checkpointing & state restoration
-
list-fn
A generic lazy list
-
basic_trie
Trie implementation in Rust
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
metatensor
Self-describing sparse tensor data format for atomistic machine learning and beyond
-
entity_data
A container for entity component data
-
bonsai-bt
Behavior tree
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
baby_shark
Geometry processing library
-
rt_ref
Internal
Ref
types forrt_ref
andrt_vec
-
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
. -
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…
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
csvenum
Generate code for enums with associated constants from a .csv in your command line
-
c_vec
Structures to wrap C arrays
-
warg-transparency
transparency data structures
-
tree-ds
manipulate tree data structures
-
hvec
A Vec-like structure that can store different types of different sizes contiguous with each other in memory
-
min-max-heap
An efficient, double-ended priority queue
-
jaggedarray
Multidimensional jagged array
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
cactus
Immutable parent pointer tree
-
shared_vector
Reference counted vector data structure
-
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. -
static-files
help automate static resource collection
-
uluru
fast, LRU cache implementation
-
ra_ap_ide_assists
TBD
-
boa_interner
String interner for the Boa JavaScript engine
-
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…
-
string
A UTF-8 encoded string with configurable byte storage
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
typeid_prefix
that implements a type-safe version of the TypePrefix section of the
TypeID
Specification -
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
gtfs-geojson
converter for GTFS to GeoJSON formats
-
xot
Full-featured XML tree library for Rust
-
flatcontainer
A flat container representation for Rust
-
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
test-assembler
A set of types for building complex binary streams
-
chat-prompts
Chat prompt template
-
validit
Validate data structures internal state
-
more_collections
Additional collections not found in std::collections
-
polars-ops
More operations on Polars data structures
-
simd_aligned
Safe and fast SIMD-aligned data structures with easy and transparent 'flat' access
-
dcl_data_structures
Data structures for for deep_causality crate
-
data_reader
A data loading library for data scientist
-
pasture-core
A framework for working with point cloud data
-
chronologic
Time constraint reasoning (scheduling...)
-
slice_ring_buf
A ring buffer implementation optimized for working with slices
-
roadmap
model a project roadmap as a directed acyclic graph
-
drain_filter_polyfill
current nightly implementation of Vec::drain_filter, copypasted out for use on stable
-
flatk
Flat layout abstraction toolkit
-
bao-tree
BLAKE3 verfiied streaming with custom chunk groups and range set queries
-
oxidd-manager-index
Index-based manager implementation for OxiDD
-
kbs-types
Rust (de)serializable types for KBS
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
melda
Delta-State JSON CRDT
-
slabmap
HashMap-like collection that automatically determines the key
-
bitm
bit and bitmap (bit vector) manipulation
-
validated
The cumulative sibling of
Result
andEither
-
optional
supplies a number of Option-like primitive types
-
garnish_lang_simple_data
Data implementation for garnish runtimes using simple list of variants
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
cdylib-link-lines
Collection of link-lines useful to build correct cdylibs on targets
-
ux-primitives
Graphics Primitives for Angular Rust
-
golomb-coded-set
BIP158 Golomb-Coded Set data structure
-
weak-table
Weak hash maps and sets
-
cedarwood
efficiently-updatable double-array trie in Rust (ported from cedar)
-
valkyrie-ast
Strong typed abstract syntax tree of valkyrie language
-
dary_heap
A d-ary heap
-
mzpeaks
representing peaks in mass spectrometry data
-
converge
Layered configuration, can be expressed in a single line of code. The
Converge
trait merges instances of structures into a new instance of a structure. TheConverge
trait can be derived… -
any-rope
A fast and robust arbitrary rope for Rust. Based on Ropey.
-
prost-unwrap
A procedural macro for prost-generated structs validation and type-casting
-
cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
binary-util
A panic-free binary utility crate to read/write binary streams over the wire
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
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.
-
vecmap-rs
A vector-based map and set implementation
-
ordered
A wrapper for adding arbitrary partial/total order to a type
-
xml-builder
Easy and highly-configurable XML builder/writer
-
mitsein
Strongly typed APIs for non-empty collections and views
-
undo
An undo-redo library
-
hrtb-lending-iterator
A lending iterator trait based on higher-rank trait bounds (HRTBs)
-
typed_floats
Types for handling floats with type checking at compile time
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
arca
Various utilities used in my crates
-
number-general
A generic number type for Rust which supports basic math and (de)serialization
-
honeycomb-core
Core structure implementation for combinatorial maps
-
ambient_element
Element is a React-inspired virtual tree library for the Ambient runtime
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
lockerroom
Readers-writer access to individual cells of your collection!
-
pyinrs
type library that is as easy to use as Python built-in types
-
ndarray-ndimage
Multidimensional image processing for ArrayBase, the n-dimensional array data structure provided by ndarray
-
ordsearch
A data structure for efficient lower-bound lookups
-
flat_spatial
Flat spatial partitionning algorithms and data structures
-
datafrost
Data format and acceleration structure management
-
easy-tree
efficient tree structure library for Rust with recursive traversal
-
bc-envelope
Gordian Envelope for Rust
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
podded
Zero-copy types for constraint environments
-
dyn-slice
&dyn [Trait] implementation, inspired by a Reddit thread
-
fiftyonedegrees
A wrapper around the 51Degrees device detection C library
-
short-uuid
generate and parse short uuids
-
cve
Mappings for parsing the CVE JSON files
-
ndstruct
Structures for N-dimensions
-
extindex
Persisted immutable index
-
bondrewd
Bit-Level field packing with proc_macros
-
aliasable
Basic aliasable (non unique pointer) types
-
bevy_spatial
tracking bevy entities in spatial indices
-
rdf-types
Data-structures and traits definitions for RDF
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
slice-dst
Slice-based custom DSTs
-
heapsz
calculating the heap usage of a data structure
-
ciborium-io
Simplified Read/Write traits for no_std usage
-
disjoint
Fast and safe implementation of the disjoint-set data structure
-
cw-semver
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
ofdb-boundary
Serializable, anemic data structures for accessing the OpenFairDB API in a type-safe manner
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
mmdb
A std-collection-like database
-
rt-pods-client
Official Client for RtPods
-
minimizer-iter
Iterate over minimizers of a DNA sequence
-
flat-tree
Series of functions to map a binary tree to a list
-
variant-rs
VARIANT support for Rust. Clean, idiomatic handling of WinAPI/COM results.
-
epsg
EPSG Coordinate Reference System tools & data
-
tinyset
Size-optimized sets
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
ascent-byods-rels
data structures for Ascent relations, made possible by Ascent's BYODS feature
-
plain
A small Rust library that allows users to reinterpret data of certain types safely
-
binary-tree-view
A binary tree visualization application built in Rust
-
primitive_fixed_point_decimal
Primitive fixed-point decimal types
-
pstd
parts of Rust std library ( different implementations, features not yet stabilised etc )
-
validiter
Iterator adapters for validating iterations
-
qutee
A quadtree implementation
-
space
providing abstractions for spatial datastructures and search
-
phf_generator
PHF generation logic
-
edtui-jagged
A jagged array data structure for the edtui editor
-
tagged-pointer
Platform-independent space-efficient tagged pointers
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
trk-io
TrackVis (*.trk) reader and writer
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
vart
An immutable versioned adaptive radix trie
-
stacked_errors
high level error propogation with programmed backtraces
-
smallstr
String-like container based on smallvec
-
shortguid
Short URL-safe Base64 encoded UUIDs
-
pdatastructs
probabilistic data structures
-
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
fenwick-bit-tree
Slighly over-engineered FenwickTree implmentation
-
fixed-macro
Macros for creating fixed-point constants for types in the
fixed
crate -
btree-range-map
B-tree range map implementation
-
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…
-
ball-tree
K-nearest neighbors
-
i_shape
iShape is a compact and efficient library specifically designed for representing 2D data structures using IntPoint
-
keyvi
key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
-
dot2
generating Graphviz DOT language files for graphs
-
alot
A forbid-unsafe, generational slot map with usize-sized IDs
-
svd-rs
A CMSIS-SVD base structures
-
slabigator
A linked list that doesn't do dynamic memory allocations
-
sized-chunks
Efficient sized chunk datatypes
-
odht
hash tables that can be mapped from disk into memory without the need for up-front decoding
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
zhifeng_impl_barnes_hut_tree
implements Barns-Hut Tree for accelerated N-body force calculation
-
endpoints
A collection of data structures for the OpenAI-compatible endpoints
-
vrm-spec
VRM data structures
-
microkelvin
tree traversal over annotated data structures
-
range_map_vec
range map data structure backed by a Vec
-
kempt
Ordered collection types with no unsafe code and no_std support
-
identity-diff
Diff
trait to compute and merge data structure differences -
gctree
cache-friendly, graph-like, arena-allocated datastructures
-
starlark_map
Map implementation with starlark-rust specific optimizations
-
ttgraph
Typed/Transactional Graph container
-
delay_map
HashMap collections whose entries expire after a given time
-
iso7816-tlv
tools and utilities for handling TLV data as defined in ISO/IEC 7816-4
-
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.
-
spacetimedb-data-structures
Assorted data structures used in spacetimedb
-
historian
a high performance zero-config histogram implementation
-
orx-selfref-col
SelfRefCol
is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees -
azalea-inventory
Representations of various inventory data structures in Minecraft
-
broomdog
A type-erased map with 'indefinite loanership'
-
ssd-data
A service and data description format + a code generator based on rhai scripts and templates
-
hidreport
HID Report Descriptor and HID Report parser
-
enum_meta
Add metadata to Enum Variants
-
emap
A map with a fixed capacity and integers as keys
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
yrs-kvstore
Generic persistence layer over Yrs documents
-
orx-fixed-vec
An efficient constant access time vector with fixed capacity and pinned elements
-
async_load
Functionality to trigger GMS2 async events from Rust
-
numeric-array
Wrapper around generic-array that adds efficient numeric trait implementations
-
prefix-sum-vec
Compressed storage for highly repeating elements, with
O(log n)
lookups -
smallbitset
series of allocation free sets capable of holding small integer values
-
ibuilder
Interactive builder for Rust types
-
fingertrees
Immutable persisten finger trees
-
forest-ds
secure tree structure
-
ninjabook
A lightweight and high performance orderbook
-
rtree_rs
R-tree for Rust
-
reconcile
A reconciliation service to sync a key-value map over multiple instances
-
b3-stable-structures
A collection of data structures for fearless canister upgrades
-
uintx
Unaligned unsigned integers with exact size in memory and arithmetic operations for them
-
f3l_search_tree
3D Point Cloud Library
-
meminterval
interval-tree in Rust made to store memory mappings
-
unordered-pair
A tuple struct representing an unordered pair
-
unionfind
A union find library made for building type inference engines. Can be used as general purpose datastructure.
-
lru-slab
Pre-allocated storage with constant-time LRU tracking
-
colibri
Rust data structures for Jitsi Meet Colibri messages
-
pas
strided slice
-
blart
adaptive radix tree packaged as a BTreeMap replacement
-
graphplan
planning algorithm from Avrim L. Blum and Merrick L. Furst in Rust
-
adflib
handle amiga disk files
-
imbl-sized-chunks
Efficient sized chunk datatypes
-
gridly
managing fixed-size 2D spaces
-
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…
-
ex3-ic-stable-structures
A collection of data structures for fearless canister upgrades
-
stack-queue
Heapless auto-batching queue
-
evento
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
adapton
programming abstractions for general-purpose incremental computations
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
vector
The package provides a vector database allowing for efficient search of nearest neighbors
-
bit_ops
Common bit-oriented operations on primitive integer types with a focus on
no_std
andconst
compatibility. Unlike other crates that provide tooling to create sophisticated high-level types with bitfields… -
cantrip
Practical extension methods for standard Rust collections
-
pact
Compact and streamable data format that works anywhere--from web apps to robots
-
isx
Traits for checking certain conditions of values
-
search_trail
manager of variables that can save and restore their values
-
sculk
handling various data found in Minecraft's NBT files
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
field_access
Dynamically access struct fields
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
farmfe_core
Core types and data structures for farm
-
pgdb_to_struct
CLI application to generate Rust struct files from PostgreSQL database tables
-
ladata
& modular data model
-
ndim
N-dimensional array for numerals in Rust similar to NumPy
-
value_pool
implements a ValuePool struct that makes the creation of self-referential data structures easier and safer
-
scapegoat
Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.
-
augurs-core
Core data structures and traits for the augurs time series library
-
HArcMut
mutable arc
-
leetcode-trees-rs
Tree Node LeetCode problems
-
statiki
Static friendly data structures
-
quickselect
基于rust的选择算法
-
etwin_dinoparc_store
Dinoparc store implementation
-
stack-map
constant-size associative container for building higher-level data structures out of
-
populated
Collection types that are guaranteed to be populated (i.e. non-empty). Based on std::collections types.
-
signvec
Vector implementation for fast, sign-based manipulation of dynamic collections
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
voxcov
Write something
-
hotel
Collection Data-structure to associate values with keys
-
lurk-elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
school_library
structures to manage school-related data, including students, classes, and schools
-
elkai-rs
solving travelling salesman problems (TSP) based on elkai (LKH 3)
-
gen_value
indexes and values with generations for vectors
-
eolib
A core rust library for writing applications related to Endless Online
-
fallback
A helper library to implement fallback mechaism
-
orx-pseudo-default
PseudoDefault trait allows to create a cheap default instance of a type, which does not claim to be useful
-
structures
collection data structures
-
mini_uuid
A small and URL-safe UUID crate for Rust
-
uid_store
Generate random uid strings containing letters, numbers, or base62 values
-
rust-box
odd set of tools for Rust programming
-
indexical
indexed collections
-
zond
standard rust collections but with collecting statistics
-
byteflags
A macro to generate bitflag-like structures with u8 flag values
-
persistence
A resizable, mutable array type implemented on top of mmap, providing persistence for arrays of data in memory
-
kg-tree
Generic object tree with Opath query language, similar to XPath
-
rs-snowflake
Rust version of the Twitter snowflake algorithm
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
digit-sequence
Sequence of u8 digits
-
strict
collections with strict bounds
-
heavykeeper
find the top-k elements of a stream of data
-
digits
Custom “numeric” incrementor without u64 MAX limit in size. Like a score flipper for a custom character set.
-
lox
Fast polygon mesh library with different data structures and traits to abstract over those
-
vsmtp-config
Next-gen MTA. Secured, Faster and Greener
-
compact-rc
Low-memory reference-counting pointers
-
smart_led_effects
A collection of effects for LED strips
-
xsd-types
XSD data types
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
product-os-authentication
Product OS : Authentication provides an entire pre-fabricated framework for user authentication and management including a set of APIs and a database structure of identities
-
linear_collections
Map and Set types backed by linear data structures
-
mset
/ multiset / bag implementation
-
tmflib
Interface library for processing TMF payloads
-
typemap_rev
A hashmap, but stores types as keys
-
grit-bitvec
BitVec, a vector type that can store fixed-width data with irregular bit widths
-
structured
Data structures to handle large, structured data
-
plane-2d
Continuous 2D data structure representing infinite 2d plane
-
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
-
balanced-tree-index
constant-time manipulation of a complete binary tree with a flat in-memory representation
-
cbsk_base
locked version cargo crates
-
constructivism
Simplify the construction of structured data
-
hypergraph
data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices
-
nslice
Structures for interpreting slices of variable length as arrays
-
arr-rs
arrays library
-
disjoint-sets
Three union-find implementations
-
medianheap
A median heap for keeping track of a running median
-
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
slack-blocks
Models + clientside validation for Slack's JSON Block Kit
-
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
metrix
metrics for application monitoring
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
rasn-smi
Data types for handling Structure for Management Information
-
exhaustive-map
An exhaustive map for types with finite inhabitants
-
hylo-fix
Fixed-point number types with Solana Anchor support
-
td-shim-interface
TD-shim metadata data structures and related functions. UEFI Platform Initializaiton data structures and accessors
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
rive-models
Revolt API models for the Rive ecosystem
-
ordinal-map
Ordinal trait to map values to integers and efficient maps and sets for such types
-
do-notation
Monadic do syntactic sugar
-
unsized-vec
Like Vec, but for unsized values
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
signalk
parse signalk maritime data
-
grit-data-prison
providing the struct Prison<T>, a Generational Arena that allows full interior mutability to each and every element
-
roussillon-type-system
A type system for a programming language
-
std-ext
Extend the standard library functionality
-
rooting-forms
Generates HTML (rooting) forms from structures
-
know
Framework for Rust
-
fav_utils
Fav's utils crate; A collection of utilities and data structures for the fav project
-
task-group
manage groups of tokio tasks
-
re_set-lib
Data structure library for ReSet
-
smodel
Symbol semantic modeling for Rust
-
enum-collections
Collections data structures optimized for Enum, initializable at runtime
-
libpna
PNA(Portable-Network-Archive) decoding and encoding library
-
mutable
keep track of changes in structures
-
matreex
matrix implementation
-
messaging
two-way messaging crate
-
sif-itree
immutable, flat interval tree
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
gix-hashtable
that provides hashtable based data structures optimized to utilize ObjectId keys
-
cbsk_mut_data
ref mut tool
-
chemrust-core
The core modules defining the flow and structs of data in computational chemistry routines
-
swimos_multi_reader
SwimOS Stream Aggregator
-
queues
Efficient FIFO Queue data structures
-
smallvec-wrapper
Macro and common structs to play with
smallvec
-
kvv-efa-api
Rust bindings for the KVV (Karlsruher Verkehrs Verbund) "EFA"-API
-
timer_list
A list of timed events that will be triggered sequentially when the timer expires
-
yy-typings
A collection of typings for GameMaker Studio 2 YY and YYP files
-
standard_card
A Lightweight Library for Efficient Card Representation
-
queued_rust
queue type for better privacy managment and data orginization
-
entity
that provides entity-like constructs
-
chinese-rand
Random generation of data structures in Chinese, using Rust
-
bicoro
Bidirectional co-routine data structures
-
heapless_matrix
efficient implementation of a matrix data structure in Rust. It offers functionality for creating, manipulating, and performing operations on matrices, such as transposition, summation, and multiplication.
-
super-struct
struct
ofRust
in the same way thatdict
ofPython
-
dayendar
advanced days calendar operations
-
extensions-rs
File extension types in Rust
-
dipa
dipa makes it easy to efficiently delta encode large Rust data structures
-
set_genome
A genetic data structure for neuroevolution algorithms
-
nimble-steps
Nimble Steps Collections
-
slablit
Literal for slab creation
-
lock_free_hashtable
Lock-free (almost) insertion only hashtable
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
garnish_lang
Single library for re-exporting and documenting all Garnish core libraries
-
subranges
manage non-interssecting integer intervals
-
iterable
collection like types
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
resizing-vec
An automatic resizing vector for data with linear increasing ids
-
cseq
compact sequences
-
awint
Arbitrary width integers
-
awid
Small, simple, universally unique identifiers
-
lim-bit-vec
Limited bit vectors
-
python-packed-resources
Manage data structures containing Python resources
-
canadensis_dsdl_frontend
Compiler front-end for the Cyphal Data Structure Description Language
-
bdk_electrum
Fetch data from electrum in the form BDK accepts
-
map-macro
Declarative macros for statically initializing collections
-
dup-indexer
Create a non-duplicated index from Strings, static str, Vec, or Box values
-
toolshed
Arena allocator and a handful of useful data structures
-
vec_extract_if_polyfill
Polyfill for Vec::extract_if
-
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.
-
civs
Controllably Increasing/Inflating VectorS
-
radicle-cob
Radicle Collaborative Objects library
-
lru-mem
An LRU cache implementation bounded by memory
-
pfds
Purely Functional Data Structures
-
akita
Mini orm for rust
-
json-number
JSON number parsing and storage
-
compact_strings
A more compact but limited representation of a list of strings or bytestrings
-
pipebuf
Efficient byte-stream pipe buffer
-
itybity
An itty bitty crate providing bit iterators and bit iterator accessories
-
msgpack_simple
Simplified, easy to use, pure Rust MessagePack implementation focused on handling dynamic data structures
-
aabel-identifier-rs
defines identifier behavior, such comparing them, or generating sequences of identifiers
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
trying
Basic trie crate
-
fm-index
FM index and its variant implementations for Rust
-
erased_set
A set of erased types
-
aleo-agent
Agent library to communicate with the Aleo Blockchain, following the Public Specification
-
tnaps
entity-component-system framework in Rust
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
nybbles
Efficient nibble-sized (4-bit) byte sequence data structure
-
regroup
regrouping arrays
-
ocpp_rs
Protocol implementation for Open Charge Point Protocol (OCPP) in Rust
-
cmsketch
A count min sketch implementation in Rust
-
ascent_base
support library for the ascent package
-
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
Ord
trait -
hit-data
Hierarchical Indexed Typed data structure
-
rc-writer
A tiny implement for writing data to a reference counted instance
-
oca-presentation
Lib providing struct for OCA presentation
-
vax-floating
VAX floating-point types
-
grdf
Generalized RDF graphs and datasets
-
cmus-status
structure cmus status data
-
ldtk_map
reading ldtk maps for usage in games
-
rustc_data_structures
Reuse rustc_data_structures for compiler_base
-
msg-store
A fast and light-weight message store designed to work as a priority queue in low hardware equiped devices
-
crio
An easy to use persistent data storage library
-
uptu_libs
A collection of libraries for my projects that I use often
-
dectree-rs
A decision tree implementation in Rust
-
cmdtree
(Rust) commands tree
-
sorted_vector_map
maps and sets backed by sorted vectors
-
panoradix
A generic map and a set, both backed by a Radix tree
-
amalgamator
A set/map like data structure that allows you to combine members together
-
keysymdefs
A collection of key symbol definitions
-
nary_tree
A vec-backed tree structure with tree-specific generational indexes
-
artie_common
Common Library for Artie Rust Projects
-
radix-heap
Fast monotone priority queues
-
collect-me
Additional collections not included in the Rust standard library
-
ndshape
fast linearization of N-dimensional array indices
-
maelstrom-base
Fundamental data structures used by all Maelstrom code
-
orbweaver
designed for effortless construction and analysis of graph data structures
-
oxrdf
providing basic data structures related to RDF
-
floating_bar
Representing rational numbers using the floating-bar number type
-
vec-entries
Entry API for iterating over and removing elements from a
Vec
-
purse
Bag data structure implementation in Rust
-
triangle_matrix
Triangle matrix indexing operations
-
mc-oblivious-ram
Implementations of Oblivious RAM data structures
-
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.
-
phf_mut
Perfectly hashed mutable containers
-
fast_collections
noheap zero copy collections
-
color-operators
Color data structures, converters, and arithmetic operators
-
enum2egui
derive macro that creates a set of egui ui databindings from arbitrary data structures. Supports egui v0.26
-
yyid
Yyid generator (random tokens like UUIDv4, but using all the bits)
-
threshold
data structures
-
point-nd
flexible no-std struct to model points on axes of any dimensions
-
cow_vec_item
Copy-on-write Vec, available on stable rust
-
map_vec
The Map and Set APIs backed by Vec
-
iowrap
Small helpers for using io::Read/io::Write
-
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
-
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
ord-collections
offering collections which are pre-sorted automatically
-
exact-covers
Knuth's algorithm for solving the exact cover problem with colors
-
rj
reactive json
-
billios
A soil library
-
deepmesa
fast Data Structures and Algorithms in Rust. Every data structure is hand crafted for performance, well tested and has an extensive API.
-
seen_set
HashSet that doesn't store values
-
debounce
Data structures and helpers for debouncing a stream of events: removing duplicate events occurring closely in time
-
cranelift-bforest
A forest of B+-trees
-
rust_twostack
Support for two-dimentional stacks for the Rust programming language
-
proxied
Unified proxy connection data structure
-
stash
An amortized
O(1)
table for cases where you don’t need to choose the keys and want something faster than a HashTable -
scoped_stack
A scoped stack data structure
-
sparse-merkle-tree
Sparse merkle tree implement in rust
-
indexset
A two-level BTree with fast iteration and indexing operations
-
commitlog
Sequential, disk-backed commit log library
-
eimage
processing image collections in 3D space
-
rs-tree-sitter-languages
Collection of Tree-Sitter parsers
-
text-style
Types and conversions for styled text
-
gecs
A generated entity component system
-
crater
Very generic containers including KD trees, fibonacci heaps, minmax heaps,
-
open-coroutine-timer
The time utils
-
arbitrary-chunks
An iterator that allows specifying an input array of arbitrary chunk-sizes with which to split a vector or array
-
mco-gen
Stackfull Generator Library in Rust
-
disk-ringbuffer
lock free on disk ringbuffer to be used in the implementation of Franz
-
suff_collections
Fast realization of suffix array and suffix tree
-
kv6
Collection of structs to allow reading of Ken Silverman's voxel formats
-
iceoryx-rs
Safe Rust bindings for Eclipse iceoryx - true zero-copy inter-process communication
-
typerat
Type-level rational numbers based on
typenum
-
wasmrs-frames
WasmRS RSocket frame decoding, encoding, and data structures
-
hydroperfox-smodel
Semantic modeling for Rust
-
bitworks
meant to provide easy to use bitsets with emphasis on safety
-
standing-relations
Standing relations over a shifting dataset optimized for 'feedback loop' scenarios
-
rtdlib
TDLib for rust
-
invade
reflect on Rust types and generate code
-
gix-pack
Implements git packs and related data structures
-
terrain-graph
Graph Library for Rust
-
hash_on_write
A wrapper for storing hash results to avoid running costly hash functions multiple times without modifying the value
-
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…
-
crdt_tree
Tree Conflict-free Replicated Data Type (CRDT)
-
cess-sp-porep
CESS Storage Proofs - Proofs of replication
-
word-dictionary
data structure for word mapping. It can be used for language translation.
-
redmaple
offers an oppinionated yet extremely flexible data modeling system based on events for backend applications
-
tree_by_path
A tree data structure featuring nodes addressable using a &Vec<usize> path and avoiding recursion and run-time borrow checking
-
sum
General-purpose sum types
-
baz-tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
opt_struct
Optional collections
-
minivec
A version of Vec that's only the size of a single pointer
-
adts
Common abstract data type traits and implementations
-
coca
Data structures with constant capacity
-
ju-tcs-tbop-24-bebidek-endpoints
providing head and tail functionality
-
plexus
2D and 3D mesh processing
-
nanotweaks-proc
moved to https://crates.io/crates/spread_macros
-
epoch32
32-bit Epoch with specified starting year
-
rk-utils
A collection of utility functions and data structures for rust
-
galemu
workaround for generic associated types (GAT) limited to lifetimes (GAL)
-
seoul
trait Isomorphism
-
sql-json-path
SQL/JSON Path implementation in Rust
-
enso-data
A collection of useful data structures
-
rosary
About Rose Trees
-
qualia
Basic semi-schemaless document store
-
rimu-parse
A data structure template system
-
arraystring
Fixed capacity stack based generic string
-
peapod
Ultra-compact storage for enums
-
idbag
A bag of u32 identifiers
-
codes-iso-639
This package contains an implementation of the ISO 639 (Parts 1, 3, and 5) Language Code specifications
-
river-ring-buffer
ring buffer implementation
-
find-all-the-kitty-cats-in-charlotte
A collection of crates for working with cats
-
swaybar-types
building swaybar status commands in rust
-
higher
Functors, Applicatives, Monads and other bad ideas
-
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…
-
ffi-toolkit
A collection of functions useful for working with the Rust FFI
-
pi_slot
lock free Slotmap data structure
-
chronofold
A conflict-free replicated data structure (a.k.a CRDT) for versioned text
-
sortedvec
a sorted vector that enables quick lookups
-
sbbf-rs
Split block bloom filter implementation
-
tea-core
Core data structures and traits for tevec
-
tensorism
Multidimensional arrays with bounds included in the type system
-
lodtree
help create octrees and quadtrees for chunked level of detail
-
kubizone-common
Typed Rust structures for representing partially and fully qualified domain names
-
smart_access
A minimalistic "lazy bidirectional pointer" framework
-
hextree
Location to value mapping
-
tree-flat
TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust
-
mipmap-1d
A small data structure to perform 1d-mipmapping (downsampling)
-
specs-hierarchy
Scene graph type hierarchy abstraction for use with specs
-
re_format_arrow
Format arrow data
-
qualomat_schema
Rust bindings for the *Qual-O-Mat* open data format for the german voting advice tool *Wahl-O-Mat*
-
tree-experiments
Experiments with tree-like data structures
-
construe
Compile-Time Growable Array: Vec & String for const!
-
recursive_reference
way to walk on recursive structures easily and safely
-
singlevec
Vec-like container optimized for storing only a single item
-
rexsgdata
Scatter-Gather Data Descriptors
-
loaded_dice
sampler for loaded dices, implementing the alias method
-
range_bounds_map
[
RangeBoundsMap
] and [RangeBoundsSet
], Data Structures for storing non-overlapping intervals based of [BTreeMap
] -
bgp-models
Structs and other building blocks for BGP and MRT related Rust projects
-
tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
try-lazy-init
Fallible lazy initialization
-
genmap
generational map data structure with no dependencies
-
vec-x
structure
VecX
to manage fixed-length arrays, supporting numeric operations and assignment operations betweenVecX
and scalar values -
pi_append_vec
Only supports append vectors, lock free
-
catalan
binary tree of n variables where the parent node represents a function and the child node represents a value
-
aabel-multihash-rs
extends Hasher trait. The added functionality allows users to get sequeces of hash values. It can be used inside of implementations of probabilistic data structures such bloom filter or count-min.
-
parallel_vec
A generic contiguous collection of heterogenous values
-
rust-3d
2D/3D library written in rust
-
algae-rs
A collection of abstract algebraic structures implemented in Rust
-
cnctd_smart_home
A collection of Smart Home APIs
-
grids
2D grid data structure for games
-
ast2str
pretty-printing ASTs and other recursive data structures
-
latestmap
latest map
-
swimos_errors
SwimOS Error Utilties
-
stdng
An enhancement for Rust standard library
-
im-pathtree
Immutable, path-addressable tree data structure
-
reunion
A generic implementation of the Union-Find w/ Rank data structure
-
ux-dx
3D Graphics Primitives for Angular Rust
-
atlv
Algebraic Tag Length Value encoding
-
im-lists
Persistent unrolled linked lists and vlists
-
ergo_avltree_rust
cryptographically authenticated dictionary based on AVL tree
-
treeflection
that provides reflection for tree structures
-
type-set
A set of heterogeneous types
-
pax-properties-coproduct
Static container for program-variable data structures and polymorphic components
-
tpntree
A N-dimensional generalization of region quad/oc-trees
-
risc0-binfmt
RISC Zero binary format crate
-
filetrack
persistent logrotated reading and other useful io things
-
dynamic_dict
A lightweight basic crate to create dynamically typed dictionaries
-
re_string_interner
string interning library
-
rep
A small tool for representation/class invariants
-
vec-option
A space optimized version of
Vec<Option<T>>
that stores the discriminant seperately -
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
merkle-cbt-lean
Special implementation of Complete Merkle Binary Tree for minimal memory footprint
-
hexarr
working with hexagonal grids
-
overtone
An API for creation and management of rich (as in rich-text) musical-ish projects
-
undo_2
Undo and redo done the right-way
-
membuffer
A very fast flat memory buffer used to deserialize at a fast speed
-
strawberry_fields
Consume, read, and mutate struct fields with an iterator-like api
-
modular-bitfield-msb
Allows to easily define bitfield types with modular building blocks. MSB-first version.
-
croaring-sys
Raw bindings to CRoaring
-
sharded
Safe, fast, and obvious concurrent collections
-
loro-rle
A internal library of loro for storing and manipulating run-length encoded data. Do not use it directly.
-
generational-indextree
Arena based tree structure by using indices instead of reference counted pointers
-
rive
ecosystem crate
-
sorbus
A tree manipulation library
-
sliding_window_alt
A structure that holds the last N items pushed to it
-
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…
-
datastruct
A pure-data structure builder
-
varlen
Ergonomic variable-length types
-
voxtree
A sparse voxel octree for rust & rust-gpu
-
tbytes
A tiny library for reading and writing typed data into buffers
-
anchors
async incremental computations
-
llist
Lisp-style singly-linked list
-
attr
attr
is 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 -
ux-dataflow
Data Processing Library
-
lsph
Learned Spatial HashMap
-
tracing-rc
Cycle-aware reference-counted pointers with a safe, simple api
-
dia-i18n
ISO 3166-1 and ISO 639 codes
-
type-erased-table
A column-oriented based raw data storage
-
mivim
-
cola-crdt
A text CRDT for real-time collaborative editing
-
identified_vec
Like HashSet but retaining INSERTION order and without
Hash
requirement on the Element type -
cbsk_log
log tool
-
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.
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
monitor-common
Basic data structure and algorithm of linux-monitor tool
-
bit-set-omnitool
A set of bits
-
moving_min_max
Tracking minimum or maximum of sliding windows
-
datazoo
Bitset and jagged array data structures
-
bstree-file-readonly
Query read-only binary-search tree file, supporting billions of entries in files of tens of GB
-
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).
-
vecdeque-stableix
Deque with stable index values
-
ioc
An Inversion-of-Control library in Rust
-
brownstone
building fixed-size arrays
-
bdaddr
Bluetooth Device Address
-
xsparseset
sparse set
-
ts_lib
A collection of functions I find useful for my projects
-
vector-map
VecMap<K, V>: a Linear Search with Map API
-
type-map
typemap container with FxHashMap
-
merkle
tree implementation with support for generation of inclusion proofs
-
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
bit-parallelism
Small integer specialized, word level, parallel algorithms and data structures
-
tinybox
Like
Box
, but with an optimization that avoids allocations for small data-structures -
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
-
bayesic
A string matching library similar to NaiveBayes but optimized for many small classifications
-
grid-tree
Pixel quadtrees and voxel octrees
-
bit-vec-omnitool
A vector of bits
-
histogram-sampler
Sampling from a distribution given by a histogram
-
table
A specialized map for storing values of varying types
-
kushi
A queue built for the Dango Music Player and Oden Music Bot
-
packbytes
Convert structures to and from packed representavises - byte arrays of fixed size that live on stack
-
write_x86_64
help you write x86_64 assembly code
-
fdec
A collection of macros for generating fixed-size fixed-point numeric types for Rust
-
viral32111-xml
XML parser crate for my Rust projects
-
ultragraph
Hypergraph data structure
-
prefix_dictionary
Data structure similar to a dictionary, but enabling search for prefixes
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
lookups
Improve the data retrieval operations for collections
-
slab_tree
A vec-backed tree structure with tree-specific generational indexes
-
lobster
A fast limit order book (LOB)
-
fenwick
tree: data structure that efficiently calculates prefix sums in a changing array of numbers
-
ofilter
fast thread-safe Bloom filter
-
tdb-succinct
succinct data structures used by terminusdb
-
ndtensor
n-dimensional tensor library for Rust
-
tongrams
Tons of N-grams
-
not-so-fast
data validation with derive macro
-
union-fn
Proc. macro for creating efficient "inline closures".
-
helgoboss-midi
Interfaces, data structures and utilities for dealing with MIDI messages according to the MIDI 1.0 specification
-
avl
A map and a set implemented with an AVL tree
-
value-log
Value log implementation for key-value separated LSM storage
-
code_location
UNMAINTAINED! Use std::panic::Location instead!
-
chronoflake
Generate unique IDs based on the Snowflake algorithm
-
big_unsigned_ints
Big Unsigned Integers ranging from U256 to U2048 using u64 arrays all under a fixed-size of 32
-
omango-util
Utililites
-
egui_suspense
Automatically show loading and error uis for egui
-
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.
-
make-message-bus
Generate a pub-sub bus for use in async applications
-
stupid_utils
that provides some simple and maybe stupid or useful tools
-
patricia_router
Radix Tree implementation for Rust
-
inplace-vec-builder
Build a vec from a vec, in place
-
range_union_find
A union-find data structure for ranges
-
contack
easy contact library
-
array_map
Map backed array for fixed size keys with O(1) performance
-
ref_kind
Different reference kinds
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
ware
middleware chains
-
cbsk_timer
rayon thread runtime
-
beehive
collections for 3D hexagonal maps
-
typed_index_collection
Manage collection of objects
-
tuplez
Tuples represented in recursive form
-
context-mapper
Single rust macro for generating different maps
-
array2ds
Package for handling sized 2d arrays in rust, without the usage of the keyword unsafe cuz why not
-
compare
Experimental comparators for collections to be generic over
-
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
type-rules
easily constrain a struct
-
flange-flat-tree
A tree that can be expanded by attaching new values to the node without mutability of the old ones
-
text-document
Text document structure and management
-
kg-utils
Various collections and utilities
-
twie
fast and compact prefix tries
-
rarena
Lock-free allocator and data structures based on ARENA
-
alt-std
Alternative Lightweight Std library for making small executables and shared objects
-
smallbytes
= SmallVec + impl BufMut (from the bytes crate)
-
vec-collections
Rust collections that are newtype wrappers around smallvec
-
insrcdata
Embed static data as source code
-
serde_single_or_vec
Type which can be deserialized from either a sequence or a single value
-
list_tools
一个自己研发的Vec<T>
-
fixedbitset-stack
A forked version of FixedBitSet that supports const generics
-
recursive_array
arrays using recrusive data structures to avoid limitations of the rust compiler
-
copy_arrayvec
Copy arrayvec, does what it says on the tin
-
fvm_ipld_kamt
Sharded IPLD Map implementation with level skipping
-
intervaltree
generic implementation of an immutable interval tree
-
landfill
Various types for dealing with on-disk data
-
streaming_algorithms
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
unicase_collections
Collection of UniCase datastructures
-
type-freak
Collection of typed data structures, trait operators and aliases
-
segment-tree
Quickly perform interval queries or modifications
-
rustc-ap-rustc_serialize
Automatically published version of the package
rustc_serialize
in the rust-lang/rust repository from commit 9a27044f42ace9eb652781b53f598e25d4e7e918 The publishing script for this crate lives at: https://github… -
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
fid
FID (Fully Indexable Dictionary) implementation for Rust
-
gtfs-translations
Reads GTFS translations.txt into structures
-
intervals-rs
intervals
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
bitlab
Extracting a range of bits from a binary data source
-
boolvec
A vector of boolean stored contiguously in memory
-
rytm-sys
Rust bindings for libanalogrytm
-
traduki
Integrate translated assets into your application or library
-
v9
A slim data engine for Data Oriented Design
-
treemap
Squarified Treemap algorithm
-
spaceindex
-
atree
An arena based tree structure with removal support
-
tf-semver
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
bit_mask_ring_buf
A ring buffer implementation with cheap indexing
-
light-curve-interpol
Interpolations tools for time series
-
fixed_bitmaps
A small crate implementing bitmap functionality around primitive Rust unsigned integers
-
range-mutex
A
Mutex<[T]>
-like type, that allows locking different ranges separately -
awint_dag
DAG
awint
functionality -
clap_flags
Collection of reusable flags for Clap
-
anylist
a list type for any type
-
generic_event_queue
generic event-queue API
-
dinvoke_data
Structures and data types definitions for dinvoke
-
minsize
Collections with a statically known minimum size (using const generics)
-
rutenspitz
А procedural macro to be used for testing/fuzzing stateful models against a semantically equivalent but obviously correct implementation
-
vartyint
Read & Write varint encoded integers
-
x12-types
Bindings for the ASC X12 EDI definitions
-
serde_either
set to enums to deserialize and serialize data that can either be string, struct or vec
-
rs-car
CAR v1 and v2 specifications
-
treez
A collection of useful data structures
-
novasmt
Storage-agnostic, highly ergonomic sparse Merkle trees
-
implies
A parser for logical formulas
-
traitgraph
Abstracting over different graph representations
-
pulz-arena
A generational arena allocator with compact generational indices
-
teardown_tree
A binary search tree that supports fast clone and delete-range operations
-
prefix_array
A generic container for searching on prefixes of keys
-
jsonmap
store values of multiple types value in one Map
-
truncate-integer
Truncate integers
-
shortlist
An efficient data structure to track the largest items pushed to it
-
tri-mesh
A triangle mesh data structure including basic operations
-
treesome
tree creation, manipulation, traversal and visualization
-
memvec
Memory-backed vector, not buffer. Designed for for mmap. Not MemMap, but MemVec!
-
tudelft-dsmr-output-generator
Companion library for the TU Delft Software Fundamentals individual assignment
-
bosque
A very fast in-place kdtree library
-
fns
add common fn, eg: debounce, throttle
-
dastral
Reduce boilerplate code, learn data structures & algorithms with Dastral
-
dade
data definition for Rust structures
-
committable
Keccak256-based structured commitments
-
etc-os-release
Parse /etc/os-release file
-
persist-o-vec
A Vec type that aims to have stable indices and memory location
-
twitter/rustcommon-time
getting current and recent timestamps
-
netlist
generic netlist data structure for VLSI design
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
slice-rbtree
A slice-based Red-black tree
-
netcrab
creating and exporting Petri nets
-
aversion
Versioned data structures with auto-upgrading
-
ndsparse
Sparse structures for N-dimensions
-
graus-db
A high-performance, thread-safe key-value embedded data store
-
syzlang-parser
Parse Syzlang language
-
bin-tree
Building Binary Tree
-
intsplit
splitting numeric types into their binary component arrays
-
fufu
-
data-stream
serialization library based on streams
-
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)
-
omnitool
A curated respository of algorithms and data structures. The libraries are included as forks of Rust codebases
-
sequence_trie
Trie-like data-structure for storing sequences of values
-
tan-lints
A collection of lints for the Tan Language
-
structre
Static-checked parsing of regexes into structs
-
art-tree
The Adaptive Radix Tree
-
staticsort
Implements a macro providing a compile-time quicksort function for arrays of any length, containing any primitive Copy type with a PartialOrd implementation
-
xio_base_datatypes
XIO base data structures
-
seq_watcher
A pair of structures for monitoring a stream of data for one or more sequences
-
simple_tables
An easy to use rust crate for creating table structures. Including macros for easily creating these table structures.
-
pvec
RRB-Tree based persistent vector implementation
-
chemrust-scanner
The core modules defining the flow and structs of data in computational chemistry routines
-
rudac
common data structures and algorithms
-
numas
multidimensional array for efficient computing
-
assoc
Treat vectors like associative arrays
-
gw2timers
Iterate and collect Guild Wars 2 map meta event times
-
liblet
learning about formal languages and grammars
-
nt-list
Compatible, type-safe, and idiomatic Rust implementations of Windows NT Linked Lists
-
lazy-seq
constructing lazily evaluated sequences
-
bitset-core
Straightforward, no-std compatible, simd optimized, BitSet API
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
object-collection
A collection that can store multiple values of types
-
linked-vector
A hybrid linked list and vector data structure
-
piece_table_rs
piece table data structure
-
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
rimu-value
A data structure template system
-
read-copy-update
locking primitive
-
data_tree
Hierarchical data tree with pathing and search support
-
froop
A functional reactive stream library for rust
-
slotmap-map
Slotmap data structure
-
bmap
A bitmap with an internal counter
-
orx-pinned-vec
PinnedVec
trait defines the interface for vectors which guarantee that elements added to the vector are pinned to their memory locations unless explicitly changed -
hedel-rs
A Hierarchical Doubly Linked List
-
compt
A complete binary tree visitor library
-
circular-queue
A circular buffer-like queue
-
sparsevec
Compress vectors using row displacement
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
wccg-models
WCCG Data
-
vbox
type erased Box of trait object
-
cliquers
Manage filesequences with a common numeric component
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
taskforge
Task management shared functions and structures for the taskforge family of tools
-
aph_disjoint_set
Disjoint set implementation with optimized memory usage and ability to detach elements
-
prust_core
encoding/decoding PUS-C packet data structures with ease
-
bktree
BK-tree datastructure
-
repc
APIs to calculate the layout of C types
-
large_int
An ease-of-use unbounded signed integer
-
sif-kdtree
immutable, flat k-d tree
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
arc-bytes
A reference-counted byte buffer
-
succinct_rs
Succinct Data Structures library for Rust
-
cvrdt-exposition
Understanding Convergent Replicated Data Types
-
st2-logformat
Adapter-agnostic definitions for data types used by ST2
-
distant-protocol
Protocol library for distant, providing data structures used between the client and server
-
rustupolis_server
using space tuples in fog computing
-
rsurf
A data structure providing range query filtering with Fast Succinct Tries
-
vecset
A vector-based sorted map, set and keyed-set implementation
-
succinct
data structures for Rust
-
lending-library
A key-value store that loans full ownership of items
-
statemachine-rs
A statemachine crate which have zero dependencies
-
inspector
General purpose inspection for popular data structures
-
kollect
Collections made ergonomic for gamedev usecases
-
range-map
Maps and sets implemented using ranges
-
atlas-rb-tree
A textbook implementation of a Red-Black Tree
-
whirlybird
generic type implementations for RedMaple library, that offers workflows for different events compatible with common contents like todos, blogs and etc
-
screech
A collection of helpers for handling audio data in real time
-
id_sys
data structures which can be marked such that they only work with similarly marked integer data types
-
loki-logger
A loki logger for the log facade
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
driftdb
A real-time data backend for browser-based applications (core library)
-
defaultmap
HashMap with an automatic default for missing keys
-
sbwt
Indexing sets of DNA k-mers with the spectral Burrow-Wheeler transform
-
temptree
Temporary trees of files
-
task-collection
Types for managing and waiting on groups of tasks
-
cast-rs
A collection of types cast for Rust
-
acme-types
Types for implementing ACME (RFC 8555) providers and clients
-
prototty_common
Definition of common ui elements and views for use with prototty
-
btree_experiment
implements a BTreeMap similar to std::collections::BTreeMap
-
dsa_sport
revision material for undergrads
-
multiset
Multisets/bags
-
smart-string
A collection of string types and traits designed for enhanced string manipulation
-
sidex
A format- and language-agnostic data structure and API definition language
-
terees
a collection of tree-like data structures
-
win-variant
that aims to provide a more ergonomic way of working with variants in winapi based projects
-
offset
Glorified offsets for arbitrary structures
-
myopic
A possibly bad lens library for Rust
-
dst
Data structures for DSTs
-
selmr
Package to create and use Simple Explainable Language Multiset Representations
-
hkalbasi-rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structures
in the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
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
-
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
retworkx
A python graph library implemented in Rust
-
field-ref
Field reference (like a member pointer to non-static data field in C++) for Rust
-
simple-canvas
generic 2 dimensional canvas struct
-
generic-btree
Generic BTree for versatile purposes
-
mut-rc
Temporarily mutable
Rc<T>
that decays intoRc<T>
-
system-config
storing application properties on disk
-
type-pools
A data structure to store values of multiple types
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
mc-oblivious-map
Oblivious Hash Map data structures on top of Oblivious RAM
-
sweeper
A foundation for Minesweeper implementations in Rust
-
eimage-io
IO operations for processing image collections in 3D space
-
dakv_skiplist
skiplist for dakv
-
restorable
An iterator adapter for saving and restoring iterator state
-
nested_containment_list
A data structure for efficiently storing and querying nested intervals
-
fwdlist
A simply linked (forward) list
-
RustyDSA
A libary for Rust data structure
-
dendron
Generic tree data structure
-
cdragon-prop
Work with BIN files used by Riot
-
corresponding
Move corresponding fields between structs
-
giftbox
A fun Rust crate called
giftbox
to help Rustlings learn and explore generics -
yptoscr
writing yptoscr
-
reactive-signals
dx-first scope-based fine-grained reactive system
-
neighborhood-diversity
computing the neighborhood diversity of simple, undirected graphs
-
rtlp-lib
This create provide structures to parse PCI TLPs
-
minimizer-queue
Fast computation of minimizers using a monotone queue
-
quadboard
Typed fixed-length buffers of chess pieces
-
serde_single_or_vec2
Type which can be deserialized from either a sequence or a single value
-
thot-core
Core functionality and types for Thot data management and analysis software
-
pointcloud
An accessor layer for goko
-
sparse_set_container
A container based on sparse set. Stable keys, O(1) lookup, cache-friendly iterations, and no hashing.
-
voml-collection
Collections for VOML
-
luthor
A collection of lexers for various languages/formats, and the tools required to build them
-
settrie
Fast subset and superset queries
-
fs-chunker
Break a file into a list of chunks
-
linear-map
A map implemented by searching linearly in a vector
-
wplot
Plot interface
-
takeable
Container type that allows for temporarily moving out of the container, or permanently moving out and invalidating the container
-
l6t-file
A part of l6t library: reading, writing and deconding for L6T IFF data
-
bitvector
in Rust
-
host-port-pair
Host-port pair type
-
modupipe
A modular and extensible ETL-like pipeline builder
-
cascara
TinyLFU cache
-
nibble_vec
Vector data-structure for half-byte values
-
shogiutil
A collection of tools to handle shogi data
-
to_markdown_table
An easy way to format any data structure into a Markdown table
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
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…
-
nanovec
Arrays and Vec-likes of small integers packed in an integer or two
-
kd-tree-rs
k-d tree
-
deltastruct
Allows defining deltas for tagged structs for later application
-
staticvec
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics
-
know_yaml
The Know Framework for Rust
-
hash-rings
Implementations of various hash rings
-
mih-rs
Multi-index hashing (MIH) for neighbor searches on binary codes in the Hamming space
-
granular-id
ID numbers with arbitrary precision
-
casbin-arangors-adapter
ArangoRs adapter for casbin-rs
-
evento-store
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
fervid_core
The core structures and utilities of fervid
-
kdtree-simd
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
-
espalier
Very simple flattened tree structure
-
nom-midi
Parse a simple midi file into data structures using nom
-
bitarr
A fast and efficient Rust implementation of a BitSet, supporting multiple backing stores
-
deepmesa-collections
A collection of data structures and algorithms designed for performance
-
densevec
Map like collection with usize indices that stores values contiguosly
-
id_collections
Index-oriented programming in Rust
-
hayami
general use symbol table
-
aterm
Annotated Terms data structure
-
nakadi-types
A connector for the Nakadi Event Broker
-
skog
Adobe's stlab::forest data structure
-
learn_together
Curated collection of lists of useful resources to learn Rust together
-
pciids
parse the pci.ids data file
-
ftree
A very fast fenwick tree implementation
-
crfsuite-sys
Rust binding to crfsuite
-
tc-value
TinyChain's representation of a value which can be collated and stored
-
bitvek
bit vector implementation
-
rdc
generating Java code from rust structs
-
b-tree
A persistent B+ tree using freqfs
-
multi_containers
Ergonomically work with multiple values per key
-
nested
A memory efficient container for nested collections (like
Vec<String>
orVec<Vec<T>>
) -
markov-generator
Highly customizable crate for building Markov chains and generating data from them
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
redox_simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
simple-undo
Easy to use undo-redo library
-
unflatter
unflatter
is a Rust library providing extension traits for flattening and unwrapping nested structures, including nestedOption
andResult
types. It simplifies working with deeply… -
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
-
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.
-
mine_sweeperr
Minimalist interface to manage the backed of a mine sweeper game
-
datastreams-rs
DataStreams container
-
processing_chain
set up processing chains of large amounts of data
-
union-find-rs
Disjoint-set forest implementation to support the union-find algorithm in Rust
-
boxing
cross-platform implementations for NaN and ptr boxes
-
chesspos
Basic structs for representing chess squares
-
upair
Unordered pair data structure
-
symbol_table
A symbol table that's fast, concurrent, and gives stable references
-
finite-automata
A collection of extendable finite automata with immutable state and transition data
-
goodreads
deserializing a Goodreads library export
-
another-option
option data type; useful when allocations are expensive
-
try-push
A trait for attempting potentially expensive actions
-
hicollections
C-liked Collections
-
routee-compass-core
The core routing algorithms and data structures of the RouteE-Compass energy-aware routing engine
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any string
-
lumberjack
Read and modify constituency trees
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
las
Read and write point clouds stored in the ASPRS las file format
-
vivalaakam_seattle_collection
Collection provider
-
parsable
A trait to easily parse data structures
-
walker-extras
Additional functionality for SBOM and CSAF walker
-
blocklist
The project is based on blocklistproject. It provides perfect hash map/set structures for fast lookup of blocklisted items.
-
relational_types
Manage relations between objects
-
empty_type
Tools to define and convert between types and their corresponding "maybe types"
-
errling
A collection of intrinsically useful errors
-
xsl-rs
A simple library
-
syntastic
Generic abstract syntax representation
-
mkargs
Build command arguments
-
index_many
A proof of concept for indexing an slice at multiple locations at once
-
gfa-reader
Reading gfa format v1
-
slotmap-fork-otter
Slotmap data structure - temporary fork for Otter
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
backtracking_iterator
generic iterator with an item history, capable of backtracking and forgetting
-
cfgmap
A special hashmap made with configuration in mind
-
keylist
Elixir keyword list in Rust
-
wrapping
slices and arrays
-
non_empty_continuous
Non-empty continuous collections
-
actions
Software without side-effects. Redo and Undo. Macro's.
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16
coordinates. -
dynsequence
Sequence-Like data-structure for storing dynamically sized types
-
hashcons
Hash cons'ing for compact representations of shared, immutable data structures
-
lanyard
UTF-8 C string types
-
rustifact_extra
Extra features for Rustifact
-
opt_vec
A wrapper around Vec<Option<T> that makes deletion fast
-
soa-vec
Vec-like API over a struct of arrays layout
-
dynprops
Creating and extending objects with typed dynamic properties
-
bb-qol
Small collection of quality-of-life functions
-
simple-rate-limit
Rate limit enforcement as simple data structures, no atomics
-
gsrs
Generic Self Referencing Struct
-
lz_diet
An AVL balanced Discrete Interval Encoding Tree
-
grove
A segment tree library enabling generic user-defined queries and actions on segments of your data
-
rt_vec
Runtime managed mutable borrowing from a vec
-
singletonThread
thread in a singleton
-
render_as_tree
visualizing tree data structures via text
-
changed
change detection
-
rolling-set
A first in first out set that never grows above a certain size
-
cds
Collection of Optimized Data Structures
-
slas
Static Linear Algebra System
-
bitvec_simd
bitvec with SIMD
-
jagged_array
Owned
[[T]]
-like 2D array where each row can differ in length -
tiny-test
tiny-test
is collection of functions simplifying test assertions in rust -
db_meta_derive
db-meta-derive is a wrapper around PostgresSOL using tokio-postgres
-
rolling_norm
Computes the rolling mean, variance, standard derivation and norm
-
weak-self
WeakSelf is simple way to have a Weak pointer to yourself
-
grafana-dashboard
grafana import/export data serializable structures
-
generational_token_list
A doubly-linked list backed by generational-arena
-
foxy_types
Types for
foxy
-
timer-queue
Pure, minimal, and scalable timers
-
folketinget-api-models
Autogenerated Rust structures based on the Danish Parliament's OData metadatafile
-
datastructures
A variety of data structures for learning purpose
-
leetcode-solutions
A collection of leetcode solution in rust
-
hash_table_datastruct
Adds a HashTable type, allowing to store values in a table with integer-indexed rows and hashable keys for columns
-
epoch-timestamp
Boilerplate collection for epoch timestamping
-
lightning-containers
A set of lock-free data structures
-
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
-
colours
Color types for different color models with conversions between it
-
hyperbitbit
data structure
-
ctxmap
A collection that can store references of different types and lifetimes
-
designal
Procedural macro for use with futures-signals
-
flatbuffers-owned
that enables a more flexible usage of FlatBuffers
-
usage
A convenient alternative to the newtype pattern
-
dsalgo
A package for Datastructures and Algorithms
-
nimrodshn-btree
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite
-
static_merkle_tree
Static Merkle Tree is dedicated for generating Merkle Root and Merkle Proof for a static list of items
-
funnel
data structure that makes it easy to read from multiple channels from a single source
-
simple-binary-tree
binary tree view representation
-
enum-tag
Proc. macro for generating enum discriminant types.
-
faex
A fast and efficient Compact Data Structures Library
-
bst-rs
Recursive & Iterative Binary Search Tree Implementations within Rust
-
priq
Array implementation of the min/max heap
-
quarkrs
A collection of small life improvements for rust
-
arbtree
A small library for general purpose tree data structures
-
collect_result
collecting an iterator of results into a result of a collection
-
woodland
Easy to use implementations of popular tree data structures such as Binary, Binary Search, AVL, Red-Black, and more
-
synthax
Synthesize syntax with quasiquoting plugins
-
path-value
Universal type and access property(s) by path
-
dyn_vec
A Vec<T: ?Sized>
-
inditech
A set of technical indicators for time series analysis
-
petal-clustering
A collection of clustering algorithms
-
swimmer
Thread-safe object pool type
-
prototty
Wrapper crate for frontend-independent prototty crates
-
bengbenge
inifity array for round-robin dns, beng, beng
-
autocomplete
Auto-complete feature using Trie data structure
-
triemap
Triemaps for Rust
-
partial
Optional monad with fake variant
-
stl-rs
STL like features in idiomatic rust
-
content-tree
An efficient data structure for compacted RLE data
-
hamst
Hash Array Mapped Shareable Trie
-
rocstr
An immutable fixed capacity stack based generic copy string
-
lazy-cogs
Lazy Cogs is a implementation of lazy clonable data structures
-
wayrs-protocols
A collection of Wayland protocols to use with wayrs-client
-
pinus
A prickly BTreeMap. You can insert through shared references and values are pin-projected.
-
granite
Generic backing storage framework for building data structures
-
cueue
High performance SPSC circular byte buffer with batch operations
-
zaplib_components
The widget toolkit for Zaplib
-
ensure
target state of an object
-
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
-
chainbuf
Fast chained buffers
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
cad_import
importing CAD data from different formats into a uniform in-memory structure
-
starbase-tools
A collection of tools created to help with ship building in the game Starbase by FrozenByte
-
entry_put_ext
Map entry extension for put operations
-
openfga_common
Common OpenFGA package, contains shared data structures
-
riblt
Rateless Invertable Bloom Lookup Table (RIBLT) data structure
-
applejack
Radix tree
-
hedge
An index based half-edge mesh implementation
-
get-many-mut
Stable polyfill for slice::get_many_mut
-
hilbert_curve_generator
A WIP Hilbert Space-Filling Curve Coordinate Generator
-
unique-id-collection
Collection with unique Id
-
pokeapi-model
Data structures for PokéAPI v2
-
simple-matrix
generic matrix library
-
proptest-recurse
Helper for defining mutually recursive strategies with proptest
-
ro
stuff read-only
-
milvus-sdk-rust
The official Milvus Rust SDK
-
one_way_slot_map
SlotMap with minimal restrictions on Keys and Values
-
puruda
Pure Rust DataFrame
-
tinyvecdeq
VecDeque
-like data structures -
l6t-symbolic
A part of l6t library: symbolic data model for different known devices
-
aggregate-map
Collect key-values pairs into a mapping from keys to collections of values
-
twilio-data
Twilio API data structures
-
scopegraphs-lib
A port of scopegraphs to Rust
-
multipath
split file path, like
/home/{user,admin}/file.txt
-
zngur-def
Data types that define the structure of a zng file
-
short-lease-map
A map collection optimized for brief internship of values
-
torro
A correct and easy-to-use BitTorrent library
-
mergle
A data structure with fast merging and comparison
-
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
-
win-idispatch
that aims to provide a more ergonomic way of working with idispatch in winapi based projects
-
run-loop
Run loop for thread, provide message post, deadline timer and future executor
-
zotero
Communicate with Zotero API
-
csgo-gsi-payload
Data structures for CSGO Game State Integration
-
batbox-approx
Approximate comparison
-
canadensis_bit_length_set
A bit length set type used to calculate data type sizes when processing Cyphal data structure description language files
-
arrsingh
A top level crate in the workspace
-
arc-swap
Atomically swappable Arc
-
ypwt
ypwang's personal toolbox
-
arc-string-interner
An efficient cuncurrent string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
weight-cache
A cache that holds a limited number of key-value-pairs according to a user defined criterion
-
fenny
working with Fenwick trees
-
collectable
Fallible, no_std-friendly collection traits
-
ljprs_async_pool
async-friendly pool data structure using tokio
-
bfield
B-field datastructure implementation in Rust
-
vec-dimension-shift
N-Dimension shift features for Vec<T>
-
bs
bitset with small-set (single-word) optimization
-
range-traits
Ranges related traits
-
bit-index
A little-endian zero-indexed bitstring representation
-
libreda-splay
Splay map and splay set data structures
-
ds-bst
Binary search tree implementation
-
id-pool
Create and recycle integer ids using a ranged pool
-
rotated-array-set
An ordered set supporting O(1) rank and O(√n) inserts and deletes
-
astack
offers a Stack data structure with fixed capacity capable of fast LIFO operations
-
visit_diff
Efficiently finding differences between data structures
-
ucd-trie
A trie for storing Unicode codepoint sets and maps
-
exosphere-core
Core crate for Exosphere
-
sum-queue
Queue struct that keeps a fixed number of items by time, not capacity, and allows to get summarized stats of its content
-
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).
-
paged
Read and create read-only paged database files
-
tcgeneric
Generic data types used internally by TinyChain
-
mori_parallel
parallel orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data…
-
struct_mapping
Token StructMapping for testing StructMapping implementations
-
protect
A protected data structure
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
graphstack
Graph-structured stack
-
vicardi
JSON VCardArray Generator that uses Serde
-
better_peekable
Create a Peekable structure like Rust's Peekable except allowing for peeking n items ahead
-
yagraphc
working with Graph data structures and common algorithms on top of it
-
optimistic_lock_coupling
A General Lock following paper 'Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method'
-
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.
-
anymap2
A safe and convenient store for one value of each type
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
bitint
Integer types that have a logical size measured in bits
-
hightorrent
High-level torrent library which supports Bittorrent v1, v2 and hybrid torrents
-
foba
A test crate
-
butils
shared by software included in BSuccinct
-
no_vec
modifying sized arrays
-
plurals
singular/plural forms, mostly in English
-
suffix_trie
Suffix trie for searching
-
pages
A dynamically-sized heap-backed data page. Comprises a user-chosen header and data array packed into a single allocation.
-
b_trees
Implementations for various binary trees including AVL tree
-
zallocators
Bringing Zig like allocators to Rust
-
libpaprika
read and generate Paprika recipe files and recipe collections
-
retaker
ecs implementation
-
anystruct
that provides traits for converting between JSON and Protocol Buffers (Proto) data structures
-
ommui_data
OMMUI data structures
-
aper
Synchronized state machines over WebSockets
-
index-map
A map with automatically generated usizes as keys
-
expire
data structure for data maybe expired
-
simid
Universally Unique IDentifier (UUID)
-
aoc-framework-utils
such as data types, algorithms and functions for aoc-framework-rs
-
aspiesolutions_core
core types used by many crates
-
arraylist
wrapper built on top of rust vector implementation. Taste like Java Arraylist, and intuitive to use like Python list and JavaScript array.
-
whistlinoak
Annotated even-arity trees backed by mmaps
-
lambda-apigateway-response
Response object for AWS Lambda with API Gateway
-
pure-hfsm
A finite state machine library with a clear separation between the machine definition and its changing state
-
traitgraph-algo
Graph algorithms based on the traitgraph crate
-
motivations
a collection of motivating messages
-
sbbf-rs-safe
Split block bloom filter implementation
-
ordered_hash_map
HashMap which preserves insertion order
-
hst-tw-images
working with Twitter profile images
-
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…
-
power_map
A map with finite key and fixed size
-
jec
My collection of general-purpose crates
-
mintaka-types
Mintaka Types
-
largeint
that supports large integer arithmetic
-
slots
Fixed size data structure with constant-time operations
-
tennis
data structures
-
openpgp-keylist
An OpenPGP Keylist data structure
-
typed_graph
Staticly typed graph library
-
phtm
Re-exports for common uses of
PhantomData
-
f1d2d2f924e986ac86fdf7b36c94bcdf32beec15
Test for XSS on docs.rs
-
cset
Fine-grained and reversible struct transactions
-
algostru
Algorithms (algo) and Data Structures (stru)
-
clouseau
A query language for inspecting Rust data structures at runtime
-
rand_map
A map that creates a random handle on insertion to use when retrieving
-
libflow
grouping network flow data
-
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
-
flatten_objects
A container that stores numbered objects. Each object can be assigned with a unique ID.
-
goya
morphological analyzer for Rust and WebAssembly
-
fn-map
Abstraction around HashMap. Uses closure to compute and store value.
-
om2
A set of classes generated from the OM2 RDF schema (mainly Unit)
-
raw-btree
Generic B-Tree implementation
-
swap-queue
A lock-free thread-owned queue whereby tasks are taken by stealers in entirety via buffer swapping
-
pati
Image data structure and format for the Patica editor
-
rusty_v8_m
Rust bindings to V8
-
handy
providing handles and handlemaps
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
hff-core
Hierarchical File Format: core structure
-
advancedresearch-higher_order_point
An experimental higher order data structure for 3D points
-
hashtree
A Merkle Tree implementation in Rust
-
temporary-annex
Helper for creating temporary annex on a collection
-
rustz
functional programming in Rust
-
break_array
For breaking array indexing
-
triskell
A tri-partite ring buffer
-
cursed-collections
Collections that (seem to) break Rust safety
-
jui_file
file tool
-
token-parser
parsing texts into data structures
-
multipeek
An adapter to peek at future elements in an iterator without advancing the iterator cursor
-
contextual
deal with data in context
-
kd_interval_tree
Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups.
-
rpos
Cursor Manager on Table
-
incremental-topo
Data structure to maintain an incremental topological ordering over a collection of values
-
motivation
A collection of motivating messages
-
chtholly
Tree, a data structure originated from CF896C
-
ziku-pds
probabilist data structures
-
mnemyme
Encode and decode integers based on the EFF large word list
-
lazyfunctions
A collections of functions for lazy people, or highly efficient programmers
-
foliage
Abstract syntax tree for first-order logic with integer arithmetics
-
simple_bitfield
Create bitfields with the same memory structure as integers using a simple macro
-
atomic_swapping
An arbitrary type atomic storage with swap operations
-
rs-arboretum
A study in trees
-
k2_tree
A space-efficient representation of sparsely populated bit-matrices
-
app_properties
reading application properties from a file
-
naq_domain
Domain library for nordic air quality (naq) that defines shared domain data structures
-
geogrid
Manipulate geographic data on a grid
-
tf2-types
a collection of types for tf2
-
rust_release_artefact
Safely extract installable files from Rust release artefacts
-
plant
Tree data structures
-
unempty
Non-empty data structures for Rust
-
cdl-list-rs
A circular doubly linked list implementation using Rc<T> and RefCell<T>
-
bitboard64
A 64-bit bitboard useful for chess programming
-
cosmic_undo_2
Undo and redo done the right-way
-
sparse-bin-mat
A sparse implementation of a binary matrix optimized for row operations
-
lib_code
Add two integers
-
dlist
List data structure based on AVL tree. It can store elements which have dimension and quickly search for elements by distance from 0.
-
prometheus-tokio
A collection of tokio runtime metrics for prometheus consumption
-
dd_statechart
A Data-Driven implementation of Harel Statecharts designed for high-reliability systems
-
version-lp
a version struct library for use with version comparing, and wildcard resolving
-
symbol-map
Memory-efficient mapping from values to integer identifiers (AKA a lexicon or symbol table), with options for fast bidirectional lookup
-
cistring
A string type that preserve case, but compares insensitiveley
-
arrsingh-lists
A test crate to test publishing
-
blobary
place for blobs
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
precedence-net
Create and analyse precedence networks
-
ABtree
AVL and Btree for rust
-
nolan
Commitlog/WAL Implmentation and Powerful Abstractions
-
u64_array_bigints
biginteger library based on u64 arrays
-
grafite
Range Filter
-
lignin
A virtual DOM structure, primarily for web use
-
cacaos
Core library for CACAO traits and data structures
-
total-maps
Maps where every possible key has an associated value
-
gapbuf
Generic gap buffer
-
rudy
Judy array implementation in pure Rust
-
tree-index
Index a flat-tree
-
byte-sequence
A little marco that creates structs to be used as byte sequences (for ApiKeys, SessionIds and so on)
-
mashmap
A flat HashMap that supports multiple entries per key
-
doublets-decorators
Decorators for doublets
-
bucket_queue
A Bucket Queue data structure that can be used as a Priority Queue
-
pl-hlist
support for heterogeneous lists (known as
HList
s), which are functional, tuple-like, strongly-typed data structures that can contain elements of differing types -
generic-cursors
A generic way to mutably traverse acyclic recursive data structures
-
foxy_utils
Common types and utilities for
foxy
submodules -
zang
A test crate which is also a collection of some libraries which I tend to use for hobby projects
-
gridd-euclid
euclid-compatible grid data structure (forked from Frosh_VII's gridd)
-
stackbt
A small collection of crates for game AI
-
btreemultimap
A multimap implementation with range support
-
rs-bush
Bush data structure
-
Project2
Implementations of red black tree and AVL tree
-
rb_tree
A Red Black Tree implementation in Rust
-
nullvec
Rust nullable vector, which can contain null(missing) values as element
-
secured_linked_list
A cryptographically secured and provable linked list
-
cell-grid
fixed-size 2d grid container suitable for
no_std
game development -
aximate
core data structures and utilities
-
tinystr-raw
Raw string-to-integer conversions for tinystr
-
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.
-
mini-linked-list
A package containing a minimal i32 LinkedList implementation
-
gpt_disk_io
GPT (GUID Partition Table) disk IO no_std library
-
num-bigint
Big integer implementation for Rust
-
diskdata
A catalog of on-disk data structures
-
flats
flattens nested structures into a flat single dimension map
-
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
-
sandpile
do sandpile computations
-
luka
working with graphs
-
gml_parser
A fast and simple Graph Modeling Language (GML) parser
-
arc-atomic
atomic pointer to an
Arc
-
rust-fp-pfds
A Functional Programming Library in Rust, Purely Functional Data Structure
-
rimu-eval
A data structure template system
-
binary_sort_tree
二叉树的new,insert,del,search等方法
-
standards
A collection of standards for international trade facilitation
-
rust_fixed_width
that allows for easier manipulation of fixed width files allowing for the ability to name fields and such using specs
-
flowcom
collection of UI components for floem
-
ternary-tree-wasm
A simplified Wasm binding to ternary-tree crate
-
icu-data
International Components for Unicode (ICU) data in Rust structures
-
mind-tree
Organize your thoughts in a tree-like structure
-
vec-strings
Store any string efficiently in an immutable way
-
sss_fft
FFT and IFFT for arrays and iterateable collections with modular algorithm interface
-
discrete_range_map
DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap
-
very_simple_trie
A Trie or prefix tree is a specialized tree-like data structure used for efficient storage
-
fvm_ipld_hamt
Sharded IPLD HashMap implementation
-
num-bigint-dig
Big integer implementation for Rust
-
data_structure_traits
data structure collection traits
-
ordered_hashmap
Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
-
arae
Cursed data structures
-
kdt
k-dimensional tree implemented with const generics
-
packed_array
Packed Array aka sparse set structure with compile-time known size
-
delete_if_not
unsafely in-place delete function
-
ninja-files-data
Core data structures for ninja files
-
hashable-map
Wrappers for HashMap and HashSet that implement Hash
-
fastrie
Sequentialised memory-packed associative tries, buildable at compile time, useful for longest prefix matching
-
iodyn
An incremental collections library making use of Adapton
-
okasaki
A collection of peristent datastructures
-
twitter/rustcommon-streamstats
Statistics calculated for a stream of samples
-
tinymap
A map structure that stores its data on the stack
-
sdsl
interface for the Succinct Data Structure Library
-
ultrametric_matrix_tools
Toolbox that provides functions and data structures to generate and handle ultrametric matrices
-
cipherstash-core
Shared code and core modules for CipherStash clients
-
linked-syntax-tree
A doubly-linked syntax tree
-
non-empty-vec
NonEmpty
vector implementation, ensure non-emptiness by construction -
hgg
Approximate nearest neighbor search collection
-
embedded-async-helpers
static
friendly helpers for async on embedded -
tilecoding
Dr. Richard S. Sutton's tile coding software.
-
wick-settings
Wick's Resource Configuration file data structures and normalization logic
-
ethercat-types
Common EtherCAT data structures
-
bigraph
Different representations with implemented operations on bigraphs
-
partial_const
way to handle constant and non-constant values in a unified way
-
fixed-slice-deque
A fixed size deque implementation
-
rcbytes
Rc version bytes crate
-
gcollections
Generic traits over Rust collections library
-
is_even_odd
categorizing and operating on integers
-
packedvec
Store vectors of integers efficiently
-
raphy
A graph data structure library
-
isomorphism
2 directional hashmaps
-
indexed_vec
IndexVec
fromlibrustc_data_structures
-
dot_tree
Create, query and store binary trees
-
bitstruct
Better Bitfields
-
python_object
Represent Python internal data structures
-
gsgdt
Generic Stringly Typed Graph Datatype
-
fast_trie_tree
A fast
TrieTree
for multiple data types -
sexpr_matcher
Structural pattern matching macro for S-Expressions and other list-like data structures
-
containerof
Macros and traits facilitating the use of intrusive structures in Rust
-
region_quadtree
A lightweight Region Quadtree
-
fxd
Fixed-point decimal implementation
-
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
) -
equivalence
Trait and derive macro for comparing and hashing types modulo an equivalence relation
-
extended-rational
implementations of high-accuracy projectively-extended rational numbers and macros for creating them
-
vector2
2D vector library
-
elaru
Memory safe implementation of LRU cache
-
json_tables
A structure that eases operations with a local json storage of undetermined items
-
geomprim2d
2D geometric primitive types
-
flag_set
FlagSet can process operations of the infinite complementary sets and the origin sets
-
bytes32
Used to create a custom type for 32-bit-wide byte arrays. Used for Drops of Diamond (more information about DoD is available at https://github.com/Drops-of-Diamond/Diamond-drops).
-
bstree
A Binary Search Tree written in Rust
-
bitrush-index
A serializable bitmap index library able to index millions values/sec on a single thread
-
fill_canvas
FillCanvas is a wrapper around a matrix with special methods to fill the cells
-
orn
A general implementation of the sum type
-
uwheel
Embeddable Aggregate Management System for Streams and Queries
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
anti-r
A spatial data structure outperforming r-trees for low numbers of elements
-
model
model-based testing for data structures, with linearizability checking
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
enum_from_variant
macro to generate From<T> trait implementations for enum variants, simplifying error conversions and enum mapping
-
packed-integers
A growable array for integer types in the range
u1
tou31
-
appendlist
An append-only list that preserves references to its elements
-
fenwick-tree
binary indexed tree (Fenwick tree) data structure in Rust
-
bitsvec
A bit vector with the Rust standard library's portable SIMD API
-
restor
A dynamic resource storage system in rust
-
eytzinger
implements the "eytzinger" (aka BFS) array layout
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
shiftnanigans
contains different iteration data structures for either iterating or for shifting iteratively forward and backward
-
static_merkel_tree
Static Merkel Tree is dedicated for generating Merkle Root and Merkle Proof for a static list of items
-
serde_fs
[De]serializing data structures as files
-
vec-btree-map
Basically just a sorted Vec that can be used as a HashMap
-
uuid-timestamp
UUID timestamp
-
rstructure
A thread-safe data structure library
-
eztd
Quick start Rust
-
bitf
procedural macro to easily create a bitfield out of a struct
-
nvpair-rs
Safe and rustic wrapper around nvpair
-
wrapped_slab
WrappedSlab: Auto-generate newtype idiom based on a Slab
-
exclusion-merkle-cbt
Complete Binary Merkle Tree for verify exclusion
-
fuzzy-search
collections for fuzzy search
-
tinysearch-cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
sequencetree
a new type of collection to store keys and their corresponding values
-
kserd
Kurt's Self-Explanatory Rust Data
-
transit_model_relations
Modeling the relations between objects
-
sexpr_parser
Generic S-Expression parser
-
scratchbuffer
A Vec<u8> like data-structure, that can be used as slices of different types
-
key-node-list
Doubly-linked list that stores key-node pairs
-
twodarray
A 2D array library
-
cycler
A simultainious write/read data structure
-
stavec
Stack-allocated vector with static capacity
-
perm-vec
Datatype representing permutations of indices
-
vec_ptr
An unsafe vector that uses raw pointers to perform standard vector operations
-
courgette
Colour manipulation/conversion library
-
workit
single-threaded work queueing utility
-
latticequeries
Allows for fast hierarchical queries on Vecs
-
rustupolis
tuple space data structure in Rust
-
xtree
general purpose tree data structure
-
json-node
A way to work with JSON as a node tree
-
bookfile
A container file format with chapters and an index
-
data_registry
An unordered data structure with immediate insertion, removal and access
-
char-list
A persistent string type with the same API as a linked-list of characters
-
pin_array
Tiny crate providing an array with structurally projected pinning
-
abbrev-tree
highly inefficient data structure for text completion
-
apint
Arbitrary precision integers library
-
old_norse_alphabet
Old Norse alphabet constants & sort for Rust
-
superset_map
Map that stores distinct supersets based on the total order defined
-
tetengo_trie
A trie library implemented with a double array
-
tracker-macros
Macros for the tracker crate
-
causal-length
CRDT's based on causal length sets
-
ranno
Annotations over recursive data structures
-
poison
writing poisoned types
-
const_std_vec
const std vec
-
benchmark-counters
Light-weight data structures to help with monitoring and benchmarking
-
biheap
A heap group that supports efficient removal of extreme elements
-
ccl_owning_ref
creating references that carry their owner with them
-
nereon
Riboseinc configuration library for Rust
-
board
creating a single vector with coordinate based access, and a few nice functions for easy use
-
ndcopy
Fast N-dimensional array memcpy
-
loro-common
Common types and functions for Loro. This is an internal lib of Loro.
-
blend-bindgen-rs
generated Blender's data structures
-
art
adaptive radix trie
-
bigvec
A really big vec
-
advanced_collections
advanced data structures (collections). Includes counter (hash-bag, multiset), disjoint set (union-find, merge-find), circular buffer (cyclic buffer) and interval (range)
-
cons-rs
containing a Cons data structure
-
pinned_vec
Vec-like data structure whose elements never move
-
kudzu
concurrent, grow-only data structures
-
willowtree
Lazily evaluated trees
-
map1
@ErichDonGubler's fancy template for new Rust projects
-
feature-set
User defined feature set
-
mmdb_core
A std-collection-like database
-
fix_float
Fixed floating types that allows useful trait implementations and datastructures on float numbers
-
aatree
in Rust
-
trie-standardmap
Standard test map for profiling tries
-
batbox-android
Helper crate for android
-
charcoal
Implements tree data structures and interfaces to work with them
-
competitive-programming-rs
Competitive Programming Library in Rust
-
artful
Low-memory overhead and high-performance adaptive radix tree
-
evento-query
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
avl-cont
A contiguous AVL Tree
-
valued
Describe your data in terms of basic data structures. Get serialization and other facilities for free
-
transiter
An Iterator suitable for navigating recursive structures and DAGs
-
lineartree
tree data structure for rust
-
btree-vec
A growable array (vector) implemented using a B-tree
-
stack-array
A data structure for storing and manipulating fixed number of elements of a specific type
-
identifier
Generate 128 bits id structs easily
-
simple_event_bus
A basic, simple event bus in Rust
-
parse_tree
A non-abstract syntax tree type
-
threshold-dict
A data structure to find smallest key that is larger than the query
-
genindex
Generational index library
-
qt-json
JSON library for QT
-
tiny-artnet-bytes-no-atomic
Vendored copy of Bytes fork for use in tiny-artnet. Types and traits for working with bytes
-
disjoint_set_forest
A disjoint set data structure implemented using a disjoint set forest
-
fr-trie
Fuzzy Radix Trie
-
vfs-tools
A collection ofttools to work with VFS
-
hash_ring
Consistent Hashing library for Rust
-
pi_phf_map
phf_map
-
sesstype
Multiparty Session Types
-
orx-imp-vec
ImpVec
, standing for immutable push vector 👿, is a data structure which allows appending elements with a shared reference -
p8n-types
Basic types for representing binary programs
-
jsonnlp
JSON-NLP data structure
-
streamhist
streaming histogram
-
mtgjson
Unofficially provided lightweight models of the data provided by MTGJSON
-
gauze
Probabilistic set membership filters with a simple interface
-
plain_trie
Basic Trie is trie capable of mapping any T to string composed of English alphabet letters
-
chtholly_tree
Rust bindings for Chtholly Tree
-
expiringmap
an AHashMap-backed TTL map
-
bfilters
bloom filter implementation in Rust
-
dlc-trie
Data structures for storage and retrival of numerical Discreet Log Contracts (DLC)
-
orange-trees
Tree data structure with several methods to query and manipulate nodes
-
minidom
A small, simple DOM implementation on top of rxml, targeting the subset of XML useful for XMPP
-
incremental-map
combinators for incremental immutable maps (see crate
incremental
) -
amplify
Amplifying Rust language capabilities: multiple generic trait implementations, type wrappers, derive macros
-
data-query
Query library that allows for Querying Serializable data using string queries
-
bucket_vec
A vector-like data structure that guarantees to never move its contained elements
-
dpc-simplemap
map with default value and compacting
-
gridd
A generic, dirt-simple, two-dimensional grid
-
segment-map
A self-balancing binary search tree for mapping discrete, disjoint segments to values
-
cumulfreqtable
A Cumulative Frequency Table implemented with a Binary Indexed Tree
-
free-ranges
An efficient data structure for keeping track of indices which are either free or not
-
esl01-dag
DAG used for source control
-
object-chain
Ad-hoc structure builder
-
combinations
give you all the combinations of values in a vec
-
cognitive-frames
Managing windows for
cognitive
-
pin-list
A safe
Pin
-based intrusive doubly linked list -
vec_key_value_pair
A drop-in replacement for std::HashMap and std::HashSet that use Vec on the backend
-
explicit-discriminant
Macro for enforcing enum discriminants
-
cursieve
that makes it easy to deserialize byte arrays into annotated Rust structures
-
dynarg
mechanism for dynamic robust argument handling
-
ahtable
Array Hash Table implementation
-
soak
Transform a struct into arrays of its fields
-
mycelial-crdt
mycelial crdt
-
mucell
A cell with the ability to mutate the value through an immutable reference when safe
-
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
bimap
andmultimap
. -
cmp_wrap
Let you compare structes by context
-
trait-map
Rust map for dynamic trait storage and references
-
dgrambuf
A fixed capacity ring buffer for datagrams (byte slices)
-
n2k-base
Basic definitions of data structures and methods for N2K networks. See https://en.wikipedia.org/wiki/NMEA_2000.
-
unrolled-linked-list
unrolled linked list in rust
-
go-heap-rs
Golang's heap written in Rust
-
common-tree
common tree lib
-
safe_index
Type-safe indexes
-
batbox-cli
cli interface
-
asdl
Parser for ASDL format. Describes the abstract syntax of compiler intermediate representations and other tree-like data structures
-
mismatch
abstract mismatching. Useful for error propagation.
-
utah
dataframe structure and operations
-
la-arena
index-based arena without deletion
-
m6coll
Small Smart Collections using prefix m6
-
spectacle
Opt-in runtime introspection
-
smallbigint
Big integer types that have a small on-stack representation for small values. Uses num-bigint internally.
-
iron_rose
Invertable Bloom Filters & Strata Estimators as found in https://www.ics.uci.edu/~eppstein/pubs/EppGooUye-SIGCOMM-11.pdf
-
leetcode_for_rust
leetcode for rust
-
python-objects
that implements the architecture of the CPython objects. with this crate you can crate a list with any data type from rust
-
kodiak-taxonomy
manage generic taxonomies supporting unique features
-
arenas
Arena data structure for efficiently adding & removing items with stable IDs
-
binary-search
General binary search implementation
-
vector_mapp
A Vec based map
-
ringbahn
an experimental safe API for io-uring
-
bloom_filter_plus
rust_bloom_filter
-
velarixdb
An LSM Storage Engine focused on reduced IO amplification
-
nave
Thinking about the construction of distributed systems starting from the *consistent hash* algorithm
-
setting
The styles of all graphics elements
-
building_blocks_mesh
Fast meshing algorithms for voxel data structures
-
parity-map
For mapping integers based on their parity
-
pds
Probabilistic Data Structures efficiently implemented in Rust
-
fuid
A UUID-compatible identifier in a friendly base-62 format
-
simple-observable
observable pointer for mutable and immutable data
-
push-while-ref
push while having a reference
-
intersection
Find the intersection over a collection of sets; when you need more than the intersection between two sets
-
reusable-vec
A Vec wrapper that allows reusing contained values
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
judy-wrap
Judy arrays FFI mid-level binding
-
rust-datastructures
some datastructures in rust
-
seq
The module 'seq' provides the lightweight, generic sequence container 'Seq' for unmovable data and is embedded into the program during compile time
-
roaring_bitmap
Roaring bitmap data structure implemented in Rust
-
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"
-
blfilter
Bloom filter implementation using farmhash
-
pinned-bucket
Mutable container for pinned and immutable items
-
ensured_bufreader
A Bufreader ensures N bytes in buffer
-
bittree
O(1) find functions in a special data structure called a bit tree
-
librualg
Collection of basic algorithms for everyday development
-
sliced
A segmented vector for iterating over slices
-
cess-sp-core
CESS Storage Proofs - Core parts for proofs of storage
-
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.
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
j2ds
A small collection of data structures not found in the standard library
-
ffizz-passby
FFI helpers for implementing pass-by-value and pass-by-pointer
-
interval-map
A vector-based, non-duplicate range-keyed, sorted array
-
html-types
HTML Data structures
-
easy_collections
Wrappers around standard collections for ease of use and quick prototyping
-
arenavec
An arena backed implementation of vectors and related types
-
any_handle
A thread-safe, type-safe smart pointer that can share, store and downcast a
dyn Any
-
binartree
Binary Tree realisation
-
forgetful
Track and forget values within a specific scope, enabling detection of repeated values
-
two-sided-vec
Double ended vectors for rust, which can grow in both the front and back
-
predicates
boolean-valued predicate functions
-
hkalbasi-rustc-ap-rustc_serialize
Automatically published version of the package
rustc_serialize
in the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
front-vec
Efficiently-prependable Vec and String types
-
multi-stash
Vector-based arena data structure that reuses vacant slots
-
unthbuf
Unsigned N-bit Buffer: A structure that holds a fixed buffer of
bits
-sized unsigned integer elements -
growable-bitmap
A growable (and shrinkable) compact boolean array
-
string-wrapper
A possibly-stack-allocated string with generic bytes storage
-
simple_ringbuf
Ringbuf is a speedy lightweight fixed-size infinite-use collection optimized for straightforward single threaded use
-
pasture-derive
Macro implementations for #[derive(PointType)]
-
branchless
Algorithms and data structures designed to maximize performance on superscalar processors
-
owned_chunks
a collection of traits and iterators to get owned chunks from collections
-
moretypes
Named tuples, records, and more!
-
simple-ref-fn
function wrappers that do not require virtual tables
-
miniconf
Serialize/deserialize/access reflection for trees
-
schemes
cache-aware recursion schemes in rust
-
jirachi
A collision resistant runtime agnostic key-generator
-
idmap
Efficient maps of integer id keys to values, backed by an underlying
Vec
-
apid
Collection of type definitions from several APIs
-
take-some
that provides a way to obtain *some* value from various collections
-
ts-builder
Timestamp builder
-
anat-rs
represent natural numbers as well-founded sets
-
treers
Sedgewick's tree maps
-
pretree
package for storing and querying routing rules with prefix tree. Pretree 是一个用于存储和查询路由规则的包。它用前缀树存储路由规则,支持包含变量的路由。
-
map_err
map error values
-
gitdag
Git DAG used for source control
-
snowflake_me
A distributed unique ID generator inspired by Twitter's Snowflake
-
hashable_weak
A hashable weak pointer
-
valet
Stores your objects and gives you a tag to retrieve them later
-
solana_libra_canonical_serialization
Libra canonical serialization
-
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
-
deferred_vector
A deferred vector implementation
-
wasmflow-interface
Types used by the Wasmflow tool chain
-
guzzle
A derivable trait for consuming key value pairs into structs
-
bpht
A bit-packed hash table implementation using hopscotch hashing for 32-bit keys and values
-
fsort
sort files in a fast, OS-independent and 'rusty' way
-
enum-ref
Proc. macro for generating enum discriminant types.
-
littlechestnutgames-trie
A generalized trie implementation for quick prefix searching
-
symbolic-sets-integers
Symbolic sets examples and test implementations
-
rc-slice2
Reference-counted slices with easy subdivision
-
bonzai
An abstraction for optimizing the memory layout and pointer aliasing of trees
-
miny
Box<T> with small value optimization
-
mqf
MQF, Mixed Quotient Filter, is a variant of CQF (Counting Quotient Filter)
-
weakheap
Weak Heap data structure implementation in Rust
-
compact-calendar
Compact representation of a set of days based on a bit-maps
-
shelves
Storing values referenced by a unique typed index
-
solomondb
An embedded and distributed Gremlin-compatible graph database
-
memcell
providing a MemoryCell struct, which stores a current and previous value
-
data-buffer
low-level data buffer type useful for IO and in homogeneous collections
-
bounded
numeric types
-
grid_trait
2D and 3D grids with combinators
-
bitmac
Structure for accessing to single bits
-
foxy_util
Util for
foxy
-
range-split
splitting sequences with range parameters
-
onigiri
handling chars
-
ransel
rank/select succinct data structures
-
flat-zip
An iterator adaptor to help traverse two-level collections
-
domain-lookup-tree
A tree structure in Rust optimized for looking up domain names, with wildcard support
-
bsp-pathfinding
Runtime path finding using Binary Spatial Partitioning
-
hirpdag
procedural macros for Hash Consed, Immutable, Reference Counted, Persistent, Directed Acyclic Graph data structures
-
banyan
Persistent indexable tree data structure
-
composite_types
Compose type definitions in the style of typescript
-
hdf5-dst
DST extensions for HDF5
-
ckb_multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
dynamic-matrix
work with matrices
-
cartesian-tree
Construct a Cartesian Tree from a Slice in Linear Time
-
siraph
A node-based digital signal processing crate
-
queue-rs
queue
-
bipbuffer
Simon Cooke's Bip-Buffer
-
dag-cbor-references
Extract blake3 ipld links from dag-cbor blocks
-
arrayset
An array-backed ordered set type
-
fastdivide
partial port of libdivide. It makes it possible to reduce the cost of divisions.
-
typed_id
Make your IDs strongly typed!!
-
local_vec
fixed-capacity vector allocated on the stack
-
version-rs
A struct for Versions, with the methods you expect
-
structurray
Easy psuedo-array generation for database optimization
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
polystore
Polymorphic data store
-
strchunk
Data types for working with UTF-8 text in I/O
-
spigal
fixed-length ring buffer implementation, intended to be no-frills and easy to use, especially for embedded applications
-
higher-cat
Functors, Applicatives, Monads and other bad ideas
-
holium-rs-sdk
Holium Rust SDK
-
nexum
collection of commonly used data structures
-
lumberjack-utils
Read and modify constituency trees
-
unsized_enum
Unsized enum implementation
-
tagged-tree
A tree-like data structure where the values are tagged
-
dimension_shiftable_buffer
A dimension shiftable buffer
-
batbox-collection
Collection of identifiable objects
-
fixedvec
A heapless version of the Rust vector type
-
variant-map
defines maps to store variants of enums
-
tournament-kway
k-way merge using a tournament tree
-
trailer
Store a type with an associated buffer in contiguous memory
-
decoded-char
wrapper to keep track of the original byte length of a decoded character in the encoded source file
-
copy-range
core::ops::Range et al, but Copy and IntoIterator
-
hv-alchemy
Heavy Alchemy - the black arts of transmutation, wrapped for your safe usage and enjoyment
-
ramp_table
RampTable, a data structure useful for certain specialized situations
-
arraylike
trait for using arrays without needing const expressions
-
pq-bincode
A wrapper crate of queue-file for bincode serializable structs
-
ov
a collection of traits that allow you to chain off of anything
-
passive
A trio of marker traits to classify passive data structures
-
more_ranges
Range types not provided in the standard library
-
crdt
Conflict-free Replicated Data Types for Rust
-
thincollections
Alternative implementations for vector, map and set that are faster/smaller for some use cases
-
linked-list
An alternative implementation of std::collections::LinkedList
-
batbox-range
Helpers for working with ranges
-
victor_tree
Victor makes vectors
-
frbf
robust, and efficient implementation of the Bloom Filter data structure in Rust
-
ppar
Persistent immutable array
-
literally
Macro literals for members of std::collections
-
dependency-graph
building and resolving dependency graphs
-
loro-preload
Loro internal lib for loading data
-
lazy-array
An array where entries are lazily initialized in any order
-
fast_forward
Quering collections blazing fast
-
griddle
A HashMap variant that spreads resize load across inserts
-
madeleine
Transparent object persistence with predefined operations and state containers
-
at-collection
Collections with minimum or maximum number of entities
-
cbor-tag-index
Tag index
-
fixed-index-vec
A vector-like data structure whose indices do not change when elements are removed
-
tc-state
TinyChain's general state enum
-
mrslac
sparse matrix data structures
-
pqueue
Priority Queue for Rust
-
priority-set
A no_std Priority Set
-
bufferring
Ring buffers for Rust
-
ast2str-lib
pretty-printing ASTs and other recursive data structures
-
runtime-sized-array
A variable-length array, also called runtime-sized
-
bellpepper-core
Core elements for a SNARK Circuit library
-
wl-tools
Wordlist tools – algorithms and data structures for working with lists of words
-
outils
Graph and tree data structure library. Providing utilities which aren't easily available in Rust.
-
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.
-
velect
A Vec with item / index selection
-
alg_ds
Algorithms & data structures
-
aabb-quadtree
A quadtree that maps bounding-boxes to elements
-
limq
Queue with optional maximum number of elements constraint
-
simple-tree
Create, edit and iterate over tree structures
-
htmldom_read
HTML reader that parses the code into easy-use tree
-
ulid-generator-rs
generating ULIDs
-
bidirectional-map
A two-way map data structure for small keys and values
-
fusebox
Mostly safe and sound append-only collection of trait objects
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
sorting-vec
Sorts a vector using a btreemap
-
type-info
Meta type information and type reflection at compile-time and runtime
-
checked
Implements a wrapper over the primitive Rust types that better indicates overflow during arithmetic
-
merkle_light
Light merkle tree implementation with SPV support and dependency agnostic
-
calcit_fingertrees
(Calcit fork of )Immutable persisten
fingertrees
-
fplist
An immutable, persistent, singly-linked list
-
colony
A fast associative data-structure that chooses its own keys
-
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. -
hopscotch
A FIFO queue for efficiently hopping and skipping between tagged items
-
flat_enum
Expand nested enum into flattened enum
-
set-trie
A trie for fast subset and superset queries
-
exegraph
no_std execution graph library
-
sortedcontainers
An experimental sorted data structure
-
const-vec
Vec-like data structure with immutable push method
-
ttm-rs
CLI to turn tuples into adjacency matrices
-
reservoir-buf
Dead simple interning
-
tree-cursor
non-intrusive tree cursor that supports node mutation without Cell/RefCell
-
sparseset
A Sparse Set
-
bndpresbufq
Bounds-preserving, optionally limited, buffer queue
-
rust-bloomfilter
bloom filter implementation in Rust programming language
-
trie
An ordered map and set based on a trie
-
collectivity
Generic collection traits
-
pathlink
A URL type whose path can also be used as a filesystem path, for Rust
-
rimu-ast
A data structure template system
-
udgraph
Universal dependency graphs
-
batbox-diff
Easy struct diffing
-
automatic-relations
Tree automatic relations
-
binary-data-schema
Meta language for raw binary serialization
-
pi_async_graph
async graph
-
compact-map
'Small map' optimization: store up to a small number of key-value pairs on the stack
-
artsy
ART Tree data structure library
-
prioq
Priority Queue implemented using std::collections::BinaryHeap
-
rbtree-arena
A cache friendly red black tree where nodes live on sequential memory
-
insert_multiple
insert multiple items into a stream in reasonable runtime
-
hdf5-hl
High level bindings to HDF5 High Level API
-
indexed_json
Index json files like a database
-
fieldfilter
trait that lets you filter stuff!
-
circular_vec
A fixed length vector that provides a next function that loops infinitely
-
bitsetium
One stop shop for all bitset needs
-
linked_lists
Different types of linked lists
-
truetree
Trees in Rust
-
ttmap
Trivial implementation of type map
-
id-set
A bitset implementation that stores data on the stack for small sizes
-
dot_json
Tools for dot map representations of serde_json Maps
-
erased-type-arena
A type-erased allocation arena with proper dropping
-
opt_arrayvec
Vector-like container with fixed capacity, using options instead of stored length
-
crdt_rs
work with Conflict-free replicated data types (CRDT) in Rust
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
tree_multiset
A tree-based multiset for Rust
-
rope_rd
A Read/Seek rope implementation
-
moka-cht
Lock-free resizeable concurrent hash table
-
upto
Fixed-capacity and variable length stack allocated arrays
-
fremkit
broadcast log
-
fcsd
Front-coding string dictionary
-
typemap_core
A no_std typemap with trait-based value-presence guarantees (on nightly)
-
csf_benchmark
The program for benchmarking Compressed Static Functions
-
sized-vec
Type level sized vectors
-
cs-fetcher
Candlestick fetcher
-
mvbitfield
Generates types to work with bit-aligned fields
-
to_any
Auto derive ToAny trait for any structure
-
component_table
Data structure for associating data with entities in an Entity Component System
-
header-slice
Definitions for slices with headers, and a vec-like type with a header allocated inline
-
cola
A text CRDT for real-time collaborative editing
-
quickscope
Multi-layer HashMap and HashSet implementations for performant representation of variable scopes
-
rustgym
solutions
-
mycelium-bitfield
Structured bitfields, courtesy of Mycelium
-
lazy_concat
Lazy concatenation for Strings and Vecs
-
sliding_window
A fixed size, heapless sliding window
-
bloom_filter_plush
rust_bloom_filter
-
collect
An experimental extension of std::collections
-
vhr_serde
A serde (de)serializer crate for the simplist possible binary format
-
ident
wrapping types with an immutable identifier and storing/accessing such types in collections
-
dst-container
Containers for DST objects
-
qt-json-rs
JSON library for QT
-
higher_order_point
An experimental higher order data structure for 3D points
-
easy_strings
Ergonomic, garbage collected strings for Rust
-
int_ranges
ranges tools for integer
-
read-write-pipe
A trait for objects implementing Write, to write all content from a Read object
-
optempty
Tools for working types that may be empty. E.g., an empty
String
,Vec
,HashMap
, etc. -
disjoint-hash-set
A disjoint set / union-find data structure suitable for incremental tracking of connected component identified by their hash
-
rubbl_fits
Core support for the FITS container format in the Rubbl framework
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
pui-arena
Generalized Arenas that can be used on
no_std
-
sortedlist-rs
A fast sorted list data structure in rust
-
jmt-blake3
Jellyfish Merkle Tree based on BLAKE3 hash function
-
hprtree
A Hilbert-Packed-R-Tree implementation for rust
-
eimage-core
Core primitives and operations for processing image collections in 3D space
-
dfb
Dynamic-Fifo-Buffer, like AnyMap but uses a VecDeque to store values and treats access as a Fifo
-
unsized-stack
Fast heterogeneous / unsized stack
-
subset-map
A map where the keys are subsets of an initial set of elements
-
collection_literals
macros for initializing std::collections
-
implhm
Simplified library of collision-handling HashMaps
-
bytes_to_type
facilitate byte conversion to specified types using macro generation
-
phf_mac
Compiler plugin for perfect hash function data structures
-
bytes-quilt
data structure for tracking random-access writes to a buffer
-
ax_banyan
Persistent indexable tree data structure
-
sqlite-collections
Rust collection types backed by sqlite database files
-
skew-forest
Skew-binary random access lists
-
fibheap
but actually useful Fibonacci Heaps
-
parity-hash
A collection of fixed-size byte array representations
-
stride
A strided slice type
-
shifted_vec
A growable datastructure with positive and negative indexing built on top of
std::vec::Vec
calculating the offset automatically -
collection
Deterministic, copy-on-write balanced search trees
-
rubbl_visdata
Preliminary work on generic data structures for radio interferometric visibility data
-
chunked-bytes
A rope-like non-contiguous buffer for efficient data structure serialization and vectored output
-
theban_interval_tree
Interval Tree implementation
-
extended-collections
An extension to the collections in the standard library with various data structures
-
lhlist
Labeled heterogeneous lists
-
tapestry
Generic 2D grid data structure and utilities
-
quickphf_codegen
Code generator for creating static maps and sets for use with quickphf
-
head
Common types with inline headers, such as HeaderVec for Vec
-
densemap
A collection data structure that is permanently accessible by unique keys and fast iterable
-
rimu
A data structure template system
-
k-bucket
Kademlia DHT K-bucket implementation as a binary tree
-
librqbit-clone-to-owned
Util traits to represent something that can be made owned and change type at the same time
-
neighborgrid
A 2-D grid datastructure with easy to use iterators and adjacent cell methods
-
offset-views
Create and index offset views of arrays, slices, strings, etc
-
id-map
Data structure of values indexed by IDs
-
tree-rizzen-yazston
Tree Library using the Any trait for data
-
miniqueue
A minimalistic single-thread job queue based on fold/reduce
-
prototty_storage
Interface to persistent storage
-
pinned-queue
Queue-like data structure whose elements can never move
-
linked_list_c
Safely work with c compatible linked lists
-
fusefilter
No alloc membership approximation
-
expanding_slice_rb
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
-
structdb
Persistent data structures using RocksDB
-
kvptree
a lightweight library for sending data around
-
cbloom
Concurrent implementation of Bloom filters
-
flex-algo
Rust commonly used data structure and algorithms
-
treelike
A trait to abstract over trees, and simplify implementing them, all in one handy crate
-
zellij_widgets
A wiget library for zellij
-
seg-tree
segment tree library
-
dyobj
improved version of the ECS pattern
-
double-map
A HashMap with double key to single data/value
-
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
-
shared-string
Split a string without another allocation
-
hashheap
data structure that combines a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
tadm
A collection of algorithms and data structures wrote out while reading The Algorithm Design Manual book
-
rs-bucket-filter
Skips slow scans using cache, bloom filter,
-
async_value
persistent, asynchronous values
-
prehash
storing values with precomputed hashes
-
bit-long-vec
Vector with fixed bit sized values stored in long
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
cli_tree
A CLI tool to generate a tree of user defined nodes
-
bitaccess
Macro for efficient and type-checked access to individual bits of a variable
-
byte_set
Efficient sets of bytes
-
allehanda
Miscellaneous data structures and algorithms
-
bounded-vec-deque
A double-ended queue|ringbuffer with an upper bound on its length
-
bloomy
Bloom filter using only two hash functions
-
pathtrie
A specialised trie for paths in the style of a Patricia or radix trie
-
store-interval-tree
A balanced unbounded interval-tree in Rust with associated values in the nodes
-
prefix_sum
prefix sum data structure
-
mutuple
Replace items in Python's immutable tuples
-
same_elements
Function to test if two collections contain the same values
-
bitsets
BitSet implementations: Dense, Compressed, Memory-Mapped, and Roaring
-
flowerbloom
fast bloom filter implementation with thorough documentation and tests
-
tranche
Tranches are an alternative to slices
-
orx-concurrent-vec
An efficient, convenient and lightweight grow-only read & write concurrent data structure allowing high performance concurrent collection
-
street_index
small utility crate for working with road name / street indexing for cartographic purposes
-
bigsi_rs
A in-memory implementation of a BIGSI-like data structure
-
counted_map
a hashmap that automatically assigns keys to pushed values
-
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.
-
im_interval_tree
An immutable data structure for storing and querying a collection of intervals
-
clampf
Clamped floating-point types
-
batbox-logger
logging
-
sortbuf
Data structure for sorting large numbers of items
-
btree_dag
A generic DAG (undirected graph) data structure
-
len-trait
Len trait for collectons
-
texcraft-stdext
Rust data structures and algorithms used in the Texcraft project
-
hashable_rc
Hashable wrappers for reference countings
-
vector-trees
Vector backed B and AVL trees
-
pegitan
A bunch of random algorithms library
-
c_linked_list
handling NULL-terminated C linked lists
-
segmentmap
A collection that maintains insertion order
-
st_ring_buffer
A fixed-size String implementation using a ring buffer
-
sbf-blake3
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
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!
-
hodgepodge
enums
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
ascii_num
digit to ascii numbers
-
fricgan
performing basic input and output on bytes
-
hamt-rs
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell
-
stack-stack
stack-allocated stack
-
phf_macros
Macros to generate types in the phf crate
-
include-lua
that allows the embedding of a lua source tree into a Rust application binary
-
lenses
An optics library loosely inspired by Julien Truffaut's Monocle
-
chainmap
mutability of intermediate maps
-
compressed-sparse-fiber
Compressed sparse fiber implementation for Rust
-
big_enum_set
creating sets of enums with a large number of variants
-
iunorm
Map normalized floating-point numbers to/from (un)signed integers
-
gtrie
Generic trie implementation with a support of different key and value types
-
querable
Quer(y)able data structure implementation
-
stacking
using a stack datastructure in rust
-
persistent_rope
An immutable persistent rope data structure
-
btree_monstousity
a code port of BTreeMap but with comparator functions
-
dynamic_graph
graph processing
-
array-init-cursor
help keep track of arrays of MaybeUninit
-
ord-by-set
providing a weakly ordered multi-set with compile-time configurable ordering scheme
-
awint_core
Core no-std and no-alloc
awint
functionality -
final
Wrap a value in a type that does not give out mutable references
-
kodiak-sets
manage generic sets supporting unique features
-
transit_model_collection
Manage collection of objects
-
dsll
Fast Thread Safe Doubly Sorted Linked List
-
an-rope
an rope for large text documents
-
btree_network
A generic network (undirected graph) data structure
-
simple-bitrange
manipulating bit ranges which is common when working with IC registers
-
another_radix_trie
Rust built radix tree library
-
bittyset
A BitSet type for manipulating bit sets
-
tindex
Vec
, slice and bitset with custom index types -
linear-hashtbl
Linear probing hash table
-
periodic-rs
Bounded datastructures
-
alo
ALO means At Least One. It could contain any number of item like
Vec
but it does not heap allocation if it contains only one item -
cervine
A slightly more flexible Cow; roughly to T: Borrow<R> as alloc::borrow::Cow is to B: ToOwned
-
internode
Smart references to your graph nodes
-
rbtset
A set based on a RB-Tree for efficient operations
-
graphlib
powerful rust library for the graph data-structure
-
sparse_set
sparse set data structure
-
louds-rs
High performance LOUDS (Level-Order Unary Degree Sequence) library
-
dotreds-binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps. Makes some previously internal function public
-
dihardts_cstools
Collection of data structures and algorithms
-
doubly-linked-list
double link list
-
holyhashmap
A hash map with stable indices
-
multi_mut
Methods on HashMap and BTreeMap for safely getting multiple mutable references to the contained values
-
nanoset-py
A memory-optimized wrapper for Python sets likely to be empty
-
map-trait
Generic Map trait
-
plum
Probabilistic data structures for rust
-
prefix-tree
A map and set interfaces using trie data structure
-
moonlight_collections
Collections for Rust
-
leonardo-heap
Heap structure supporting fast in-place partial sorting
-
traitgraph-tsplib-io
Functions to read and write graphs in TSPLIB format
-
smolmask
A small library for storing small binary masks in just a single integer
-
unrecurse
Helper crate for rewriting your recursive code in iterative way
-
partial-array
potentially partially-filled arrays
-
altdeque
An alternative deque implementation
-
ego-binary-tree
Binary tree API built by wrapping ego-tree
-
indexed_bitvec
An indexed bitvector with (hopefully) fast rank and select operations
-
prust-lib
Persistent & Immutable Data Structures in Rust
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
fastgraph
Graph abstraction providing a generic interface and powerful parallelized traversals
-
serde-ordered-collections
Ordered serialization/deserialization serde functionality
-
stable-bloom-filter
A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams
-
kvstructs
General basic key-value structs for Key-Value based storages
-
hyper-tree-router
Routing middleware for Hyper http library using Prefix tree (trie) for path finding
-
ati
Introduces the
At
trait, which allows collections to be indexed byu|i{8,16,32,64,128}
andisize
. Supports Python-like negative index, where -1 is last element. -
nopetgraph
Graph data structure library. Provides graph types and graph algorithms.
-
bucket
Offers a very simple container for any value without mutation
-
ttl-queue
A queue that drops its content after a given amount of time
-
generic-arrayvec
Interop between the arrayvec and generic_array crates
-
flit
Bloom filter backed by xxHash
-
kappendlist
Append to a growable list in O(1) without needing &mut
-
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…
-
btreelist
A list data structure that has efficient insertion and removal in the middle
-
amazed
A graph maze building library
-
semver-store
An HashMap structure that uses semver strings as keys
-
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
-
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.
-
tree-automata
Term Rewriting Systems
-
rimu-meta
A data structure template system
-
cyclic_data_types
Cyclic data types are series of structs, enums, types and functions to create a series of fast data types
-
closures
Abstraction for seperating code and state in closures
-
svec
Dart-style list in Rust
-
map-of-indexes
A compact key-value map for unique but not dense indexes
-
nclist
finding overlapping intervals using a nested containment list
-
flow_arena
A HashMap managed Graph Model with the concept of ownership
-
lobby-queue
Const-size queue-like data structure
-
simple-octree
octree implementation written in Rust
-
bytesstr
An immutable reference-counted UTF8 String
-
tinyvec_string
tinyvec based string types
-
bitstring-trees
Trees based on bitstrings
-
microcrates-bytes
Types and traits for working with bytes (with no_std support by default)
-
watermark
watermarking set for in-order insertions
-
dynamization
Fast insertion for static containers
-
tapa-trait-serde
A collection of Tapalogi's reusable crates
-
uniqueid
Generates a unique hash/identifier for a system given a set of parameters
-
algo
Algorithms & Data Structure implementations
-
bagofholding
collection types. Efficient data structures that look bigger on the inside.
-
sac
A macro for constructing collections
-
id-vec
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
graphiti
macro dsl and builder for creating and describing arbitrary sets of related data using a serializable description type
-
queueue
Queue-like data structures used in rCore
-
pathtree
An immutable tree data structure for fast path operations
-
hkalbasi-rustc-ap-rustc_graphviz
Automatically published version of the package
rustc_graphviz
in the hkalbasi/rust repository from commit e77366b57b799dfa3ce1fcb850c068723a3213ee The publishing script for this crate lives at: https://github… -
sbom-walker
work with SBOM data
-
indexvec
Simplified copy of rustc's index crate
-
murmurhash64
MurmurHash2 (64bit version)
-
btree-map
A data structure for storing and manipulating fixed number of elements of a specific type
-
rs_trie
My first Rust crate. A simple implementation of a Trie datastructure with a struct and linked lists. Not intended for serious use.
-
trie-generic
A trie with generic content
-
banyan-utils
work with banyan trees
-
gentrix
that adds the Matrix typed using generics that is basically a wrapper around a 2D Vector
-
string-err
String error type
-
arrav
Sentinel-based heapless vector
-
crdt-list
Abstract CRDTs for lists
-
bloom
Fast Bloom Filter and Counting Bloom Filter implementation
-
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…
-
recasting
traits for one-to-one recasting of values in data structures
-
array_trait
A generic trait for any array, with item as type and length as const parameter
-
ngds
Rust bindings for AVFounation
-
bitstr
contiguous sequence of bits in memory
-
provenance
Container structures that generate key upon insertion that only works with the map that generated it
-
terms
Tree terms and patterns data structures
-
bitstring
traits and implementations
-
thin-string
A String with a smaller stack footprint
-
simple_trie
array backed trie
-
trips
generic triple store written in Rust
-
list-any
Type erased slices and Vecs
-
winvec
Windowed Vector (TTL) Collection for Rust
-
fid-rs
High performance FID (Fully Indexable Dictionary) library
-
hashbrown_tstd
port of Google's SwissTable hash map
-
init_trait
A small helper trait to simplify the initialisation of 'indexable' data structures
-
congruence
closure
-
atom_table
Assign easy-to-handle typed IDs to large, hard to handle things like strings
-
immer-rs
A wrapper around the C++ library immer for persistent datastructures
-
tsil_cev
LinkedList on Vec
-
iostream
the project is rust io stream.you can easily use it to manipulate files stream and memory stream
-
bytes-expand
Types and traits for working with bytes
-
gavl
A fast implementation for a map and a set using an AVL tree
-
option_vec
Vec<Option<T>>-like container
-
linked_lista
LinkedList data structure
-
Xorfilter
No alloc membership approximation
-
fallacy-hash
fallible hash collections
-
flow-graph
A representation of a graph data structure for flow-based programming
-
simha-bst
My custom binary search tree implementation
-
compacts
compact data structures
-
const-arrayvec
A vec-like type backed by an array on the stack
-
hubs
The horribly unsafe buffer structure
-
pair_macro
Create types consisting of the same type values such that Pair, Triplet, and so on
-
heapq
Priority Queue with scoring function
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it's own. Very similar to Slab.
-
pure_ref
making immutable references only
-
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)…
-
lineup_rust
queue implementation in Rust. This is a learning and a hobby project and is not intended for production use.
-
tampon
Contains SAFE Rust functions, macro and trait to serialize / deserialize data structure and/or object and generate buffer
-
eitherq
Queue which support two different types
-
trashmap
A HashMap and HashSet that operate directly on hashes instead of keys, avoiding rehashing
-
simple-stack
linked list-based implementation of the Stack data type
-
safer-bytes
safe, non-panicking wrappers around the 'bytes' crate
-
veho
a iterable toolset
-
atb
lock-free triple buffer
-
dynvec
DynVec
type that acts like a vector to store any datatype -
slice-deque
A double-ended queue that Deref's into a slice
-
flexible-string
A stack heap flexible string designed to improve performance
-
priority-matrix
A matrix that supports per-row, per-column and whole-matrix maximum key queries
-
graphrepresentations
providing efficient abstract implementations of different graph representations
-
pulz-bitset
bitset implementation
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
automap
pattern to implement key-value maps where the value type contains the key type
-
aligned-utils
Common utilities to work with aligned values and allocation
-
ring_queue
A double-ended queue implemented using a vector that reuses space after elements are removed
-
default-vec
A specialized vector that has a default value
-
small-ord-set
A set data-structure represented by a sorted
SmallVec
-
matterdb
Persistent storage implementation based on RocksDB
-
fixed-queue
no_std, no_alloc, use [T; N]. support
Vec
/VecDeque
/History
-
char_index
efficient charwise indexing into a string
-
pq-tree
consecutive ones property (C1P) and graph planarity testing
-
inexor-rgf-model-binary
Inexor - Reactive Graph Flow - Model - Binary
-
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…
-
key_set
KeySet representing concepts of All, None, Some(list), and AllExceptSome(list), with basic set calculations (intersection, difference, inverse)
-
merkle-search-tree
A data structure for efficient state-based CRDT replication and anti-entropy
-
gvec
Very simple implementation of generational indexing for vectors written in Rust
-
hashmap-entry-ownable
Variation of HashMap::entry() that accepts borrowed forms of keys
-
tagged_ufs
A union-find-set implementation, in which sets can be associated with tags. When two sets are united, their tags are merged
-
hex-string
a data structure for managing hex strings in both string and byte vector representation
-
xdag
DAG(Directed Acyclic Graph) lib
-
tyght-map
A static type map implementation
-
freezie
small library that disables mutation for the contained type
-
batching-queue
An Israeli Queue implementation
-
toboggan-kv
abstraction layer over multiple KV stores
-
mmap_json_file
parse, count, filter JSON files using memory mapped io library
-
handlebox
A map-like collection that reuses unused keys
-
stackvector
StackVec: vector-like facade for stack-allocated arrays
-
packed_str
Store immutable strings in a single packed allocation
-
hoop
Fixed ring buffer that allows non-consuming iteration both ways
-
modular-bitfield-ordering
Provide u8be..u128be, u8le..u128le for modular-bitfield
-
cseq_benchmark
The program for benchmarking compact sequences and bitmaps
-
lifetimed-bytes
Bytes, but with attached lifetime
-
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 -
hashed
type you can convert any hashable type into and still do equality checks on
-
sharedvec
A fast but limited collection for storing values of a single type
-
tag-vec
A vector used for storing tags
-
collections-more
Common data structure and algorithms for rust-lang to complete the already excellent std::collections
-
mut-binary-heap
Enhanced version of std::collections::BinaryHeap that supports increase and decrease key, max, min, and custom-order heaps
-
digger
A trait for extracting data from recursive data structures
-
hamt
Purely functional hash array mapped tries
-
rb
A thread-safe ring buffer with blocking IO
-
bitmaptrie
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
-
skippable_map
deserialize wrapper around HashMap which skips non-conforming data
-
petitset
An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap
-
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
immutable-seq
Immutable sequence data structure
-
string_stupidify
Collection of helper functions to format strings in unusual ways
-
pointer-value-pair
A pair of a pointer and a small integer packed into a pointer-sized object
-
doubly
linked lists in rust
-
event-queue
crates.io için bir paket nasıl hazırlanırın ele alındığı öğrenme amaçlı modüldür
-
static-bytes
Bytes for embedded devices
-
intrusive-containers
intrusive data structures
-
sot
Object Tree
-
algods
A collection of data structures and algorithms
-
raw-vec
A Raw utility for managing contiguous heap allocations
-
tibitset
bitset replacement for HashSet
-
graphed
implement graph-based functionality
-
dogged
Persistent vector, similar to Clojure
-
containers-rs
'Collections' interfaces for describing objects that contain other objects
-
byte_trie
A compressed trie based on bytes with some weird child node bucket sizes
-
recollection
implementations and reimplementations of common data structures and algorithms, and other personally commonly used utilities
-
slicedvec
A segmented vector for iterating over slices
-
tiny-interner
Easy to use string interner with fast access to underlying strings and minimal memory footprint
-
yuuang_petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
capillary
HashMap-like storage of key-value pairs, but allowing for step-by-step (partial) search of value
-
trait-based-collection
A trait-based collection library that implement different data structures using the same trait
-
chunky-vec
A pin safe, append only vector never moves the backing store for an element
-
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…
-
const-buffer
A fixed-capacity memory buffer allocated on the stack using const generics
-
crdt-sample
containing samples of crdts
-
generic-json
Generic JSON traits
-
binary_tree_zy
binary tree
-
prio-queue
priority queue implemented as a heap stored in a Vec
-
non-empty-collections
Non-empty hash-map and hash-set implementations
-
array-ops
Automatic method implementations for array data types
-
uguid
GUID (Globally Unique Identifier) no_std library
-
rustgym-util
handy macros, data types and traits for rustgym
-
uvector
access two slices as a single continuous vector
-
dynstr
A string implementation optimized for manipulations
-
matrixable
Traits and structs extending capabilities of matrix-like structures
-
transient_map
Hashmap with eviction of unused elements
-
id_cache
A cache data structure which generates sequentially-assigned ids for unique values
-
bet
parsing and evaluating binary expression trees
-
traitgraph-dimacs-io
Functions to read and write graphs in DIMACS format
-
buf-list
A list of buffers that implements the bytes::Buf trait
-
comprende
Python-style collection comprehensions in Rust
-
dimsum
multi-dimensional array library
-
static-box
A stack-allocated box that stores trait objects
-
history-buffer
A fixed capacity, write-only, ring buffer
-
gvc-sys
graphviz rust bindings
-
small_vec2
Vector on the stack or heap need nightly rustc
-
index-ext
Index slices with arbitrary ints and as arrays
-
recursion-schemes
cache-aware stack safe recursion (this is the really haskell brained one)
-
maybe-cell
An UnsafeCell optionally containing a value, with the state externally managed
-
tobz1000-petgraph
Pseudo-namespaced fork of
petgraph
: Graph data structure library. Provides graph types and graph algorithms. -
flat-veb
Fast implementation of vEB trees without internal allocation
-
rahashmap
Fork of standard library HashMap with additional functionality
-
gap_query_interval_tree
that provides a gap-query optimized interval-tree data-structure
-
stringz
A way to use strings in generic paramters
-
justly
justified containers
-
map-to-const
Easily convert HashMap<K, V> to constant [(K, V); N] values
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
lattice-graph
Set of Lattice(Grid) based Graph Structures
-
neurarbor
manipulating tree graphs, for the analysis of neuronal arbors
-
afmt
Basic data structure parsing from strings
-
functional_vec
Owning versions of mutable Vec methods
-
flashtext
algorithm to search and replace keywords in given text
-
maybe-string
newtype wrapper that represents a byte vector that may be a valid UTF-8 string
-
stable_node_set
An ordered set with handles to values
-
shared_bytes
Owned string and byte slices
-
cuml_map
A trait representing cumulative mappings, and several implemntations of this trait
-
cursorvec
Cursored vector container
-
string32
A string that is indexed by u32 instead of usize
-
flattree
A series of functions to map a binary tree to a list
-
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.
-
gardiz
integer geometry on 2D planes, focused on games
-
enum-set
A structure for holding a set of enum variants
-
rbitset
A bit set, being able to hold a fixed amount of booleans in an array of integers
-
normalize_interval
Normalizing interval library
-
calf-vec
Small copy-on-write arrays, essentially combining
SmallVec
andCow
-
sorted-list
SortedList data structure which allows mapping an Ord key to multiple distinct PartialEq values
-
lfbs
Lock-free stack with batched pop
-
anymap3
A safe and convenient store for one value of each type
-
discord-indexmap
A fork of the popular
indexmap
library that adds a few extra APIs that are yet to be upstreamed -
loro-internal
Loro internal library. Do not use it directly as it's not stable.
-
rbloom
efficient and minimalistic bloom filter
-
ringvec
ring buffer implementation based on a vector
-
lighter
Macro for rewriting string matches as tries
-
sqa-bounded-spsc-queue
A bounded SPSC queue (temporary version so I can publish sqa-engine)
-
low-map
A convenient wrapper around a vector of options
-
std_collection_traits
Abstraction of operations in std collection types
-
fera
An aggregation of algorithms, data structures and supporting crates
-
retrace
Safe, generic rollback log with predictable latency
-
xx-bloomfilter
Bloom filter implementation using xx hash
-
itc
Interval Tree Clocks as described in the itc2008 paper
-
mikel_binary_tree
search binary tree implementation in rust
-
any_key
Dynamically typed keys for associative arrays
-
fral
Functional random-access lists
-
construct
A macro for building container literals
-
regex-map
Associative container where the keys are regular expressions
-
hash-trie
Hash Array Mapped Trie (HAMT) Immutable Set Implementation
-
diskmap
disk based HashMap-like for shared concurrent memory usage
-
comprehend
Python like list, set and hashmap comprehensions via macros
-
bloomy-rs
Fast bloom filter implementation
-
castle_api
Castle API, graph api
-
im-rope
Unicode strings backed by RRB vectors
-
xfast
Trie- binary trie for storing integers
-
louds
LOUDS implementation for Rust
-
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…
-
ax_banyan_utils
work with banyan trees
-
ketsugou
merges two arrays
-
sequence_buffer
Sequence buffer data structure implementation
-
keyed
Implement comparison traits by specifying a key
-
associative_positional_list
AssociativePositionalList is a list-like container in which each value is associated with an index, but unlike other list containers, the index for a value can be determined efficiently
-
roaring-graphs
Graph data structure backed by roaring bitmaps
-
immutable-avl
An Immutable map and set implement for rust based on an AVL tree
-
u64_array_bigints_core
Core library for
u64_array_bigints
-
fast-btree
A fast B-tree implementation ported from tlx library
-
slice-cell
A
Cell<[T]>
-like mutable slice, that allows slice-like APIs -
stack-buf
Vector-like facade for arrays allocated entirely on the stack
-
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…
-
vizz
creating GraphViz/DOT visualizations of Rust data structures
-
pyrpds
Python Wrapper for Rust Persistent Data Structures
-
dequemap
A no_std compatible implementation of the dequemap crate
-
quetta
Immutable, reference-counted strings for rust
-
simple-collection-macros
configurable macros for maps and sets
-
abi_stable
For doing Rust-to-Rust ffi,writing libraries loaded at program startup
-
stonks
Sets that allow borrowing while inserting entries
-
isl-rs
Rust bindings for Integer Set Library
-
metaldb
Persistent storage implementation based on RocksDB
-
tdf_utils
such as tree
-
chain-map
A chain of maps with a single view into the aggregated values
-
bytes
Types and traits for working with bytes
-
loaf
Why have a slice when you can have a loaf?
-
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…
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
cycle_map
Implementations of bi-directionally accessible hashmaps
-
slotgraph
Graph implementation built with slotmap and petgraph
-
holodeque
Array- and slice-backed double-ended queues in 100% safe Rust
-
fp-collections
An alternate collections library for 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.
-
easy_graph
Data structure that represent generic vertices and undirected connections
-
labelgraph
graph implementation, allowing random access to nodes via labels
-
collect-once-hashmap
A hashmap that can be collected only when there are unique keys in the iterator
-
enum-map-derive
Macros 1.1 implementation of #[derive(Enum)]
-
binary_search_tree
Binary search tree implementation
-
graphific
graph data structure library
-
bitset-fixed
Bitset for DP
-
pi_tree
A tree structure implemented by dense memory linked list
-
dag_compute
construction of arbitrary computation DAGs and the expression of dataflow graphs
-
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…
-
history_stack
A collection of containers that support generic history tracking mechanisms
-
tournament_tree
A tournament tree library