-
hashbrown
port of Google's SwissTable hash map
-
indexmap
A hash table with consistent order and fast iteration
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
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
-
roaring
A better compressed bitset - pure Rust implementation
-
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
bit-vec
A vector of bits
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
tinystr
A small ASCII-only bounded length string representation
-
bimap
Bijective maps
-
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
-
linked_hash_set
HashSet with insertion ordering
-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
rowan
generic lossless syntax trees
-
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
-
im
Immutable collection datatypes
-
typed-index-collections
Typed index version of Rust slice and Vec containers
-
fixedbitset
bitset collection
-
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.
-
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
-
rpds
Persistent data structures with structural sharing
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
imbl
Immutable collection datatypes
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
array-init
Safe wrapper for initializing fixed-size arrays
-
spade
Delaunay triangulations for the rust ecosystem
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
multimap
A multimap implementation
-
range-set-blaze
Integer sets as fast, sorted, integer ranges with full set operations
-
egg
egraphs
-
intmap
Specialized HashMap for integer keys
-
smallbox
Small Boxoptimization: store small item on stack and fallback to heap for large item -
thin-vec
A vec that takes up less space on the stack
-
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.
-
uluru
fast, LRU cache implementation
-
guppy
Track and query Cargo dependency graphs
-
crdts
Practical, serializable, thoroughly tested CRDTs
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
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
-
narrow
Apache Arrow
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
-
str-buf
Static string buffer
-
cordyceps
Mycelium intrusive data structures
-
array-macro
Array multiple elements constructor syntax
-
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
-
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
-
nonempty-collections
Correct-by-construction non-empty collections
-
equivalent
Traits for key comparison in maps
-
jaq-json
JSON values for jaq
-
micromap
The fastest alternative to HashMap, for maps smaller than 20 keys
-
modql
Model Query Language support
-
open-payments-fednow
Open Payments - Message Parsing Library - FedNow
-
grid
Dynamic generic 2D data structure
-
tree_iterators_rs
built to provide you with the iterators to easily work with tree data structures in Rust
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
mycelium-bitfield
Structured bitfields, courtesy of Mycelium
-
dary_heap
A d-ary heap
-
qfilter
Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF)
-
walker-common
Common functionality for SBOM and CSAF walker
-
bitfield-struct
Struct-like procedural macro for bitfields
-
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
-
loro-rle
A internal library of loro for storing and manipulating run-length encoded data. Do not use it directly.
-
range-collections
Sets and maps of ranges, backed by smallvec
-
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
-
las
Reads and writes point clouds stored in the ASPRS las file format
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
phf_shared
Support code shared by PHF libraries
-
iset
Map and set with interval keys (x..y)
-
cita_trie
Modified Patricia Tree (aka Trie)
-
fqdn
FQDN (Fully Qualified Domain Name)
-
blobby
Iterator over simple binary blob storage
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
vecmap-rs
A vector-based map and set implementation
-
oxc_index
Newtype-style helpers for
Vecandusize -
ringbuffer
A fixed-size circular buffer
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
portgraph
Data structure library for directed graphs with first-level ports
-
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
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
bloom2
Fast, compressed, 2-level bloom filter and bitmap
-
ndarray-ndimage
Multidimensional image processing for ArrayBase, the n-dimensional array data structure provided by ndarray
-
lib-sokoban
Sokoban: compact, efficient data structures packed into contiguous byte arrays
-
crop
A pretty fast text rope
-
setsum
order-agnostic checksum
-
vec_map
map based on a vector for small integer keys
-
modular-bitfield
Allows to easily define bitfield types with modular building blocks
-
submap
B-Tree map for pub/sub services
-
tinyset
Size-optimized sets
-
timed-map
Lightweight map implementation that supports expiring entries and fully compatible with both std and no_std environments
-
i256
Optimized implementations of 256-bit signed and unsigned integers
-
qwt
Quad Wavelet Tree
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
keyvi
key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
-
vise
Typesafe metrics client
-
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
-
vart
An immutable versioned adaptive radix trie
-
xml-builder
Easy and highly-configurable XML builder/writer
-
xsd-types
XSD data types
-
array-concat
Macros for concatenating const arrays
-
rustica
functional programming library for the Rust language
-
arraydeque
A ring buffer with a fixed capacity, which can be stored on the stack
-
bytes-utils
Additional utilities for working with the bytes crate
-
trees
General purpose tree data structures
-
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
-
xot
Full-featured XML tree library for Rust
-
undo
An undo-redo library
-
intervallum
Generic interval and interval set library
-
simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
chat-prompts
Chat prompt template
-
rsdict
Fast static rank and select data structure
-
cueue
High performance SPSC circular byte buffer with batch operations
-
tree-ds
manipulate tree data structures
-
uuid-rng-internal
Private implementation details of the uuid crate
-
base-traits
base traits (for Rust)
-
cc-traits
Common collection traits
-
spatialtree
A fast and flexible generic spatial tree collection (Octree, Quadtree, etc)
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
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
-
tracker
A macro to track changes on structs
-
ordinal-map
Ordinal trait to map values to integers and efficient maps and sets for such types
-
ftree
A very fast fenwick tree implementation
-
hdf5
Thread-safe Rust bindings for the HDF5 library
-
delay_map
HashMap collections whose entries expire after a given time
-
itybity
An itty bitty crate providing bit iterators and bit iterator accessories
-
interavl
An optimised interval tree for efficient interval stabbing
-
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… -
slotmap-careful
Wrap the slotmap crate and prevent key reuse
-
ordered-multimap
Insertion ordered multimap
-
cdg_api
interact with api.congress.gov
-
blart
adaptive radix tree packaged as a BTreeMap replacement
-
phf_generator
PHF generation logic
-
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
-
mzpeaks
representing peaks in mass spectrometry data
-
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. -
im-lists
Persistent unrolled linked lists and vlists
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
cactus
Immutable parent pointer tree
-
wildbird
Rust Framework 🐦
-
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
-
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…
-
baby_shark
Geometry processing library
-
kempt
Ordered collection types with no unsafe code and no_std support
-
louds-rs
High performance LOUDS (Level-Order Unary Degree Sequence) library
-
value-log
Value log implementation for key-value separated LSM storage
-
dogear
merging bookmark trees
-
merkletree
Light merkle tree implementation with SPV support and dependency agnostic
-
block-grid
A quick, cache-conscious, tiled 2D array
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
flex_array
A
#[no_std]flexible array much like std::Vec but with custom indices and length and capacity types -
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
-
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
-
orange-trees
Tree data structure with several methods to query and manipulate nodes
-
diff-struct
A trait for diffing and applying diffs to types
-
arrow-row
Arrow row format
-
truc
Rust code generator for safe, fixed size, evolving records
-
rt_ref
Internal
Reftypes forrt_refandrt_vec -
slice_ring_buf
A ring buffer implementation optimized for working with slices
-
libwebnovel
enabling users to get chapters of a webnovel, with multiple available backends
-
matreex
matrix implementation
-
raft-log
Raft log 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
-
any_vec
Type erased vector. Most operations can be done without type knowledge. Mostly zero overhead.
-
linearize
Types that are enumerable and an array-backed map
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
adflib
handle amiga disk files
-
dequemap
A no_std compatible implementation of the dequemap crate
-
vec-strings
Store any string efficiently in an immutable way
-
more_collections
Additional collections not found in std::collections
-
byteview
Thin, immutable zero-copy slice type
-
tetengo_trie
A trie library implemented with a double array
-
xor_name
Xor Type
-
id_tree
creating and modifying Tree structures
-
sized-chunks
Efficient sized chunk datatypes
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
roadmap
model a project roadmap as a directed acyclic graph
-
hashslab
A hash table with data accessible by index
-
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
-
rdf-types
Data-structures and traits definitions for RDF
-
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
-
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)
-
ocpp_rs
Protocol implementation for Open Charge Point Protocol (OCPP) in Rust
-
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
-
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
-
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
-
variadics
Variadic generics on stable Rust using tuple lists
-
ttgraph
Typed/Transactional Graph container
-
snowid
generating SnowID - a Snowflake-like timestamp-based distributed unique identifier
-
sector
A stateful vector implementation that provides different memory management behaviors through Rust traits and state machines
-
json-number
JSON number parsing and storage
-
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
-
incremental-topo
Data structure to maintain an incremental topological ordering over a collection of values
-
f3l_search_tree
3D Point Cloud Library
-
cheap-clone
A trait which indicates that such type can be cloned cheaply
-
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
-
csaf-walker
work with CSAF data
-
edtui-jagged
A jagged array data structure for the edtui editor
-
wavltree
An intrusive Weak AVL Tree
-
traitgraph-algo
Graph algorithms based on the traitgraph crate
-
ball-tree
K-nearest neighbors
-
flatk
Flat layout abstraction toolkit
-
slabmap
HashMap-like collection that automatically determines the key
-
scopegraphs
A well-documented port of scopegraphs to Rust
-
seoul
trait Isomorphism
-
json_dotpath
Dotted path access to nested JSON objects (serde_json::Value)
-
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
field_access
Dynamically access struct fields
-
compact-rc
Low-memory reference-counting pointers
-
swamp-code-gen
generates swamp-vm opcodes
-
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
-
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
-
madeleine
Transparent object persistence with predefined operations and state containers
-
rs-ecs
reasonably simple entity component system
-
scapegoat
Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.
-
dup-indexer
Create a non-duplicated index from Strings, static str, Vec, or Box values
-
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
-
indexical
indexed collections
-
ux-primitives
Graphics Primitives for Angular Rust
-
rc-u8-reader
A tiny implement for reading
u8data from a reference counted instance -
endpoints
A collection of data structures for the OpenAI-compatible endpoints
-
treeclocks
Various Tree Clock data-structures and utilities
-
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
-
i_tree
Expiration key tree. Usable in algorithms like swipe line. Only for uniq elements
-
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
-
cantrip
Practical extension methods for standard Rust collections
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
mikufans-proto
gRPC APIs for Mikufans
-
open-payments-iso20022
Open Payments - Message Parsing Library - ISO20022
-
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
-
easy-tree
efficient tree structure library for Rust with recursive traversal
-
tailcall-chunk
persistent data structure for efficient append and concatenation operations
-
fingertrees
Immutable persisten finger trees
-
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
-
bitvec_helpers
BitVec based bitstream reader and writer
-
typemap_rev
A hashmap, but stores types as keys
-
intervaltree
generic implementation of an immutable interval tree
-
symbol_table
A symbol table that's fast, concurrent, and gives stable references
-
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
-
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
-
intrusive-lru-cache
An LRU cache implementation using intrusive data structures
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
roussillon-type-system
A type system for a programming language
-
pasture-core
A framework for working with point cloud data
-
iter-tree
Convert between iterators and tree structures in both directions
-
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
typeid_prefix
that implements a type-safe version of the TypePrefix section of the
TypeIDSpecification -
optional
supplies a number of Option-like primitive types
-
vortex-array
Vortex in memory columnar data format
-
slabigator
A linked list that doesn't do dynamic memory allocations
-
jaggedarray
Multidimensional jagged array
-
rt-pods-client
Official Client for RtPods
-
srdf
RDF data shapes implementation in Rust
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
anyrust
any rust
-
lean_string
Compact, clone-on-write string
-
suffixarrayview
Creates a view of a suffix array
-
jsonbb
A binary representation of json value, optimized for parsing and querying
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
griddle
A HashMap variant that spreads resize load across inserts
-
mphf_benchmark
The program for benchmarking Minimal Perfect Hash Functions
-
atelier
a Computational Workshop for Market Microstructure Modeling, Synthetic Simulation and Historical Replay
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
attribute-search-engine
Generic search engine for rows with attributes using different matchers
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
bye_nanoflann_rs
KD-Tree, implemented based on nanoflann, primarily optimized for 2D or 3D point clouds
-
hextree
Location to value mapping
-
pi_slot
lock free Slotmap data structure
-
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
jumprope
fast rope (fancy string) library built on top of Skiplists
-
validit
Validate data structures internal state
-
do-notation
Monadic do syntactic sugar
-
radixmap
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
-
sucds
Succinct data structures in Rust
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
entid
generating and validating type-safe, prefixed entity identifiers based on UUIDs and ULIDs
-
bitboard64
A 64-bit bitboard useful for chess programming
-
shared_vector
Reference counted vector data structure
-
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… -
tuplez
Tuples represented in recursive form
-
rbitset
A bit set, being able to hold a fixed amount of booleans in an array of integers
-
vortex-sparse
Vortex Sparse array
-
min-max-heap
An efficient, double-ended priority queue
-
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
-
json_deref
JSON internal field links resolver
-
minimizer-iter
Iterate over minimizers of a DNA sequence
-
hashify
Fast perfect hashing without dependencies
-
incrementalmerkletree-testing
Common types, interfaces, and utilities for testing Merkle tree data structures
-
rdf-model
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
kn0sys-ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
sif-itree
immutable, flat interval tree
-
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…
-
data_reader
A data loading library for data scientist
-
psrutils
few utilities to facilitate pulsar science projects in rust
-
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
-
strumbra
Umbra-style strings (also known as German strings)
-
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
-
sparse-merkle-tree
Sparse merkle tree implement in rust
-
rbtree
the rbtree for Rust
-
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…
-
hash-iter
Iterator producing sequence of hash values for a given input (using double hashing technique)
-
stavec
Stack-allocated vector with static capacity
-
nestac
access nested structures using path-like string format
-
dia-i18n
-
bitstring
traits and implementations
-
ofilter
fast thread-safe Bloom filter
-
typeables
type aliases. By SixArm.com.
-
stack-queue
Heapless auto-batching queue
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
unordered-pair
A tuple struct representing an unordered pair
-
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.
-
halfling
A collection of basic utilities for working with nibbles
-
ringmap
A hash table with consistent deque-like order and fast iteration
-
cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
tournament-kway
k-way merge using a tournament tree
-
cell-grid
2d grid container
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
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
-
tree-sitter-traversal2
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
smallvec-wrapper
Macro and common structs to play with
smallvec -
re_string_interner
string interning library
-
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…
-
windows-collections
Windows collection types
-
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.
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
cdll
A circular doubly linked list
-
graph-api-petgraph
Integration between graph-api and petgraph - use graph-api's traversal system with petgraph structures
-
swamp-script-source-map-lookup
Source map lookup for Swamp
-
sif-kdtree
immutable, flat k-d tree
-
weak-table
Weak hash maps and sets
-
segtri
Segment tree with customizable data type and update operations
-
heapless_graphs
composable graphs for no_alloc environments
-
ninjabook
A lightweight and high performance orderbook
-
bose_einstein
A data structure that efficiently partitions elements into two sets
-
doubloon
Money datatype that supports both statically and dynamically typed currencies
-
pdatastructs
probabilistic data structures
-
pipebuf
Efficient byte-stream pipe buffer
-
bloomcalc
calculator for bloom filters
-
hashheap
data structures that combine a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
cseq
compact sequences
-
range-map
Maps and sets implemented using ranges
-
rust_flightweather
Decodes METAR and TAF
-
lsph
Learned Spatial HashMap
-
uid_store
Generate random uid strings containing letters, numbers, or base62 values
-
oxidd-rules-bdd
Binary decision diagrams (BDDs) for OxiDD
-
bit_mask_ring_buf
A ring buffer implementation with cheap indexing
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
orn
A general implementation of the sum type. Meant to be a generic counterpart to tuples.
-
gesha-collections
Collection utilities for the Gesha project
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
btree-slab
A memory compact Slab-based B-tree implementation
-
seq-map
Sequential Map
-
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 -
try_reserve
Stable implementation of the TryReserveError from std for custom collections
-
indexed_arena
index-based arena without deletion
-
map-macro
Declarative macros for statically initializing 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
-
bv
Bit-vectors and bit-slices
-
nlist
inline-allocated list with statically tracked length
-
snix-castore
Modular functional package manager
-
mmdb
A std-collection-like database
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
atree
An arena based tree structure with removal support
-
wrapped_slab
WrappedSlab: Auto-generate newtype idiom based on a Slab
-
fit-rust
designed for reading, writing, and merging FIT protocol files
-
implies
A parser for logical formulas
-
pfds
Purely Functional Data Structures
-
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…
-
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.
-
data_registry
An unordered data structure with immediate insertion, removal and access
-
vortex-bytebool
Vortex byte-boolean array
-
chinese-rand
Random generation of data structures in Chinese, using Rust
-
strict
collections with strict bounds
-
ligature
Ligature's data model in Rust
-
sharded
Safe, fast, and obvious concurrent collections
-
rand-select
a tiny choice selector
-
slack-blocks
Models + clientside validation for Slack's JSON Block Kit
-
leetcode-trees-rs
Tree Node LeetCode problems
-
parallel_frontier
Queue-like frontier for breath-first visits on graphs that supports constant-time concurrent pushes and parallel iteration
-
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
-
rust_multistack
Support for two-dimentional stacks for the Rust programming language
-
threshold
data structures
-
idbag
A bag of integers
-
scope-cell
temporary, scope-bound, and thread-safe mutation of data in Rust
-
basic_trie
Trie implementation in Rust
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
anymap2
A safe and convenient store for one value of each type
-
dynarg
mechanism for dynamic robust argument handling
-
merkle_light
Light merkle tree implementation with SPV support and dependency agnostic
-
float16
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
irange
A data structure to store and manipulate ranges of integers with set operations
-
vec-collections
Rust collections that are newtype wrappers around smallvec
-
qutee
A quadtree implementation
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
samling-clorinde
Database queries etc for the
samlingcrate -
parametrized
Supply useful iterating methods for user-defined types which are parametrized by type parameters
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
solvent
Dependency Resolver library
-
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.
-
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…
-
c_vec
Structures to wrap C arrays
-
splay-safe-rs
Splay implemented with safe rust
-
cacheline-ef
Per-cacheline encoding of sorted integer sequences
-
libwebnovel-storage
A complement to libwebnovel: this package handles downloading and organizing collections of followed webnovels
-
identity_map
Identity-based maps
-
clubcard
exact membership query filter for static sets
-
nb-tree
Very simple tree structure with generic node and branch data
-
plane-2d
Continuous 2D data structure representing infinite 2d plane
-
skiplist
in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
gridly
managing fixed-size 2D spaces
-
populated
Collection types that are guaranteed to be populated (i.e. non-empty). Based on std::collections types.
-
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 -
usize-set
Set data structures optimized to store sparsely distributed usize values
-
lapce-xi-rope
A generic rope data structure built on top of B-Trees
-
lru-mem
An LRU cache implementation bounded by memory
-
regroup
regrouping arrays
-
arraystring
Fixed capacity stack based generic string
-
bool_vec
A crates that exposes a vector called BoolVec which allows you to store a boolean in a single bit
-
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
-
bitvector
in Rust
-
extindex
Persisted immutable index
-
smodel
Symbol semantic modeling for Rust
-
freyr
A UI component library for Dioxus web
-
aliasable
Basic aliasable (non unique pointer) types
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
nid
Generate and parse Nano IDs
-
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
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
-
rb_tree
A Red Black Tree implementation in Rust
-
stable-map
A hash map with temporarily stable indices
-
osmgraph
Convert OSM queries into graphs
-
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.
-
blas-array2
Parameter-optional BLAS wrapper by ndarray::Array (Ix1 or Ix2)
-
blf_lib-derivable
Shared traits used by blf_lib and blf_lib-derive
-
sigmars
sigmahq rule collections
-
foyer-intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
pi_sinfo
used to describe the 'structure', that is, the meta information of the structure
-
beach_map
slotmap
-
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
-
libpna
PNA(Portable-Network-Archive) decoding and encoding library
-
lookupvec
Container with Vec-like properties that also offers O(1) lookup of items based on an id field
-
whale
A lock-free, dependency-tracking primitive for incremental computation
-
disjoint-sets
Three union-find implementations
-
gapbuf
Generic gap buffer
-
delta-collections
Data structures with revertable operations called deltas
-
modular-bitfield-msb
Allows to easily define bitfield types with modular building blocks. MSB-first version.
-
untis
accessing the Untis API
-
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…
-
bin-it
efficient Rust library for binary serialization and deserialization
-
hydroperfox-smodel
Semantic modeling for Rust
-
beat_saber_map
Read and write Beat Saber maps with Rust
-
differential-dataflow-master
An incremental data-parallel dataflow platform
-
iterlist
Linked list with a cursor based api
-
lignin
A virtual DOM structure, primarily for web use
-
cbsk_socket
socket callback tool
-
host-port-pair
Host-port pair type
-
arc-string-interner
An efficient cuncurrent string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
mih-rs
Multi-index hashing (MIH) for neighbor searches on binary codes in the Hamming space
-
atomic_ptr_cell
Safe no_std repr(transparent) wrapper for AtomicPtr and &AtomicPtr with an api similar to a cell
-
mset
/ multiset / bag implementation
-
a-tree
A dynamic data structure for efficiently indexing arbitrary boolean expressions
-
retworkx
A python graph library implemented in Rust
-
array_list
A dynamic container that combines the characteristics of a Vec and a LinkedList
-
micromap-rawl
Fork of Micromap https://github.com/yegor256/micromap, the fastest alternative to HashMap, for maps smaller than 20 keys
-
iterable
collection like types
-
named_colors
that provides named colors in RGB and Hexadecimal formats
-
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
-
sequential
A configurable sequential number generator
-
reusing-vec
Wrapper over Vec that allows elements to be reused without dropping them
-
ksq
k-2 tree
-
linkedin-csv
Structs defined to hold the data as exported from LinkedIn
-
cve
Mappings for parsing the CVE JSON files
-
orx-tree
A beautiful tree 🌳 with convenient and efficient growth, mutation and traversal features
-
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
-
gtfs-geojson
converter for GTFS to GeoJSON formats
-
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
openligadb
API
-
loc_api
interact with the loc.gov API
-
arraysetcell
A fixed-capacity, vector-like array with interior mutability and no ordering guarantees
-
onebuck
An efficient unordered dynamically-sized data structure
-
sweetrpg-kv-objects
Objects for Key-value store
-
horizon_data_types
The Horizon data types library for third-party integrations
-
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.
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
general_stable_vec
A Vec implementation with stable indices
-
trie-root
In-memory patricia trie operations
-
access
that helps creating diverse accessors
-
amadeus-streaming
SIMD-accelerated implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling
-
gcollections
Generic traits over Rust collections library
-
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
-
mikel_binary_tree
search binary tree implementation
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
rand_pool
Create a pool of random numbers pre generated thread safe
-
enum-table
creating tables with enums as key
-
bit-int
An arbitrary fixed bit-width integer library
-
sortedlist-rs
A fast sorted list data structure in rust
-
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
-
kn0sys_ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
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
-
id_collections
Index-oriented programming in Rust
-
entity_data
A container for entity component data
-
expiremap
Key-Value map where each value has a custom expiry time
-
floating_bar
Representing rational numbers using the floating-bar number type
-
thin-string
A String with a smaller stack footprint
-
pineappl
not an extension of APPLgrid
-
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
-
retaker
ecs implementation
-
merkle-log
"Merkle Tree-Structured Log" defined in the paper "Transparent Logs for Skeptical Clients." https://research.swtch.com/tlog
-
slab_tree
A vec-backed tree structure with tree-specific generational indexes
-
nimbusqueue
fifo collection
-
btree_monstrousity
a code port of BTreeMap but with comparator functions
-
contexts
Implements a type for treating several hashmaps as one
-
frozen-collections
Fast partially-immutable collections
-
bytering
A ring buffer specialized for vectored reading and writing in blocking and async I/O
-
rust-tls-duplex-stream
Full Duplex stream Wrapper around rust-tls
-
suff_collections
Fast realization of suffix array and suffix tree
-
orx-selfref-col
SelfRefCol is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees
-
tagged-vec
A Vec which can be indexed by one specific type
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
geosite-rs
that parses geosite.dat file format
-
rsor
Reusable slice of references
-
trk-io
TrackVis (*.trk) reader and writer
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
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
-
expanding_slice_rb
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
-
rangetools
Extending the Rust Range structs found in std::ops
-
enid
parse Encrypted Numeric Identifiers
-
HArcMut
mutable arc
-
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
-
trie-hard
Fast implementation of trie data structure
-
tiled_parse_tree
Tree data structure
-
equivalent-flipped
Similar to
equivalentcrate, but flipsKandQ -
ztimer
A block-based, non-circular double-linked list implementation for Rust
-
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.
-
phf_macros
Macros to generate types in the phf crate
-
vector
The package provides a vector database allowing for efficient search of nearest neighbors
-
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
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
expiringdict
A dict / HashMap whose items expire over time
-
data_tree
Hierarchical data tree with pathing and search support
-
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
-
bitvek
bit vector implementation
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
pas
strided slice
-
rs-bush
Bush data structure
-
minivec
A version of Vec that's only the size of a single pointer
-
text-style
Types and conversions for styled text
-
circbuf
A growable circular buffer for working with bytes
-
sapling-dag
DAG used for source control
-
ahtml
An HTML templating and manipulation library
-
ux-dataflow
Data Processing Library
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
radyx
A basic radix tree implementation
-
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
-
commitlog
Sequential, disk-backed commit log library
-
compt
A complete binary tree visitor library
-
div-int
Rational numbers with a compile-time denominator
-
foreign_vec
Unofficial implementation of Apache Arrow spec in safe Rust
-
sortedvec
a sorted vector that enables quick lookups
-
ostr
Owned str
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
rdf-format
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
bytes_deque
A growable bytes deque in Rust, providing access to the raw pointer
-
flat-tree
Series of functions to map a binary tree to a list
-
dcl_data_structures
Data structures for for deep_causality crate
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
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
-
tensorism
Multidimensional arrays with bounds included in the type system
-
markov-generator
Highly customizable library for building Markov chains and generating random data
-
flange-flat-tree
A tree that can be expanded by attaching new values to the node without mutability of the old ones
-
concurrent-bloom-rs
thread-safe bloom filter
-
ordered_hash_map
HashMap which preserves insertion order
-
modern-multiset
A hash multiset implementation
-
akshually
Smart Boys
-
ware
middleware chains
-
queue-queue
A priority queue implementation based on Rust's BinaryHeap
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
rocstr
An immutable fixed capacity stack based generic copy string
-
code_location
UNMAINTAINED! Use std::panic::Location instead!
-
flat_enum
Expand nested enum into flattened enum
-
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
-
arrayset
An array-backed ordered set type
-
value-ext
Serde Json Value Extension Trait (more Value type later)
-
cses-rs
A CSES spec impl in Rust
-
rtdlib
TDLib for rust
-
safe_index
Type-safe indexes
-
binn-ir
-
slablit
Literal for slab creation
-
cistring
A string type that preserve case, but compares insensitiveley
-
median-accumulator
fast, space-efficient, generic accumulator for computing median
-
open-payments-iso20022-reda
Open Payments - Message Parsing Library - ISO20022 REDA
-
Sparse-Voxel-64Tree
A lib for handling Sparse Voxel Contrees
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
pbloom
A portable bloom filter implementation in Rust
-
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
-
rangeset
Integer collection backed by ranges with set operation support
-
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.
-
radix-heap
Fast monotone priority queues
-
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
-
cfpyo3_rs_core
a collection of performant utilities
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
lodtree
help create octrees and quadtrees for chunked level of detail
-
vise-exporter
Prometheus exporter for metrics defined using
vise -
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
-
non-empty-vec
NonEmptyvector implementation, ensure non-emptiness by construction -
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)…
-
nary_tree
A vec-backed tree structure with tree-specific generational indexes
-
ux-dx
3D Graphics Primitives for Angular Rust
-
espalier
Very simple flattened tree structure
-
compressed-intvec
A compressed integer vector with fast random access that stores values with instantaneous codes in a bitstream
-
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
-
guppy-summaries
Build summaries for Cargo, created by guppy
-
fenwick
tree: data structure that efficiently calculates prefix sums in a changing array of numbers
-
indexed_json
Index json files like a database
-
structured
Data structures to handle large, structured data
-
expiringmap
a HashMap-backed TTL map
-
im-pathtree
Immutable, path-addressable tree data structure
-
gamma
Graph primitives and traversals for Rust
-
malwaredb-api
Common API endpoints and data types for MalwareDB components
-
validiter
Iterator adapters for validating iterations
-
py_env
A wrapper for Python commands to easily install dependencies and run Python scripts in an optionally impersistent environment
-
xskiplist
Skiplist implementation in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.
-
moka-cht
Lock-free resizeable concurrent hash table
-
linked-list
An alternative implementation of std::collections::LinkedList
-
pvec
RRB-Tree based persistent vector implementation
-
prepona
A graph crate with simplicity in mind
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
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
-
sweep-bptree
In memory locality aware b+ tree, faster for ordered access
-
ultragraph
Hypergraph data structure
-
qust-ds
a part of crate qust
-
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
-
magnetise
asses the similarity between SQL queries
-
rubbl_visdata
Preliminary work on generic data structures for radio interferometric visibility data
-
contigious-tree
Write and read tree graphs to and from contigious blocks of memory
-
sum
General-purpose sum types
-
iowrap
Small helpers for using io::Read/io::Write
-
higher
Functors, Applicatives, Monads and other bad ideas
-
chunked_vec
A vector-like data structure that stores elements in fixed-size chunks for better memory management
-
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
-
vec_extract_if_polyfill
Polyfill for Vec::extract_if
-
box-collections
A no_std compatible implementation of the collection crate
-
bk-tree
A Rust BK-tree implementation
-
segment-tree
Quickly perform interval queries or modifications
-
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
-
mapack
mapbox vector tiles
-
advancedresearch-tree_mem_sort
An in-memory topological sort algorithm for trees based on Group Theory
-
jsonmap
store values of multiple types value in one Map
-
coca
Data structures with constant capacity
-
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
-
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
outils
Graph and tree data structure library. Providing utilities which aren't easily available in Rust.
-
shortguid
Short URL-safe Base64 encoded UUIDs
-
ntree-rs
A mutable n-tree with async support
-
merkle-tree-bulletin-board
A public bulletin board based upon Merkle trees
-
firims
fixed range integer maps and sets
-
precedence-net
Create and analyse precedence networks
-
enum_meta
Add metadata to Enum Variants
-
sweetrpg-model-core
Core model definitions for SweetRPG
-
netcrab
creating and exporting Petri nets
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
rust_airport_supplier
Rust-AirportSupplier downloads airport data from OurAirports and decodes the information
-
handlemap
A collection that produces handles that can be used as keys to retrieve the stored items
-
ladata
& modular data model
-
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
mco-gen
Stackfull Generator Library in Rust
-
gen_value
indexes and values with generations for vectors
-
constructivism
Simplify the construction of structured data
-
rive
ecosystem crate
-
serde_map
Mapbased onVecfor serialization purposes -
sparse_set_container
A container based on sparse set. Stable keys, O(1) lookup, cache-friendly iterations, and no hashing.
-
range_bounds_map
[
RangeBoundsMap] and [RangeBoundsSet], Data Structures for storing non-overlapping intervals based of [BTreeMap] -
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
-
idmap
Efficient maps of integer id keys to values, backed by an underlying
Vec -
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
-
boolvec
A vector of boolean stored contiguously in memory
-
zngur-def
Data types that define the structure of a zng file
-
entity
that provides entity-like constructs
-
traiter
Traits collection
-
interval-rbtree
An interval tree implementation using Red-Black Tree as its underlying data structure
-
graphlib
powerful rust library for the graph data-structure
-
char_index
efficient charwise indexing into a string
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
cphf
Compile-time perfect hash function data structures
-
index-ext
Index slices with arbitrary ints and as arrays
-
query-flow
A macro-free, data-oriented, general-purpose library for incremental, on-demand, self-adjusting computation using query-based dataflow
-
fwdlist
A simply linked (forward) list
-
broomdog
A type-erased map with 'indefinite loanership'
-
roers
prepare augmented annotations for single-cell RNA-seq analysis
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
grid-tree
Pixel quadtrees and voxel octrees
-
fenwick-bit-tree
Slighly over-engineered FenwickTree implmentation
-
proptest-recurse
Helper for defining mutually recursive strategies with proptest
-
rtree_rs
R-tree for Rust
-
charcoal
Implements tree data structures and interfaces to work with them
-
dashmap-shard
port of Google's SwissTable hash map
-
vp-avl
A combined Vantage-Point AVL tree, to make VP trees updateable
-
fixed-collections
Dynamically allocated ungrowable collections
-
tinybox
Like
Box, but with an optimization that avoids allocations for small data-structures -
bnr-xfs
Pure Rust implementation of the BNR XFS USB
-
reactive-signals
dx-first scope-based fine-grained reactive system
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
bst-rs
Recursive & Iterative Binary Search Tree Implementations within Rust
-
gsgdt
Generic Stringly Typed Graph Datatype
-
aph_disjoint_set
Disjoint set implementation with optimized memory usage and ability to detach elements
-
indexlist1
A doubly linked list, backed by a vector
-
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".
-
lanyard
UTF-8 C string types
-
limq
Queue with a controller for monitoring queue elements
-
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
-
merkle
tree implementation with support for generation of inclusion proofs
-
rj
reactive json
-
small-world-rs
The easiest HNSW vector index you'll ever use
-
indexed_vec
IndexVecfromlibrustc_data_structures -
write_x86_64
help you write x86_64 assembly code
-
higher-free-macro
macro that creates a (naive) Free Monad type based on a user-supplied Functor. It uses the traits from the "higher" crate. This macro is a port of the Control.Monad.Free part of the…
-
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 -
lazy-cow
Copy-on-write pointers with lazy modification support to minimise clones with a cost counter to limit work duplication
-
char-list
A persistent string type with the same API as a linked-list of characters
-
btreemultimap
A multimap implementation with range support
-
objectionable
storage of unsized types inline inside allocated objects
-
zhifeng_impl_barnes_hut_tree
implements Barns-Hut Tree for accelerated N-body force calculation
-
onigiri
handling chars
-
segvec
data structure for rust. Similar to Vec, but allocates memory in chunks of increasing size
-
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
-
wolf-derivation-graph
Adds support for memoizing data flow graphs to wolf-graph
-
hinted
small crate for providing a size hint and exact size on an iterator
-
emap
A map with a fixed capacity and integers as keys
-
varlen
Ergonomic variable-length types
-
fungi-lang
Fungi: A typed, functional language for programs that name their cached dependency graphs
-
brownstone
building fixed-size arrays
-
singletonThread
thread in a singleton
-
total-maps
Maps where every possible key has an associated value
-
llist
Lisp-style singly-linked list
-
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… -
dyn_list
A linked list that can hold dynamically sized values in its nodes
-
object-collection
A collection that can store multiple values of types
-
type-rules
easily constrain a struct
-
smallbitset
series of allocation free sets capable of holding small integer values
-
tinystr-raw
Raw string-to-integer conversions for tinystr
-
chainbuf
Fast chained buffers
-
automap
pattern to implement key-value maps where the value type contains the key type
-
alist
Association list offering fast lookups while preserving insertion order
-
recursion-visualize
visualized cache-aware stack safe recursion
-
content-tree
An efficient data structure for compacted RLE data
-
enumoid
Enum Indexed Containers
-
contack
easy contact library
-
clash_rules
a clash yaml rule parser and matching algorithms provider
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
slas
Static Linear Algebra System
-
bdaddr
Bluetooth Device Address
-
intervals-rs
intervals
-
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
-
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
-
histogram-sampler
Sampling from a distribution given by a histogram
-
appendlist
An append-only list that preserves references to its elements
-
fixed_bitmaps
A small crate implementing bitmap functionality around primitive Rust unsigned integers
-
froop
A functional reactive stream library for rust
-
artie_common
Common Library for Artie Rust Projects
-
alignment-exporter
Proc macro providing alignment info for a user-defined struct
-
holyhashmap
A hash map with stable indices
-
fenny
working with Fenwick trees
-
generic-btree
Generic BTree for versatile purposes
-
lockerroom
Readers-writer access to individual cells of your collection!
-
inplace-vec-builder
Build a vec from a vec, in place
-
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
-
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)
-
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
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
two-sided-vec
Double ended vectors for rust, which can grow in both the front and back
-
sliding_tree
A tree that grows from the leaves and recedes from the root
-
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…
-
designal
Procedural macro for use with futures-signals
-
fed
A sketch implementation of anonymous, tagged unions in stable Rust
-
prefix-tree-rs
A Trie (prefix tree) implementation
-
vicardi
JSON VCardArray Generator that uses Serde
-
vecset
A vector-based sorted map, set and keyed-set implementation
-
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
-
minsize
Collections with a statically known minimum size (using const generics)
-
oxidd-test-utils
Test utilities for OxiDD
-
rdf-writer
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
raw-btree
Generic B-Tree implementation
-
rust_twostack
Support for two-dimentional stacks for the Rust programming language
-
generational-indextree
Arena based tree structure by using indices instead of reference counted pointers
-
vecshard
Split Vecs in constant time
-
xsparseset
sparse set
-
ahtable
Array Hash Table implementation
-
grdf
Generalized RDF graphs and datasets
-
bucket_vec
A vector-like data structure that guarantees to never move its contained elements
-
btree-ondisk
BTree structure on persistent storage in userspace
-
loaned
Safely move values with live inner borrows
-
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
-
wolf-graph
Data structures and algorithms for working with graphs with reference or value semantics
-
bitset-core
Straightforward, no-std compatible, simd optimized, BitSet API
-
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
-
valord-map
A dictionary sorted by values
-
indextreemap
A BTreeMap implementation that allows for key and or positional insertion and retreival
-
eventree
creating lossless syntax trees
-
rustz
functional programming in Rust
-
simple-triplestore
graph database for storing triples with support for custom node and edge properties
-
awid
Small, simple, universally unique identifiers
-
utf8char
that supplies a utf8 encoded char
-
bitvec_simd
bitvec with SIMD
-
sbom-walker
work with SBOM data
-
timely_container
Container abstractions for Timely
-
bitlab
Extracting a range of bits from a binary data source
-
granite
Generic backing storage framework for building data structures
-
wolf-graph-mermaid
Adds support for generating Mermaid diagrams from wolf-graph graphs
-
fluentbit
build output plugins for Fluent-bit
-
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.
-
tinybuf
Container for many types of immutable bytes, with optimisations for small arrays
-
get-full-year
An unofficial Rust client for getfullyear.com that helps you get the full year
-
schema2struct
Convert a JSON schema into Rust structs for efficient and type-safe data management
-
construe
Compile-Time Growable Array: Vec & String for const!
-
dynp
Dynamic property system that emphasizes the use of the Newtype pattern
-
bubbletree
Bubble-tree
-
know
Framework for Rust
-
mzdata-spectra
A subset of
mzdata’s traits and spectrum data model -
win-variant
that aims to provide a more ergonomic way of working with variants in winapi based projects
-
text-document
Text document structure and management
-
tree-rizzen-yazston
Tree Library using the Any trait for data
-
astack
offers a Stack data structure with fixed capacity capable of fast LIFO operations
-
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.
-
wacky_traits
Defines some traits
-
lumberjack
Read and modify constituency trees
-
bayesic
A string matching library similar to NaiveBayes but optimized for many small classifications
-
pna
PNA(Portable-Network-Archive) decoding and encoding library
-
staticvec
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics
-
wccg-models
WCCG Data
-
dirbuf
reusable directory bufferes
-
detach
helper type for being able to detach/reatach a member item
-
field-ref
Field reference (like a member pointer to non-static data field in C++) for Rust
-
flow_arena
A HashMap managed Graph Model with the concept of ownership
-
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
-
twovec
A data structure for storing 2 types of data in a packed, heap allocated array
-
rosary
About Rose Trees
-
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
-
tinyvec_string
tinyvec based string types
-
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
-
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
-
pin_array
Tiny crate providing an array with structurally projected pinning
-
latestmap
latest map
-
bonzai
An abstraction for optimizing the memory layout and pointer aliasing of trees
-
patricia_router
Radix Tree implementation for Rust
-
fastgraph
Graph abstraction providing a generic interface and powerful parallelized traversals
-
chesspos
Basic structs for representing chess squares
-
collectable
Fallible, no_std-friendly collection traits
-
genindex
Generational index library
-
to-offset
developer-friendly methods to manipulate strings with character indices
-
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()
-
iter_seq
Stateless, transformable, abstract sequence of values
-
stringid
Lightweight system to manage identifier as human readable string and unique number
-
bstree-file-readonly
Query read-only binary-search tree file, supporting billions of entries in files of tens of GB
-
chainmap
mutability of intermediate maps
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
ecstatic
Statically-typed ECS library
-
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
-
open-payments-iso20022-camt
Open Payments - Message Parsing Library - ISO20022 CAMT
-
optempty
Tools for working types that may be empty. E.g., an empty
String,Vec,HashMap, etc. -
fixedvec
A heapless version of the Rust vector type
-
sorbus
A tree manipulation library
-
bpht
A bit-packed hash table implementation using hopscotch hashing for 32-bit keys and values
-
nonempty-containers
Fast, zero-cost conversion, and fully inter-operable nonempty container types
-
wildfly_container_versions
WildFly container versions
-
dendron
Generic tree data structure
-
traitgraph
Abstracting over different graph representations
-
treeflection
that provides reflection for tree structures
-
civs
Controllably Increasing/Inflating VectorS
-
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
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
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
-
indexland
Rust Collections with Newtype Indices
-
swamp-analyzer
analyzer for swamp
-
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
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>
-
make-message-bus
Generate a pub-sub bus for use in async applications
-
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
-
sycamore-state-core
sycamore-state core types and trait definitions
-
pinned_vec
Vec-like data structure whose elements never move
-
corresponding
Move corresponding fields between structs
-
compare
Experimental comparators for collections to be generic over
-
applejack
Radix tree
-
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. -
enum-tag
Proc. macro for generating enum discriminant types.
-
buffer-trigger
A data collection trigger based on the maximum number and refresh time
-
baz-tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
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
-
pi_densevec
重定向映射表，一个使用usize作为key的映射表
-
bktree
BK-tree datastructure
-
klingt
audio graph library?
-
cbsk_timer
rayon thread runtime
-
granular-id
ID numbers with arbitrary precision
-
spaceindex
-
cervine
A slightly more flexible Cow; roughly to T: Borrow<R> as alloc::borrow::Cow is to B: ToOwned
-
task-collection
Types for managing and waiting on groups of tasks
-
elastic_hash_rs
Elastic Hashing from Optimal Bounds for Open Addressing without Reordering
-
weak-self
WeakSelf is simple way to have a Weak pointer to yourself
-
sid_vec
Tiny library providing id types and an id-based vector
-
isomorphism
2 directional hashmaps
-
purse
Bag data structure implementation in Rust
-
myopic
A possibly bad lens library for Rust
-
slice-rbtree
A slice-based Red-black tree
-
periodic-rs
Bounded datastructures
-
flow-graph
A representation of a graph data structure for flow-based programming
-
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
-
limited-queue
a limited queue that overrides the oldest data if trying to push a data when the queue is full
-
minimizer-queue
Fast computation of minimizers using a monotone queue
-
pointcloud
An accessor layer for goko
-
vec_key_value_pair
A drop-in replacement for std::HashMap and std::HashSet that use Vec on the backend
-
keylist
Elixir keyword list in Rust
-
front-vec
Efficiently-prependable Vec and String types
-
collection_literals
macros for initializing std::collections
-
flatarray
Fast implementation of SeqEval, a sequence evaluation framework
-
dynamic_dict
A lightweight basic crate to create dynamically typed dictionaries
-
auto_vec
Vec that automatically remove the child when the child is being dropped
-
dot_tree
Create, query and store binary trees
-
merkle-lite
fast, and composable binary Merkle tree and proof for Rust Crypto hash functions
-
collect-rs
Special and custom Collections and Containers (for Rust)
-
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
-
slotgraph
Graph implementation built with slotmap and petgraph
-
smallobjectpool
A small object pool for Rust
-
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
-
cbloom
Concurrent implementation of Bloom filters
-
stac-extensions
Manage STAC extensions (https://stac-extensions.github.io/)
-
vec_arith
Powerful vector/matrix arithmetic library written in Rust
-
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
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
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
-
iter-set
Set operations on sorted, deduplicated iterators
-
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 -
whirlybird
generic type implementations for RedMaple library, that offers workflows for different events compatible with common contents like todos, blogs and etc
-
tilecoding
Dr. Richard S. Sutton's tile coding software.
-
graphannis-core
supports graph representation and generic query-functionality
-
bufferring
Ring buffers for Rust
-
hashmap-entry-ownable
Variation of HashMap::entry() that accepts borrowed forms of keys
-
memorable
Lock-free, ordered and multiple version memory table for key-value databases
-
polystore
Polymorphic data store
-
tcgeneric
Generic data types used internally by TinyChain
-
tyght-map
A static type map implementation
-
hgg
Approximate nearest neighbor search collection
-
flex-algo
Rust commonly used data structure and algorithms
-
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
-
statiki
Static friendly data structures
-
mqfilters
Highly optimized approximate membership query filters (bloom, cuckoo, xor, quotient) with SIMD support
-
fxd
Fixed-point decimal implementation
-
pq-tree
consecutive ones property (C1P) and graph planarity testing
-
open-coroutine-timer
The time utils
-
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…
-
medianheap
A median heap for keeping track of a running median
-
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.
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
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
-
rahashmap
Fork of standard library HashMap with additional functionality
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
arc-atomic
atomic pointer to an
Arc -
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
-
hashable_weak
A hashable weak pointer
-
treers
Sedgewick's tree maps
-
hedge
An index based half-edge mesh implementation
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
seq-set
A Set collection that maintains insertion order
-
mutcrab
written in rust that contains various classic data structures
-
sweeper
A foundation for Minesweeper implementations in Rust
-
cpp_map
C++ std::map emulator
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
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
-
nopetgraph
Graph data structure library. Provides graph types and graph algorithms.
-
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
-
tree-sitter-traversal
Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface
-
output_iter
An iterator that performs calculation during iteration
-
entoli
A functional programming library inspired by haskell
-
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
-
wildland-catlib
Wildland Catalog Library client
-
web-glitz-buffer-vec
Implements growing WebGlitz memory buffers for slices of data
-
u64_array_bigints
biginteger library based on u64 arrays
-
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
-
simple-vec-collections
Collections implemented using Vec
-
ndcopy
Fast N-dimensional array memcpy
-
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)…
-
btreec
Rust bindings for btree.c
-
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
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
swamp-std
standard library for swamp
-
redox_simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
crio
An easy to use persistent data storage library
-
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
-
graus-db
A high-performance, thread-safe key-value embedded data store
-
rds-tensors
Rust Data Science Tensors crate
-
atomic_lifo
Lock free thread-safe lifo for rust
-
multiset
Multisets/bags
-
queues
Efficient FIFO Queue data structures
-
implhm
Simplified library of collision-handling HashMaps
-
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
-
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
-
rpos
Cursor Manager on Table
-
processing_chain
set up processing chains of large amounts of data
-
app_properties
reading application properties from a file
-
advanced_collections
advanced data structures (collections). Includes counter (hash-bag, multiset), disjoint set (union-find, merge-find), circular buffer (cyclic buffer) and interval (range)
-
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 -
unflatter
unflatteris a Rust library providing extension traits for flattening and unwrapping nested structures, including nestedOptionandResulttypes. It simplifies working with deeply… -
persistent_hashmap
Persistent hashmap is a library for working with memory mapped hashmaps
-
optionee
The macro to create option struct easily
-
multipath
split file path, like
/home/{user,admin}/file.txt -
object-chain
Ad-hoc structure builder
-
bengbenge
inifity array for round-robin dns, beng, beng
-
goodreads
deserializing a Goodreads library export
-
search_trail
manager of variables that can save and restore their values
-
rolling_norm
Computes the rolling mean, variance, standard derivation and norm
-
easy_collections
Wrappers around standard collections for ease of use and quick prototyping
-
index_many
A proof of concept for indexing an slice at multiple locations at once
-
untyped_vec
A type-erased vector type for Rust
-
pareto_front
Builds a Pareto front incrementaly
-
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
-
ashscript-types
Types for Ashcript Game game and action states
-
resizing-vec
An automatic resizing vector for data with linear increasing ids
-
nave
Thinking about the construction of distributed systems starting from the *consistent hash* algorithm
-
bitstring-trees
Trees based on bitstrings
-
shared-string
Split a string without another allocation
-
median-heap
A median heap implementation in Rust, used to keep track of a running median of a sequence of numbers
-
partial
Optional monad with fake variant
-
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
-
list-any
Type erased slices and Vecs
-
datastructures
A variety of data structures for learning purpose
-
kodiak-taxonomy
manage generic taxonomies supporting unique features
-
ospf-rust-multiarray
A multi-array utils for ospf-rust
-
mkargs
Build command arguments
-
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
-
libarena
Arena allocated graph implementation
-
pinus
A prickly BTreeMap. You can insert through shared references and values are pin-projected.
-
discord-indexmap
A fork of the popular
indexmaplibrary that adds a few extra APIs that are yet to be upstreamed -
recursive_array
arrays using recrusive data structures to avoid limitations of the rust compiler
-
circularbuf
Rust fixed size circular (ring) buffer
-
mind-tree
Organize your thoughts in a tree-like structure
-
iunorm
Map normalized floating-point numbers to/from (un)signed integers
-
valet
Stores your objects and gives you a tag to retrieve them later
-
aatree
in Rust
-
collectivity
Generic collection traits
-
collect_result
collecting an iterator of results into a result of a collection
-
smap
Simple-Map: HashMap for easy to use
-
wolf-graph-dot
Adds support for generating Graphviz DOT files from wolf-graph graphs
-
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 -
const_std_vec
const std vec
-
deviz
access to a VS Code extension for displaying structured program output
-
moonlight_collections
Collections for Rust
-
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
-
rive-models
Revolt API models for the Rive ecosystem
-
arc-bytes
A reference-counted byte buffer
-
pac_cell
Parent and child cell
-
conlife
Backend-only implementation of Game of Life with minimal dependencies
-
cursed-collections
Collections that (seem to) break Rust safety
-
tag-vec
A vector used for storing tags
-
slice-cell
A
Cell<[T]>-like mutable slice, that allows slice-like APIs -
bloom-filters
Rust port of https://github.com/tylertreat/BoomFilters
-
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.
-
chrom
representing colours
-
const_array_map
A const-capable Map type backed by a static array
-
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…
-
tc-state
TinyChain's general state enum
-
simple-matrix
generic matrix library
-
version-lp
a version struct library for use with version comparing, and wildcard resolving
-
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
-
priq
Array implementation of the min/max heap
-
weak-lists
Lists with weak references and concurrent iteration and modification
-
ctxmap
A collection that can store references of different types and lifetimes
-
btree-vec
A growable array (vector) implemented using a B-tree
-
tea-core
Core data structures and traits for tevec
-
bittyset
A BitSet type for manipulating bit sets
-
typed_graph
Staticly typed graph library
-
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 -
hashable-map
Wrappers for HashMap and HashSet that implement Hash
-
nslice
Structures for interpreting slices of variable length as arrays
-
maybe-cell
An UnsafeCell optionally containing a value, with the state externally managed
-
sdsl
interface for the Succinct Data Structure Library
-
nvpair-rs
Safe and rustic wrapper around nvpair
-
fqdn-trie
FQDN (Fully Qualified Domain Name) lookup structures (based on tries)
-
arith
containers with arithmetics
-
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
-
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
-
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
-
fixed-slice-deque
A fixed size deque implementation
-
array-const-fn-init
Initializes an array with constant values calculated by a
const fn -
yuuang_petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
uvector
access two slices as a single continuous vector
-
equivalence
Trait and derive macro for comparing and hashing types modulo an equivalence relation
-
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
-
path-value
Universal type and access property(s) by path
-
capillary
HashMap-like storage of key-value pairs, but allowing for step-by-step (partial) search of value
-
case_insensitive_string
A case insensitive string struct
-
pure-hfsm
A finite state machine library with a clear separation between the machine definition and its changing state
-
non-empty-collections
Non-empty hash-map and hash-set implementations
-
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
-
sparse-bin-mat
A sparse implementation of a binary matrix optimized for row operations
-
Project2
Implementations of red black tree and AVL tree
-
erased_set
A set of erased types
-
trying
Basic trie crate
-
take-some
that provides a way to obtain *some* value from various collections
-
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
petr-stdlib
the petr language's standard library
-
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.
-
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
-
binary-tree-view
A binary tree visualization application built in Rust
-
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.
-
magiclist
List with O(log n) random access, insertion, splitting, and merging
-
checked
Implements a wrapper over the primitive Rust types that better indicates overflow during arithmetic
-
graff
manipulating graphs
-
quarkrs
A collection of small life improvements for rust
-
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 -
segment-map
A self-balancing binary search tree for mapping discrete, disjoint segments to values
-
kvv-efa-api
Rust bindings for the KVV (Karlsruher Verkehrs Verbund) "EFA"-API
-
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
-
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
-
triangle_matrix
Triangle matrix indexing operations
-
fplist
An immutable, persistent, singly-linked list
-
usage
A convenient alternative to the newtype pattern
-
kd_interval_tree
Implements a K-dimensional interval tree, for fast interval-overlap lookup. Binary-tree based implementation, i.e. O(log(n)) lookups.
-
batbox-cmp
Traits & functions related to Ord
-
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
-
vec-entries
Entry API for iterating over and removing elements from a
Vec -
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
-
dependency-graph
building and resolving dependency graphs
-
bit-array-rs
Bit Array
-
data_structure_traits
data structure collection traits
-
simple_event_bus
A basic, simple event bus in Rust
-
liblet
learning about formal languages and grammars
-
temporary-annex
Helper for creating temporary annex on a collection
-
qualomat_schema
Rust bindings for the *Qual-O-Mat* open data format for the german voting advice tool *Wahl-O-Mat*
-
dawgdic
Port of DAFSA in safe Rust (original implementation courtesy to Susumu Yata)
-
rdf-reader
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
canopydb
Transactional key-value storage engine
-
typed_index_collection
Manage collection of objects
-
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 -
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
-
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
-
dyn_vec
A Vec<T: ?Sized>
-
okasaki
A collection of peristent datastructures
-
range-mutex
A
Mutex<[T]>-like type, that allows locking different ranges separately -
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
-
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
-
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…
-
circular_vec
A fixed length vector that provides a next function that loops infinitely
-
open-payments-iso20022-acmt
Open Payments - Message Parsing Library - ISO20022 ACMT
-
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…
-
tantivy
Search engine library
-
graph-rs
graph library
-
datazoo
Bitset and jagged array data structures
-
fusefilter
No alloc membership approximation
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any char iterator
-
hibit_tree
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
-
nfe
NF-e - Manipulação da nota fiscal eletrônica
-
wide
help you go wide
-
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
-
gpt_disk_types
GPT (GUID Partition Table) disk data types no_std library
-
meminterval
interval-tree in Rust made to store memory mappings
-
simple-graph
Graph library with ability to serialize/deserialize Trivial Graph Format
-
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.
-
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
-
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. -
oas3
Structures and tools to parse, navigate, and validate OpenAPI v3.1 specifications
-
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
-
k2_tree
A space-efficient representation of sparsely populated bit-matrices
-
stupid-add
If you want to add stuff this lib is the way to go
-
big-tuple
providing trait implementations for tuples of up to 128 elements
-
farmap
working with Farcaster label datasets
-
prefix_array
A generic container for searching on prefixes of keys
-
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
-
sparseset
A Sparse Set
-
lim-bit-vec
Limited bit vectors
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
spectacle
Opt-in runtime introspection
-
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.
-
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
-
eternaltwin_dinoparc_store
Dinoparc store implementation
-
immer-rs
A wrapper around the C++ library immer for persistent datastructures
-
protocoll
clojure inspired protocols for rust collections
-
oats-rs
Short, unique ids without the hassle of random uuids
-
win-idispatch
that aims to provide a more ergonomic way of working with idispatch in winapi based projects
-
ads-rs
(Algorithms and Data Structures) is a set of useful generic production-ready algorithms and data structures
-
woodland
Easy to use implementations of popular tree data structures such as Binary, Binary Search, AVL, Red-Black, and more
-
zond
standard rust collections but with collecting statistics
-
inline-str
Efficent and immutable string type, backed by inline-array
-
kukoo
lockfree cuckoo hashmap
-
eth2_ssz_types
types with unique properties required for SSZ serialization and Merklization
-
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).
-
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
-
poset
posets
-
const-vec
Vec-like data structure with immutable push method
-
puruda
Pure Rust DataFrame
-
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
-
ensure
target state of an object
-
tudelft-dsmr-output-generator
Companion library for the TU Delft Software Fundamentals individual assignment
-
undo_2
Undo and redo done the right-way
-
sorted_vector_map
maps and sets backed by sorted vectors
-
adts
Common abstract data type traits and implementations
-
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
-
rt_vec
Runtime managed mutable borrowing from a vec
-
id-vec
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
-
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
-
hex-string
a data structure for managing hex strings in both string and byte vector representation
-
foliage
Abstract syntax tree for first-order logic with integer arithmetics
-
text_utils_s
edit array. Example delete duplicate in array. Clear string
-
fixed_str
Fixed-size, null-padded UTF-8 string type with const-safe construction and binary serialization support
-
hexarr
working with hexagonal grids
-
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
-
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
-
bet
parsing and evaluating binary expression trees
-
tiltflake
distributed database that uses the flake algorithm to generate unique IDs
-
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).
-
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)
-
bfield
B-field datastructure implementation in Rust
-
rbx_tree
Weakly-typed Roblox DOM implementation for Rust
-
competitive-programming-rs
Competitive Programming Library in Rust
-
kserd
Kurt's Self-Explanatory Rust Data
-
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
-
tinysearch-cuckoofilter
Cuckoo Filter: Practically Better Than Bloom
-
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
-
triskell
A tri-partite ring buffer
-
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
-
memcell
providing a MemoryCell struct, which stores a current and previous value
-
geo-index
Fast, immutable, ABI-stable spatial indexes
-
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
-
ecoord-core
Core primitives and operations for transforming between 3D coordinate frames
-
simple-collection-macros
configurable macros for maps and sets
-
alloc-wg
Attempt of collection several proposals of the allocators-wg
-
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
-
smallgraph
A small graph based on smallvec
-
ident
wrapping types with an immutable identifier and storing/accessing such types in collections
-
hostname
Cross-platform system's host name functions
-
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
-
bloom_filter_plus
rust_bloom_filter
-
nats-types
Enumerations and types for representing NATS protocol messages
-
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
-
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
-
vec_2d
2d vector for Rust
-
tree-index
Index a flat-tree
-
quantity
Representation of quantites, i.e. of unit valued scalars and arrays.
-
bucket_queue
A Bucket Queue data structure that can be used as a Priority Queue
-
containers
Containers
-
default-vec
A specialized vector that has a default value
-
lambda-apigateway-response
Response object for AWS Lambda with API Gateway
-
fusebox
Mostly safe and sound append-only collection of trait objects
-
largeint
that supports large integer arithmetic
-
bit-vec-omnitool
A vector of bits
-
typeslice
type-level slices
-
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.
-
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
-
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
-
medea-reactive
Reactive mutable data containers
-
arenas
Arena data structure for efficiently adding & removing items with stable IDs
-
art
adaptive radix trie
-
keymaps
standardized encoding for key codes
-
bndpresbufq
Bounds-preserving, optionally limited, buffer queue
-
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
-
futures-bounded
bounding futures in size and time
-
fastdivide
partial port of libdivide. It makes it possible to reduce the cost of divisions.
-
apint
Arbitrary precision integers library
-
unicase_collections
Collection of UniCase datastructures
-
lz_diet
An AVL balanced Discrete Interval Encoding Tree
-
streamies
More features for your streams
-
acme-types
Types for implementing ACME (RFC 8555) providers and clients
-
graph-api-simplegraph
efficient graph implementation for the graph-api ecosystem with support for indexing
-
binary_tree_zy
binary tree
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16coordinates. -
rmat
minimal implementation of two-dimensional matrix algebra
-
mismatch
abstract mismatching. Useful for error propagation.
-
orx-imp-vec
ImpVecstands for immutable push vector 👿, it is a data structure which allows appending elements with a shared reference -
jcm
Pure Rust implementation of the JCM USB communication protocol
-
geomprim2d
2D geometric primitive types
-
bpf-ins
working with eBPF instructions
-
tinybitset
Generic implementation of small, fixed size, copyable bitsets
-
blocked-vec
A vector of byte blocks behaving like files
-
grit-bitvec
BitVec, a vector type that can store fixed-width data with irregular bit widths
-
sigma-rust
parsing and evaluating Sigma rules to create custom detection pipelines
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
kushi
A queue built for the Dango Music Player and Oden Music Bot
-
destiny-pkg
Destiny 1/2 Tiger package library and tools (unpacker, verification)
-
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
-
timeless
storing in-memory timeseries data
-
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
-
immutable-map
An immutable ordered map and set based on weight-balanced tree
-
gvdb
glib gvdb file format
-
nested
A memory efficient container for nested collections (like
Vec<String>orVec<Vec<T>>) -
anycollections
Rust Vec and HashMap which can contain arbitrary types
-
tupley
Extension for primitive tuple (Hlist based on recursive structure)
-
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
-
macaddr
MAC address types
-
bitint
Integer types that have a logical size measured in bits
-
bonsai
Index arithmetic functions for perfect binary trees
-
single_byte_hashmap
HashMap for storing singular bytes as keys
-
fairqueue
Spatially distancing fair queue. A kind of queue for sequential round-robin processing.
-
into_enum
Rust macro to generate trivial From impls
-
esl01-dag
DAG used for source control
-
primitive_fixed_point_decimal
Primitive fixed-point decimal types
-
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
-
extensions
typemap container with FxHashMap
-
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
-
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
-
map1
@ErichDonGubler's fancy template for new Rust projects
-
lancelot
binary analysis framework for x32/x64 PE files
-
sum-queue
Queue struct that keeps a fixed number of items by time, not capacity, and allows to get summarized stats of its content
-
squall_dot_io_resp
A RESP parser implementation, written with edge performance in mind
-
field_accessor
A procedural macro to get and set a struct field by String dynamically
-
ioc
An Inversion-of-Control library in Rust
-
chtholly_tree
Rust bindings for Chtholly Tree
-
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
-
scoped_stack
A scoped stack data structure
-
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
-
forgetful
Track and forget values within a specific scope, enabling detection of repeated values
-
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
-
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
-
interval-map
A vector-based, non-duplicate range-keyed, sorted array
-
kodiak-sets
manage generic sets supporting unique features
-
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
-
hv-alchemy
Heavy Alchemy - the black arts of transmutation, wrapped for your safe usage and enjoyment
-
internode
Smart references to your graph nodes
-
libreda-splay
Splay map and splay set data structures
-
discrete_range_map
DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap
-
mikufans-proto-intl
gRPC APIs for Mikufans (Intl)
-
an-rope
an rope for large text documents
-
json-node
A way to work with JSON as a node tree
-
yagraphc
working with Graph data structures and common algorithms on top of it
-
gridd
A generic, dirt-simple, two-dimensional grid
-
streamhist
streaming histogram
-
insrcdata
Embed static data as source code
-
file_graph-rs
A tiny crate to generate a tree like structure starting from a folder and branching inwards
-
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
-
cbor-tag-index
Tag index
-
honeycomb-core
Core structure implementation for combinatorial maps
-
csgo-gsi-payload
Data structures for CSGO Game State Integration
-
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
-
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
-
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
-
tiny-interner
Easy to use string interner with fast access to underlying strings and minimal memory footprint
-
vox_writer
writer module for MagicaVoxel file format
-
range-split
splitting sequences with range parameters
-
iodyn
An incremental collections library making use of Adapton
-
bitaccess
Macro for efficient and type-checked access to individual bits of a variable
-
eztd
Quick start Rust
-
defaultmap
HashMap with an automatic default for missing keys
-
csv2struct
Generate Rust struct definitions from CSV
-
cbsk_log_rayon
log tool, using tokio as the runtime
-
bipbuffer
Simon Cooke's Bip-Buffer
-
arr-rs
arrays library
-
range-traits
Ranges related traits
-
hashmap_union
Allows the union and intersection of hashmaps
-
typed_id
Make your IDs strongly typed!!
-
rust-ds
Custom data structures crate for Rust
-
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
-
graphs
Graph data-structure implementations based off graph-traits
-
p-chan
Multimedia (Audio, Raster) Channel Newtypes and Conversions
-
wordlist-generator
A handy wordlist generator
-
rdf-query
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
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
-
append-only
Append only versions of std data structures
-
moretypes
Named tuples, records, and more!
-
deterministic-bloom
A deterministic Bloom filter with support for saturation. Suitable for distributed use cases and as a cryptographic primitive.
-
rbtset
A set based on a RB-Tree for efficient operations
-
mutable
keep track of changes in structures
-
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
-
jp_multimap
A barebones multimap (part of the jp project)
-
mc-oblivious-ram
Implementations of Oblivious RAM data structures
-
fixed-macro
Macros for creating fixed-point constants for types in the
fixedcrate -
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
-
onevec
One-based indexed Vec wrapper
-
hecs
A fast, minimal, and ergonomic entity-component-system library
-
hashcons
Hash cons'ing for compact representations of shared, immutable data structures
-
pui-arena
Generalized Arenas that can be used on
no_std -
flowerbloom
fast bloom filter implementation with thorough documentation and tests
-
fr-trie
Fuzzy Radix Trie
-
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
-
sbf
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
tracker-macros
Macros for the tracker crate
-
serde_view
Serialize views of data
-
enum-ref
Proc. macro for generating enum discriminant types.
-
insert_multiple
insert multiple items into a stream in reasonable runtime
-
stac-duckdb
Client for querying stac-geoparquet using DuckDB
-
fricgan
performing basic input and output on bytes
-
hexing
A basic Rust library to manipulate hexagonal grids
-
ankurah-core
Core state management functionality for Ankurah
-
elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
free-ranges
An efficient data structure for keeping track of indices which are either free or not
-
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
-
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
-
hash_table_datastruct
Adds a HashTable type, allowing to store values in a table with integer-indexed rows and hashable keys for columns
-
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
-
trybox
stable,
no_std-compatible, fallible heap allocation -
ttgraph_macros
Proc-macros for TTGraph
-
sylvan-sys
Bindings for the Sylvan parallel decision diagrams library
-
symbolmap-trait
A trait for generic implementation of symbol tables
-
string32
A string that is indexed by u32 instead of usize
-
chronoflake
Generate unique IDs based on the Snowflake algorithm
-
idcontain
Generational (or tagged) ID-based containers
-
package-json
package.json manager for Rust
-
wec
Useful vec!-like macros
-
histogram
A collection of histogram data structures
-
ast2str-lib
pretty-printing ASTs and other recursive data structures
-
stringvec
macro for creating Vec<String> from various types
-
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
-
bmap
A bitmap with an internal counter
-
vec-dimension-shift
N-Dimension shift features for Vec<T>
-
ts-builder
Timestamp builder
-
uwheel
Embeddable Aggregate Management System for Streams and Queries
-
im_interval_tree
An immutable data structure for storing and querying a collection of intervals
-
vec-vp-tree
A vantage-point tree implementation backed by vectors for good performance with no unsafe code
-
mucell
A cell with the ability to mutate the value through an immutable reference when safe
-
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
-
varstack
A call-stack based singly-linked list
-
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
-
trait-union
Stack-allocated trait objects
-
stochastic-data-structures
Various stochastic datastructures implemented
-
xsd
XSD.rs
-
hashtree
A Merkle Tree implementation in Rust
-
mmdb_core
A std-collection-like database
-
big_enum_set
creating sets of enums with a large number of variants
-
jui_file
file tool
-
banyan
Persistent indexable tree data structure
-
tiny-sparse-merkle-tree
Sparse Merkle Tree
-
dgunther2001-linked_list
A generic singly linked list
-
nanoset-py
A memory-optimized wrapper for Python sets likely to be empty
-
hdrhistogram
A port of HdrHistogram to Rust
-
mori_parallel
parallel orientation library built around commonly used orientation representations used in crystallography and engineering applications. It contains conversion, rotation, and data…
-
bugu
Cuckoo Filter: Practically Better Than Bloom
-
crdt_rs
work with Conflict-free replicated data types (CRDT) in Rust
-
kdt
k-dimensional tree implemented with const generics
-
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.
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
validbr
data structure and validation for Brazilian Registries, such as CPF, CNPJ and CNH (currently only CPF and CNPJ is supported)
-
petitset
An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap
-
goya
morphological analyzer for Rust and WebAssembly
-
aabb-quadtree
A quadtree that maps bounding-boxes to elements
-
smolvec
A lightweight vector implementation with small-vector optimization for rust
-
htmldom_read
HTML reader that parses the code into easy-use tree
-
sized-vec
Type level sized vectors
-
xtree
general purpose tree data structure
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
cow-rewrite
Rewrite copy-on-write types copying only when it's neccessary
-
pthash
Rust bindings for PTHash
-
sliding_window
A fixed size, heapless sliding window
-
river-ring-buffer
ring buffer implementation
-
generic_singleton
allowing for generic singleton patterns
-
open-payments-common
Open Payments - Message Parsing Library - ISO20022
-
kn0sys_ndarray_rand
Constructors for randomized arrays.
randintegration forndarray. -
rblist
A block-based, non-circular double-linked list implementation for Rust
-
nonasync
A set of utilities useful for building a non-blocking non-async APIs
-
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
-
vortex-sampling-compressor
Vortex compressor that uses statistical sampling
-
flat-multimap
A multimap and multiset implementation using a flattened hash table
-
tapestry
Generic 2D grid data structure and utilities
-
grapes
Persistent graph data structures: Tree, Graph, Arena & more
-
bit-index
A little-endian zero-indexed bitstring representation
-
geogrid
Manipulate geographic data on a grid
-
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
-
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
-
tbytes
A tiny library for reading and writing typed data into buffers
-
bitmac
Structure for accessing to single bits
-
sodg
Surging Object DiGraph (SODG)
-
mvbitfield
Generates types to work with bit-aligned fields
-
hopscotch
A FIFO queue for efficiently hopping and skipping between tagged items
-
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
-
mathio
A lightweight, simple and straight-forward opinionated library for math used in other projects
-
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 -
try-lazy-init
Fallible lazy initialization
-
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
-
multi-stash
Vector-based arena data structure that reuses vacant slots
-
sortedcontainers
An experimental sorted data structure
-
unsized_enum
Unsized enum implementation
-
stuff
Stuffing things into pointers
-
nohash-hasher
std::hash::Hasherwhich does not hash at all -
hedel-rs
A Hierarchical Doubly Linked List
-
binary_search_tree
Binary search tree implementation
-
stringz
A way to use strings in generic paramters
-
labelgraph
graph implementation, allowing random access to nodes via labels
-
kvtree
Heterogenous in memory key value tree storage
-
keyed
Implement comparison traits by specifying a key
-
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
-
bloom_filter_plush
rust_bloom_filter
-
ttl-queue
A queue that drops its content after a given amount of time
-
ensured_bufreader
A Bufreader ensures N bytes in buffer
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
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
-
qt-json
JSON library for QT
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
smt_map
A uint-to-uint map backed by Sparse Merkle Tree (SMT), which supports generating Merkle Proofs of key-values
-
immutable_string
Immutable Single Instance Strings for Rust
-
oomfi
A minimal Bloom Filter implementation in Rust
-
varset
an any type set of items
-
i24
working with 24-bit integers
-
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
-
modql-macros
Macros for modql. Not intended to be used directly.
-
tongrams
Tons of N-grams
-
smart-string
A collection of string types and traits designed for enhanced string manipulation
-
healm
**He**ap **al**located **me**rkle tree
-
go-heap-rs
Golang's heap written in Rust
-
fastbuf
single-thread-oriented very fast byte buffer
-
aversion
Versioned data structures with auto-upgrading
-
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
-
weighted_random_list
A Vec<T> that allows you to define the weight of each entry and randomly get entries
-
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
-
nimrodshn-btree
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite
-
safer-bytes
safe, non-panicking wrappers around the 'bytes' crate
-
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
-
rustgym
solutions
-
sparse_vec
Datastructure that stores separate but contiguous ranges of values efficiently
-
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…
-
velarixdb
An LSM Storage Engine focused on reduced IO amplification
-
vhr_serde
A serde (de)serializer crate for the simplist possible binary format
-
range_vec
Fast indexed access to a range of mostly-default values
-
simple-observable
observable pointer for mutable and immutable data
-
projected-hash-map
projected HashMap over HashSet
-
rs-merkletree
create Merkle Trees
-
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
-
mutuple
Replace items in Python's immutable tuples
-
array-ops
Automatic method implementations for array data types
-
byte-sequence
A little marco that creates structs to be used as byte sequences (for ApiKeys, SessionIds and so on)
-
rbtree-arena
A cache friendly red black tree where nodes live on sequential memory
-
butils
shared by software included in BSuccinct
-
ptr_hash
A high-throughput minimal perfect hash function
-
ulid-generator-rs
generating ULIDs
-
algods
A collection of data structures and algorithms
-
dst-container
Containers for DST objects
-
smart_access
A minimalistic "lazy bidirectional pointer" framework
-
no_vec
modifying sized arrays
-
honeycomb-render
Visualization tool for combinatorial maps
-
cycler
A simultainious write/read data structure
-
ckb_multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
treesome
tree creation, manipulation, traversal and visualization
-
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
-
ranged_integers
An integer restricted to a compile-time defined bounds driven by const generics
-
gloss-hecs
A wrapper over hecs for easy use with gloss
-
bounded-vec-deque
A double-ended queue|ringbuffer with an upper bound on its length
-
topset
Top N selector
-
priority-set
A no_std Priority Set
-
gpt_disk_io
GPT (GUID Partition Table) disk IO no_std library
-
pgdb_to_struct
CLI application to generate Rust struct files from PostgreSQL database tables
-
arrow-digest
Stable hashes for Apache Arrow
-
store-interval-tree
A balanced unbounded interval-tree in Rust with associated values in the nodes
-
jsonnlp
JSON-NLP data structure
-
u64_array_bigints_core
Core library for
u64_array_bigints -
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
-
atom_table
Assign easy-to-handle typed IDs to large, hard to handle things like strings
-
variant-map
defines maps to store variants of enums
-
trait-map
Rust map for dynamic trait storage and references
-
tiny-solver
Factor graph solver
-
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
-
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
graphsearch
graph search and representation library
-
unique-id-collection
Collection with unique Id
-
gen-vec
Vector indexed with generational indices
-
plain
A small Rust library that allows users to reinterpret data of certain types safely
-
tapa-trait-serde
A collection of Tapalogi's reusable crates
-
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
-
slotmap
data structure
-
read-write-pipe
A trait for objects implementing Write, to write all content from a Read object
-
union-find-rs
Disjoint-set forest implementation to support the union-find algorithm in Rust
-
vbox
type erased Box of trait object
-
libflow
grouping network flow data
-
const_queue
A stack-only, no_std queue using const generics
-
uuid-macro-internal
Private implementation details of the uuid! macro
-
rez
A convention for libraries to bundle resource files alongside binaries
-
bitops
Miscellaneous bit operations for any Integer
-
tiger-pkg
Tiger engine package reading library for Destiny 1/2 and Marathon
-
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
-
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
-
ordered-vecmap
Ordered map and set based on vectors and binary search
-
type-pools
A data structure to store values of multiple types
-
randsort
A sorting library with an optimal complexity of O(n) (!!) by randomly sorting Vectors until they are sorted
-
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. -
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
-
isx
Traits for checking certain conditions of values
-
higher-cat
Functors, Applicatives, Monads and other bad ideas
-
inspector
General purpose inspection for popular data structures
-
dynamic-matrix
work with matrices
-
compacts-dict
succinct dictionary
-
const-assoc
A const-capable Map type backed by a static array
-
borrow-framework
More flexible borrowing
-
short-lease-map
A map collection optimized for brief internship of values
-
altdeque
An alternative deque implementation
-
neighborgrid
A 2-D grid datastructure with easy to use iterators and adjacent cell methods
-
f256
Octuple-precision floating-point arithmetic
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
automatic-relations
Tree automatic relations
-
hit-data
Hierarchical Indexed Typed data structure
-
hamt-rs
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell
-
indexvec
Simplified copy of rustc's index crate
-
rdf-vocab
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
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
-
webgraph-algo
Algorithms for the Rust port of the WebGraph framework (http://webgraph.di.unimi.it/)
-
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
-
bloom
Fast Bloom Filter and Counting Bloom Filter implementation
-
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… -
option-block
A minimal utility Rust crate for small, fixed-size blocks of optional types
-
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
-
type-set
A set of heterogeneous types
-
piece_table_rs
piece table data structure
-
aliri_braid
Improve and strengthen your strings by making them strongly-typed with less boilerplate
-
nunny
the definitive non-empty slice/array/vec library for Rust
-
any_key
Dynamically typed keys for associative arrays
-
binary-data-schema
Meta language for raw binary serialization
-
fibheap
but actually useful Fibonacci Heaps
-
jsonpath-rust
basic functionality to find the set of the data according to the filtering query
-
sled
Lightweight high-performance pure-rust transactional embedded database
-
graph-api-lib
Core library for the graph-api ecosystem - a flexible, type-safe API for working with in-memory graphs in Rust
-
open-payments-iso20022-pain
Open Payments - Message Parsing Library - ISO20022 PAIN
-
vortex-fastlanes
Vortex fastlanes arrays
-
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
-
lazy_list
Lazily-populated lists, finite or infinite
-
tensorism-gen
Multidimensional arrays with bounds included in the type system
-
pi_link_list
linklist
-
synchronized-writer
A tiny implement for synchronously writing data
-
stac-async
Asynchronous I/O for stac-rs
-
init_trait
A small helper trait to simplify the initialisation of 'indexable' data structures
-
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
-
enum-set
A structure for holding a set of enum variants
-
cola
A text CRDT for real-time collaborative editing
-
vector2
2D vector library
-
dastral
Reduce boilerplate code, learn data structures & algorithms with Dastral
-
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
-
aterm
Annotated Terms data structure
-
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
-
muds
Minimalistic Data Structures and Entity-Component-System Library
-
moogle
data structures for relational code
-
closures
Abstraction for seperating code and state in closures
-
mti
that implements type-safe, prefix-enhanced identifiers based on the TypeID Specification
-
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
-
pi_phf_map
phf_map
-
holodeque
Array- and slice-backed double-ended queues in 100% safe Rust
-
rc-box
Known unique versions of Rc and Arc
-
tindex
Vec, slice and bitset with custom index types -
deqmap
A double-ended queue with optional keys
-
char-circle
A circular buffer for strings and traits for in-place string transforms
-
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
-
local_vec
fixed-capacity vector allocated on the stack
-
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
-
validated
The cumulative sibling of
ResultandEither -
bloomy
Bloom filter using only two hash functions
-
sorting-vec
Sorts a vector using a btreemap
-
map-trait
Generic Map trait
-
bs
bitset with small-set (single-word) optimization
-
delete_if_not
unsafely in-place delete function
-
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
-
immutable-avl
An Immutable map and set implement for rust based on an AVL tree
-
lhlist
Labeled heterogeneous lists
-
nnn
Generate your newtypes from a single macro
-
aces
Algebra of Cause-Effect Structures
-
setting
The styles of all graphics elements
-
datastruct
A pure-data structure builder
-
len-trait
Len trait for collectons
-
yuuang_dominators
null
-
hj_ds
A data structure library for Rust
-
stack-array
A data structure for storing and manipulating fixed number of elements of a specific type
-
another_radix_trie
Rust built radix tree library
-
const_enum_map
Get const value from enum handle
-
btree_graph
A generic graph data structure
-
btree_monstousity
a code port of BTreeMap but with comparator functions
-
nstree
construct branched 'namespace strings' for nested subcomponents, often for logging
-
succinct
data structures for Rust
-
tdf_utils
such as tree
-
collections-more
Common data structure and algorithms for rust-lang to complete the already excellent std::collections
-
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
-
zeen_filter
A fast and optimized Bloom Filter implementation in Rust
-
ttm-rs
CLI to turn tuples into adjacency matrices
-
qt-json-rs
JSON library for QT
-
gtrie
Generic trie implementation with a support of different key and value types
-
typescript-definitions-ufo-patch
serde support for exporting Typescript definitions
-
rust-fp-pfds
A Functional Programming Library in Rust, Purely Functional Data Structure
-
probabilistic_data_structures
Probabilistic data structures in Rust Lang
-
contextual
deal with data in context
-
mut-binary-heap
Enhanced version of std::collections::BinaryHeap that supports increase and decrease key, max, min, and custom-order heaps
-
subway
Fast, performant in-memory SkipList implemented in Rust
-
dsll
Fast Thread Safe Doubly Sorted Linked List
-
gecs
A generated entity component system
-
paged
Read and create read-only paged database files
-
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
-
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.
-
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
-
judy-sys
Low-level Judy array FFI binding
-
bondrewd
Bit-Level field packing with proc_macros
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
eimage
processing image collections in 3D space
-
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
-
graph-api-test
Test utilities and property-based testing for the graph-api ecosystem
-
hashindexed
A cache. A set which compares elements in a customisable way without overriding the eq() and hash() functions on the type itself.
-
voxel_chunk
A voxel object module which allows you to have private Chunk objects with methods to modify their data
-
bytes_to_type
facilitate byte conversion to specified types using macro generation
-
collect
An experimental extension of std::collections
-
compressed_map
'Static functions': compressed maps with the keys removed
-
queue-rs
queue
-
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
-
fpdec
Decimal fixed-point arithmetic
-
bits128
A struct to iterate over 128 bits by taking only 128 bits
-
vhr_datatypes
data/file structures used in the computer game Valheim
-
bytey
convenient and easy to use byte storage
-
fixed-bigint
Fixed-size big integer implementation for Rust
-
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
-
xml2arrow
Efficiently convert XML data to Apache Arrow format for high-performance data processing
-
collection
Deterministic, copy-on-write balanced search trees
-
bstree
A Binary Search Tree written in Rust
-
exclusion-set
a lock-free concurrent set
-
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
-
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
-
bit-set-omnitool
A set of bits
-
enum_set2
A bit-set indexed by enum variants
-
stable_node_set
An ordered set with handles to values
-
flashtext
algorithm to search and replace keywords in given text
-
crossbeam-skiplist-mvcc
Support MVCC (Multiple Version Concurrent Control) for
crossbeam-skiplist -
history-buffer
A fixed capacity, write-only, ring buffer
-
vpb
key-value proto buffer for veladb
-
aora
Append-only random-accessed data persistence
-
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
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
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
-
empty-collections
Correct-by-construction empty collections
-
uberbyte
Bit manipulation for dummies
-
taganak-core
RDF types and interfaces from Taganak (Transactional, Aggregating Graph Architecture for Networking and Access to Knowledge)
-
lighter
Macro for rewriting string matches as tries
-
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
-
aabel-bloom-rs
implements the Bloom filter
-
m6coll
Small Smart Collections using prefix m6
-
nonempty_range
Range representing nonempty ranges
-
eitherq
Queue which support two different types
-
arbitrary-int
Modern and lightweight implementation of u2, u3, u4, ..., u127
-
graphrox
A graph library for graph compression and fast processing of graph approximations
-
leonardo-heap
Heap structure supporting fast in-place partial sorting
-
oneoff
one-off types
-
crdt-list
Abstract CRDTs for lists
-
downstream
efficient, constant-space implementations of stream curation algorithms
-
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.
-
uniplate
boilerplate-free operations on tree-shaped data types
-
open-payments-iso20022-admi
Open Payments - Message Parsing Library - ISO20022 ADMI
-
modular-bitfield-ordering
Provide u8be..u128be, u8le..u128le for modular-bitfield
-
jinpyok_input
My comfortable user input methods
-
mytrie
Trie implmentation
-
vortex-proto
Protocol buffer definitions for Vortex types
-
rc-borrow
Borrowed forms of Rc and Arc
-
tany
Type-erased container with inline storage for small values
-
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.
-
sliced
A segmented vector for iterating over slices
-
comfy-bounded-ints
Bounded-integer types focused on ergonomics and safety. (See README.md)
-
know_yaml
The Know Framework for Rust
-
ranno
Annotations over recursive data structures
-
bit-array
A compile time sized array of bits
-
hashcow
HashMap implementation with copy-on-write keys and values
-
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…
-
simple_bitfield
Create bitfields with the same memory structure as integers using a simple macro
-
grit-data-prison
providing the struct Prison<T>, a Generational Arena that allows full interior mutability to each and every element
-
feature-set
User defined feature set
-
stac-validate
Validate STAC objects with jsonschema
-
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
-
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
-
bytebufrs
A ring buffer for bytes implementing io::Read and io::Write
-
rdf_rs
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
explicit-discriminant
Macro for enforcing enum discriminants
-
pathlink
A URL type whose path can also be used as a filesystem path, for Rust
-
unsized-stack
Fast heterogeneous / unsized stack
-
zed
A minimal, Redux-like state management library for Rust with advanced features
-
awint_macros
Accompanying procedural macros to
awint -
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
-
hff-core
Hierarchical File Format: core structure
-
collection_traits
Collection traits & utilities; work in progress
-
vortex
file format with all builtin codecs and a sampling compressor
-
pi_world
ecs world
-
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
-
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
-
bloom_filter_simple
generic bloom filter implementation
-
atomic_swapping
An arbitrary type atomic storage with swap operations
-
flit
Bloom filter backed by xxHash
-
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
-
enumap
A HashMap and HashSet like interface for enums backed by an array
-
orx-concurrent-vec
A thread-safe, efficient and lock-free vector allowing concurrent grow, read and update operations
-
plum
Probabilistic data structures for rust
-
flat_bit_set
有序、稀疏、节省空间的 bitset，适用于小数据量
-
grid_trait
2D and 3D grids with combinators
-
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
-
rb
A thread-safe ring buffer with blocking IO
-
perm-vec
Datatype representing permutations of indices
-
power_map
A map with finite key and fixed size
-
graph-api-benches
Benchmarking utilities and performance tests for the graph-api ecosystem
-
fill
trait, an alternative to Extend for finite containers
-
stonks
Sets that allow borrowing while inserting entries
-
r-collections
Created some collection example LinkedList, Stack and Queue
-
slotmap-fork-otter
Slotmap data structure - temporary fork for Otter
-
vortex-mask
Vortex Mask - sorted, unique, non-negative integers
-
trie-generic
A trie with generic content
-
louds
LOUDS implementation for Rust
-
bset
Fast and compact sets of bytes or ASCII characters
-
my-stack
stack implementation in Rust
-
cursorvec
Cursored vector container
-
comparable
comparing data structures in Rust, oriented toward testing
-
picocadrs
working with picoCAD saves
-
mdarray
Multidimensional array for Rust
-
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 -
generic-json
Generic JSON traits
-
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
-
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.
-
baffa
Generic buffer for bytes
-
passive
A trio of marker traits to classify passive data structures
-
causal-length
CRDT's based on causal length sets
-
bstorage
A lightweight library for working with application configuration files
-
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 -
evillatoro-data-structures
Personal crate of me trying to implement data structures and algorithms in Rust
-
querable
Quer(y)able data structure implementation
-
ziku-pds
probabilist data structures
-
out-reference
out references
-
rdf-borsh
RDF.rs is a Rust framework for working with RDF knowledge graphs
-
transit_model_collection
Manage collection of objects
-
ringvec
ring buffer implementation based on a vector
-
bit_collection
A trait for iterating over the individual bits of a collection
-
taganak-orm
ORM (object-relational mapper) for Rust dataypes onto Taganak graphs
-
lupine
A bloom filter using FX Hash with Kirsch and Mitzenmacher optimization
-
fp-collections
An alternate collections library for rust
-
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
-
tuco-core
Contains the Tuco trait, used by the Tuco crate
-
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
-
slice-deque
A double-ended queue that Deref's into a slice
-
merkle-search-tree
A data structure for efficient state-based CRDT replication and anti-entropy
-
bounded-vector
Vec wrapper that guarantees upper and lower bounds on type level
-
im-rope
Unicode strings backed by RRB vectors
-
stack-trait
Stack trait with entry API for the LIFO element
-
sbf-blake3
Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space
-
bitty
Extract bits from, and put back into integer types
-
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
-
rbloom
efficient and minimalistic bloom filter
-
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
-
reference-interval
reference interval helpers a.k.a. reference range helpers.
-
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
-
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
-
functional_list
A functional, immutable list for Rust
-
dogma
Dogma.rs
-
serde-ndim
Serde support for n-dimensional arrays from self-describing formats
-
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
-
buf-list
A list of buffers that implements the bytes::Buf trait
-
bloomy-rs
Fast bloom filter implementation
-
nth-cons-list
The nth cons list implementation
-
frozen-collections-core
logic for frozen collections
-
yoke
Abstraction allowing borrowed data to be carried along with the backing data it borrows from
-
generic-bloom
A generic implementation of Bloom filters using traits
-
metered
Fast, ergonomic metrics for Rust!
-
bitsets
BitSet implementations: Dense, Compressed, Memory-Mapped, and Roaring
-
dh
Data handling in Rust, made easy
-
opt_arrayvec
Vector-like container with fixed capacity, using options instead of stored length
-
trs
Term Rewriting Systems
-
awint
Arbitrary width integers