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