-
arrayvec
A vector with fixed capacity, backed by an array (it can be stored on the stack too). Implements fixed capacity ArrayVec and ArrayString.
-
bytes
Types and traits for working with bytes
-
generic-array
Generic types implementing functionality of arrays
-
indexmap
A 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 hash table functionality, it preserves insertion order except after removals, and it allows lookup of its elements by either hash table key or numerical index. A corresponding hash set type is also provided. This crate was initially published under the name ordermap, but it was renamed to indexmap.
-
hashbrown
A Rust port of Google’s SwissTable hash map
-
either
The enum
Eitherwith variantsLeftandRightis a general purpose sum type with two cases -
hdrhistogram
A port of HdrHistogram to Rust
-
smallvec
‘Small vector’ optimization: store up to a small number of items on the stack
-
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
scroll
A suite of powerful, extensible, generic, endian-aware Read/Write traits for byte buffers
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
ndarray
An n-dimensional array for general elements and for numerics. Lightweight array views and slicing; views support chunking and splitting.
-
slice-deque
A double-ended queue that Deref’s into a slice
-
vec_map
A simple map based on a vector for small integer keys
-
bit-vec
A vector of bits
-
id_tree
A library for creating and modifying Tree structures
-
bitvec
A crate for manipulating memory, bit by bit
-
predicates
An implementation of boolean-valued predicate functions
-
optional
This crate supplies a number of Option-like primitive types
-
uint
Large fixed-size integers arithmetics
-
lru-cache
A cache that holds a limited number of key-value pairs
-
suffix
Suffix arrays
-
arc-swap
Atomically swappable Arc
-
hibitset
Hierarchical bit set structure
-
im
Immutable collection datatypes
-
starling
This tree structure is a binary merkle tree with branch compression via split indexes
-
bimap
A fast two-way bijective map implementation
-
c_vec
Structures to wrap C arrays
-
fixedbitset
FixedBitSet is a simple bitset collection
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
bit-set
A set of bits
-
rpds
Persistent data structures with structural sharing
-
string
A UTF-8 encoded string with configurable byte storage
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
radix_trie
Generic radix trie data-structure
-
rustc-ap-rustc_data_structures
Automatically published version of the package
rustc_data_structuresin the rust-lang/rust repository from commit 0928511d3a11ecc9703c3c34f0fe36282dd9b171 The publishing script for this crate lives at: https://github.com/alexcrichton/rustc-auto-publish -
sequence_trie
Trie-like data-structure for storing sequences of values
-
strfmt
strfmt: rust library for formatting dynamic strings
-
undo
Provides undo-redo functionality with dynamic dispatch and automatic command merging
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
typescript-definitions
serde support for exporting Typescript definitions
-
pagetable
simple wait-free two-level pagetable with 2mb pages
-
adapton
programming abstractions for general-purpose incremental computations
-
bitlab
Extracting a range of bits from a binary data source
-
generator
Stackfull Generator Library in Rust
-
smallbitvec
A bit vector optimized for size and inline storage
-
trees
General purpose tree data structures
-
redo
Provides undo-redo functionality with static dispatch and manual command merging
-
heapless
staticfriendly data structures that don’t require dynamic memory allocation -
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
histogram
histogram storage and percentile metrics with precision guarentees
-
rusty_ulid
Rust ULID (Universally Unique Lexicographically Sortable Identifier) generation and processing
-
total-order-multi-map
A multimap with at the same time keeps the total insertion ordering of all elements
-
fwdlist
A simply linked (forward) list
-
crates-index
Library for retrieving and interacting with the crates.io index
-
vob
Vector of Bits with Vec-like API and usize backing storage
-
enum-map
A map with C-like enum keys represented internally as an array
-
im-rc
Immutable collection datatypes (the fast but not thread safe version)
-
string-interner
An efficient string interning data structure with minimal memory-footprint and fast access to the underlying contents
-
rle_vec
A vector like struct that stores data as runs of identical values. Useful for storing sparse data.
-
kdtree
K-dimensional tree in Rust for fast geospatial indexing and lookup
-
flat-tree
Rust module for encoding/decoding varints that doesn’t do any IO. Inspired by the Node.js varint module
-
min-max-heap
An efficient, double-ended priority queue
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
splay_tree
Splay Tree based Data Structures (map, set, heap)
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
arccstr
Thread-safe, reference-counted null-terminated immutable strings
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
fp_rust
Implement fp features for Rust
-
queues
Efficient FIFO Queue data structures
-
polytype
A Hindley-Milner polymorphic typing system
-
csv2json
Converts CSVs into JSON documents
-
bv
Bit-vectors and bit-slices
-
base_custom
Use any characters as your own numeric base and convert to and from decimal
-
stable-vec
A Vec-like collection which guarantees stable indices and features O(1) deletion of elements
-
ordsearch
A data structure for efficient lower-bound lookups
-
trk-io
TrackVis (*.trk) reader and writer
-
enum_vec
Efficiently store a vector of enum variants as a packed n-bit vec
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
enumset
A library for creating compact sets of enums
-
crates-io-cli
Interact with crates.io from the command-line
-
ndarray-stats
Statistical routines for ArrayBase, the n-dimensional array data structure provided by ndarray
-
treebitmap
Fast IPv4/IPv6 lookup trie
-
treeflection_derive
#[derive(Node)] macro for the Treeflection library
-
array-macro
Array multiple elements constructor syntax
-
arraystring
Fixed capacity stack based generic string
-
voluntary-servitude
Thread-safe appendable list with lock-free iterator
-
succinct_rs
Succinct Data Structures library for Rust
-
disjoint-sets
Three union-find implementations
-
fst-regex
Search finite state transducers with regular expression
-
numas
numas library is implementation of multidimensional array for efficient computing
-
compt
A complete binary tree visitor library
-
fungi-lang
Fungi: A typed, functional language for programs that name their cached dependency graphs
-
merkle
Merkle tree implementation with support for generation of inclusion proofs
-
hash-rings
Implementations of various hash rings
-
path-tree
Path-based routing tree
-
bcc
Idiomatic Rust bindings for BPF Compiler Collection (BCC)
-
afi
Audio & video structures, plus encoder & decoder traits
-
landon
A collection of tools, data structures and methods for exporting Blender data (such as meshes and armatures) and preparing it for your rendering pipeline
-
wavelet-matrix
A wavelet matrix implementation. Supports various near-O(1) queries on large number of symbols or integers.
-
rexsgdata
Scatter-Gather Data Descriptors
-
array-init
Safe wrapper for initializing fixed-size arrays
-
data_reader
A data loading library for data scientist
-
ternary-tree
A Rust implementation of Ternary Search Trees, with no unsafe blocks
-
bounded-spsc-queue
A bounded SPSC queue
-
treeflection
A library that provides reflection for tree structures
-
rstar
R*-tree library for the rust ecosystem
-
cactus
Immutable parent pointer tree
-
blender-armature
Serialize / deserialize Blender armatures
-
plain
A small Rust library that allows users to reinterpret data of certain types safely
-
bucket_queue
A Bucket Queue data structure that can be used as a Priority Queue
-
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.
-
anymap
A safe and convenient store for one value of each type
-
tri-mesh
A triangle mesh data structure including basic operations
-
metrics
high-speed metrics collection library
-
vec-tree
A safe tree using an arena allocator that allows deletion without suffering from the ABA problem by using generational indices
-
trie-db
Merkle-Patricia Trie generic over key hasher and node encoding
-
enum-set
A structure for holding a set of enum variants
-
defaultmap
Provides a HashMap with an automatic default for missing keys
-
succinct
Succinct data structures for Rust
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
sized-chunks
Efficient sized chunk datatypes
-
merkle-cbt
A library for generating efficient Merkle tree and combined Merkle proof based on complete binary tree
-
leveled-hash-map
A 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, no matter what parent keys they have.
-
railcar
Placeholder for railcar
-
immutable-chunkmap
A cache efficient immutable map and set with lookup performance equivalent to BTreeMap and BTreeSet, and fast batch insert and update methods, and efficient implementations of all basic set operations
-
ego-tree
Vec-backed ID-tree
-
linear-map
A map implemented by searching linearly in a vector
-
nearly_eq
Nearly(Approximately) equal traits and assertion
-
data_structure_traits
data structure collection traits
-
usher
Parameterized routing for generic resources in Rust
-
by_address
Wrapper for comparing and hashing pointers by address
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
id-vec
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
-
numeric-array
Wrapper around generic-array that adds efficient numeric trait implementations
-
crdts
Practical serializable thoroughly tested CRDTs (ORSWOT, counters, LWW) ported from riak_dt
-
vec3
vec3
-
cidr-utils
This crate provides data structures and functions to deal with IPv4 CIDRs and IPv6 CIDRs
-
rc-writer
A tiny implement for writing data to a reference counted instance
-
treez
A collection of useful tree data structures
-
ami
Useful data structures that are not in the standard library
-
appro-eq
Approximately equal traits and assertion
-
vec2
vec2
-
gtrie
Generic trie implementation with a support of different key and value types
-
segment-tree
Quickly perform interval queries or modifications
-
nats-types
Enumerations and types for representing NATS protocol messages
-
simple-matrix
A simple generic matrix library
-
histogram-sampler
Sampling from a distribution given by a histogram
-
slice-of-array
Extension traits for casting between slices and slices of arrays. (&[T] <-> &[[T; n]])
-
slotmap
Slotmap data structure
-
linked_hash_set
HashSet with insertion ordering
-
mucell
A cell with the ability to mutate the value through an immutable reference when safe
-
lending-library
A key-value store that loans full ownership of items
-
string-wrapper
A possibly-stack-allocated string with generic bytes storage
-
enumflags
Bitflags
-
extindex
Persisted immutable index
-
fid
FID (Fully Indexable Dictionary) implementation for Rust
-
circbuf
A growable circular buffer for working with bytes
-
slab_tree
A vec-backed tree structure with tree-specific generational indexes
-
packedvec
Store vectors of integers efficiently
-
cmdtree
(Rust) commands tree
-
holyhashmap
A hash map with stable indices
-
isomorphism
2 directional hashmaps
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
atlatl
Double-array tries
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
enum_set2
A bit-set indexed by enum variants
-
fingertrees
Immutable persisten finger trees
-
hash_ring
Consistent Hashing library for Rust
-
quantized-density-fields
Rust implementation of Quantized Density Fields data structure
-
radix-tree
A radix tree implementation for router, path search
-
free-ranges
An efficient data structure for keeping track of indices which are either free or not
-
idcontain
Generational (or tagged) ID-based containers
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
region_buffer
A growable array allowing for multiple mutable non overlapping regions
-
graphlib
Graphlib is a simple and powerful rust library for the graph data-structure
-
fed
A sketch implementation of anonymous, tagged unions in stable Rust
-
vec4
vec4
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it’s own. Very similar to Slab.
-
galemu
Provides a workaround for generic associated types (GAT) limited to lifetimes (GAL)
-
iowrap
Small helpers for using io::Read/io::Write
-
version-lp
a version struct library for use with version comparing, and wildcard resolving
-
uluru
A simple, fast, LRU cache implementation
-
bip_handshake
Common handshaking interface as well as a default handshake implementation
-
predicates-tree
Render boolean-valued predicate functions results as a tree
-
graph-neighbor-matching
Graph similarity score using neighbor matching
-
binary-heap-plus
Enhanced version of std::collections::BinaryHeap that supports arbitrary order
-
inspector
General purpose inspection for popular data structures
-
digits
Custom “numeric” incrementor without u64 MAX limit in size. Like a score flipper for a custom character set.
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
tiled
A rust crate for loading in maps created by the Tiled editor
-
binn-ir
An implementation of Binn - https://github.com/liteserver/binn
-
half_edge_mesh
A basic implementation of the half-edge mesh data structure. It has a bunch of the functions you probably want in a half-edge mesh, but probably not all of them. I’m intending to add more methods and mutation techniques, as I need them for other projects or as I think of them. Pull requests welcome!
-
manhattan-tree
A spatial tree which can effiently find closest key to a point, by manhattan distance
-
backtracking_iterator
A simple implementation of a generic iterator with an item history, capable of backtracking and forgetting
-
intervallum
Generic interval and interval set library
-
divbuf
Buffer object that can be recursively divided into smaller buffers
-
bitmaptrie
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
-
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
-
enum-map-derive
Macros 1.1 implementation of #[derive(Enum)]
-
varuint
Variable length signed and unsigned integer types
-
named_tuple
A macro for declaring a
structthat manages a set of fields in atuple -
sea-canal
Identifies patterns in sequences of integers
-
froop
A functional reactive stream library for rust
-
multiset
Multisets/bags
-
pdatastructs
Simple probabilistic data structures
-
dto_derive
Derive for automatic mapping DTOs to Entities and vice versa
-
bip_metainfo
Parsing and building of bittorrent metainfo files
-
subset-map
A map where the keys are subsets of an initial set of elements
-
nodrop-union
A wrapper type to inhibit drop (destructor). Implementation crate for nodrop, the untagged unions implementation (which is unstable / requires nightly) as of this writing.
-
roaring
http://roaringbitmap.org : A better compressed bitset - pure Rust implementation
-
bytes_chain
Zero copy bytes chain based on crate
bytes -
itree
An interactively navigable version of the Linux utility
tree -
apint
Arbitrary precision integers library
-
hashmap-entry-ownable
Variation of HashMap::entry() that accepts borrowed forms of keys
-
compare
Experimental comparators for collections to be generic over
-
trie
An ordered map and set based on a trie
-
radix-heap
Fast monotone priority queues
-
ring_queue
A double-ended queue implemented using a vector that reuses space after elements are removed
-
sqa-bounded-spsc-queue
A bounded SPSC queue (temporary version so I can publish sqa-engine)
-
sized-vec
Type level sized vectors
-
ordered_iter
Ordered iterators
-
orderbook
Orderbook for Rust
-
croaring-sys
Raw bindings to CRoaring
-
froggy
Froggy is a 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
-
arr_macro
Initialize arrays with ease!
-
byte_trie
A compressed trie based on bytes with some weird child node bucket sizes
-
kailua_env
Basic environments for Kailua
-
probabilistic-collections
Various implementations of collections that use randomization to improve on running time or memory, but introduce a certain amount of error
-
rahashmap
Fork of standard library HashMap with additional functionality
-
bip_utracker
Communication with bittorrent UDP trackers
-
uid
A crate for the creation of unique IDs
-
debt64
An implementation of Base64 - https://en.wikipedia.org/wiki/Base64
-
nibble_vec
Vector data-structure for half-byte values
-
sortedvec
a sorted vector that enables quick lookups
-
fixed-vec-deque
A fixed-size, zero-allocation circular buffer for Rust
-
artsy
ART Tree data structure library
-
depot
A (disk) persistent queue library
-
bonzai
An abstraction for optimizing the memory layout and pointer aliasing of trees
-
sesstype
An implementation of Multiparty Session Types
-
uvector
access two slices as a single continuous vector
-
gapbuf
Generic gap buffer
-
heatmap
time-series of histograms with precision guarantees
-
htmldom_read
HTML reader that parses the code into easy-use tree
-
street_index
street_index is a small utility crate for working with road name / street indexing for cartographic purposes
-
intervaltree
A simple and generic implementation of an immutable interval tree
-
aci_ppm
Encode and decode PNM image files (TODO: so far only PPM)
-
abi_stable_derive
Implementation detail of abi_stable
-
trek-router
A flexible router for RESTful APIs
-
weak-self
WeakSelf is simple way to have a Weak pointer to yourself
-
actions
Software without side-effects. Redo and Undo. Macro’s.
-
dependy
Dependency resolution with variable dependency types
-
beach_map
Implementation of a slotmap
-
telegram-typings
Structs represents telegram bot typings
-
bisetmap
BisetMap is a 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 is interior mutable and all operations are thread safe. Each clone provides access to the same underlying data. Serialize and Deserialize from serde are also implemented.
-
csv2struct
Generate Rust struct definitions from CSV
-
stackvector
StackVec: vector-like facade for stack-allocated arrays
-
floating_bar
Representing rational numbers using the floating-bar number type
-
gcollections
Generic traits over Rust collections library
-
block-array-cow
In memory array de-duplication, useful for efficient storing of a history of data versions
-
moniker
Automatically derive variable binding and alpha equivalence for abstract syntax trees
-
rustz
A library for functional programming in Rust
-
enum_meta
Add metadata to Enum Variants
-
jagged_array
Owned
[[T]]-like 2D array where each row can differ in length -
take-some
A simple library that provides a way to obtain some value from various collections
-
dockerfile
A Rust library for dynamically generating Dockerfiles
-
avm1-tree
Abstract Syntax Tree (AST) for AVM1
-
range
A library for range addressing
-
sprs-ldl
Sparse cholesky factorization
-
simd_aligned
Safe and fast SIMD-aligned data structures with easy and transparent ‘flat’ access
-
merkle_light
Light merkle tree implementation with SPV support and dependency agnostic
-
dynstack
A stack for trait objects that minimizes allocations
-
thincollections
Alternative implementations for vector, map and set that are faster/smaller for some use cases
-
stomp
A full STOMP 1.2 client implementation. Allows programs to interact with message queueing services like ActiveMQ and RabbitMQ.
-
partial
Optional monad with fake variant
-
bitarray
A compile time sized array of bits
-
indexed
Convenient allocator for index-linked data structures
-
matmath
Matrix and Vector Math with generic type elements
-
collections-more
Common data structure and algorithms for rust-lang to complete the already excellent std::collections
-
restor
A dynamic resource storage system in 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 -
flit
Bloom filter backed by xxHash
-
doubly
Doubly linked lists in rust
-
multi_mut
Methods on HashMap and BTreeMap for safely getting multiple mutable references to the contained values
-
flatten
Tuple flatteing for rust
-
dict
Exercise crate implementing real associative arrays, also known as dictionaries
-
contrail-collections
Collections built on top of contrail
-
chainbuf
Fast chained buffers
-
bk-tree
A Rust BK-tree implementation
-
fral
Functional random-access lists
-
baggie
Container for storing mixed / heterogeneous values in a common structure
-
typescript-definitions-derive
serde support for exporting Typescript definitions
-
dinotree
An aabb space partitioning 2d tree data structure
-
weighted_random_list
A Vec that allows you to define the weight of each entry and randomly get entries
-
non-empty-collections
Non-empty hash-map and hash-set implementations
-
abi_stable
For doing Rust-to-Rust ffi,writing libraries loaded at program startup
-
cl-traits
Provides traits that describe collections
-
sprs_suitesparse_ldl
sprs bindings to the suitesparse ldl solver
-
ascii_num
digit to ascii numbers
-
mdbookshelf
Create epubs from a list of mdbook repositories