-
hashbrown
port of Google's SwissTable hash map
-
indexmap
A hash table with consistent order and fast iteration
-
ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
bitvec
Addresses memory by bits, for packed collections and bitfields
-
predicates
boolean-valued predicate functions
-
tinyvec
tinyvecprovides 100% safe vec-like data structures -
bit-set
A set of bits
-
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
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
roaring
A better compressed bitset - pure Rust implementation
-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
bimap
Bijective maps
-
bit-vec
A vector of bits
-
tinystr
A small ASCII-only bounded length string representation
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
string-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
croaring
Rust wrapper for CRoaring
-
smartstring
Compact inlined strings
-
generator
Stackfull Generator Library in Rust
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
zerofrom
trait for constructing
-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
linked_hash_set
HashSet with insertion ordering
-
rowan
generic lossless syntax trees
-
im
Immutable collection datatypes
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
ego-tree
Vec-backed ID-tree
-
faststr
string library that reduces the cost of clone
-
typed-index-collections
Typed index version of Rust slice and Vec containers
-
fixedbitset
bitset collection
-
array-init
Safe wrapper for initializing fixed-size arrays
-
smallbitvec
A bit vector optimized for size and inline storage
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
gix-pack
Implements git packs and related data structures
-
bloomfilter
Bloom filter implementation
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
enumset
creating compact sets of enums
-
yrs
High performance implementation of the Yjs CRDT
-
radix_trie
Generic radix trie data-structure
-
index_vec
Newtype-style helpers for
Vecandusize -
circular-buffer
Efficient, fixed-size, overwriting circular buffer
-
bitmaps
Fixed size boolean arrays
-
ecow
Compact, clone-on-write vector and string
-
abi_stable
For doing Rust-to-Rust ffi,writing libraries loaded at program startup
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
rpds
Persistent data structures with structural sharing
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
imbl
Immutable collection datatypes
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
spade
Delaunay triangulations for the rust ecosystem
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
multimap
A multimap implementation
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
range-set-blaze
Integer sets as fast, sorted, integer ranges with full set operations
-
egg
egraphs
-
intmap
Specialized HashMap for integer keys
-
thin-vec
A vec that takes up less space on the stack
-
las
Reads and writes point clouds stored in the ASPRS las file format
-
smallbox
Small Boxoptimization: store small item on stack and fallback to heap for large item -
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.
-
crdts
Practical, serializable, thoroughly tested CRDTs
-
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.
-
guppy
Track and query Cargo dependency graphs
-
array-macro
Array multiple elements constructor syntax
-
uluru
fast, LRU cache implementation
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
dlv-list
Semi-doubly linked list implemented using a vector
-
orx-split-vec
An efficient dynamic capacity vector with pinned element guarantees
-
ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
narrow
Apache Arrow
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
-
str-buf
Static string buffer
-
vortex-array
Vortex in memory columnar data format
-
cordyceps
Mycelium intrusive data structures
-
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
-
hashbag
An unordered multiset implementation using a hash bag
-
binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps
-
nonempty-collections
Correct-by-construction non-empty collections
-
equivalent
Traits for key comparison in maps
-
jaq-json
JSON values for jaq
-
modql
Model Query Language support
-
open-payments-fednow
Open Payments - Message Parsing Library - FedNow
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
tree_iterators_rs
built to provide you with the iterators to easily work with tree data structures in Rust
-
grid
Dynamic generic 2D data structure
-
mycelium-bitfield
Structured bitfields, courtesy of Mycelium
-
micromap
The fastest alternative to HashMap, for maps smaller than 20 keys
-
dary_heap
A d-ary heap
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
bitfield-struct
Struct-like procedural macro for bitfields
-
walker-common
Common functionality for SBOM and CSAF walker
-
orx-priority-queue
Priority queue traits and high performance d-ary heap implementations
-
boa_interner
String interner for the Boa JavaScript engine
-
sqrid
Square coordinates and grid-like arrays, with zero dependencies, in a single file
-
bounded-vec
Non-empty rust Vec wrapper with type guarantees on lower and upper bounds for items quantity
-
slice-dst
Slice-based custom DSTs
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
cranelift-entity
Data structures using entity references as mapping keys
-
string
A UTF-8 encoded string with configurable byte storage
-
range-collections
Sets and maps of ranges, backed by smallvec
-
loro-rle
A internal library of loro for storing and manipulating run-length encoded data. Do not use it directly.
-
rustic_core
fast, encrypted, deduplicated backups that powers rustic-rs
-
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
-
vers-vecs
A collection of succinct data structures supported by fast implementations of rank and select queries
-
newtype-uuid
Newtype wrapper around UUIDs
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
indexset
A two-level BTree with fast iteration and indexing operations
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
iso7816-tlv
tools and utilities for handling TLV data as defined in ISO/IEC 7816-4
-
iset
Map and set with interval keys (x..y)
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
phf_shared
Support code shared by PHF libraries
-
cita_trie
Modified Patricia Tree (aka Trie)
-
modular-bitfield
Allows to easily define bitfield types with modular building blocks
-
fqdn
FQDN (Fully Qualified Domain Name)
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
blobby
Iterator over simple binary blob storage
-
ringbuffer
A fixed-size circular buffer
-
vecmap-rs
A vector-based map and set implementation
-
oxc_index
Newtype-style helpers for
Vecandusize -
portgraph
Data structure library for directed graphs with first-level ports
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
mitsein
Strongly typed APIs for non-empty collections, slices, and iterators
-
fm-index
FM index and its variant implementations for Rust
-
circular-queue
A circular buffer-like queue
-
ndarray-ndimage
Multidimensional image processing for ArrayBase, the n-dimensional array data structure provided by ndarray
-
crop
A pretty fast text rope
-
setsum
order-agnostic checksum
-
lib-sokoban
Sokoban: compact, efficient data structures packed into contiguous byte arrays
-
submap
B-Tree map for pub/sub services
-
vec_map
map based on a vector for small integer keys
-
tinyset
Size-optimized sets
-
qwt
Quad Wavelet Tree
-
i256
Optimized implementations of 256-bit signed and unsigned integers
-
vart
An immutable versioned adaptive radix trie
-
timed-map
Lightweight map implementation that supports expiring entries and fully compatible with both std and no_std environments
-
intervallum
Generic interval and interval set library
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
keyvi
key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
-
bao-tree
BLAKE3 verfiied streaming with custom chunk groups and range set queries
-
idlset
Fast u64 set operations library
-
pg_filters
helper to generate postgres sql for pagination, sorting and filtering
-
oci-spec
Open Container Initiative Specifictions in Rust
-
btree-range-map
B-tree range map implementation
-
xml-builder
Easy and highly-configurable XML builder/writer
-
xsd-types
XSD data types
-
array-concat
Macros for concatenating const arrays
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
hdf5
Thread-safe Rust bindings for the HDF5 library
-
arraydeque
A ring buffer with a fixed capacity, which can be stored on the stack
-
rustica
functional programming library for the Rust language
-
bytes-utils
Additional utilities for working with the bytes crate
-
trees
General purpose tree data structures
-
vortex-sparse
Vortex Sparse array
-
sparsevec
Compress vectors using row displacement
-
numeric-array
Wrapper around generic-array that adds efficient numeric trait implementations
-
short-uuid
generate and parse short uuids
-
bitflag-attr
A macro to generate bitflags structures from C-like enums
-
rust_dynamic
Support for dynamically-typed values in run-time
-
tagged-pointer
Platform-independent space-efficient tagged pointers
-
hibitset
Hierarchical bit set structure
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
undo
An undo-redo library
-
xot
Full-featured XML tree library for Rust
-
rsdict
Fast static rank and select data structure
-
tree-ds
manipulate tree data structures
-
chat-prompts
Chat prompt template
-
cueue
High performance SPSC circular byte buffer with batch operations
-
uuid-rng-internal
Private implementation details of the uuid crate
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
base-traits
base traits (for Rust)
-
cc-traits
Common collection traits
-
spatialtree
A fast and flexible generic spatial tree collection (Octree, Quadtree, etc)
-
tracker
A macro to track changes on structs
-
keyed_priority_queue
Priority queue that support changing priority or early remove by key
-
pin-list
A safe
Pin-based intrusive doubly linked list -
any_of
A general optional sum of product type which can be Neither, Left, Right or Both
-
ordinal-map
Ordinal trait to map values to integers and efficient maps and sets for such types
-
ftree
A very fast fenwick tree implementation
-
itybity
An itty bitty crate providing bit iterators and bit iterator accessories
-
slotmap-careful
Wrap the slotmap crate and prevent key reuse
-
interavl
An optimised interval tree for efficient interval stabbing
-
delay_map
HashMap collections whose entries expire after a given time
-
ordered-multimap
Insertion ordered multimap
-
cdg_api
interact with api.congress.gov
-
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… -
phf_generator
PHF generation logic
-
blart
adaptive radix tree packaged as a BTreeMap replacement
-
ordered
A wrapper for adding arbitrary partial/total order to a type
-
docker-compose-types
Deserialization and Serialization of docker-compose.yml files in a relatively strongly typed fashion
-
orx-iterable
Defines and implements Iterable, Collection and CollectionMut traits to represent types that can be iterated over multiple times
-
cactus
Immutable parent pointer tree
-
mzpeaks
representing peaks in mass spectrometry data
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
wildbird
Rust Framework 🐦
-
im-lists
Persistent unrolled linked lists and vlists
-
queue-file
lightning-fast, transactional, file-based FIFO
-
imbl-sized-chunks
Efficient sized chunk datatypes
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
array2d
A fixed sized two-dimensional array
-
kempt
Ordered collection types with no unsafe code and no_std support
-
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…
-
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. -
louds-rs
High performance LOUDS (Level-Order Unary Degree Sequence) library
-
value-log
Value log implementation for key-value separated LSM storage
-
xapi-rs
A conformant LRS implementation of xAPI 2.0.0
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
dogear
merging bookmark trees
-
arrow-row
Arrow row format
-
merkletree
Light merkle tree implementation with SPV support and dependency agnostic
-
block-grid
A quick, cache-conscious, tiled 2D array
-
csf
compressed static functions (maps) that use perfect hashing and value compression
-
faststr-fork
Faststr is a string library that reduces the cost of clone
-
flex_array
A
#[no_std]flexible array much like std::Vec but with custom indices and length and capacity types -
any_vec
Type erased vector. Most operations can be done without type knowledge. Mostly zero overhead.
-
is-tree
Everything is a tree
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
bittle
Zero-cost bitsets over native Rust types
-
range-set
Smallvec-backed containers of sorted integer ranges
-
normalize_interval
Normalizing interval library
-
baby_shark
Geometry processing library
-
diff-struct
A trait for diffing and applying diffs to types
-
truc
Rust code generator for safe, fixed size, evolving records
-
rt_ref
Internal
Reftypes forrt_refandrt_vec -
orange-trees
Tree data structure with several methods to query and manipulate nodes
-
slice_ring_buf
A ring buffer implementation optimized for working with slices
-
raft-log
Raft log implementation
-
matreex
matrix implementation
-
stac-server
SpatioTemporal Asset Catalog (STAC) API server
-
hypergraph
data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices
-
map_vec
The Map and Set APIs backed by Vec
-
sync-ptr
Sync & Send wrappers for raw pointer's
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
adflib
handle amiga disk files
-
linearize
Types that are enumerable and an array-backed map
-
vec-strings
Store any string efficiently in an immutable way
-
more_collections
Additional collections not found in std::collections
-
dequemap
A no_std compatible implementation of the dequemap crate
-
byteview
Thin, immutable zero-copy slice type
-
xor_name
Xor Type
-
tetengo_trie
A trie library implemented with a double array
-
sized-chunks
Efficient sized chunk datatypes
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
id_tree
creating and modifying Tree structures
-
rdf-types
Data-structures and traits definitions for RDF
-
roadmap
model a project roadmap as a directed acyclic graph
-
funcmap
Derivable functorial mappings for Rust
-
ergo_avltree_rust
cryptographically authenticated dictionary based on AVL tree
-
beap
Bi-parental heap data structure implementation in Rust
-
valkyrie-ast
Strong typed abstract syntax tree of valkyrie language
-
dot2
generating Graphviz DOT language files for graphs
-
hvec
A Vec-like structure that can store different types of different sizes contiguous with each other in memory
-
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
-
stacked_errors
high level error propogation with software controlled backtraces
-
unsized-vec
Like Vec, but for unsized values
-
mule-map
A hybrid between a HashMap and a lookup table
-
uuid-rs
Universally Unique IDentifier (UUID)
-
smallstr
String-like container based on smallvec
-
vectree
Vector-buffered tree collection with post-order, depth-first, mutable/immutable iterator
-
euui
An Extended Universal Unique Identifier
-
sector
A stateful vector implementation that provides different memory management behaviors through Rust traits and state machines
-
simd_aligned
Safe and fast SIMD-aligned data structures with easy and transparent 'flat' access
-
xmltv
electronic program guide (EPG) parser and generator using serde
-
variadics
Variadic generics on stable Rust using tuple lists
-
slice_map
A generic container to store a single type of data into unevenly sized slices
-
bumparaw-collections
A small set of bumpalo-backed collections for low-level operations
-
snowid
generating SnowID - a Snowflake-like timestamp-based distributed unique identifier
-
dup-indexer
Create a non-duplicated index from Strings, static str, Vec, or Box values
-
json-number
JSON number parsing and storage
-
indexical
indexed collections
-
case_insensitive_hashmap
A HashMap that uses case-insensitive strings as keys
-
heavykeeper
finding Top-K elephant flows with high precision and low memory footprint
-
snowflake_me
A distributed unique ID generator inspired by Twitter's Snowflake
-
polytype
A Hindley-Milner polymorphic typing system
-
libwebnovel
enabling users to get chapters of a webnovel, with multiple available backends
-
incremental-topo
Data structure to maintain an incremental topological ordering over a collection of values
-
f3l_search_tree
3D Point Cloud Library
-
ocpp_rs
Protocol implementation for Open Charge Point Protocol (OCPP) in Rust
-
mut_set
A safe implementation for HashSet with iter_mut and get_mut
-
pi_map
Define a Triat: map for the mapped schema, and provide two built-in implementations of HashMap and vecmap
-
wavltree
An intrusive Weak AVL Tree
-
edtui-jagged
A jagged array data structure for the edtui editor
-
traitgraph-algo
Graph algorithms based on the traitgraph crate
-
ball-tree
K-nearest neighbors
-
csaf-walker
work with CSAF data
-
flatk
Flat layout abstraction toolkit
-
slabmap
HashMap-like collection that automatically determines the key
-
scopegraphs
A well-documented port of scopegraphs to Rust
-
json_dotpath
Dotted path access to nested JSON objects (serde_json::Value)
-
swamp-code-gen
generates swamp-vm opcodes
-
seoul
trait Isomorphism
-
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
compact-rc
Low-memory reference-counting pointers
-
flatten_objects
A container that stores numbered objects. Each object can be assigned with a unique ID.
-
span-map
A data structure for efficiently managing sets of values over spans/ranges
-
form_builder
building forms with various fields and validation
-
cheap-clone
A trait which indicates that such type can be cloned cheaply
-
field_access
Dynamically access struct fields
-
madeleine
Transparent object persistence with predefined operations and state containers
-
scapegoat
Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.
-
rc-u8-reader
A tiny implement for reading
u8data from a reference counted instance -
rs-ecs
reasonably simple entity component system
-
overlay-map
A two-layered map data structure for Rust that tracks current and previous values for each key — with zero-clone, in-place state transitions
-
packedvec
Store vectors of integers efficiently
-
superset_map
Map that stores distinct supersets based on the total order defined
-
enum-collections
Collections data structures optimized for Enum, initializable at runtime
-
ux-primitives
Graphics Primitives for Angular Rust
-
endpoints
A collection of data structures for the OpenAI-compatible endpoints
-
mutcursor
Safely stores mutable references to parent nodes, for backtracking during traversal of tree & graph structures
-
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. -
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
simple-grid
2d-grid structure
-
random-access-disk
Continuously read and write to disk, using random offsets and lengths
-
orx-fixed-vec
An efficient fixed capacity vector with pinned element guarantees
-
ordsearch
A data structure for efficient lower-bound lookups
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
bose_einstein
A data structure that efficiently partitions elements into two sets
-
vise
Typesafe metrics client
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
open-payments-iso20022
Open Payments - Message Parsing Library - ISO20022
-
ttgraph
Typed/Transactional Graph container
-
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…
-
persistent-kv
Persistent key-value store
-
i_tree
Expiration key tree. Usable in algorithms like swipe line. Only for uniq elements
-
easy-tree
efficient tree structure library for Rust with recursive traversal
-
fingertrees
Immutable persisten finger trees
-
mikufans-proto
gRPC APIs for Mikufans
-
tailcall-chunk
persistent data structure for efficient append and concatenation operations
-
bitvec_helpers
BitVec based bitstream reader and writer
-
intervaltree
generic implementation of an immutable interval tree
-
typemap_rev
A hashmap, but stores types as keys
-
codas-flow
Low-latency, high-throughput bounded queues ("data flows") for (a)synchronous and event-driven systems
-
turbine_scene3d
Scene rendering for the Turbine engine
-
symbol_table
A symbol table that's fast, concurrent, and gives stable references
-
hashslab
A hash table with data accessible by index
-
among
The enum
Amongwith variantsLeft,MiddleandRightis a general purpose sum type with three cases -
hyperloglogplus
HyperLogLog implementations
-
avl
A map and a set implemented with an AVL tree
-
intrusive-lru-cache
An LRU cache implementation using intrusive data structures
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
pasture-core
A framework for working with point cloud data
-
iter-tree
Convert between iterators and tree structures in both directions
-
typeid_prefix
that implements a type-safe version of the TypePrefix section of the
TypeIDSpecification -
ringmap
A hash table with consistent deque-like order and fast iteration
-
optional
supplies a number of Option-like primitive types
-
slabigator
A linked list that doesn't do dynamic memory allocations
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
jaggedarray
Multidimensional jagged array
-
unordered-pair
A tuple struct representing an unordered pair
-
cantrip
Practical extension methods for standard Rust collections
-
rt-pods-client
Official Client for RtPods
-
jsonbb
A binary representation of json value, optimized for parsing and querying
-
anyrust
any rust
-
lean_string
Compact, clone-on-write string
-
griddle
A HashMap variant that spreads resize load across inserts
-
suffixarrayview
Creates a view of a suffix array
-
min-max-heap
An efficient, double-ended priority queue
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
tuplez
Tuples represented in recursive form
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
srdf
RDF data shapes implementation in Rust
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
validit
Validate data structures internal state
-
atelier
a Computational Workshop for Market Microstructure Modeling, Synthetic Simulation and Historical Replay
-
attribute-search-engine
Generic search engine for rows with attributes using different matchers
-
rbitset
A bit set, being able to hold a fixed amount of booleans in an array of integers
-
ranges
generic alternative to core/std ranges, set-operations to work with them and a range set that can efficiently store them with the least amount of memory possible
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
do-notation
Monadic do syntactic sugar
-
mphf_benchmark
The program for benchmarking Minimal Perfect Hash Functions
-
bye_nanoflann_rs
KD-Tree, implemented based on nanoflann, primarily optimized for 2D or 3D point clouds
-
hextree
Location to value mapping
-
entid
generating and validating type-safe, prefixed entity identifiers based on UUIDs and ULIDs
-
pi_slot
lock free Slotmap data structure
-
heapless_graphs
composable graphs for no_alloc environments
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
radixmap
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
-
jumprope
fast rope (fancy string) library built on top of Skiplists
-
rbtree
the rbtree for Rust
-
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
bitboard64
A 64-bit bitboard useful for chess programming
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
shared_vector
Reference counted vector data structure
-
flatcontainer
A flat container representation for Rust
-
hotel
Collection Data-structure to associate values with keys
-
livestock-rs
comprehensive library and CLI tool for managing, identifying, and working with livestock breeds, growth rates, and health. Designed to support farming and ranching applications, breed registries…
-
agb_hashmap
no_std hashmap implementation intended for use in the
agblibrary -
forest-ds
secure tree structure
-
unsure
handling unsure (optional) values that might fail, with an additional rejection variant
-
plain_trie
Classic trie implementation capable of mapping any T to char iterator
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
rdf-model
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
json_deref
JSON internal field links resolver
-
minimizer-iter
Iterate over minimizers of a DNA sequence
-
halfling
A collection of basic utilities for working with nibbles
-
sucds
Succinct data structures in Rust
-
incrementalmerkletree-testing
Common types, interfaces, and utilities for testing Merkle tree data structures
-
hashify
Fast perfect hashing without dependencies
-
sif-itree
immutable, flat interval tree
-
strumbra
Umbra-style strings (also known as German strings)
-
kn0sys-ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
paginate
framework agnostic pagination crate, that is especially suited for databases, slices and collections. Paginate calculates the range of pages indexes, making it ideal for accessing slices…
-
psrutils
few utilities to facilitate pulsar science projects in rust
-
data_reader
A data loading library for data scientist
-
treeclocks
Various Tree Clock data-structures and utilities
-
dataflow-rs
A lightweight, rule-driven workflow engine for building powerful data processing pipelines and nanoservices in Rust. Extend it with your custom tasks to create robust, maintainable services.
-
elusion
modern DataFrame / Data Engineering / Data Analysis library that combines the familiarity of DataFrame operations (like those in PySpark, Pandas, and Polars) with the power of SQL query building…
-
signalk
parse signalk maritime data
-
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…
-
sparse-merkle-tree
Sparse merkle tree implement in rust
-
hash-iter
Iterator producing sequence of hash values for a given input (using double hashing technique)
-
nestac
access nested structures using path-like string format
-
bitstring
traits and implementations
-
stavec
Stack-allocated vector with static capacity
-
dia-i18n
-
stack-queue
Heapless auto-batching queue
-
ofilter
fast thread-safe Bloom filter
-
typeables
type aliases. By SixArm.com.
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
disjoint
Fast and safe implementation of the disjoint-set data structure
-
digit-sequence
Sequence of u8 digits
-
hicollections
C-liked Collections
-
mem_btree
A Data Structure of BTree Implemented with Rust, support snapshot. not use any unsafe lib.
-
tournament-kway
k-way merge using a tournament tree
-
cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
rust-mcp-transport
Transport implementations for the MCP (Model Context Protocol) within the rust-mcp-sdk ecosystem, enabling asynchronous data exchange and efficient message handling between MCP clients and servers
-
cell-grid
2d grid container
-
exhaustive-map
An exhaustive map for types with finite inhabitants
-
tailvec
Split Vec to mutable slice and TailVec, the TailVec can push or pop etc
-
linear-hashtbl
Linear probing hash table
-
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…
-
tree-sitter-traversal2
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
smallvec-wrapper
Macro and common structs to play with
smallvec -
re_string_interner
string interning library
-
windows-collections
Windows collection types
-
cdll
A circular doubly linked list
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
tagid
Defines a newtype labeled tagging for different types of ids
-
any-rope
A fast and robust arbitrary rope for Rust. Based on Ropey.
-
swamp-script-source-map-lookup
Source map lookup for Swamp
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
sif-kdtree
immutable, flat k-d tree
-
weak-table
Weak hash maps and sets
-
ninjabook
A lightweight and high performance orderbook
-
segtri
Segment tree with customizable data type and update operations
-
doubloon
Money datatype that supports both statically and dynamically typed currencies
-
pipebuf
Efficient byte-stream pipe buffer
-
general_stable_vec
A Vec implementation with stable indices
-
windowed-infinity
data structure representing an infinite sequentially writable u8 vector of which a small view has writes to it preserved. This is primarily useful when implementing CoAP block-wise transfers…
-
indexed_arena
index-based arena without deletion
-
hashheap
data structures that combine a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
oxidd-rules-bdd
Binary decision diagrams (BDDs) for OxiDD
-
lsph
Learned Spatial HashMap
-
uid_store
Generate random uid strings containing letters, numbers, or base62 values
-
bit_mask_ring_buf
A ring buffer implementation with cheap indexing
-
bloomcalc
calculator for bloom filters
-
orn
A general implementation of the sum type. Meant to be a generic counterpart to tuples.
-
pdatastructs
probabilistic data structures
-
btree-slab
A memory compact Slab-based B-tree implementation
-
range-map
Maps and sets implemented using ranges
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
gesha-collections
Collection utilities for the Gesha project
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
parallel_frontier
Queue-like frontier for breath-first visits on graphs that supports constant-time concurrent pushes and parallel iteration
-
seq-map
Sequential Map
-
roussillon-type-system
A type system for a programming language
-
orx-pseudo-default
PseudoDefault trait allows to create a cheap default instance of a type, which does not claim to be useful
-
stac
SpatioTemporal Asset Catalog (STAC) specification
-
identified_vec
Like HashSet but retaining INSERTION order and without
Hashrequirement on the Element type -
rust_flightweather
Decodes METAR and TAF
-
try_reserve
Stable implementation of the TryReserveError from std for custom collections
-
engcon
macros to define (eng)ineering (con)tracts on data-structure level
-
kg-tree
Generic object tree with Opath query language, similar to XPath
-
nlist
inline-allocated list with statically tracked length
-
snix-castore
Modular functional package manager
-
mmdb
A std-collection-like database
-
parametrized
Supply useful iterating methods for user-defined types which are parametrized by type parameters
-
anymap2
A safe and convenient store for one value of each type
-
atree
An arena based tree structure with removal support
-
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.
-
pfds
Purely Functional Data Structures
-
cseq
compact sequences
-
fit-rust
designed for reading, writing, and merging FIT protocol files
-
implies
A parser for logical formulas
-
populated
Collection types that are guaranteed to be populated (i.e. non-empty). Based on std::collections types.
-
data_registry
An unordered data structure with immediate insertion, removal and access
-
strict
collections with strict bounds
-
ligature
Ligature's data model in Rust
-
sharded
Safe, fast, and obvious concurrent collections
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
slack-blocks
Models + clientside validation for Slack's JSON Block Kit
-
leetcode-trees-rs
Tree Node LeetCode problems
-
taskchain
A block-based, non-circular double-linked list implementation for Rust
-
yrs_tree
implementing a CRDT-based tree data structure powered by Yrs
-
space
providing abstractions for spatial datastructures and search
-
scope-cell
temporary, scope-bound, and thread-safe mutation of data in Rust
-
rust_multistack
Support for two-dimentional stacks for the Rust programming language
-
threshold
data structures
-
idbag
A bag of integers
-
Sparse-Voxel-64Tree
A lib for handling Sparse Voxel Contrees
-
map-macro
Declarative macros for statically initializing collections
-
merkle_light
Light merkle tree implementation with SPV support and dependency agnostic
-
basic_trie
Trie implementation in Rust
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
dynarg
mechanism for dynamic robust argument handling
-
qutee
A quadtree implementation
-
float16
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
vec-collections
Rust collections that are newtype wrappers around smallvec
-
irange
A data structure to store and manipulate ranges of integers with set operations
-
samling-clorinde
Database queries etc for the
samlingcrate -
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…
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
solvent
Dependency Resolver library
-
usize-set
Set data structures optimized to store sparsely distributed usize values
-
ipld-dagpb
IPLD DAG-PB codec
-
deepmesa
fast Data Structures and Algorithms in Rust. Every data structure is hand crafted for performance, well tested and has an extensive API.
-
c_vec
Structures to wrap C arrays
-
splay-safe-rs
Splay implemented with safe rust
-
gridly
managing fixed-size 2D spaces
-
libwebnovel-storage
A complement to libwebnovel: this package handles downloading and organizing collections of followed webnovels
-
cacheline-ef
Per-cacheline encoding of sorted integer sequences
-
nb-tree
Very simple tree structure with generic node and branch data
-
clubcard
exact membership query filter for static sets
-
identity_map
Identity-based maps
-
plane-2d
Continuous 2D data structure representing infinite 2d plane
-
lox
Fast polygon mesh library with different data structures and traits to abstract over those
-
snowflake-ng
Dead easy and high performance
snowflakeimplemented in Rust -
skiplist
in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
chinese-rand
Random generation of data structures in Chinese, using Rust
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
regroup
regrouping arrays
-
arraystring
Fixed capacity stack based generic string
-
extindex
Persisted immutable index
-
takeable
Container type that allows for temporarily moving out of the container, or permanently moving out and invalidating the container
-
collection_tools
General purpose tools to manipulate collections( containers like Vec/HashMap/HashSet )
-
lesbar
String types that must encode legible text
-
nid
Generate and parse Nano IDs
-
bv
Bit-vectors and bit-slices
-
bitvector
in Rust
-
lru-mem
An LRU cache implementation bounded by memory
-
array_list
A dynamic container that combines the characteristics of a Vec and a LinkedList
-
smodel
Symbol semantic modeling for Rust
-
aliasable
Basic aliasable (non unique pointer) types
-
stable-map
A hash map with temporarily stable indices
-
the-zipper
zipper is a data structure that allows you to traverse and modify a tree-like structure efficiently. It provides a way to navigate through the tree while keeping track of the context…
-
foyer-intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
once-list2
A single linked list which is backed by
OnceCell. You can append the value to the non-mutableOnceList. -
data-source
that fetches data from different sources
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
osmgraph
Convert OSM queries into graphs
-
rb_tree
A Red Black Tree implementation in Rust
-
beach_map
slotmap
-
sigmars
sigmahq rule collections
-
fast-ordered-buffer
A faster buffering implementation for asynchronous streams, trading off memory usage for speed
-
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.
-
blf_lib-derivable
Shared traits used by blf_lib and blf_lib-derive
-
pi_sinfo
used to describe the 'structure', that is, the meta information of the structure
-
rsor
Reusable slice of references
-
microkelvin
tree traversal over annotated data structures
-
astrie
High-performance hybrid data structure that combines the benefits of tries and B+ trees to provide efficient key-value storage with adaptive behavior based on data patterns
-
whale
A lock-free, dependency-tracking primitive for incremental computation
-
lookupvec
Container with Vec-like properties that also offers O(1) lookup of items based on an id field
-
beat_saber_map
Read and write Beat Saber maps with Rust
-
freyr
A UI component crate for Dioxus web
-
libpna
PNA(Portable-Network-Archive) decoding and encoding library
-
disjoint-sets
Three union-find implementations
-
delta-collections
Data structures with revertable operations called deltas
-
untis
accessing the Untis API
-
bin-it
efficient Rust library for binary serialization and deserialization
-
modular-bitfield-msb
Allows to easily define bitfield types with modular building blocks. MSB-first version.
-
blas-array2
Parameter-optional BLAS wrapper by ndarray::Array (Ix1 or Ix2)
-
hydroperfox-smodel
Semantic modeling for Rust
-
differential-dataflow-master
An incremental data-parallel dataflow platform
-
lignin
A virtual DOM structure, primarily for web use
-
cbsk_socket
socket callback tool
-
host-port-pair
Host-port pair type
-
gapbuf
Generic gap buffer
-
mih-rs
Multi-index hashing (MIH) for neighbor searches on binary codes in the Hamming space
-
arc-string-interner
An efficient cuncurrent string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
bit-int
An arbitrary fixed bit-width integer library
-
atomic_ptr_cell
Safe no_std repr(transparent) wrapper for AtomicPtr and &AtomicPtr with an api similar to a cell
-
a-tree
A dynamic data structure for efficiently indexing arbitrary boolean expressions
-
retworkx
A python graph library implemented in Rust
-
micromap-rawl
Fork of Micromap https://github.com/yegor256/micromap, the fastest alternative to HashMap, for maps smaller than 20 keys
-
named_colors
that provides named colors in RGB and Hexadecimal formats
-
iterable
collection like types
-
ascent-byods-rels
data structures for Ascent relations, made possible by Ascent's BYODS feature
-
spart
A collection of space partitioning tree data structures for Rust
-
akita
Mini orm for rust
-
walker-extras
Additional functionality for SBOM and CSAF walker
-
mset
/ multiset / bag implementation
-
rand_pool
Create a pool of random numbers pre generated thread safe
-
reusing-vec
Wrapper over Vec that allows elements to be reused without dropping them
-
sequential
A configurable sequential number generator
-
ksq
k-2 tree
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
linkedin-csv
Structs defined to hold the data as exported from LinkedIn
-
cve
Mappings for parsing the CVE JSON files
-
trie-hard
Fast implementation of trie data structure
-
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
pinned-deque
A high-performance double-ended queue, inspired by BOOST deque. Every element in this deque is pinned until its popping
-
fixed_deque
A fixed size VecDeque to match Python Deque
-
orx-tree
A beautiful tree 🌳 with convenient and efficient growth, mutation and traversal features
-
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… -
gtfs-geojson
converter for GTFS to GeoJSON formats
-
arraysetcell
A fixed-capacity, vector-like array with interior mutability and no ordering guarantees
-
openligadb
API
-
loc_api
interact with the loc.gov API
-
vortex-btrblocks
BtrBlocks style compressor
-
iterlist
Linked list with a cursor based api
-
bool_vec
A crates that exposes a vector called BoolVec which allows you to store a boolean in a single bit
-
onebuck
An efficient unordered dynamically-sized data structure
-
sweetrpg-kv-objects
Objects for Key-value store
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
access
that helps creating diverse accessors
-
collections-futures
working with futures through collections types
-
hora-id
A 64-bit time-based sorted unique ID generator that includes the current time in the ID
-
amadeus-streaming
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
mikel_binary_tree
search binary tree implementation
-
enum-table
creating tables with enums as key
-
id_collections
Index-oriented programming in Rust
-
sortedlist-rs
A fast sorted list data structure in rust
-
kn0sys_ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
ndshape
fast linearization of N-dimensional array indices
-
string_manipulation_utf8
String manipulation functions using character indexing (UTF-8) instead of bytes
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
probabilistic-collections
Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error
-
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
-
entity_data
A container for entity component data
-
expiremap
Key-Value map where each value has a custom expiry time
-
slab_tree
A vec-backed tree structure with tree-specific generational indexes
-
retaker
ecs implementation
-
floating_bar
Representing rational numbers using the floating-bar number type
-
geosite-rs
that parses geosite.dat file format
-
thin-string
A String with a smaller stack footprint
-
vsmtp-config
Next-gen MTA. Secured, Faster and Greener
-
skiplist-rust
A lockless skiplist implementation in Rust
-
opt_struct
Optional collections
-
disk-ringbuffer
lock free on disk ringbuffer to be used in the implementation of Franz
-
libnv
Safe and rustic wrapper around libnv-sys
-
merkle-log
"Merkle Tree-Structured Log" defined in the paper "Transparent Logs for Skeptical Clients." https://research.swtch.com/tlog
-
markov-generator
Highly customizable library for building Markov chains and generating random data
-
nimbusqueue
fifo collection
-
pineappl
not an extension of APPLgrid
-
contexts
Implements a type for treating several hashmaps as one
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
enid
parse Encrypted Numeric Identifiers
-
trie-root
In-memory patricia trie operations
-
rust-tls-duplex-stream
Full Duplex stream Wrapper around rust-tls
-
suff_collections
Fast realization of suffix array and suffix tree
-
bytering
A ring buffer specialized for vectored reading and writing in blocking and async I/O
-
tagged-vec
A Vec which can be indexed by one specific type
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
trk-io
TrackVis (*.trk) reader and writer
-
rust_redux
A Redux-like state management library for Rust
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
flammkuchen
Some data structures for fun and flammkuchen (e.g. a 2d grid which permits negative indices)
-
hybridmap
Hybrid map using smallvec and the std hashmap
-
cbsk_base
locked version cargo crates
-
rangetools
Extending the Rust Range structs found in std::ops
-
HArcMut
mutable arc
-
iowrap
Small helpers for using io::Read/io::Write
-
gcollections
Generic traits over Rust collections library
-
ztimer
A block-based, non-circular double-linked list implementation for Rust
-
linum
An open-source 2D-, and 3D-Vector Library
-
tree-flat
TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust
-
eastl-rs
EASTL binary-compatible Rust implementations
-
equivalent-flipped
Similar to
equivalentcrate, but flipsKandQ -
tiled_parse_tree
Tree data structure
-
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.
-
vector
The package provides a vector database allowing for efficient search of nearest neighbors
-
phf_macros
Macros to generate types in the phf crate
-
hprtree
A Hilbert-Packed-R-Tree implementation for rust
-
closed-interval-set
Unions of closed intervals as containers of pairs
-
chronofold
A conflict-free replicated data structure (a.k.a CRDT) for versioned text
-
orx-selfref-col
SelfRefCol is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees
-
minivec
A version of Vec that's only the size of a single pointer
-
expiringdict
A dict / HashMap whose items expire over time
-
data_tree
Hierarchical data tree with pathing and search support
-
rs-bush
Bush data structure
-
bitvek
bit vector implementation
-
frozen-collections
Fast partially-immutable collections
-
flat-tree
Series of functions to map a binary tree to a list
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
sapling-dag
DAG used for source control
-
circbuf
A growable circular buffer for working with bytes
-
radyx
A basic radix tree implementation
-
ux-dataflow
Data Processing Library
-
ostr
Owned str
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
div-int
Rational numbers with a compile-time denominator
-
rangeset
Integer collection backed by ranges with set operation support
-
fibonacci_heap
A Fibonacci Heap implementation in Rust
-
traitgraph-tsplib-io
Functions to read and write graphs in TSPLIB format
-
fibis
fixed range bitset
-
tree-iter
iterating over tree structures
-
rdf-writer
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
commitlog
Sequential, disk-backed commit log library
-
compt
A complete binary tree visitor library
-
arrayset
An array-backed ordered set type
-
sortedvec
a sorted vector that enables quick lookups
-
foreign_vec
Unofficial implementation of Apache Arrow spec in safe Rust
-
text-style
Types and conversions for styled text
-
slablit
Literal for slab creation
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
dcl_data_structures
Data structures for for deep_causality crate
-
radix-heap
Fast monotone priority queues
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
bytes_deque
A growable bytes deque in Rust, providing access to the raw pointer
-
packed-uints
Array of uints that scales from u4 to u32 to minimize wasted space while still being fast
-
fid
FID (Fully Indexable Dictionary) implementation for Rust
-
horizon_data_types
The Horizon data types library for third-party integrations
-
tensorism
Multidimensional arrays with bounds included in the type system
-
pas
strided slice
-
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
-
open-payments-iso20022-acmt
Open Payments - Message Parsing Library - ISO20022 ACMT
-
flange-flat-tree
A tree that can be expanded by attaching new values to the node without mutability of the old ones
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
concurrent-bloom-rs
thread-safe bloom filter
-
ordered_hash_map
HashMap which preserves insertion order
-
modern-multiset
A hash multiset implementation
-
ware
middleware chains
-
queue-queue
A priority queue implementation based on Rust's BinaryHeap
-
akshually
Smart Boys
-
code_location
UNMAINTAINED! Use std::panic::Location instead!
-
nary_tree
A vec-backed tree structure with tree-specific generational indexes
-
flat_enum
Expand nested enum into flattened enum
-
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.
-
msg-store
A fast and light-weight message store designed to work as a priority queue in low hardware equiped devices
-
omango-util
Utililites
-
hyper-tree
Quadtrees and Octrees generalized to any dimension and type
-
cses-rs
A CSES spec impl in Rust
-
value-ext
Serde Json Value Extension Trait (more Value type later)
-
median-accumulator
fast, space-efficient, generic accumulator for computing median
-
im-pathtree
Immutable, path-addressable tree data structure
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
rtdlib
TDLib for rust
-
safe_index
Type-safe indexes
-
binn-ir
-
cistring
A string type that preserve case, but compares insensitiveley
-
pbloom
A portable bloom filter implementation in Rust
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
big_unsigned_ints
Big Unsigned Integers ranging from U256 to U2048 using u64 arrays all under a fixed-size of 32
-
point-nd
flexible no-std struct to model points on axes of any dimensions
-
luka
working with graphs
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
non-empty-vec
NonEmptyvector implementation, ensure non-emptiness by construction -
simple-file-manifest
Interact with lists of files through a storage-agnostic interface
-
variant-rs
VARIANT support for Rust. Clean, idiomatic handling of WinAPI/COM results.
-
cfpyo3_rs_core
a collection of performant utilities
-
set_genome
A genetic data structure for neuroevolution algorithms
-
neighborhood-diversity
computing the neighborhood diversity of simple, undirected graphs
-
bloom-filter-yss
bloom filter for me or you
-
lodtree
help create octrees and quadtrees for chunked level of detail
-
arraylist
wrapper built on top of rust vector implementation. Taste like Java Arraylist, and intuitive to use like Python list and JavaScript array.
-
ref_kind
Different reference kinds
-
qmc
Quantum Monte Carlo simulations in Rust
-
lsmtree
Implements a Sparse Merkle tree for a key-value store. The tree implements the same optimisations specified in the libra whitepaper, to reduce the number of hash operations required per tree operation to O(k)…
-
ux-dx
3D Graphics Primitives for Angular Rust
-
espalier
Very simple flattened tree structure
-
cow_vec_item
Copy-on-write Vec, available on stable rust
-
vecdeque-stableix
Deque with stable index values
-
parallel_vec
A generic contiguous collection of heterogenous values
-
indexed_json
Index json files like a database
-
fenwick
tree: data structure that efficiently calculates prefix sums in a changing array of numbers
-
guppy-summaries
Build summaries for Cargo, created by guppy
-
structured
Data structures to handle large, structured data
-
expiringmap
a HashMap-backed TTL map
-
py_env
A wrapper for Python commands to easily install dependencies and run Python scripts in an optionally impersistent environment
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
validiter
Iterator adapters for validating iterations
-
gamma
Graph primitives and traversals for Rust
-
xskiplist
Skiplist implementation in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
compressed-intvec
A compressed integer vector with fast random access that stores values with instantaneous codes in a bitstream
-
linked-list
An alternative implementation of std::collections::LinkedList
-
moka-cht
Lock-free resizeable concurrent hash table
-
pvec
RRB-Tree based persistent vector implementation
-
prepona
A graph crate with simplicity in mind
-
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!
-
rexsgdata
Scatter-Gather Data Descriptors
-
kdtree-simd
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
-
ultragraph
Hypergraph data structure
-
qust-ds
a part of crate qust
-
magnetise
asses the similarity between SQL queries
-
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
bitpack-vec
A vector for arbitrary bitwidth integers, densely packed
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
redmaple
offers an oppinionated yet extremely flexible data modeling system based on events for backend applications
-
contigious-tree
Write and read tree graphs to and from contigious blocks of memory
-
sum
General-purpose sum types
-
chunked_vec
A vector-like data structure that stores elements in fixed-size chunks for better memory management
-
vec_extract_if_polyfill
Polyfill for Vec::extract_if
-
higher
Functors, Applicatives, Monads and other bad ideas
-
tc-value
TinyChain's representation of a value which can be collated and stored
-
grove
A segment tree library enabling generic user-defined queries and actions on segments of your data
-
box-collections
A no_std compatible implementation of the collection crate
-
bk-tree
A Rust BK-tree implementation
-
grangers
working with genomic ranges and annotations
-
rspack_collections
rspack collections
-
wiwi-chain
wiwi chaining API
-
string-hash-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
jsonmap
store values of multiple types value in one Map
-
mapack
mapbox vector tiles
-
advancedresearch-tree_mem_sort
An in-memory topological sort algorithm for trees based on Group Theory
-
malwaredb-api
Common API endpoints and data types for MalwareDB components
-
coca
Data structures with constant capacity
-
outils
Graph and tree data structure library. Providing utilities which aren't easily available in Rust.
-
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
-
easy-xml
An XML library
-
serde_map
Mapbased onVecfor serialization purposes -
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
ntree-rs
A mutable n-tree with async support
-
firims
fixed range integer maps and sets
-
shortguid
Short URL-safe Base64 encoded UUIDs
-
merkle-tree-bulletin-board
A public bulletin board based upon Merkle trees
-
handlemap
A collection that produces handles that can be used as keys to retrieve the stored items
-
precedence-net
Create and analyse precedence networks
-
rust_airport_supplier
Rust-AirportSupplier downloads airport data from OurAirports and decodes the information
-
sweetrpg-model-core
Core model definitions for SweetRPG
-
dyn_list
A linked list that can hold dynamically sized values in its nodes
-
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
expanding_slice_rb
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
-
enum_meta
Add metadata to Enum Variants
-
ladata
& modular data model
-
mco-gen
Stackfull Generator Library in Rust
-
vise-exporter
Prometheus exporter for metrics defined using
vise -
constructivism
Simplify the construction of structured data
-
segment-tree
Quickly perform interval queries or modifications
-
sparse_set_container
A container based on sparse set. Stable keys, O(1) lookup, cache-friendly iterations, and no hashing.
-
groupex
Syncronization primitive that allows acquire lock by index
-
res
build-script dependency for managing your project's resources
-
ndstruct
Structures for N-dimensions
-
hashbrown_tstd
port of Google's SwissTable hash map
-
stacked-set
Set interface, allowing stack-only implementations
-
tf-semver
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
panoradix
A generic map and a set, both backed by a Radix tree
-
vec-btree-map
Basically just a sorted Vec that can be used as a HashMap
-
idmap
Efficient maps of integer id keys to values, backed by an underlying
Vec -
boolvec
A vector of boolean stored contiguously in memory
-
entity
that provides entity-like constructs
-
traiter
Traits collection
-
zngur-def
Data types that define the structure of a zng file
-
interval-rbtree
An interval tree implementation using Red-Black Tree as its underlying data structure
-
graphlib
powerful rust library for the graph data-structure
-
cphf
Compile-time perfect hash function data structures
-
netcrab
creating and exporting Petri nets
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
index-ext
Index slices with arbitrary ints and as arrays
-
gen_value
indexes and values with generations for vectors
-
query-flow
A macro-free, data-oriented, general-purpose library for incremental, on-demand, self-adjusting computation using query-based dataflow
-
broomdog
A type-erased map with 'indefinite loanership'
-
rive
ecosystem crate
-
grid-tree
Pixel quadtrees and voxel octrees
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
rtree_rs
R-tree for Rust
-
range_bounds_map
[
RangeBoundsMap] and [RangeBoundsSet], Data Structures for storing non-overlapping intervals based of [BTreeMap] -
proptest-recurse
Helper for defining mutually recursive strategies with proptest
-
vp-avl
A combined Vantage-Point AVL tree, to make VP trees updateable
-
hinted
small crate for providing a size hint and exact size on an iterator
-
roers
prepare augmented annotations for single-cell RNA-seq analysis
-
dashmap-shard
port of Google's SwissTable hash map
-
charcoal
Implements tree data structures and interfaces to work with them
-
char-list
A persistent string type with the same API as a linked-list of characters
-
emap
A map with a fixed capacity and integers as keys
-
fixed-collections
Dynamically allocated ungrowable collections
-
objectionable
storage of unsized types inline inside allocated objects
-
tinybox
Like
Box, but with an optimization that avoids allocations for small data-structures -
segvec
data structure for rust. Similar to Vec, but allocates memory in chunks of increasing size
-
bnr-xfs
Pure Rust implementation of the BNR XFS USB
-
indexlist1
A doubly linked list, backed by a vector
-
reactive-signals
dx-first scope-based fine-grained reactive system
-
fenwick-bit-tree
Slighly over-engineered FenwickTree implmentation
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
bst-rs
Recursive & Iterative Binary Search Tree Implementations within Rust
-
aph_disjoint_set
Disjoint set implementation with optimized memory usage and ability to detach elements
-
gsgdt
Generic Stringly Typed Graph Datatype
-
heapq
Priority Queue with scoring function
-
messaging
two-way messaging crate
-
ttmap
Trivial implementation of type map
-
cola-crdt
A text CRDT for real-time collaborative editing
-
union-fn
Proc. macro for creating efficient "inline closures".
-
object-collection
A collection that can store multiple values of types
-
lanyard
UTF-8 C string types
-
ndim
N-dimensional array for numerals in Rust similar to NumPy
-
rc-writer
A tiny implement for writing data to a reference counted instance
-
cbsk_log
log tool
-
rj
reactive json
-
small-world-rs
The easiest HNSW vector index you'll ever use
-
lazy-cow
Copy-on-write pointers with lazy modification support to minimise clones with a cost counter to limit work duplication
-
indexed_vec
IndexVecfromlibrustc_data_structures -
char_index
efficient charwise indexing into a string
-
write_x86_64
help you write x86_64 assembly code
-
merkle
tree implementation with support for generation of inclusion proofs
-
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…
-
fwdlist
A simply linked (forward) list
-
membuffer
A very fast flat memory buffer used to deserialize at a fast speed
-
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 -
btreemultimap
A multimap implementation with range support
-
wolf-derivation-graph
Adds support for memoizing data flow graphs to wolf-graph
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
zhifeng_impl_barnes_hut_tree
implements Barns-Hut Tree for accelerated N-body force calculation
-
onigiri
handling chars
-
art-tree
The Adaptive Radix Tree
-
uintx
Unaligned unsigned integers with exact size in memory and arithmetic operations for them
-
range_union_find
A union-find data structure for ranges
-
varlen
Ergonomic variable-length types
-
total-maps
Maps where every possible key has an associated value
-
brownstone
building fixed-size arrays
-
histogram-sampler
Sampling from a distribution given by a histogram
-
singletonThread
thread in a singleton
-
llist
Lisp-style singly-linked list
-
fungi-lang
Fungi: A typed, functional language for programs that name their cached dependency graphs
-
tord
Data structure to store transitive relations
-
clonelicious
macro library that simplifies cloning and closure execution. The
clone!macro automatically clones variables and immediately executes the closure with the cloned values, streamlining… -
type-rules
easily constrain a struct
-
alist
Association list offering fast lookups while preserving insertion order
-
smallbitset
series of allocation free sets capable of holding small integer values
-
tinystr-raw
Raw string-to-integer conversions for tinystr
-
automap
pattern to implement key-value maps where the value type contains the key type
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
content-tree
An efficient data structure for compacted RLE data
-
enumoid
Enum Indexed Containers
-
recursion-visualize
visualized cache-aware stack safe recursion
-
contack
easy contact library
-
bdaddr
Bluetooth Device Address
-
rubbl_visdata
Preliminary work on generic data structures for radio interferometric visibility data
-
clash_rules
a clash yaml rule parser and matching algorithms provider
-
slas
Static Linear Algebra System
-
persist-o-vec
A Vec type that aims to have stable indices and memory location
-
value_pool
implements a ValuePool struct that makes the creation of self-referential data structures easier and safer
-
large_int
An ease-of-use unbounded signed integer
-
pi_vec_remain
vec remain range
-
limq
Queue with a controller for monitoring queue elements
-
word-dictionary
data structure for word mapping. It can be used for language translation.
-
range_map_vec
range map data structure backed by a Vec
-
appendlist
An append-only list that preserves references to its elements
-
alignment-exporter
Proc macro providing alignment info for a user-defined struct
-
fixed_bitmaps
A small crate implementing bitmap functionality around primitive Rust unsigned integers
-
grdf
Generalized RDF graphs and datasets
-
rust_twostack
Support for two-dimentional stacks for the Rust programming language
-
froop
A functional reactive stream library for rust
-
artie_common
Common Library for Artie Rust Projects
-
holyhashmap
A hash map with stable indices
-
fenny
working with Fenwick trees
-
lockerroom
Readers-writer access to individual cells of your collection!
-
inplace-vec-builder
Build a vec from a vec, in place
-
wolf-graph
Data structures and algorithms for working with graphs with reference or value semantics
-
lru-slab
Pre-allocated storage with constant-time LRU tracking
-
memvec
Memory-backed vector, not buffer. Designed for for mmap. Not MemMap, but MemVec!
-
hash-rings
Implementations of various hash rings
-
sliding_tree
A tree that grows from the leaves and recedes from the root
-
mori
orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data analysis…
-
galemu
workaround for generic associated types (GAT) limited to lifetimes (GAL)
-
prefix-tree-rs
A Trie (prefix tree) implementation
-
seadawg
that implements the online algorithm for Direct Acyclic Word Graph (DAWG) and Compact Direct Acyclic Word Graph (CDAWG)
-
b-tree
A persistent B+ tree using freqfs
-
two-sided-vec
Double ended vectors for rust, which can grow in both the front and back
-
intervals-rs
intervals
-
indexmap-rmw
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
vecset
A vector-based sorted map, set and keyed-set implementation
-
designal
Procedural macro for use with futures-signals
-
fed
A sketch implementation of anonymous, tagged unions in stable Rust
-
vicardi
JSON VCardArray Generator that uses Serde
-
tpntree
A N-dimensional generalization of region quad/oc-trees
-
solomondb
An embedded and distributed Gremlin-compatible graph database
-
linear_collections
Map and Set types backed by linear data structures
-
generic-btree
Generic BTree for versatile purposes
-
minsize
Collections with a statically known minimum size (using const generics)
-
oxidd-test-utils
Test utilities for OxiDD
-
raw-btree
Generic B-Tree implementation
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
loaned
Safely move values with live inner borrows
-
btree-ondisk
BTree structure on persistent storage in userspace
-
rdf-format
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
generational-indextree
Arena based tree structure by using indices instead of reference counted pointers
-
vecshard
Split Vecs in constant time
-
ahtable
Array Hash Table implementation
-
xsparseset
sparse set
-
bucket_vec
A vector-like data structure that guarantees to never move its contained elements
-
numas
multidimensional array for efficient computing
-
aligned-utils
Common utilities to work with aligned values and allocation
-
signvec
Vector implementation for fast, sign-based manipulation of dynamic collections
-
astack
offers a Stack data structure with fixed capacity capable of fast LIFO operations
-
bitset-core
Straightforward, no-std compatible, simd optimized, BitSet API
-
text-document
Text document structure and management
-
fallback
A helper library to implement fallback mechaism
-
tree_by_path
A tree data structure featuring nodes addressable using a &Vec<usize> path and avoiding recursion and run-time borrow checking
-
sql-json-path
SQL/JSON Path implementation in Rust
-
fast_collections
noheap zero copy collections
-
st_ring_buffer
A fixed-size String implementation using a ring buffer
-
willowtree
Lazily evaluated trees
-
idata
Small tools to reduce mutability
-
wolf-graph-mermaid
Adds support for generating Mermaid diagrams from wolf-graph graphs
-
valord-map
A dictionary sorted by values
-
indexland
Rust Collections with Newtype Indices
-
indextreemap
A BTreeMap implementation that allows for key and or positional insertion and retreival
-
simple-triplestore
graph database for storing triples with support for custom node and edge properties
-
eventree
creating lossless syntax trees
-
awid
Small, simple, universally unique identifiers
-
nonempty-containers
Fast, zero-cost conversion, and fully inter-operable nonempty container types
-
rustz
functional programming in Rust
-
bitvec_simd
bitvec with SIMD
-
bitlab
Extracting a range of bits from a binary data source
-
staticvec
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics
-
granite
Generic backing storage framework for building data structures
-
get-full-year
An unofficial Rust client for getfullyear.com that helps you get the full year
-
fluentbit
build output plugins for Fluent-bit
-
chainbuf
Fast chained buffers
-
mzdata-spectra
A subset of
mzdata’s traits and spectrum data model -
dynp
Dynamic property system that emphasizes the use of the Newtype pattern
-
tinybuf
Container for many types of immutable bytes, with optimisations for small arrays
-
schema2struct
Convert a JSON schema into Rust structs for efficient and type-safe data management
-
construe
Compile-Time Growable Array: Vec & String for const!
-
bubbletree
Bubble-tree
-
win-variant
that aims to provide a more ergonomic way of working with variants in winapi based projects
-
sbom-walker
work with SBOM data
-
wacky_traits
Defines some traits
-
rose_tree
An indexable tree data structure with a variable and unbounded number of branches per node. It is Implemented on top of petgraph's Graph data structure and attempts to follow similar conventions where suitable.
-
tree-rizzen-yazston
Tree Library using the Any trait for data
-
lumberjack
Read and modify constituency trees
-
tinyvec_string
tinyvec based string types
-
bayesic
A string matching library similar to NaiveBayes but optimized for many small classifications
-
good_lp
Mixed Integer Linear Programming for Rust, with an user-friendly API. This crate allows modeling LP problems, and lets you solve them with various solvers.
-
wccg-models
WCCG Data
-
dirbuf
reusable directory bufferes
-
pna
PNA(Portable-Network-Archive) decoding and encoding library
-
detach
helper type for being able to detach/reatach a member item
-
twovec
A data structure for storing 2 types of data in a packed, heap allocated array
-
field-ref
Field reference (like a member pointer to non-static data field in C++) for Rust
-
ecstatic
Statically-typed ECS library
-
know
Framework for Rust
-
flow_arena
A HashMap managed Graph Model with the concept of ownership
-
rosary
About Rose Trees
-
snake_case
SnakeCase is a String-like type that can only contain valid non-empty snake_case
-
swaybar-types
building swaybar status commands in rust
-
double-map
A HashMap with double key to single data/value
-
lurk-elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
bravery_router
Radix Tree implementation
-
python-objects
that implements the architecture of the CPython objects. with this crate you can crate a list with any data type from rust
-
dsalgo
A package for Datastructures and Algorithms
-
siraph
A node-based digital signal processing crate
-
overtone
An API for creation and management of rich (as in rich-text) musical-ish projects
-
enso-data
A collection of useful data structures
-
nutype
The newtype with guarantees
-
croaring-sys
Raw bindings to CRoaring
-
pin_array
Tiny crate providing an array with structurally projected pinning
-
noindexmap
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
dayendar
advanced days calendar operations
-
bonzai
An abstraction for optimizing the memory layout and pointer aliasing of trees
-
chesspos
Basic structs for representing chess squares
-
latestmap
latest map
-
to-offset
developer-friendly methods to manipulate strings with character indices
-
patricia_router
Radix Tree implementation for Rust
-
collectable
Fallible, no_std-friendly collection traits
-
genindex
Generational index library
-
fixed-index-vec
A vector-like data structure whose indices do not change when elements are removed
-
truncate-integer
Truncate integers
-
v9
A slim data engine for Data Oriented Design
-
twounordered
two vec-like vecs backed by a single vec and provides retain_mut_unordered()
-
bstree-file-readonly
Query read-only binary-search tree file, supporting billions of entries in files of tens of GB
-
timely_container
Container abstractions for Timely
-
optempty
Tools for working types that may be empty. E.g., an empty
String,Vec,HashMap, etc. -
stringid
Lightweight system to manage identifier as human readable string and unique number
-
chainmap
mutability of intermediate maps
-
sorbus
A tree manipulation library
-
tcgeneric
Generic data types used internally by TinyChain
-
timer_list
A list of timed events that will be triggered sequentially when the timer expires
-
serde_either
set to enums to deserialize and serialize data that can either be string, struct or vec
-
enum-tag
Proc. macro for generating enum discriminant types.
-
open-payments-iso20022-camt
Open Payments - Message Parsing Library - ISO20022 CAMT
-
fixedvec
A heapless version of the Rust vector type
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
civs
Controllably Increasing/Inflating VectorS
-
baz-tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
bpht
A bit-packed hash table implementation using hopscotch hashing for 32-bit keys and values
-
wildfly_container_versions
WildFly container versions
-
dendron
Generic tree data structure
-
traitgraph
Abstracting over different graph representations
-
treeflection
that provides reflection for tree structures
-
boxing
cross-platform implementations for NaN and ptr boxes
-
uniquevec
A
Vec-like datastructure which only contains unique entries. It is no_std and has optional serde support. -
ldpc
A toolbox for classical and quantum LDPC codes
-
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
-
partial-array
potentially partially-filled arrays
-
chain-map
A chain of maps with a single view into the aggregated values
-
modifier
Fluid chaining APIs for both mutable ownership types
-
swamp-analyzer
analyzer for swamp
-
make-message-bus
Generate a pub-sub bus for use in async applications
-
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
fastgraph
Graph abstraction providing a generic interface and powerful parallelized traversals
-
lluvia
A stripped down Entity Component System that allows for no-nonsense data storage in finite time
-
mashmap
A flat HashMap that supports multiple entries per key
-
cdl-list-rs
A circular doubly linked list implementation using Rc<T> and RefCell<T>
-
singletonset
SingletonSetdata structure, which makes it easy to store a single instance each of various types within a single set -
bufferbuffer
Double Buffer design pattern from 'Game Programming Patterns' by Robert Nystrom
-
collect-rs
Special and custom Collections and Containers (for Rust)
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
sycamore-state-core
sycamore-state core types and trait definitions
-
iter_seq
Stateless, transformable, abstract sequence of values
-
pinned_vec
Vec-like data structure whose elements never move
-
corresponding
Move corresponding fields between structs
-
applejack
Radix tree
-
compare
Experimental comparators for collections to be generic over
-
many-to-many
creating many-to-many data structures with the ability to query either side, useful for applications such as pubsub. Like a fusion between
bimapandmultimap. -
buffer-trigger
A data collection trigger based on the maximum number and refresh time
-
flat_collections
Lightweight and memory-efficient associative data structures
-
tree-graphviz
Generate GraphViz DOT directed trees, based on an arbitrary tree structure
-
seg-tree
segment tree library
-
ds-bst
Binary search tree implementation
-
bktree
BK-tree datastructure
-
cbsk_timer
rayon thread runtime
-
klingt
audio graph library?
-
slice-rbtree
A slice-based Red-black tree
-
spaceindex
-
cervine
A slightly more flexible Cow; roughly to T: Borrow<R> as alloc::borrow::Cow is to B: ToOwned
-
granular-id
ID numbers with arbitrary precision
-
task-collection
Types for managing and waiting on groups of tasks
-
elastic_hash_rs
Elastic Hashing from Optimal Bounds for Open Addressing without Reordering
-
pi_densevec
重定向映射表，一个使用usize作为key的映射表
-
weak-self
WeakSelf is simple way to have a Weak pointer to yourself
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
flow-graph
A representation of a graph data structure for flow-based programming
-
vec_key_value_pair
A drop-in replacement for std::HashMap and std::HashSet that use Vec on the backend
-
isomorphism
2 directional hashmaps
-
purse
Bag data structure implementation in Rust
-
myopic
A possibly bad lens library for Rust
-
periodic-rs
Bounded datastructures
-
sid_vec
Tiny library providing id types and an id-based vector
-
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
-
minimizer-queue
Fast computation of minimizers using a monotone queue
-
pointcloud
An accessor layer for goko
-
limited-queue
a limited queue that overrides the oldest data if trying to push a data when the queue is full
-
keylist
Elixir keyword list in Rust
-
dynamic_dict
A lightweight basic crate to create dynamically typed dictionaries
-
front-vec
Efficiently-prependable Vec and String types
-
flatarray
Fast implementation of SeqEval, a sequence evaluation framework
-
collection_literals
macros for initializing std::collections
-
slotgraph
Graph implementation built with slotmap and petgraph
-
hashable_weak
A hashable weak pointer
-
merkle-lite
fast, and composable binary Merkle tree and proof for Rust Crypto hash functions
-
auto_vec
Vec that automatically remove the child when the child is being dropped
-
non_empty_continuous
Non-empty continuous collections
-
fns
add common fn, eg: debounce, throttle
-
linear-map
A map implemented by searching linearly in a vector
-
statemachine-rs
A statemachine crate which have zero dependencies
-
smallobjectpool
A small object pool for Rust
-
stac-extensions
Manage STAC extensions (https://stac-extensions.github.io/)
-
workit
single-threaded work queueing utility
-
segmap
Map and set data structures whose keys are stored as ranges. Contiguous and overlapping ranges that map to the same value are coalesced into a single range. Originated as a fork of Jeff Parsons' "rangemap"
-
vecbool
bit vector built on top of Vec<u8>
-
extended-rational
implementations of high-accuracy projectively-extended rational numbers and macros for creating them
-
vec_arith
Powerful vector/matrix arithmetic library written in Rust
-
cbloom
Concurrent implementation of Bloom filters
-
whirlybird
generic type implementations for RedMaple library, that offers workflows for different events compatible with common contents like todos, blogs and etc
-
sequence_trie
Trie-like data-structure for storing sequences of values
-
pokeapi-model
Data structures for PokéAPI v2
-
rcbytes
Rc version bytes crate
-
genmap
generational map data structure with no dependencies
-
iter-set
Set operations on sorted, deduplicated iterators
-
memorable
Lock-free, ordered and multiple version memory table for key-value databases
-
treentern
An interning library that makes it easy to intern tree like types
-
luthor
A collection of lexers for various languages/formats, and the tools required to build them
-
lending-library
A key-value store that loans full ownership of items
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
enum_vec
Efficiently store a vector of enum variants as a packed n-bit vec
-
giftbox
A fun Rust crate called
giftboxto help Rustlings learn and explore generics -
nopetgraph
Graph data structure library. Provides graph types and graph algorithms.
-
graphannis-core
supports graph representation and generic query-functionality
-
tilecoding
Dr. Richard S. Sutton's tile coding software.
-
bufferring
Ring buffers for Rust
-
hashmap-entry-ownable
Variation of HashMap::entry() that accepts borrowed forms of keys
-
polystore
Polymorphic data store
-
mqfilters
Highly optimized approximate membership query filters (bloom, cuckoo, xor, quotient) with SIMD support
-
tyght-map
A static type map implementation
-
hgg
Approximate nearest neighbor search collection
-
flex-algo
Rust commonly used data structure and algorithms
-
statiki
Static friendly data structures
-
tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
spatialize
collection of spatial data structures used for efficent spatial partitioning
-
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…
-
upair
Unordered pair data structure
-
ipld-core
IPLD core types
-
ahtml
An HTML templating and manipulation library
-
medianheap
A median heap for keeping track of a running median
-
fxd
Fixed-point decimal implementation
-
pq-tree
consecutive ones property (C1P) and graph planarity testing
-
open-coroutine-timer
The time utils
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
core_collections
copy of libstd::collections with all the parts that don't work in core removed. Most importantly, it provides HashMap and HashSet. This crate is (mostly) automatically generated from the rust git source…
-
fenwick-tree
binary indexed tree (Fenwick tree) data structure in Rust
-
eki
solver for steady and transient flow in fluid networks
-
simple_tables
An easy to use rust crate for creating table structures. Including macros for easily creating these table structures.
-
rahashmap
Fork of standard library HashMap with additional functionality
-
pciids
parse the pci.ids data file
-
modupipe
A modular and extensible ETL-like pipeline builder
-
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.
-
sbox
Tiny Linux containers implementation
-
arc-atomic
atomic pointer to an
Arc -
dot_tree
Create, query and store binary trees
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
analytic
has been renamed to be the math crate https://crates.io/crates/math
-
cds
Collection of Optimized Data Structures
-
retrace
Safe, generic rollback log with predictable latency
-
crio
An easy to use persistent data storage library
-
treers
Sedgewick's tree maps
-
hedge
An index based half-edge mesh implementation
-
seq-set
A Set collection that maintains insertion order
-
sweeper
A foundation for Minesweeper implementations in Rust
-
output_iter
An iterator that performs calculation during iteration
-
cpp_map
C++ std::map emulator
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
entoli
A functional programming library inspired by haskell
-
graphrepresentations
providing efficient abstract implementations of different graph representations
-
chunky-vec
A pin safe, append only vector never moves the backing store for an element
-
circularbuf
Rust fixed size circular (ring) buffer
-
queues
Efficient FIFO Queue data structures
-
finite-automata
A collection of extendable finite automata with immutable state and transition data
-
hayami
general use symbol table
-
realhydroper-smodel
Semantic modeling for Rust
-
actions
Software without side-effects. Redo and Undo. Macro's.
-
distant-protocol
Protocol library for distant, providing data structures used between the client and server
-
rs-collections
generic collections (no dependency on std)
-
graphia
graph data structure
-
u64_array_bigints
biginteger library based on u64 arrays
-
zsling
Rust Wrapper around a Sequentially lockign (SeqLock) Ring Buffer written in Zig
-
multi_containers
Ergonomically work with multiple values per key
-
trey
Writing V3000 CTfiles
-
web-glitz-buffer-vec
Implements growing WebGlitz memory buffers for slices of data
-
dynsequence
Sequence-Like data-structure for storing dynamically sized types
-
light-id
Generate and manipulate incremental IDs effortlessly
-
partial_const
way to handle constant and non-constant values in a unified way
-
generic_event_queue
generic event-queue API
-
syntastic
Generic abstract syntax representation
-
hash_ring
Consistent Hashing library for Rust
-
ndcopy
Fast N-dimensional array memcpy
-
simple-vec-collections
Collections implemented using Vec
-
cast-rs
A collection of types cast for Rust
-
splay
native implementation of a Splay Tree for Rust. Splay Trees are self-balancing binary search trees which adapt dynamically to lookups over time to allow common access patterns to frequently have better than log(n)…
-
mutcrab
written in rust that contains various classic data structures
-
btreec
Rust bindings for btree.c
-
atomic_lifo
Lock free thread-safe lifo for rust
-
mergle
A data structure with fast merging and comparison
-
treelike
A trait to abstract over trees, and simplify implementing them, all in one handy crate
-
swamp-std
standard library for swamp
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
redox_simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
zot
Option-like enums for working with ordered collections of zero, one, or two items (
Zot), or ordered collections of one or two items (Ot) -
diskmap
disk based HashMap-like for shared concurrent memory usage
-
rds-tensors
Rust Data Science Tensors crate
-
pareto_front
Builds a Pareto front incrementaly
-
multiset
Multisets/bags
-
implhm
Simplified library of collision-handling HashMaps
-
wildland-catlib
Wildland Catalog Library client
-
no-order
A transparent wrapper to ignore ordering and hashing of any value
-
dynstr
A string implementation optimized for manipulations
-
multipeek
An adapter to peek at future elements in an iterator without advancing the iterator cursor
-
bitstring-trees
Trees based on bitstrings
-
simple-ref-fn
function wrappers that do not require virtual tables
-
igraph
A graph representation data structure with a built in index on keys
-
tinyid
A tiny ID type that's like UUID except shorter and easier for a user to type in
-
serde_single_or_vec
Type which can be deserialized from either a sequence or a single value
-
simple-undo
Easy to use undo-redo library
-
kodiak-taxonomy
manage generic taxonomies supporting unique features
-
rpos
Cursor Manager on Table
-
processing_chain
set up processing chains of large amounts of data
-
app_properties
reading application properties from a file
-
gridd-euclid
euclid-compatible grid data structure (forked from Frosh_VII's gridd)
-
unthbuf
Unsigned N-bit Buffer: A structure that holds a fixed buffer of
bits-sized unsigned integer elements -
aliri_braid_examples
Examples demonstrating usage of the
aliri_braidcrate -
persistent_hashmap
Persistent hashmap is a library for working with memory mapped hashmaps
-
unflatter
unflatteris a Rust library providing extension traits for flattening and unwrapping nested structures, including nestedOptionandResulttypes. It simplifies working with deeply… -
optionee
The macro to create option struct easily
-
iunorm
Map normalized floating-point numbers to/from (un)signed integers
-
graus-db
A high-performance, thread-safe key-value embedded data store
-
search_trail
manager of variables that can save and restore their values
-
multipath
split file path, like
/home/{user,admin}/file.txt -
index_many
A proof of concept for indexing an slice at multiple locations at once
-
object-chain
Ad-hoc structure builder
-
goodreads
deserializing a Goodreads library export
-
bengbenge
inifity array for round-robin dns, beng, beng
-
rolling_norm
Computes the rolling mean, variance, standard derivation and norm
-
easy_collections
Wrappers around standard collections for ease of use and quick prototyping
-
untyped_vec
A type-erased vector type for Rust
-
das-grid
2D grid library which serves as fundamental building block for any 2D game built on the concept of grid
-
leetcode-solutions
A collection of leetcode solution in rust
-
parst
declarative parsing
-
nave
Thinking about the construction of distributed systems starting from the *consistent hash* algorithm
-
ashscript-types
Types for Ashcript Game game and action states
-
resizing-vec
An automatic resizing vector for data with linear increasing ids
-
median-heap
A median heap implementation in Rust, used to keep track of a running median of a sequence of numbers
-
shared-string
Split a string without another allocation
-
list-any
Type erased slices and Vecs
-
const_array_map
A const-capable Map type backed by a static array
-
hyperbitbit
data structure
-
read-copy-update
locking primitive
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
inline-css
Embed CSS directly in your Rust code
-
jirachi
A collision resistant runtime agnostic key-generator
-
ospf-rust-multiarray
A multi-array utils for ospf-rust
-
datastructures
A variety of data structures for learning purpose
-
mkargs
Build command arguments
-
recursive_array
arrays using recrusive data structures to avoid limitations of the rust compiler
-
index-map
A map with automatically generated usizes as keys
-
artful
Low-memory overhead and high-performance adaptive radix tree
-
sparse-bitfield
Bitfield that allocates a series of small buffers
-
hdf5-hl
High level bindings to HDF5 High Level API
-
wolf-graph-dot
Adds support for generating Graphviz DOT files from wolf-graph graphs
-
pinus
A prickly BTreeMap. You can insert through shared references and values are pin-projected.
-
libarena
Arena allocated graph implementation
-
discord-indexmap
A fork of the popular
indexmaplibrary that adds a few extra APIs that are yet to be upstreamed -
mind-tree
Organize your thoughts in a tree-like structure
-
valet
Stores your objects and gives you a tag to retrieve them later
-
aatree
in Rust
-
collect_result
collecting an iterator of results into a result of a collection
-
smap
Simple-Map: HashMap for easy to use
-
octree
algorithm for nearest neighbor search in 3D space
-
smallbigint
Big integer types that have a small on-stack representation for small values. Uses num-bigint internally.
-
vec-option
A space optimized version of
Vec<Option<T>>that stores the discriminant seperately -
advanced_collections
advanced data structures (collections). Includes counter (hash-bag, multiset), disjoint set (union-find, merge-find), circular buffer (cyclic buffer) and interval (range)
-
const_std_vec
const std vec
-
deviz
access to a VS Code extension for displaying structured program output
-
moonlight_collections
Collections for Rust
-
rive-models
Revolt API models for the Rive ecosystem
-
arc-bytes
A reference-counted byte buffer
-
codemap2
maintained fork of the codemap crate that contains a data structure for efficiently storing source code position and span information (e.g. in a compiler AST), and mapping it back to file/line/column locations for error…
-
dyn-slice
&dyn [Trait] implementation, inspired by a Reddit thread
-
changed
change detection
-
cbsk_log_tokio
log tool, using tokio as the runtime
-
anylist
a list type for any type
-
opt_vec
A wrapper around Vec<Option<T> that makes deletion fast
-
pac_cell
Parent and child cell
-
chrom
representing colours
-
cursed-collections
Collections that (seem to) break Rust safety
-
conlife
Backend-only implementation of Game of Life with minimal dependencies
-
tag-vec
A vector used for storing tags
-
slice-cell
A
Cell<[T]>-like mutable slice, that allows slice-like APIs -
default-vec2
Vec-like data structure with default elements and a bitset built using it -
static_map
A static hashmap implementation, based on the Round-Robin hashing algorithm found in rustc
-
mrkl
Generic, minimalist, parallelizable Merkle tree
-
treap_non_random
A non-randomized Treap implementation. Not very useful as a balanced tree, but useful when implementing CVM or similar algorithms.
-
bloom-filters
Rust port of https://github.com/tylertreat/BoomFilters
-
spooles_ffi
Spooles C library FFI
-
rust_fixed_width
that allows for easier manipulation of fixed width files allowing for the ability to name fields and such using specs
-
bisetmap
fast and thread-safe two-way hash map of sets. It is best suited where you need to associate two collumns uniquely. Each key is associated to one or more other unique values. The structure…
-
simple-matrix
generic matrix library
-
version-lp
a version struct library for use with version comparing, and wildcard resolving
-
fixed-slice-deque
A fixed size deque implementation
-
benchmark-counters
Light-weight data structures to help with monitoring and benchmarking
-
multi_key_map
a hash table that shares one value across multiple keys
-
flats
flattens nested structures into a flat single dimension map
-
weak-lists
Lists with weak references and concurrent iteration and modification
-
partial
Optional monad with fake variant
-
hashable-map
Wrappers for HashMap and HashSet that implement Hash
-
ctxmap
A collection that can store references of different types and lifetimes
-
bittyset
A BitSet type for manipulating bit sets
-
tea-core
Core data structures and traits for tevec
-
btree-vec
A growable array (vector) implemented using a B-tree
-
typed_graph
Staticly typed graph library
-
nslice
Structures for interpreting slices of variable length as arrays
-
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 -
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
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
-
maybe-cell
An UnsafeCell optionally containing a value, with the state externally managed
-
arith
containers with arithmetics
-
collectivity
Generic collection traits
-
sdsl
interface for the Succinct Data Structure Library
-
priq
Array implementation of the min/max heap
-
fqdn-trie
FQDN (Fully Qualified Domain Name) lookup structures (based on tries)
-
composite_types
Compose type definitions in the style of typescript
-
weight-cache
A cache that holds a limited number of key-value-pairs according to a user defined criterion
-
xdag
DAG(Directed Acyclic Graph) lib
-
lexpr
A representation for Lisp data
-
comprehend
Python like list, set and hashmap comprehensions via macros
-
colmac
Macros to work with
std::collections -
lesbar-text
String extensions and queries for legible text
-
inditech
A set of technical indicators for time series analysis
-
cons-rs
containing a Cons data structure
-
nimble-steps
Nimble Steps Collections
-
array-const-fn-init
Initializes an array with constant values calculated by a
const fn -
uvector
access two slices as a single continuous vector
-
stable_bst
An ordered map and set based on a binary search tree. Works with stable Rust 1.9.0.
-
linked-vector
A hybrid linked list and vector data structure
-
dd_statechart
A Data-Driven implementation of Harel Statecharts designed for high-reliability systems
-
viral32111-xml
XML parser crate for my Rust projects
-
owned_chunks
a collection of traits and iterators to get owned chunks from collections
-
dfb
Dynamic-Fifo-Buffer, like AnyMap but uses a VecDeque to store values and treats access as a Fifo
-
generational_token_list
A doubly-linked list backed by generational-arena
-
sequencetree
a new type of collection to store keys and their corresponding values
-
sliding_extrema
Queue data structure with support for an O(1) extrema function over contents (for example, to obtain min and max over a sliding window of samples)
-
sot
Object Tree
-
colours
Color types for different color models with conversions between it
-
case_insensitive_string
A case insensitive string struct
-
path-value
Universal type and access property(s) by path
-
pure-hfsm
A finite state machine library with a clear separation between the machine definition and its changing state
-
wrapped_slab
WrappedSlab: Auto-generate newtype idiom based on a Slab
-
non-empty-collections
Non-empty hash-map and hash-set implementations
-
capillary
HashMap-like storage of key-value pairs, but allowing for step-by-step (partial) search of value
-
hpo
Human Phenotype Ontology Similarity
-
plurals
singular/plural forms, mostly in English
-
one_way_slot_map
SlotMap with minimal restrictions on Keys and Values
-
swimmer
Thread-safe object pool type
-
mini_uuid
A small and URL-safe UUID crate for Rust
-
nostd-bv
Bit-vectors and bit-slices
-
binary-tree-view
A binary tree visualization application built in Rust
-
magiclist
List with O(log n) random access, insertion, splitting, and merging
-
half-2
Fork of starkat99/half-rs. Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types.
-
yuuang_petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
Project2
Implementations of red black tree and AVL tree
-
sparse-bin-mat
A sparse implementation of a binary matrix optimized for row operations
-
erased_set
A set of erased types
-
trying
Basic trie crate
-
take-some
that provides a way to obtain *some* value from various collections
-
yyid
Yyid generator (random tokens like UUIDv4, but using all the bits)
-
subset-map
A map where the keys are subsets of an initial set of elements
-
petr-stdlib
the petr language's standard library
-
parse_tree
A non-abstract syntax tree type
-
froggy
prototype for the Component Graph System programming model. It aims to combine the convenience of composition-style Object-Oriented Programming with the performance close to Entity-Component Systems
-
amplify
Amplifying Rust language capabilities: multiple generic trait implementations, type wrappers, derive macros
-
actionidmap-updater
A HashMap that can be updated from a URL. Intended to be used to keep reverse-engineered API's in use even as private referenced ID's get updated.
-
nvpair-rs
Safe and rustic wrapper around nvpair
-
graff
manipulating graphs
-
checked
Implements a wrapper over the primitive Rust types that better indicates overflow during arithmetic
-
quarkrs
A collection of small life improvements for rust
-
typed_index_collection
Manage collection of objects
-
bitvec-rs
Bit vector with guaranteed
[u8]representation and the ability to get safe immutable and mutable views into its internal vector for easy I/O -
version-rs
A struct for Versions, with the methods you expect
-
restorable
An iterator adapter for saving and restoring iterator state
-
tinymap
A map structure that stores its data on the stack
-
vector-trees
Vector backed B and AVL trees
-
triangle_matrix
Triangle matrix indexing operations
-
usage
A convenient alternative to the newtype pattern
-
prefix_array
A generic container for searching on prefixes of keys
-
ypwt
ypwang's personal toolbox
-
bibliographix
A bibliography management crate
-
streaming_algorithms
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
simplecountry
Country Library
-
fplist
An immutable, persistent, singly-linked list
-
batbox-cmp
Traits & functions related to Ord
-
kd_interval_tree
Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups.
-
dependency-graph
building and resolving dependency graphs
-
vec-entries
Entry API for iterating over and removing elements from a
Vec -
dawgdic
Port of DAFSA in safe Rust (original implementation courtesy to Susumu Yata)
-
ih-muse-record
Record Muse Api usage for testing purposes
-
cset
Fine-grained and reversible struct transactions
-
rt-lists
Link lib
-
handler_map
Map from types to functions that receive them
-
bit-array-rs
Bit Array
-
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.
-
data_structure_traits
data structure collection traits
-
simple_event_bus
A basic, simple event bus in Rust
-
temporary-annex
Helper for creating temporary annex on a collection
-
liblet
learning about formal languages and grammars
-
big-tuple
providing trait implementations for tuples of up to 128 elements
-
qualomat_schema
Rust bindings for the *Qual-O-Mat* open data format for the german voting advice tool *Wahl-O-Mat*
-
pl-hlist
support for heterogeneous lists (known as
HLists), which are functional, tuple-like, strongly-typed data structures that can contain elements of differing types -
canopydb
Transactional key-value storage engine
-
hi-doc-jumprope
fast rope (fancy string) library built on top of Skiplists - hi-doc fork
-
google-contacts-csv
Struct defined to hold the contact information from the Google contact file
-
anas
Anas's Meta-data crate
-
equivalence
Trait and derive macro for comparing and hashing types modulo an equivalence relation
-
kvv-efa-api
Rust bindings for the KVV (Karlsruher Verkehrs Verbund) "EFA"-API
-
segment-map
A self-balancing binary search tree for mapping discrete, disjoint segments to values
-
bitrush-index
A serializable bitmap index library able to index millions values/sec on a single thread
-
run-loop
Run loop for thread, provide message post, deadline timer and future executor
-
dyobj
improved version of the ECS pattern
-
sws-tree
Slotmap-backed ID-tree
-
range-mutex
A
Mutex<[T]>-like type, that allows locking different ranges separately -
dyn_vec
A Vec<T: ?Sized>
-
inline-str
Efficent and immutable string type, backed by inline-array
-
okasaki
A collection of peristent datastructures
-
epoch32
32-bit Epoch with specified starting year
-
zetacore
in-memory vector store library with Python bindings
-
quadboard
Typed fixed-length buffers of chess pieces
-
dependy
Dependency resolution with variable dependency types
-
calcit_fingertrees
(Calcit fork of )Immutable persisten
fingertrees -
decomp
Components of a decompilation pipeline
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any char iterator
-
rdf-reader
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
cad_import
importing CAD data from different formats into a uniform in-memory structure
-
shortlist
An efficient data structure to track the largest items pushed to it
-
tinyvecdeq
VecDeque-like data structures -
elastic-array-plus
Elastic vector backed by fixed size array
-
bytesstr
An immutable reference-counted UTF8 String
-
circular_vec
A fixed length vector that provides a next function that loops infinitely
-
kmmp-generator
allows one to automate the setup of Kotlin Multiplatform Mobile (KMM) projects. Simplify the creation of KMM projects by generating project structures, managing configurations, handling dependencies…
-
async-func
providing macros to simplify the creation of asynchronous closures with external state captured by move. Useful for structuring asynchronous code with ease and clarity.
-
tantivy
Search engine library
-
gpt_disk_types
GPT (GUID Partition Table) disk data types no_std library
-
graph-rs
graph library
-
fusefilter
No alloc membership approximation
-
datazoo
Bitset and jagged array data structures
-
hibit_tree
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
-
nfe
NF-e - Manipulação da nota fiscal eletrônica
-
soapy-shared
Custom types used by soapy macros
-
trips
generic triple store written in Rust
-
eytzinger-map
array/vec based map using eytzinger search algorithm
-
rustupolis
tuple space data structure in Rust
-
wide
help you go wide
-
meminterval
interval-tree in Rust made to store memory mappings
-
tree-cursor
non-intrusive tree cursor that supports node mutation without Cell/RefCell
-
array2ds
Package for handling sized 2d arrays in rust, without the usage of the keyword unsafe cuz why not
-
embedded-async-helpers
staticfriendly helpers for async on embedded -
bitf
procedural macro to easily create a bitfield out of a struct
-
oas3
Structures and tools to parse, navigate, and validate OpenAPI v3.1 specifications
-
bitstr
contiguous sequence of bits in memory
-
rs-snowflake
Rust version of the Twitter snowflake algorithm
-
string-wrapper
A possibly-stack-allocated string with generic bytes storage
-
tobz1000-petgraph
Pseudo-namespaced fork of
petgraph: Graph data structure library. Provides graph types and graph algorithms. -
quetta
Immutable, reference-counted strings for rust
-
jagged_array
Owned
[[T]]-like 2D array where each row can differ in length -
p8n-types
Basic types for representing binary programs
-
stupid-add
If you want to add stuff this lib is the way to go
-
k2_tree
A space-efficient representation of sparsely populated bit-matrices
-
lim-bit-vec
Limited bit vectors
-
farmap
working with Farcaster label datasets
-
last-git-commit
wrapper arround git2-rs to get info about the last commit. Useful for when you want to show the git hash in a program.
-
colony
A fast associative data-structure that chooses its own keys
-
open-payments-iso20022-reda
Open Payments - Message Parsing Library - ISO20022 REDA
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
spectacle
Opt-in runtime introspection
-
bidrag
input-binding system (API-Agnostic)
-
dynprops
Creating and extending objects with typed dynamic properties
-
om2
A set of classes generated from the OM2 RDF schema (mainly Unit)
-
safe-graph
Graph implementation (refactored version of GraphMap from popular crate petgraph)
-
aoc-framework-utils
such as data types, algorithms and functions for aoc-framework-rs
-
adjacency-list
Adjacency List and Adjacency Graph
-
fpq
Priority Queue with scoring Function
-
ads-rs
(Algorithms and Data Structures) is a set of useful generic production-ready algorithms and data structures
-
eternaltwin_dinoparc_store
Dinoparc store implementation
-
oats-rs
Short, unique ids without the hassle of random uuids
-
immer-rs
A wrapper around the C++ library immer for persistent datastructures
-
protocoll
clojure inspired protocols for rust collections
-
win-idispatch
that aims to provide a more ergonomic way of working with idispatch in winapi based projects
-
woodland
Easy to use implementations of popular tree data structures such as Binary, Binary Search, AVL, Red-Black, and more
-
eth2_ssz_types
types with unique properties required for SSZ serialization and Merklization
-
kukoo
lockfree cuckoo hashmap
-
simple-graph
Graph library with ability to serialize/deserialize Trivial Graph Format
-
push-while-ref
push while having a reference
-
construct
A macro for building container literals
-
bytes32
Used to create a custom type for 32-bit-wide byte arrays. Used for Drops of Diamond (more information about DoD is available at https://github.com/Drops-of-Diamond/Diamond-drops).
-
poset
posets
-
rand_map
A map that creates a random handle on insertion to use when retrieving
-
rust_release_artefact
Safely extract installable files from Rust release artefacts
-
const-vec
Vec-like data structure with immutable push method
-
puruda
Pure Rust DataFrame
-
sparseset
A Sparse Set
-
system-config
storing application properties on disk
-
scaffolding-core
A software development kit that provides the scaffolding for building applications and services using OOP
-
sliding_window_alt
A structure that holds the last N items pushed to it
-
simple-collections
Collection of simple collections
-
rust-fsm
A framework and a DSL for building finite state machines in Rust
-
rocstr
An immutable fixed capacity stack based generic copy string
-
ensure
target state of an object
-
tudelft-dsmr-output-generator
Companion library for the TU Delft Software Fundamentals individual assignment
-
bet
parsing and evaluating binary expression trees
-
undo_2
Undo and redo done the right-way
-
sorted_vector_map
maps and sets backed by sorted vectors
-
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…
-
adts
Common abstract data type traits and implementations
-
nonoverlapping_interval_tree
Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate).
-
rudy
Judy array implementation in pure Rust
-
alo
ALO means At Least One. It could contain any number of item like
Vecbut it does not heap allocation if it contains only one item -
stringmap
An immutable string map with pointers into frozen memory that can be shared between C, Ruby, Python and Rust
-
gap_vec
GapVec data structure in rust
-
threshold-dict
A data structure to find smallest key that is larger than the query
-
deepmesa-collections
A collection of data structures and algorithms designed for performance
-
const-oid
Const-friendly implementation of the ISO/IEC Object Identifier (OID) standard as defined in ITU X.660, with support for BER/DER encoding/decoding as well as heapless no_std (i.e. embedded) support
-
staticsort
Implements a macro providing a compile-time quicksort function for arrays of any length, containing any primitive Copy type with a PartialOrd implementation
-
id-vec
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
-
rt_vec
Runtime managed mutable borrowing from a vec
-
tree-collection
Name reservation – Project will feature a collection of dependency-free pure rust implementations of tree varaints, such as AVL Tree, TTree and B+ Tree
-
bytes-quilt
data structure for tracking random-access writes to a buffer
-
vax-floating
VAX floating-point types
-
linked_array
Arbitrarilly long fixed-size arrays
-
cliquers
Manage filesequences with a common numeric component
-
my_crate_new
function collection
-
collect-me
Additional collections not included in the Rust standard library
-
baggie
Container for storing mixed / heterogeneous values in a common structure
-
collections-rs
Generic collection types for rust
-
fast_forward
Quering collections blazing fast
-
another-option
option data type; useful when allocations are expensive
-
collectioner
collection helper
-
cosmic_undo_2
Undo and redo done the right-way
-
foliage
Abstract syntax tree for first-order logic with integer arithmetics
-
fixed_str
Fixed-size, null-padded UTF-8 string type with const-safe construction and binary serialization support
-
fdm-toolkit
reading and writing 4D Miner (0.2.1.4 Alpha) game-data
-
string-err
String error type
-
binary_sort_tree
二叉树的new,insert,del,search等方法
-
gardiz
integer geometry on 2D planes, focused on games
-
polars-ad-hoc
Polars
-
gamozolabs/rangeset
Pure Rust x86_64 bootloader and kernel
-
zond
standard rust collections but with collecting statistics
-
dltree
Doubly linked tree with leaf-considering typing
-
identifier
Generate 128 bits id structs easily
-
proc-concat-bytes
Like std::concat but for byte strings
-
ndtensor
n-dimensional tensor library for Rust
-
ketsugou
merges two arrays
-
prost-unwrap
A procedural macro for prost-generated structs validation and type-casting
-
incrstruct
Build self-referencing structs using two-phase initialization
-
indexmap-amortized
hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual…
-
strawberry_fields
Consume, read, and mutate struct fields with an iterator-like api
-
sharedvec
A fast but limited collection for storing values of a single type
-
bfield
B-field datastructure implementation in Rust
-
sesstype
Multiparty Session Types
-
bin_file
Mangling of various file formats that conveys binary information (Motorola S-Record, Intel HEX, TI-TXT and binary files)
-
rbx_tree
Weakly-typed Roblox DOM implementation for Rust
-
competitive-programming-rs
Competitive Programming Library in Rust
-
thin_str
A string type that’s smaller than
Box<str>or String -
btree-plus-store
B-trees backed by a slab/arena to reduce allocations and increase locality + copyable, immutable B-trees which must be manually dropped
-
nullvec
Rust nullable vector, which can contain null(missing) values as element
-
kserd
Kurt's Self-Explanatory Rust Data
-
lumberjack-utils
Read and modify constituency trees
-
kill_tree
🌳 Kill Tree is a library designed to terminate a specified process and all its child processes recursively, operating independently of other commands like kill or taskkill
-
simple-bitrange
manipulating bit ranges which is common when working with IC registers
-
map_in_place
Reuse the memory of a Vec<T>, Box<[T]> or Box<T> when mapping the elements if possible
-
bounded
numeric types
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
hannibal
A small actor library
-
packed_str
Store immutable strings in a single packed allocation
-
geo-index
Fast, immutable, ABI-stable spatial indexes
-
memcell
providing a MemoryCell struct, which stores a current and previous value
-
ziptree
Tarjan's zip tree implemented in Rust
-
foxy_types
Types for
foxy -
ra_ap_rustc-dependencies
TBD
-
guzzle
A derivable trait for consuming key value pairs into structs
-
elaru
Memory safe implementation of LRU cache
-
ute2
(U)biquitous (T)ile (E)ngine (2) - lib for parsing and manipulating abstract polygons with tagged sides
-
abbrev-tree
highly inefficient data structure for text completion
-
pages
A dynamically-sized heap-backed data page. Comprises a user-chosen header and data array packed into a single allocation.
-
swap-queue
A lock-free thread-owned queue whereby tasks are taken by stealers in entirety via buffer swapping
-
tiltflake
distributed database that uses the flake algorithm to generate unique IDs
-
ecoord-core
Core primitives and operations for transforming between 3D coordinate frames
-
alloc-wg
Attempt of collection several proposals of the allocators-wg
-
simple-collection-macros
configurable macros for maps and sets
-
iostream
the project is rust io stream.you can easily use it to manipulate files stream and memory stream
-
simd-r-drive-extensions
Storage extensions for SIMD R Drive
-
text_utils_s
edit array. Example delete duplicate in array. Clear string
-
hex-string
a data structure for managing hex strings in both string and byte vector representation
-
smallgraph
A small graph based on smallvec
-
ident
wrapping types with an immutable identifier and storing/accessing such types in collections
-
rustupolis_server
using space tuples in fog computing
-
automerge-persistent-sled
A sled adapter for persisting Automerge documents
-
eziter
Wrapper around Iterator
-
tsil_cev
LinkedList on Vec
-
unempty
Non-empty data structures for Rust
-
graph_process_manager_core
explore parts of a tree-like or graph-like structure that is not known in advance
-
rustfsm
Define state machines that can accept events and produce commands
-
terminal-linked-hash-map
A fork of linked-hash-map that builds on stable in exchange for not allowing custom hashers
-
triskell
A tri-partite ring buffer
-
keymaps
standardized encoding for key codes
-
ucd-trie
A trie for storing Unicode codepoint sets and maps
-
nibble_vec
Vector data-structure for half-byte values
-
simple_ringbuf
Ringbuf is a speedy lightweight fixed-size infinite-use collection optimized for straightforward single threaded use
-
serde-ordered-collections
Ordered serialization/deserialization serde functionality
-
tinysearch-cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
vec_2d
2d vector for Rust
-
bucket_queue
A Bucket Queue data structure that can be used as a Priority Queue
-
hexarr
working with hexagonal grids
-
quantity
Representation of quantites, i.e. of unit valued scalars and arrays.
-
containers
Containers
-
fusebox
Mostly safe and sound append-only collection of trait objects
-
default-vec
A specialized vector that has a default value
-
lambda-apigateway-response
Response object for AWS Lambda with API Gateway
-
largeint
that supports large integer arithmetic
-
bit-vec-omnitool
A vector of bits
-
hostname
Cross-platform system's host name functions
-
typeslice
type-level slices
-
byte_set
Efficient sets of bytes
-
courgette
Colour manipulation/conversion library
-
string-offsets
Converts string offsets between UTF-8 bytes, UTF-16 code units, Unicode code points, and lines
-
bloom_filter_plus
rust_bloom_filter
-
nats-types
Enumerations and types for representing NATS protocol messages
-
quotient-filter
A quotient filter implementation
-
scratchbuffer
A Vec<u8> like data-structure, that can be used as slices of different types
-
ppar
Persistent immutable array
-
cmp_wrap
Let you compare structes by context
-
growable-bitmap
A growable (and shrinkable) compact boolean array
-
tree-index
Index a flat-tree
-
medea-reactive
Reactive mutable data containers
-
orx-imp-vec
ImpVecstands for immutable push vector 👿, it is a data structure which allows appending elements with a shared reference -
arenas
Arena data structure for efficiently adding & removing items with stable IDs
-
art
adaptive radix trie
-
pair_macro
Create types consisting of the same type values such that Pair, Triplet, and so on
-
quantized-density-fields
Quantized Density Fields data structure
-
clone_cell
A Cell that works with a restrictive form of Clone
-
apint
Arbitrary precision integers library
-
fastdivide
partial port of libdivide. It makes it possible to reduce the cost of divisions.
-
unicase_collections
Collection of UniCase datastructures
-
lz_diet
An AVL balanced Discrete Interval Encoding Tree
-
streamies
More features for your streams
-
futures-bounded
bounding futures in size and time
-
acme-types
Types for implementing ACME (RFC 8555) providers and clients
-
tupley
Extension for primitive tuple (Hlist based on recursive structure)
-
rmat
minimal implementation of two-dimensional matrix algebra
-
binary_tree_zy
binary tree
-
mismatch
abstract mismatching. Useful for error propagation.
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16coordinates. -
jcm
Pure Rust implementation of the JCM USB communication protocol
-
geomprim2d
2D geometric primitive types
-
bpf-ins
working with eBPF instructions
-
into_enum
Rust macro to generate trivial From impls
-
tinybitset
Generic implementation of small, fixed size, copyable bitsets
-
blocked-vec
A vector of byte blocks behaving like files
-
kushi
A queue built for the Dango Music Player and Oden Music Bot
-
grit-bitvec
BitVec, a vector type that can store fixed-width data with irregular bit widths
-
vortex-bytebool
Vortex byte-boolean array
-
sigma-rust
parsing and evaluating Sigma rules to create custom detection pipelines
-
bndpresbufq
Bounds-preserving, optionally limited, buffer queue
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
aabel-identifier-rs
defines identifier behavior, such comparing them, or generating sequences of identifiers
-
data-structures-algorithms
Data Structures and Algorithms in Rust!
-
typed_floats
Types for handling floats with type checking at compile time
-
arrayvec-const
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
kathy
Const-evaluated swift-style keypaths
-
gvdb
glib gvdb file format
-
immutable-map
An immutable ordered map and set based on weight-balanced tree
-
nested
A memory efficient container for nested collections (like
Vec<String>orVec<Vec<T>>) -
destiny-pkg
Destiny 1/2 Tiger package library and tools (unpacker, verification)
-
timeless
storing in-memory timeseries data
-
anycollections
Rust Vec and HashMap which can contain arbitrary types
-
macaddr
MAC address types
-
disjoint-hash-set
A disjoint set / union-find data structure suitable for incremental tracking of connected component identified by their hash
-
wagon-utils
Various utilities for WAGon
-
kodiak-sets
manage generic sets supporting unique features
-
bitint
Integer types that have a logical size measured in bits
-
fairqueue
Spatially distancing fair queue. A kind of queue for sequential round-robin processing.
-
bonsai
Index arithmetic functions for perfect binary trees
-
esl01-dag
DAG used for source control
-
single_byte_hashmap
HashMap for storing singular bytes as keys
-
forgetful
Track and forget values within a specific scope, enabling detection of repeated values
-
tiled-json-rs
parse and interact with Tiled editor JSON files
-
ro
stuff read-only
-
smol_str
small-string optimized string type with O(1) clone
-
judy-wrap
Judy arrays FFI mid-level binding
-
extended-collections
An extension to the collections in the standard library with various data structures
-
final
Wrap a value in a type that does not give out mutable references
-
bool_ext
defines and implements a complete set of
Option/Result-style Boolean functional combinators on Rust’sboolprimitive type -
ascii_num
digit to ascii numbers
-
extensions
typemap container with FxHashMap
-
json_to_struct
Convert JSON into Rust structs for efficient and type-safe data management
-
depends
Ergonomic, performant, incremental computation between arbitrary types
-
structures
collection data structures
-
restor
A dynamic resource storage system in rust
-
bon
Next-gen compile-time-checked builder generator, named function's arguments, and more!
-
fix_float
Fixed floating types that allows useful trait implementations and datastructures on float numbers
-
lancelot
binary analysis framework for x32/x64 PE files
-
map1
@ErichDonGubler's fancy template for new Rust projects
-
scoped_stack
A scoped stack data structure
-
field_accessor
A procedural macro to get and set a struct field by String dynamically
-
squall_dot_io_resp
A RESP parser implementation, written with edge performance in mind
-
ioc
An Inversion-of-Control library in Rust
-
shopless-types
API types of shopless
-
json_tables
A structure that eases operations with a local json storage of undetermined items
-
bitsvec
A bit vector with the Rust standard library's portable SIMD API
-
brarchive
Bedrock Archives in Rust
-
to-binary
Converts From Hex, UTF-8, Vector of Bytes, or a Byte Slice to a Binary String And Implements Many Useful Functions For Binary Strings
-
deltastruct
Allows defining deltas for tagged structs for later application
-
cloneless_cow
A greatly-reduced implementation of Cow that does not require T to be Clone but allows for storing either a reference or an owned instance for future needs of references to T
-
alpha-micrograd-rust
Expression tree, automatic gradients, neural networks, layers and perceptrons
-
collidea
Collision-prone memory-efficient collections
-
ABtree
AVL and Btree for rust
-
twie
fast and compact prefix tries
-
pluck
Extract values conveniently
-
progress-streams
Progress callbacks for types which implement Read/Write
-
ropey
A fast and robust text rope for Rust
-
twodarray
A 2D array library
-
graphific
graph data structure library
-
cock-tier
Measure the power level of a peen
-
ploc-bvh
A Bounding Volume Hierarchy based on PLOC
-
thincollections
Alternative implementations for vector, map and set that are faster/smaller for some use cases
-
prcn_lib
private library for atcoder
-
sum-queue
Queue struct that keeps a fixed number of items by time, not capacity, and allows to get summarized stats of its content
-
crdt
Conflict-free Replicated Data Types for Rust
-
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 -
priority-expiry-cache
A cache that evicts items based on their priority and expiry time (LRU + TTL) Add (O(1)), Get (O(1)), Evict (O(1)) in both time and space
-
fast-rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 15812785344d913d779d9738fe3cca8de56f71d5 The publishing script for this crate lives at: https://github… -
qlrumap
A HashMap with an LRU feature
-
vectune
A lightweight VectorDB with Incremental Indexing, based on FreshVamana
-
internode
Smart references to your graph nodes
-
chtholly_tree
Rust bindings for Chtholly Tree
-
libreda-splay
Splay map and splay set data structures
-
mikufans-proto-intl
gRPC APIs for Mikufans (Intl)
-
yagraphc
working with Graph data structures and common algorithms on top of it
-
json-node
A way to work with JSON as a node tree
-
gridd
A generic, dirt-simple, two-dimensional grid
-
streamhist
streaming histogram
-
file_graph-rs
A tiny crate to generate a tree like structure starting from a folder and branching inwards
-
insrcdata
Embed static data as source code
-
better_peekable
Create a Peekable structure like Rust's Peekable except allowing for peeking n items ahead
-
sequence-map
Implements a map of unsigned 64-bit keys into strings. The map is optimized for creating it once, and then reading many times. The struct
Builderis used to build the map, and the structMapis used for lookups… -
keyed_vec
Vector type where the key is a custom object to avoid mixing indices between vectors
-
os_error
Struct
OsErrorrepresents only the OS error part ofstd::io::Error.OsErrorimplementsClone,Copy,PartialEq,PartialOrd,Eq,Ord,Display,Debug,Hash,TryFrom<std::io::Error>… -
backtracking_iterator
generic iterator with an item history, capable of backtracking and forgetting
-
honeycomb-core
Core structure implementation for combinatorial maps
-
rust-ds
Custom data structures crate for Rust
-
cbor-tag-index
Tag index
-
fill_canvas
FillCanvas is a wrapper around a matrix with special methods to fill the cells
-
ternary-tree-wasm
A simplified Wasm binding to ternary-tree crate
-
offset
Glorified offsets for arbitrary structures
-
hv-alchemy
Heavy Alchemy - the black arts of transmutation, wrapped for your safe usage and enjoyment
-
rust-mcp-schema
Type-safe implementation of the Model Context Protocol in Rust, designed to reduce errors and accelerate development with powerful utilities
-
id-map
Data structure of values indexed by IDs
-
kvstructs
General basic key-value structs for Key-Value based storages
-
discrete_range_map
DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap
-
compact_path_tree
A data structure providing a compact in-memory representation of a tree of paths
-
leaderboard
functions for Vec such as ranking with ex aequos
-
iodyn
An incremental collections library making use of Adapton
-
tiny-interner
Easy to use string interner with fast access to underlying strings and minimal memory footprint
-
range-split
splitting sequences with range parameters
-
bitaccess
Macro for efficient and type-checked access to individual bits of a variable
-
interval-map
A vector-based, non-duplicate range-keyed, sorted array
-
eztd
Quick start Rust
-
defaultmap
HashMap with an automatic default for missing keys
-
cbsk_log_rayon
log tool, using tokio as the runtime
-
csv2struct
Generate Rust struct definitions from CSV
-
range-traits
Ranges related traits
-
bipbuffer
Simon Cooke's Bip-Buffer
-
an-rope
an rope for large text documents
-
arr-rs
arrays library
-
hashmap_union
Allows the union and intersection of hashmaps
-
typed_id
Make your IDs strongly typed!!
-
cbsk_unique
unique value generator
-
cuml_map
A trait representing cumulative mappings, and several implemntations of this trait
-
char-buf
A writable, fixed-length
charbuffer usable inno_stdenvironments -
easy_linked_list
easy linked list is easy to work
-
csgo-gsi-payload
Data structures for CSGO Game State Integration
-
graphs
Graph data-structure implementations based off graph-traits
-
p-chan
Multimedia (Audio, Raster) Channel Newtypes and Conversions
-
wordlist-generator
A handy wordlist generator
-
append-only
Append only versions of std data structures
-
grafferous
graph library with a focus on generic data in nodes
-
theban_interval_tree
Interval Tree implementation
-
typedmap
A hash map (dash map). A type of value is defined by trait implemented on key type
-
enum-ref
Proc. macro for generating enum discriminant types.
-
moretypes
Named tuples, records, and more!
-
graph-api-lib
Core library for the graph-api ecosystem - a flexible, type-safe API for working with in-memory graphs in Rust
-
rbtset
A set based on a RB-Tree for efficient operations
-
mutable
keep track of changes in structures
-
stac-duckdb
Client for querying stac-geoparquet using DuckDB
-
pretree
package for storing and querying routing rules with prefix tree. Pretree 是一个用于存储和查询路由规则的包。它用前缀树存储路由规则，支持包含变量的路由。
-
hdf5-dst
DST extensions for HDF5
-
miny
Box<T> with small value optimization
-
nanovec
Arrays and Vec-likes of small integers packed in an integer or two
-
elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
hashcons
Hash cons'ing for compact representations of shared, immutable data structures
-
fixed-macro
Macros for creating fixed-point constants for types in the
fixedcrate -
fr-trie
Fuzzy Radix Trie
-
pathio
Data type for storing generic data on a virtual path tree hierarchy. The data is stored in memory, this is not OS file system abstraction, but immitation
-
mc-oblivious-ram
Implementations of Oblivious RAM data structures
-
ankurah-core
Core state management functionality for Ankurah
-
onevec
One-based indexed Vec wrapper
-
hecs
A fast, minimal, and ergonomic entity-component-system library
-
pui-arena
Generalized Arenas that can be used on
no_std -
oxidd
A safe, concurrent, modular, and performant decision diagram framework
-
tensr
A high-performance, cross-platform, multi-backend tensor/array library for Rust
-
flag_set
FlagSet can process operations of the infinite complementary sets and the origin sets
-
tracker-macros
Macros for the tracker crate
-
serde_view
Serialize views of data
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
insert_multiple
insert multiple items into a stream in reasonable runtime
-
fricgan
performing basic input and output on bytes
-
free-ranges
An efficient data structure for keeping track of indices which are either free or not
-
hexing
A basic Rust library to manipulate hexagonal grids
-
gaps
Functionality for working with gaps/holes in ordered sequences of values
-
qris
QRIS Parser & Editor
-
jpostcode_rs
Japanese postal code lookup library in Rust, powered by jpostcode-data
-
hash_table_datastruct
Adds a HashTable type, allowing to store values in a table with integer-indexed rows and hashable keys for columns
-
more_collection_macros
Adds new macros to rust for creating collections
-
arenavec
An arena backed implementation of vectors and related types
-
serde_single_or_vec2
Type which can be deserialized from either a sequence or a single value
-
hoop
Fixed ring buffer that allows non-consuming iteration both ways
-
contiguous_collections
collections backed by flat contiguous arrays
-
msiz_rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 74d5c70b174f06843049af2d764ff57ddc81c81c The publishing script for this crate lives at: https://github… -
light_merkle
A light-weight merkle tree implementation that allows to use any hashing algorithms from the packages sha2 and sha3
-
simple-binary-tree
binary tree view representation
-
batbox-collection
Collection of identifiable objects
-
smolvec
A lightweight vector implementation with small-vector optimization for rust
-
graph-api-test
Test utilities and property-based testing for the graph-api ecosystem
-
ttgraph_macros
Proc-macros for TTGraph
-
sylvan-sys
Bindings for the Sylvan parallel decision diagrams library
-
mucell
A cell with the ability to mutate the value through an immutable reference when safe
-
jp_multimap
A barebones multimap (part of the jp project)
-
symbolmap-trait
A trait for generic implementation of symbol tables
-
utf8char
that supplies a utf8 encoded char
-
flowerbloom
fast bloom filter implementation with thorough documentation and tests
-
trybox
stable,
no_std-compatible, fallible heap allocation -
chronoflake
Generate unique IDs based on the Snowflake algorithm
-
string32
A string that is indexed by u32 instead of usize
-
idcontain
Generational (or tagged) ID-based containers
-
wec
Useful vec!-like macros
-
histogram
A collection of histogram data structures
-
stochastic-data-structures
Various stochastic datastructures implemented
-
bmap
A bitmap with an internal counter
-
stringvec
macro for creating Vec<String> from various types
-
ast2str-lib
pretty-printing ASTs and other recursive data structures
-
uuid-timestamp
UUID timestamp
-
fsort
sort files in a fast, OS-independent and 'rusty' way
-
event-store-adapter-rs
DynamoDB an Event Store
-
const-size-flatten
Flatten and FlatMap with constant inner iterator size
-
deterministic-bloom
A deterministic Bloom filter with support for saturation. Suitable for distributed use cases and as a cryptographic primitive.
-
bloomfx
Bloom filter implementation backed by fxhash
-
dgunther2001-linked_list
A generic singly linked list
-
big_enum_set
creating sets of enums with a large number of variants
-
vec-dimension-shift
N-Dimension shift features for Vec<T>
-
ts-builder
Timestamp builder
-
kdt
k-dimensional tree implemented with const generics
-
vec-vp-tree
A vantage-point tree implementation backed by vectors for good performance with no unsafe code
-
varstack
A call-stack based singly-linked list
-
digits
Custom “numeric” incrementor without u64 MAX limit in size. Like a score flipper for a custom character set.
-
decoded-char
wrapper to keep track of the original byte length of a decoded character in the encoded source file
-
bitworks
meant to provide easy to use bitsets with emphasis on safety
-
package-json
package.json manager for Rust
-
shelves
Storing values referenced by a unique typed index
-
elu
Traits and implementations for EVAL-LINK-UPDATE data structures
-
gsrs
Generic Self Referencing Struct
-
dag_compute
construction of arbitrary computation DAGs and the expression of dataflow graphs
-
more_ranges
Range types not provided in the standard library
-
tree-sitter-generate
generating C source code from a tree-sitter grammar
-
xsd
XSD.rs
-
uwheel
Embeddable Aggregate Management System for Streams and Queries
-
trait-union
Stack-allocated trait objects
-
hashtree
A Merkle Tree implementation in Rust
-
mmdb_core
A std-collection-like database
-
flat-multimap
A multimap and multiset implementation using a flattened hash table
-
jui_file
file tool
-
banyan
Persistent indexable tree data structure
-
tiny-sparse-merkle-tree
Sparse Merkle Tree
-
kn0sys_ndarray_rand
Constructors for randomized arrays.
randintegration forndarray. -
nanoset-py
A memory-optimized wrapper for Python sets likely to be empty
-
mori_parallel
parallel orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data…
-
skiplist-rs
Skip list is a kind of ordered map and can store any value inside. See skip list wikipedia page to learn more about this data structure.
-
crdt_rs
work with Conflict-free replicated data types (CRDT) in Rust
-
im_interval_tree
An immutable data structure for storing and querying a collection of intervals
-
petitset
An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
aabb-quadtree
A quadtree that maps bounding-boxes to elements
-
smart-string
A collection of string types and traits designed for enhanced string manipulation
-
rdf-vocab
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
goya
morphological analyzer for Rust and WebAssembly
-
htmldom_read
HTML reader that parses the code into easy-use tree
-
cow-rewrite
Rewrite copy-on-write types copying only when it's neccessary
-
xtree
general purpose tree data structure
-
pthash
Rust bindings for PTHash
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
sliding_window
A fixed size, heapless sliding window
-
rblist
A block-based, non-circular double-linked list implementation for Rust
-
higher-cat
Functors, Applicatives, Monads and other bad ideas
-
river-ring-buffer
ring buffer implementation
-
generic_singleton
allowing for generic singleton patterns
-
open-payments-common
Open Payments - Message Parsing Library - ISO20022
-
forged-in-lost-lands
Forged in Lost Lands is a simple game engine built in Rust that focuses on data control and ease of use
-
tbytes
A tiny library for reading and writing typed data into buffers
-
tapestry
Generic 2D grid data structure and utilities
-
stringz
A way to use strings in generic paramters
-
grapes
Persistent graph data structures: Tree, Graph, Arena & more
-
bit-index
A little-endian zero-indexed bitstring representation
-
bugu
Cuckoo Filter: Practically Better Than Bloom
-
geogrid
Manipulate geographic data on a grid
-
sized-vec
Type level sized vectors
-
validbr
data structure and validation for Brazilian Registries, such as CPF, CNPJ and CNH (currently only CPF and CNPJ is supported)
-
hexga_generational
GenVec, ideal for MAS (Multi-Agent System), where each agent can be removed at any time and has references to other agents
-
rs-bucket-filter
Skips slow scans using cache, bloom filter,
-
fcsd
Front-coding string dictionary
-
nonasync
A set of utilities useful for building a non-blocking non-async APIs
-
ahash
A non-cryptographic hash function using AES-NI for high performance
-
datastreams-rs
DataStreams container
-
simple-canvas
generic 2 dimensional canvas struct
-
spigal
fixed-length ring buffer implementation, intended to be no-frills and easy to use, especially for embedded applications
-
ego-binary-tree
Binary tree API built by wrapping ego-tree
-
transitionable
A no_std compatible type to transition
T -> Twhere you have an&mut T -
option_set
Bitflags on steroids
-
hdrhistogram
A port of HdrHistogram to Rust
-
bitmac
Structure for accessing to single bits
-
hopscotch
A FIFO queue for efficiently hopping and skipping between tagged items
-
unsized_enum
Unsized enum implementation
-
sodg
Surging Object DiGraph (SODG)
-
mvbitfield
Generates types to work with bit-aligned fields
-
cycle_map
Implementations of bi-directionally accessible hashmaps
-
aoc-framework-rs
A framework for AdventOfCode coding competition, that handles input, output and provides some core utilities
-
merged_range
rangeset that can merge overlap
-
dotreds-binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports max, min, and custom-order heaps. Makes some previously internal function public
-
collection_macros
Collection of macros for collections
-
bidir-map
Bidirectional map implementation for Rust
-
vector-map
VecMap<K, V>: a Linear Search with Map API
-
collect-once-hashmap
A hashmap that can be collected only when there are unique keys in the iterator
-
flexstr
A flexible, simple to use, immutable, clone-efficient
Stringreplacement for Rust -
avl-cont
A contiguous AVL Tree
-
num-rational
Rational numbers implementation for Rust
-
stackvector
StackVec: vector-like facade for stack-allocated arrays
-
key-node-list
Doubly-linked list that stores key-node pairs
-
arrav
Sentinel-based heapless vector
-
exhaustive-map-macros
Proc macros for the exhaustive-map crate
-
matrixcompare-core
Core traits for matrixcompare
-
sortedcontainers
An experimental sorted data structure
-
stuff
Stuffing things into pointers
-
multi-stash
Vector-based arena data structure that reuses vacant slots
-
hedel-rs
A Hierarchical Doubly Linked List
-
nohash-hasher
std::hash::Hasherwhich does not hash at all -
binary_search_tree
Binary search tree implementation
-
labelgraph
graph implementation, allowing random access to nodes via labels
-
mathio
A lightweight, simple and straight-forward opinionated library for math used in other projects
-
keyed
Implement comparison traits by specifying a key
-
i24
working with 24-bit integers
-
ibuilder
Interactive builder for Rust types
-
fibonacii-heap
Priority queue implemeted using a Fibonacii Heap
-
dgrambuf
A fixed capacity ring buffer for datagrams (byte slices)
-
arrsingh
A top level crate in the workspace
-
pasture-derive
Macro implementations for #[derive(PointType)]
-
dot_json
Tools for dot map representations of serde_json Maps
-
ciborium
serde implementation of CBOR using ciborium-basic
-
vortex-dtype
Vortex's core type system
-
ttl-queue
A queue that drops its content after a given amount of time
-
weighted_random_list
A Vec<T> that allows you to define the weight of each entry and randomly get entries
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
tiny-solver
Factor graph solver
-
ensured_bufreader
A Bufreader ensures N bytes in buffer
-
idr-ebr
An efficient concurrent ID to object resolver
-
pointer-value-pair
A pair of a pointer and a small integer packed into a pointer-sized object
-
probly-search
A lightweight full-text search engine with a fully customizable scoring function
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
qt-json
JSON library for QT
-
immutable_string
Immutable Single Instance Strings for Rust
-
smt_map
A uint-to-uint map backed by Sparse Merkle Tree (SMT), which supports generating Merkle Proofs of key-values
-
oomfi
A minimal Bloom Filter implementation in Rust
-
varset
an any type set of items
-
kvtree
Heterogenous in memory key value tree storage
-
mapro
A tiny macro library for creating std::collections
-
sparse_set
sparse set data structure
-
trashmap
A HashMap and HashSet that operate directly on hashes instead of keys, avoiding rehashing
-
binary-tree
Collection of Binary Tree data structures and algorithms
-
gur
A undo-redo framework
-
linear-deque
A double-ended queue that can be sliced at any time without preparation
-
tongrams
Tons of N-grams
-
modql-macros
Macros for modql. Not intended to be used directly.
-
healm
**He**ap **al**located **me**rkle tree
-
range_vec
Fast indexed access to a range of mostly-default values
-
go-heap-rs
Golang's heap written in Rust
-
fastbuf
single-thread-oriented very fast byte buffer
-
aversion
Versioned data structures with auto-upgrading
-
bloom_filter_plush
rust_bloom_filter
-
sorted-collections
providing useful extension traits and convenience methods for ordered collections in Rust. NOTE: This library is not currently in active development, and much of the functionality…
-
ct-tilemap
help parse ClickTeam Tilemap files
-
slots
Fixed size data structure with constant-time operations
-
break_array
For breaking array indexing
-
not_empty
Slices and vectors that are statically guaranteed to be not empty
-
boxed_array_ringbuffer
A ring buffer of fixed size, that uses a boxed array as storage, therefore avoiding re-allocations when converting from Vec or to VecDeque
-
safer-bytes
safe, non-panicking wrappers around the 'bytes' crate
-
nimrodshn-btree
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite
-
reusable-vec
A Vec wrapper that allows reusing contained values
-
pui-vec
An append only vector, with guaranteed elided bounds checks
-
ax_banyan
Persistent indexable tree data structure
-
typemap_core
A no_std typemap with trait-based value-presence guarantees (on nightly)
-
db_meta_derive
db-meta-derive is a wrapper around PostgresSOL using tokio-postgres
-
once-list
an append-only per-item list
-
persistent_array
Persistent array is a library for working with memory mapped arrays
-
sparse_vec
Datastructure that stores separate but contiguous ranges of values efficiently
-
rustgym
solutions
-
hdf5-hl-sys
Bindings to HDF5 High Level API
-
priority-queue-rs
Priority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by…
-
vhr_serde
A serde (de)serializer crate for the simplist possible binary format
-
rs-merkletree
create Merkle Trees
-
simple-observable
observable pointer for mutable and immutable data
-
projected-hash-map
projected HashMap over HashSet
-
id-set
A bitset implementation that stores data on the stack for small sizes
-
weakheap
Weak Heap data structure implementation in Rust
-
pyrpds
Python Wrapper for Rust Persistent Data Structures
-
rdf-query
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
mutuple
Replace items in Python's immutable tuples
-
byte-sequence
A little marco that creates structs to be used as byte sequences (for ApiKeys, SessionIds and so on)
-
ptr_hash
A high-throughput minimal perfect hash function
-
rbtree-arena
A cache friendly red black tree where nodes live on sequential memory
-
algods
A collection of data structures and algorithms
-
velarixdb
An LSM Storage Engine focused on reduced IO amplification
-
ulid-generator-rs
generating ULIDs
-
treesome
tree creation, manipulation, traversal and visualization
-
dst-container
Containers for DST objects
-
smart_access
A minimalistic "lazy bidirectional pointer" framework
-
no_vec
modifying sized arrays
-
cycler
A simultainious write/read data structure
-
wildbird_macro_derive
Rust Framework 🐦 | Macro System
-
hexgridspiral
Hexagonal Cube-Coordinate System with Spiralling Integer Tile Identifiers
-
cargo-index-transit
A package for common types for Cargo index interactions, and conversion between them
-
ransel
rank/select succinct data structures
-
bounded-vec-deque
A double-ended queue|ringbuffer with an upper bound on its length
-
gloss-hecs
A wrapper over hecs for easy use with gloss
-
topset
Top N selector
-
ckb_multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
priority-set
A no_std Priority Set
-
pgdb_to_struct
CLI application to generate Rust struct files from PostgreSQL database tables
-
tc-state
TinyChain's general state enum
-
gpt_disk_io
GPT (GUID Partition Table) disk IO no_std library
-
u64_array_bigints_core
Core library for
u64_array_bigints -
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
watermark
watermarking set for in-order insertions
-
fid-rs
High performance FID (Fully Indexable Dictionary) library
-
crudite
A JSON CRDT
-
static-bytes
Bytes for embedded devices
-
bytes
Types and traits for working with bytes
-
ptr-union
Pointer union types the size of a pointer by storing the tag in the alignment bits
-
clampf
Clamped floating-point types
-
indexed_bitvec
An indexed bitvector with (hopefully) fast rank and select operations
-
anon-vec
An Anonymous Vector that emulates dynamic typing
-
type-info
Meta type information and type reflection at compile-time and runtime
-
docchi
A diff-based data management language to implement unlimited undo, auto-save for games, and cloud-apps which needs to retain every change
-
const-assoc
A const-capable Map type backed by a static array
-
atom_table
Assign easy-to-handle typed IDs to large, hard to handle things like strings
-
trait-map
Rust map for dynamic trait storage and references
-
store-interval-tree
A balanced unbounded interval-tree in Rust with associated values in the nodes
-
ranged_integers
An integer restricted to a compile-time defined bounds driven by const generics
-
union-find-rs
Disjoint-set forest implementation to support the union-find algorithm in Rust
-
mstr
2-word, immutable Cow<str>
-
compacts-bits
succinct bit vector
-
object-merge
Traits useful for recursively merging document-like objects
-
loaf
Why have a slice when you can have a loaf?
-
structz
Anonymous struct implementation in rust
-
number-general
A generic number type for Rust which supports basic math and (de)serialization
-
array-ops
Automatic method implementations for array data types
-
tapa-trait-serde
A collection of Tapalogi's reusable crates
-
jsonnlp
JSON-NLP data structure
-
graphsearch
graph search and representation library
-
unique-id-collection
Collection with unique Id
-
gen-vec
Vector indexed with generational indices
-
neighborgrid
A 2-D grid datastructure with easy to use iterators and adjacent cell methods
-
plain
A small Rust library that allows users to reinterpret data of certain types safely
-
discrimination-tree
discrimination tree term indexing
-
dag-cbor-references
Extract blake3 ipld links from dag-cbor blocks
-
keysymdefs
A collection of key symbol definitions
-
artsy
ART Tree data structure library
-
read-write-pipe
A trait for objects implementing Write, to write all content from a Read object
-
slotmap
data structure
-
vbox
type erased Box of trait object
-
libflow
grouping network flow data
-
variant-map
defines maps to store variants of enums
-
const_queue
A stack-only, no_std queue using const generics
-
rez
A convention for libraries to bundle resource files alongside binaries
-
butils
shared by software included in BSuccinct
-
rope_rd
A Read/Seek rope implementation
-
matrixgraph
A graph implementation based on dense adjacency matrices
-
lookups
Improve the data retrieval operations for collections
-
intsplit
splitting numeric types into their binary component arrays
-
bookfile
A container file format with chapters and an index
-
collect-mac
collect!macro, which can be used to easily construct arbitrary collections, includingVec,String, andHashMap. It also endeavours to construct the collection with a single allocation, where possible. -
hashable_rc
Hashable wrappers for reference countings
-
vector-growing
The growing vector with free indexes
-
mmap_json_file
parse, count, filter JSON files using memory mapped io library
-
type-pools
A data structure to store values of multiple types
-
ordered-vecmap
Ordered map and set based on vectors and binary search
-
randsort
A sorting library with an optimal complexity of O(n) (!!) by randomly sorting Vectors until they are sorted
-
isx
Traits for checking certain conditions of values
-
spatial-neighbors
certain Spatial-Partitioning Algorithms | DataStructures
-
shine-graph
SHINE. Graph and sparse matrix module for the shine engine.
-
indexed-vector
that implements vector container that can be indexed with specified function
-
hamt-rs
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell
-
uuid-macro-internal
Private implementation details of the uuid! macro
-
dynamic-matrix
work with matrices
-
compacts-dict
succinct dictionary
-
bitops
Miscellaneous bit operations for any Integer
-
borrow-framework
More flexible borrowing
-
short-lease-map
A map collection optimized for brief internship of values
-
altdeque
An alternative deque implementation
-
f256
Octuple-precision floating-point arithmetic
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
automatic-relations
Tree automatic relations
-
graph-api-simplegraph
efficient graph implementation for the graph-api ecosystem with support for indexing
-
hit-data
Hierarchical Indexed Typed data structure
-
indexvec
Simplified copy of rustc's index crate
-
inspector
General purpose inspection for popular data structures
-
hashed
type you can convert any hashable type into and still do equality checks on
-
fuid
A UUID-compatible identifier in a friendly base-62 format
-
lightning-containers
A set of lock-free data structures
-
la-arena
index-based arena without deletion
-
stack-buf
Vector-like facade for arrays allocated entirely on the stack
-
wrapping
slices and arrays
-
mtgjson
Unofficially provided lightweight models of the data provided by MTGJSON
-
stride
A strided slice type
-
linked_list_c
Safely work with c compatible linked lists
-
rust_cards
Simulates playing cards
-
fallacy-hash
fallible hash collections
-
ati
Introduces the
Attrait, which allows collections to be indexed byu|i{8,16,32,64,128}andisize. Supports Python-like negative index, where -1 is last element. -
copy-range
core::ops::Range et al, but Copy and IntoIterator
-
arc-swap
Atomically swappable Arc
-
num-bigint-dig
Big integer implementation for Rust
-
pegitan
A bunch of random algorithms library
-
rbl_circular_buffer
A zero-allocation, fast, circular buffer implementation in Rust
-
null-vec
A specialized vector that stores nullable values
-
converge
Layered configuration, can be expressed in a single line of code. The
Convergetrait merges instances of structures into a new instance of a structure. TheConvergetrait can be derived… -
priority-matrix
A matrix that supports per-row, per-column and whole-matrix maximum key queries
-
toboggan-kv
abstraction layer over multiple KV stores
-
btree_network
A generic network (undirected graph) data structure
-
l6t-file
A part of l6t library: reading, writing and deconding for L6T IFF data
-
triemap
Triemaps for Rust
-
transit_model_relations
Modeling the relations between objects
-
whistlinoak
Annotated even-arity trees backed by mmaps
-
piece_table_rs
piece table data structure
-
type-set
A set of heterogeneous types
-
jsonpath-rust
basic functionality to find the set of the data according to the filtering query
-
nunny
the definitive non-empty slice/array/vec library for Rust
-
aliri_braid
Improve and strengthen your strings by making them strongly-typed with less boilerplate
-
stac-async
Asynchronous I/O for stac-rs
-
any_key
Dynamically typed keys for associative arrays
-
binary-data-schema
Meta language for raw binary serialization
-
fibheap
but actually useful Fibonacci Heaps
-
open-payments-iso20022-pain
Open Payments - Message Parsing Library - ISO20022 PAIN
-
pi_link_list
linklist
-
sled
Lightweight high-performance pure-rust transactional embedded database
-
enum-map-derive
Macros 1.1 implementation of #[derive(Enum)]
-
tranche
Tranches are an alternative to slices
-
nuid
A highly performant unique identifier generator
-
zvariant
D-Bus & GVariant encoding & decoding
-
tensorism-gen
Multidimensional arrays with bounds included in the type system
-
synchronized-writer
A tiny implement for synchronously writing data
-
bloom
Fast Bloom Filter and Counting Bloom Filter implementation
-
init_trait
A small helper trait to simplify the initialisation of 'indexable' data structures
-
mti
that implements type-safe, prefix-enhanced identifiers based on the TypeID Specification
-
flax
An ergonomic archetypical ECS
-
weighted_trie
Weighted prefix trie for autosuggestions
-
data-buffer
low-level data buffer type useful for IO and in homogeneous collections
-
arrow-digest
Stable hashes for Apache Arrow
-
rust-fp-pfds
A Functional Programming Library in Rust, Purely Functional Data Structure
-
cola
A text CRDT for real-time collaborative editing
-
enum-set
A structure for holding a set of enum variants
-
rc-box
Known unique versions of Rc and Arc
-
vector2
2D vector library
-
dastral
Reduce boilerplate code, learn data structures & algorithms with Dastral
-
lazy_list
Lazily-populated lists, finite or infinite
-
head
Common types with inline headers, such as HeaderVec for Vec
-
rust_decimal_macro_impls
Shorthand macros to assist creating Decimal types. Do not depend on this directly; use rust_decimal_macros
-
street_index
small utility crate for working with road name / street indexing for cartographic purposes
-
shifted_vec
A growable datastructure with positive and negative indexing built on top of
std::vec::Veccalculating the offset automatically -
flexible-string
A stack heap flexible string designed to improve performance
-
local_vec
fixed-capacity vector allocated on the stack
-
muds
Minimalistic Data Structures and Entity-Component-System Library
-
moogle
data structures for relational code
-
closures
Abstraction for seperating code and state in closures
-
static-box
A stack-allocated box that stores trait objects
-
csvenum
Generate code for enums with associated constants from a .csv in your command line
-
holodeque
Array- and slice-backed double-ended queues in 100% safe Rust
-
deqmap
A double-ended queue with optional keys
-
tindex
Vec, slice and bitset with custom index types -
nnn
Generate your newtypes from a single macro
-
bs
bitset with small-set (single-word) optimization
-
aterm
Annotated Terms data structure
-
orx-self-or
Defines SoR (self-or-ref) and SoM (self-or-mut) traits that are useful in reducing code duplication and pushing forward the ownership transfer decision from the type designer to the consumer
-
char-circle
A circular buffer for strings and traits for in-place string transforms
-
array-object
Self-describing binary format for arrays of integers, real numbers, complex numbers and strings, designed for object storage, database and single file
-
trailer
Store a type with an associated buffer in contiguous memory
-
delete_if_not
unsafely in-place delete function
-
sorting-vec
Sorts a vector using a btreemap
-
vortex-proto
Protocol buffer definitions for Vortex types
-
map-trait
Generic Map trait
-
pi_phf_map
phf_map
-
stack-array
A data structure for storing and manipulating fixed number of elements of a specific type
-
generic-cursors
A generic way to mutably traverse acyclic recursive data structures
-
uf_rush
A lock-free, thread-safe implementation of the Union-Find (Disjoint-Set) data structure
-
gtrie
Generic trie implementation with a support of different key and value types
-
immutable-avl
An Immutable map and set implement for rust based on an AVL tree
-
lhlist
Labeled heterogeneous lists
-
hj_ds
A data structure library for Rust
-
setting
The styles of all graphics elements
-
aces
Algebra of Cause-Effect Structures
-
datastruct
A pure-data structure builder
-
len-trait
Len trait for collectons
-
another_radix_trie
Rust built radix tree library
-
const_enum_map
Get const value from enum handle
-
btree_graph
A generic graph data structure
-
nstree
construct branched 'namespace strings' for nested subcomponents, often for logging
-
btree_monstousity
a code port of BTreeMap but with comparator functions
-
yuuang_dominators
null
-
tdf_utils
such as tree
-
collections-more
Common data structure and algorithms for rust-lang to complete the already excellent std::collections
-
paged
Read and create read-only paged database files
-
predicates-core
An API for boolean-valued predicate functions
-
sixarm_collections
Collections for HashMapToSet and BTreeMapToSet as trait extensions. By SixArm.com.
-
nanobox
NanoBoxoptimization: store small item on stack and fallback to heap for large item -
lazy_concat
Lazy concatenation for Strings and Vecs
-
achan
& convenient representation for any value
-
ttm-rs
CLI to turn tuples into adjacency matrices
-
qt-json-rs
JSON library for QT
-
typescript-definitions-ufo-patch
serde support for exporting Typescript definitions
-
contextual
deal with data in context
-
subway
Fast, performant in-memory SkipList implemented in Rust
-
mut-binary-heap
Enhanced version of std::collections::BinaryHeap that supports increase and decrease key, max, min, and custom-order heaps
-
dsll
Fast Thread Safe Doubly Sorted Linked List
-
eimage
processing image collections in 3D space
-
gecs
A generated entity component system
-
bloomy
Bloom filter using only two hash functions
-
libcanopy
Canopy is a lightweight tree-based data structure for Rust, optimized for reference management using Rc and Weak pointers
-
sif-rtree
immutable, flat R-tree
-
secured_linked_list
A cryptographically secured and provable linked list
-
succinct
data structures for Rust
-
vec-2-10-10-10
A 32-bit vector, where 2 bits are dedicated for alpha, and 30 bits are dedicated for color. Compatible with GL_UNSIGNED_INT_2_10_10_10_REV vertex attribute format.
-
vortex-flatbuffers
Flatbuffers definitions for Vortex types
-
villa01-data-structures
Personal crate of me trying to implement data structures and algorithms in Rust
-
compact_bitset
A type for storing fixed-size arrays of booleans densely to optimize space
-
bitsetium
One stop shop for all bitset needs
-
pointer_vec
The PointerVec works same as the std Vec structure except the Vec has a size of 3 usize (pointer, length, capacity). This crate provides a replacement that has a size of 1 pointer.
-
banyan-utils
work with banyan trees
-
framering
Queue-of-queues container
-
probabilistic_data_structures
Probabilistic data structures in Rust Lang
-
hashindexed
A cache. A set which compares elements in a customisable way without overriding the eq() and hash() functions on the type itself.
-
bondrewd
Bit-Level field packing with proc_macros
-
judy-sys
Low-level Judy array FFI binding
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
gvec
Very simple implementation of generational indexing for vectors written in Rust
-
roaring-graphs
Graph data structure backed by roaring bitmaps
-
trait-based-collection
A trait-based collection library that implement different data structures using the same trait
-
header-slice
Definitions for slices with headers, and a vec-like type with a header allocated inline
-
zeen_filter
A fast and optimized Bloom Filter implementation in Rust
-
fpdec
Decimal fixed-point arithmetic
-
bytes_to_type
facilitate byte conversion to specified types using macro generation
-
collect
An experimental extension of std::collections
-
queue-rs
queue
-
compressed_map
'Static functions': compressed maps with the keys removed
-
voxel_chunk
A voxel object module which allows you to have private Chunk objects with methods to modify their data
-
const-buffer
A fixed-capacity memory buffer allocated on the stack using const generics
-
fixedbitset-stack
A forked version of FixedBitSet that supports const generics
-
bigraph
Different representations with implemented operations on bigraphs
-
hashmap_vec
A HashMap with lists a values
-
maybe-string
newtype wrapper that represents a byte vector that may be a valid UTF-8 string
-
immutable-seq
Immutable sequence data structure
-
random-access-storage
Abstract interface to implement random-access instances
-
bits128
A struct to iterate over 128 bits by taking only 128 bits
-
webgraph-algo
Algorithms for the Rust port of the WebGraph framework (http://webgraph.di.unimi.it/)
-
vhr_datatypes
data/file structures used in the computer game Valheim
-
bytey
convenient and easy to use byte storage
-
portable-network-archive
cli
-
generic-arrayvec
Interop between the arrayvec and generic_array crates
-
mmap_bytey_byte_buffer
Mmap Bytey MByteBuffer code, use Mmap Bytey instead
-
map-of-indexes
A compact key-value map for unique but not dense indexes
-
miniconf
Serialize/deserialize/access reflection for trees
-
anymap3
A safe and convenient store for one value of each type
-
collection
Deterministic, copy-on-write balanced search trees
-
bstree
A Binary Search Tree written in Rust
-
no_proto
Flexible, Fast & Compact Serialization with RPC
-
grafana-dashboard
grafana import/export data serializable structures
-
const-arrayvec
A vec-like type backed by an array on the stack
-
exclusion-set
a lock-free concurrent set
-
gentrix
that adds the Matrix typed using generics that is basically a wrapper around a 2D Vector
-
btreelist
A list data structure that has efficient insertion and removal in the middle
-
loglevel
way to set your log level
-
tree-automata
Term Rewriting Systems
-
graphstack
Graph-structured stack
-
event-queue
crates.io için bir paket nasıl hazırlanırın ele alındığı öğrenme amaçlı modüldür
-
enum_set2
A bit-set indexed by enum variants
-
bit-set-omnitool
A set of bits
-
stable_node_set
An ordered set with handles to values
-
history-buffer
A fixed capacity, write-only, ring buffer
-
flashtext
algorithm to search and replace keywords in given text
-
crossbeam-skiplist-mvcc
Support MVCC (Multiple Version Concurrent Control) for
crossbeam-skiplist -
calf-vec
Small copy-on-write arrays, essentially combining
SmallVecandCow -
raw-vec
A Raw utility for managing contiguous heap allocations
-
ldtk_map
reading ldtk maps for usage in games
-
tuple_list
macro-free variadic tuple metaprogramming
-
deferred_vector
A deferred vector implementation
-
native_model
A thin wrapper around serialized data which add information of identity and version
-
victor_tree
Victor makes vectors
-
lattice-graph
Set of Lattice(Grid) based Graph Structures
-
graph-api-benches
Benchmarking utilities and performance tests for the graph-api ecosystem
-
aora
Append-only random-accessed data persistence
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
lighter
Macro for rewriting string matches as tries
-
sealingslice
A mutable slice that can seal its initial part off from mutability, and hand out the sealed parts as immutable references
-
persistent_rope
An immutable persistent rope data structure
-
open-payments-iso20022-pacs
Open Payments - Message Parsing Library - ISO20022 PACS
-
uberbyte
Bit manipulation for dummies
-
empty-collections
Correct-by-construction empty collections
-
uniplate
boilerplate-free operations on tree-shaped data types
-
doubly-linked-list
double link list
-
index_graph
Graph library that only stores indexes from a base array
-
slotmapd
orlp/slotmap fork where serialization cycle doesn't change observable behavior
-
generic
Higher level serialization of rust values to rust values
-
hamst
Hash Array Mapped Shareable Trie
-
one-of
Macro to represent a type that can be converted either
FromorTryIntothe given types -
crossbeam-skiplist
A concurrent skip list
-
graph-arena
Collection type to store immutable graph structures efficiently
-
uid
creation of unique IDs
-
small_vec2
Vector on the stack or heap need nightly rustc
-
tampon
Contains SAFE Rust functions, macro and trait to serialize / deserialize data structure and/or object and generate buffer
-
m6coll
Small Smart Collections using prefix m6
-
nonempty_range
Range representing nonempty ranges
-
arbitrary-int
Modern and lightweight implementation of u2, u3, u4, ..., u127
-
eitherq
Queue which support two different types
-
jinpyok_input
My comfortable user input methods
-
leonardo-heap
Heap structure supporting fast in-place partial sorting
-
aabel-bloom-rs
implements the Bloom filter
-
oneoff
one-off types
-
crdt-list
Abstract CRDTs for lists
-
token-string
Short (up to 65,535 bytes) immutable strings to e.g. parse tokens, implemented in Rust. These are sometimes called 'German Strings', because Germans have written the paper mentioning them.
-
downstream
efficient, constant-space implementations of stream curation algorithms
-
open-payments-iso20022-admi
Open Payments - Message Parsing Library - ISO20022 ADMI
-
modular-bitfield-ordering
Provide u8be..u128be, u8le..u128le for modular-bitfield
-
vortex-sampling-compressor
Vortex compressor that uses statistical sampling
-
mytrie
Trie implmentation
-
rc-borrow
Borrowed forms of Rc and Arc
-
tany
Type-erased container with inline storage for small values
-
feature-set
User defined feature set
-
vec-tree
A safe tree using an arena allocator that allows deletion without suffering from the ABA problem by using generational indices
-
bitmaptrie
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
-
xml2arrow
Efficiently convert XML data to Apache Arrow format for high-performance data processing
-
comfy-bounded-ints
Bounded-integer types focused on ergonomics and safety. (See README.md)
-
sliced
A segmented vector for iterating over slices
-
stac-validate
Validate STAC objects with jsonschema
-
know_yaml
The Know Framework for Rust
-
ranno
Annotations over recursive data structures
-
graphrox
A graph library for graph compression and fast processing of graph approximations
-
bit-array
A compile time sized array of bits
-
hashcow
HashMap implementation with copy-on-write keys and values
-
rdf_rs
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
roopes
Object Oriented Pattern Element System. This crate provides generic traits and implementations for typical object-oriented patterns. It is intended to be used as a cluster of utility…
-
grit-data-prison
providing the struct Prison<T>, a Generational Arena that allows full interior mutability to each and every element
-
skew-forest
Skew-binary random access lists
-
dimension_shiftable_buffer
A dimension shiftable buffer
-
zerovec
Zero-copy vector backed by a byte array
-
stack-stack
stack-allocated stack
-
simple_bitfield
Create bitfields with the same memory structure as integers using a simple macro
-
roaring_bitmap
Roaring bitmap data structure implemented in Rust
-
vizz
creating GraphViz/DOT visualizations of Rust data structures
-
arrsingh-lists
A test crate to test publishing
-
flit
Bloom filter backed by xxHash
-
bytebufrs
A ring buffer for bytes implementing io::Read and io::Write
-
pathlink
A URL type whose path can also be used as a filesystem path, for Rust
-
explicit-discriminant
Macro for enforcing enum discriminants
-
unsized-stack
Fast heterogeneous / unsized stack
-
zed
A minimal, Redux-like state management library for Rust with advanced features
-
arbtree
A small library for general purpose tree data structures
-
ctb
ctb unifies borrowed and owned values into a smart pointer that is internally borrowed to retain ownership
-
collection_traits
Collection traits & utilities; work in progress
-
ring_queue
A double-ended queue implemented using a vector that reuses space after elements are removed
-
svec
Dart-style list in Rust
-
nybbles
Efficient nibble-sized (4-bit) byte sequence data structure
-
pi_world
ecs world
-
gavl
A fast implementation for a map and a set using an AVL tree
-
linked_lists
Different types of linked lists
-
velect
A Vec with item / index selection
-
awint_macros
Accompanying procedural macros to
awint -
atomic_swapping
An arbitrary type atomic storage with swap operations
-
stof
unified data interface and interchange format for creating, sharing, and manipulating data. Stof removes the fragile and cumbersome parts of combining and using data in applications.
-
arc-vector-rust
Rust client for Arc Vector Search Engine
-
stable_queue
Queues with stable indices
-
erasable
Type-erased thin pointers
-
rusty_list
A no_std compatible, intrusive doubly linked list implementation
-
maybe-multiple
An extension of
Optionwhich can hold none, one or multiple elements -
trie
An ordered map and set based on a trie
-
stapifaction
allowing to easily generate static APIs
-
stacking
using a stack datastructure in rust
-
compact-map
'Small map' optimization: store up to a small number of key-value pairs on the stack
-
orx-concurrent-vec
A thread-safe, efficient and lock-free vector allowing concurrent grow, read and update operations
-
flat_bit_set
有序、稀疏、节省空间的 bitset，适用于小数据量
-
grid_trait
2D and 3D grids with combinators
-
bloom_filter_simple
generic bloom filter implementation
-
kurve
Adjacency list graph data structure
-
terms
Tree terms and patterns data structures
-
bit_range
A small library for getting bits and ranges of bits from byte collections
-
eclectic
Experimental collection traits
-
dimsum
multi-dimensional array library
-
perm-vec
Datatype representing permutations of indices
-
power_map
A map with finite key and fixed size
-
rb
A thread-safe ring buffer with blocking IO
-
louds
LOUDS implementation for Rust
-
fill
trait, an alternative to Extend for finite containers
-
stonks
Sets that allow borrowing while inserting entries
-
plum
Probabilistic data structures for rust
-
vortex-mask
Vortex Mask - sorted, unique, non-negative integers
-
r-collections
Created some collection example LinkedList, Stack and Queue
-
hff-core
Hierarchical File Format: core structure
-
slotmap-fork-otter
Slotmap data structure - temporary fork for Otter
-
trie-generic
A trie with generic content
-
my-stack
stack implementation in Rust
-
bset
Fast and compact sets of bytes or ASCII characters
-
cursorvec
Cursored vector container
-
vpb
key-value proto buffer for veladb
-
comparable
comparing data structures in Rust, oriented toward testing
-
picocadrs
working with picoCAD saves
-
mdarray
Multidimensional array for Rust
-
generic-json
Generic JSON traits
-
smolbox
Like a Box, but small objects are stored on the stack
-
byte_trie
A compressed trie based on bytes with some weird child node bucket sizes
-
lesbar-macros
Procedural macros for string types that encode legible text
-
cons-list
An immutable singly-linked list, as seen in basically every functional language
-
btree_dag
A generic DAG (undirected graph) data structure
-
enum_from_variant
macro to generate From<T> trait implementations for enum variants, simplifying error conversions and enum mapping
-
tennis
data structures
-
double-buffer
double buffer generic implementation
-
dyn-iter
Wrapper around
Box<dyn Iterator<Item = V> + 'iter>to simplify your code -
key_set
KeySet representing concepts of All, None, Some(list), and AllExceptSome(list), with basic set calculations (intersection, difference, inverse)
-
immutable
persistent data structures for Rust
-
option_vec
Vec<Option<T>>-like container
-
fral
Functional random-access lists
-
get-many-mut
Stable polyfill for slice::get_many_mut
-
unrecurse
Helper crate for rewriting your recursive code in iterative way
-
nexum
collection of commonly used data structures
-
fixed_free_list
A fixed-size free-list with optional key lifetime safety and macroless unique typing
-
bstorage
A lightweight library for working with application configuration files
-
passive
A trio of marker traits to classify passive data structures
-
timed_set
timed set in Rust to store elements for a given time period
-
glace
A type-safe, user-friendly proc macro for embedding a file tree into your code
-
littlechestnutgames-trie
A generalized trie implementation for quick prefix searching
-
bit-long-vec
Vector with fixed bit sized values stored in long
-
nbits_vec
Small bits value (e.g. 1,2.. bits) vector implementation.
-
vortex-scalar
Vortex Scalars
-
baffa
Generic buffer for bytes
-
causal-length
CRDT's based on causal length sets
-
pulz-bitset
bitset implementation
-
kudzu
concurrent, grow-only data structures
-
append-only-vec
Append-only, concurrent vector
-
v-trie
Just a generic compressed prefix tree
-
bagofholding
collection types. Efficient data structures that look bigger on the inside.
-
simple_trie
array backed trie
-
iregex-automata
Finite automata definitions for the
iregexcrate -
ziku-pds
probabilist data structures
-
rdf-borsh
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
out-reference
out references
-
transit_model_collection
Manage collection of objects
-
evillatoro-data-structures
Personal crate of me trying to implement data structures and algorithms in Rust
-
ringvec
ring buffer implementation based on a vector
-
querable
Quer(y)able data structure implementation
-
bit_collection
A trait for iterating over the individual bits of a collection
-
vec-x
structure
VecXto manage fixed-length arrays, supporting numeric operations and assignment operations betweenVecXand scalar values -
dynvec
DynVectype that acts like a vector to store any datatype -
by_address
Wrapper for comparing and hashing pointers by address
-
fp-collections
An alternate collections library for rust
-
derive-visitor
Derive visitor pattern for arbitrary data structures
-
typescript-definitions
serde support for exporting Typescript definitions
-
compacts
compact data structures
-
umili
Mutate and observe Rust data structures
-
lupine
A bloom filter using FX Hash with Kirsch and Mitzenmacher optimization
-
merkle-search-tree
A data structure for efficient state-based CRDT replication and anti-entropy
-
im-rope
Unicode strings backed by RRB vectors
-
tuco-core
Contains the Tuco trait, used by the Tuco crate
-
bounded-vector
Vec wrapper that guarantees upper and lower bounds on type level
-
stack-trait
Stack trait with entry API for the LIFO element
-
bitty
Extract bits from, and put back into integer types
-
slice-deque
A double-ended queue that Deref's into a slice
-
sculk
handling various data found in Minecraft's NBT files
-
sbf-blake3
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
line-index
Maps flat
TextSizeoffsets to/from(line, column)representation -
atlist-rs
LinkedList which is allowed to insert/remove element by immutable iterator.Adding, removing and moving the elements within the list or across several lists does not invalidate the iterators or references…
-
persistent-list
A singly-linked persistent thread safe list
-
to-display
A trait that is Display or can be converted to Display
-
collectables
collections helpers for BTreeMap, BTreeSet, HashMapSet, etc. By SixArm.com.
-
loro-preload
Loro internal lib for loading data
-
graph-traits
Traits for graph data structures
-
suffix_trie
Suffix trie for searching
-
smallvec-stableunion
Fork of the crate smallvec. Uses unions in stable rust. Please note that it can only store Copy types. No functional differences apart from that.
-
one-stack-vec
OneStackVec could contain any number of item like
Vec, and it does heap allocation only when it contains more than one item -
ax_banyan_utils
work with banyan trees
-
disjoint-collections
Disjoint-set data structures
-
do_util
Discrete Optimization utilitary library (data-structures)
-
prio-queue
priority queue implemented as a heap stored in a Vec
-
terees
a collection of tree-like data structures
-
hlist2
Compile-time heterogeneous list implementation
-
iso20022-common
Open Payments - Message Parsing Library - ISO20022
-
matrixable
Traits and structs extending capabilities of matrix-like structures
-
primitive-byte-iter
An Iterator which can load primitive types and glam types from bytes
-
array_map
Map backed array for fixed size keys with O(1) performance
-
hyper-tree-router
Routing middleware for Hyper http library using Prefix tree (trie) for path finding
-
corosensei
A fast and safe implementation of stackful coroutines
-
dogma
Dogma.rs
-
intersection
Find the intersection over a collection of sets; when you need more than the intersection between two sets
-
sovran-typemap
A thread-safe heterogeneous container with type-safety
-
handlebox
A map-like collection that reuses unused keys
-
dade
data definition for Rust structures
-
rbloom
efficient and minimalistic bloom filter
-
serde-ndim
Serde support for n-dimensional arrays from self-describing formats
-
functional_list
A functional, immutable list for Rust
-
indextree-ng
Arena based tree structure by using indices instead of reference counted pointers. Fork of indextree by Sascha Grunert which allows to remove nodes
-
nth-cons-list
The nth cons list implementation
-
buf-list
A list of buffers that implements the bytes::Buf trait
-
frozen-collections-core
logic for frozen collections
-
dh
Data handling in Rust, made easy
-
yoke
Abstraction allowing borrowed data to be carried along with the backing data it borrows from
-
opt_arrayvec
Vector-like container with fixed capacity, using options instead of stored length
-
trs
Term Rewriting Systems
-
bloomy-rs
Fast bloom filter implementation
-
metered
Fast, ergonomic metrics for Rust!
-
awint
Arbitrary width integers
-
generic-bloom
A generic implementation of Bloom filters using traits
-
vortex-ipc
IPC message format to exchange Vortex arrays across processes
-
bitman
An easy to use bit manipulation library for Rust
-
negatable-set
Wrapper for sets that allows full boolean operations including negation
-
fixed-queue
no_std, no_alloc, use [T; N]. support
Vec/VecDeque/History -
succinct_vec
A Vec-like datastructure with less memory overhead
-
stacked_type_map
Compile time map of any type
-
nd-slice
Wrapping
std::slices to represent n-dimensional arrays -
smallqueue
A queue with a no-alloc optimization when the size is 1 or 0
-
tibitset
bitset replacement for HashSet