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