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