-
petgraph
Graph data structure library. Provides graph types and graph algorithms.
-
baby_shark
Geometry processing library
-
graaf
Functions and types for working with graphs
-
orx-split-vec
An efficient constant access time vector with dynamic capacity and pinned elements
-
tskit
rust interface to tskit
-
warg-transparency
transparency data structures
-
sorted_vector_map
maps and sets backed by sorted vectors
-
cranelift-bforest
A forest of B+-trees
-
aleo-agent
Agent library to communicate with the Aleo Blockchain, following the Public Specification
-
expiringmap
an AHashMap-backed TTL map
-
process_mining
Process Mining library for working with (object-centric) event data
-
bc-envelope
Gordian Envelope for Rust
-
rust_twostack
Support for two-dimentional stacks for the Rust programming language
-
mashmap
A flat HashMap that supports multiple entries per key
-
re_string_interner
string interning library
-
smodel
Symbol semantic modeling for Rust
-
ra_ap_ide_assists
TBD
-
ra_ap_tt
TBD
-
loro
high-performance CRDTs framework. Make your app collaborative efforlessly.
-
light_ranged_integers
similar to ranged_integers, but working on a stable compiler version
-
triemap
Triemaps for Rust
-
search_trail
manager of variables that can save and restore their values
-
matreex
matrix implementation
-
tan-lints
A collection of lints for the Tan Language
-
tuplez
Tuples represented in recursive form
-
dyn-slice
&dyn [Trait] implementation, inspired by a Reddit thread
-
num-bigint
Big integer implementation for Rust
-
num-rational
Rational numbers implementation for Rust
-
loro-rle
A internal library of loro for storing and manipulating run-length encoded data. Do not use it directly.
-
vectune
A lightweight VectorDB with Incremental Indexing, based on FreshVamana
-
histogram
A collection of histogram data structures
-
loro-delta
Loro internal library. It's used as a delta between two versions of text or lists. It's also an efficient Rope.
-
non_empty_continuous
Non-empty continuous collections
-
serde_derive
Macros 1.1 implementation of #[derive(Serialize, Deserialize)]
-
fav_core
Fav's core crate; A collection of traits
-
cranelift-entity
Data structures using entity references as mapping keys
-
loro-common
Common types and functions for Loro. This is an internal lib of Loro.
-
viral32111-xml
XML parser crate for my Rust projects
-
yrs
High performance implementation of the Yjs CRDT
-
jcm
Pure Rust implementation of the JCM USB communication protocol
-
fav_utils
Fav's utils crate; A collection of utilities and data structures for the fav project
-
compact-rc
Low-memory reference-counting pointers
-
sparkv
Expirable in-memory key-value store
-
minifloat
Emulate various minifloats with const generics
-
las
Read and write point clouds stored in the ASPRS las file format
-
bb-qol
Small collection of quality-of-life functions
-
pyinrs
type library that is as easy to use as Python built-in types
-
loro-internal
Loro internal library. Do not use it directly as it's not stable.
-
voxtree
A sparse voxel octree for rust & rust-gpu
-
miniconf
Serialize/deserialize/access reflection for trees
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
libpna
PNA(Portable-Network-Archive) decoding and encoding library
-
bit_manipulation
lightweight Rust crate for seamless management and validation of up to 128 option states. Empower your applications with efficient, flexible, and intuitive option handling, ensuring…
-
db_meta_derive
db-meta-derive is a wrapper around PostgresSOL using tokio-postgres
-
csaf-walker
work with CSAF data
-
walker-common
A common functionality for SBOM and CSAF walker
-
ttgraph
Typed/Transactional Graph container
-
hecs
A fast, minimal, and ergonomic entity-component-system library
-
pinned-bucket
Mutable container for pinned and immutable items
-
pna
PNA(Portable-Network-Archive) decoding and encoding library
-
aper
Synchronized state machines over WebSockets
-
uintx
Unaligned unsigned integers with exact size in memory and arithmetic operations for them
-
vector
The package provides a vector database allowing for efficient search of nearest neighbors
-
string-interner
Efficient string interner with minimal memory footprint and fast access to the underlying strings
-
range-set-blaze
Integer sets as fast, sorted, integer ranges with full set operations
-
walker-extras
Additional functionality for SBOM and CSAF walker
-
stringz
A way to use strings in generic paramters
-
spacetimedb-data-structures
Assorted data structures used in spacetimedb
-
roaring
A better compressed bitset - pure Rust implementation
-
counted_map
a hashmap that automatically assigns keys to pushed values
-
regroup
regrouping arrays
-
linear_collections
Map and Set types backed by linear data structures
-
rsor
Reusable slice of references
-
generic-btree
Generic BTree for versatile purposes
-
field_access
Dynamically access struct fields
-
portable-network-archive
cli
-
hashbrown
port of Google's SwissTable hash map
-
prost-unwrap
A procedural macro for prost-generated structs validation and type-casting
-
lsm-tree
A K.I.S.S. implementation of log-structured merge trees (LSM-trees/LSMTs)
-
wide
help you go wide
-
keymaps
standardized encoding for key codes
-
wayrs-protocols
A collection of Wayland protocols to use with wayrs-client
-
tar-no-std
read Tar archives (by GNU Tar) in
no_std
contexts with zero allocations. The crate is simple and only supports reading of “basic” archives, therefore no extensions, such as GNU Longname… -
structz
Anonymous struct implementation in rust
-
risc0-binfmt
RISC Zero binary format crate
-
mipmap-1d
A small data structure to perform 1d-mipmapping (downsampling)
-
grammers-tl-types
Rust definitions for Telegram's API types and functions
-
sbom-walker
work with SBOM data
-
searchy
Search index (in-memory), that can be constructed and searched using a bag of words model, with cosine similarity scoring based on tf-idf. Supports multiple search terms, permissions…
-
ulid-generator-rs
generating ULIDs
-
expry
Execute an expression on an encoded (binary) value, yielding another binary value (either in decoded or encoded form). Supports custom functions. Supports parsing the expression and converting the expression to bytecode.
-
rust_dot
RustDOT is mostly the Graphviz DOT language, lightly rustified
-
maelstrom-base
Fundamental data structures used by all Maelstrom code
-
wasmedge-types
The common data structures for WasmEdge Rust bindings
-
datastreams-rs
DataStreams container
-
chat-prompts
Chat prompt template
-
mmap_bytey_byte_buffer
Mmap Bytey MByteBuffer code, use Mmap Bytey instead
-
yy-typings
A collection of typings for GameMaker Studio 2 YY and YYP files
-
endpoints
A collection of data structures for the OpenAI-compatible endpoints
-
fraction
Lossless fractions and decimals; drop-in float replacement
-
mmap_bytey
Mmap Bytey provides a convenient and easy to use byte storage
-
imbl
Immutable collection datatypes
-
astack
offers a Stack data structure with fixed capacity capable of fast LIFO operations
-
power_map
A map with finite key and fixed size
-
prost-unwrap-transform
A procedural macro container for prost-unwrap library
-
rpkg-rs
Parse Glacier ResourcePackage (rpkg) files, allowing access to the resources stored within
-
fjall
LSM-based key-value storage engine
-
lance-arrow
Arrow Extension for Lance
-
lance-index
Lance indices implementation
-
reactive_graph
A fine-grained reactive graph for building user interfaces
-
gw_signal
Package with signal processing tools for graviational waves studies
-
bs
bitset with small-set (single-word) optimization
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
hylo-fix
Fixed-point number types with Solana Anchor support
-
queued_rust
queue type for better privacy managment and data orginization
-
prost-unwrap-core
A procedural macro implementation for prost-unwrap library
-
nimble-steps
Nimble Steps Collections
-
sif-itree
immutable, flat interval tree
-
louds-rs
High performance LOUDS (Level-Order Unary Degree Sequence) library
-
blazemap
Implements a vector-based slab-like map with an interface similar to that of HashMap, and also provides tools for generating lightweight identifiers that can be type-safely used as keys for this map
-
jsonpath-rust
basic functionality to find the set of the data according to the filtering query
-
stac
SpatioTemporal Asset Catalog (STAC) specification
-
semver-eq
Parser and evaluator for Cargo's flavor of Semantic Versioning
-
honeycomb-core
Core structure implementation for combinatorial maps
-
dinvoke_data
Structures and data types definitions for dinvoke
-
kvv-efa-api
Rust bindings for the KVV (Karlsruher Verkehrs Verbund) "EFA"-API
-
ssd-data
A service and data description format + a code generator based on rhai scripts and templates
-
afrim-memory
handle of sequential codes easier for an input method
-
sbwt
Indexing sets of DNA k-mers with the spectral Burrow-Wheeler transform
-
bet
parsing and evaluating binary expression trees
-
i_shape
iShape is a compact and efficient library specifically designed for representing 2D data structures using IntPoint
-
fenwick-bit-tree
Slighly over-engineered FenwickTree implmentation
-
ndtensor
n-dimensional tensor library for Rust
-
scalable_cuckoo_filter
A variant of Cuckoo Filter whose size automatically scales as necessary
-
vart
An immutable versioned adaptive radix trie
-
azalea-inventory
Representations of various inventory data structures in Minecraft
-
pi_world
ecs world
-
rustc_data_structures
Reuse rustc_data_structures for compiler_base
-
cbsk_mut_data
ref mut tool
-
zellij_widgets
A wiget library for zellij
-
td-shim-interface
TD-shim metadata data structures and related functions. UEFI Platform Initializaiton data structures and accessors
-
nested_intervals
nested & overlapping interval set functions, overlap, union, etc
-
krata-xenstore
A client that interacts with xenstore for krata
-
rs-tree-sitter-languages
Collection of Tree-Sitter parsers
-
ninjabook
A lightweight and high performance orderbook
-
x12-types
Bindings for the ASC X12 EDI definitions
-
total-maps
Maps where every possible key has an associated value
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
fn-map
Abstraction around HashMap. Uses closure to compute and store value.
-
modql
Model Query Language support
-
indxvec
Vecs sorting, merging, indexing, ranking, searching, reversing, intersecting, printing, etc
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
list_tools
一个自己研发的Vec<T>
-
xot
Full-featured XML tree library for Rust
-
plod
deriving plain old data
-
irox-tools
Stuff that should have been in the Rust STL, but aren't
-
narrow
Apache Arrow
-
treesome
tree creation, manipulation, traversal and visualization
-
halfling
A collection of basic utilities for working with nibbles
-
stacked_errors
high level error propogation with programmed backtraces
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
hashable_weak
A hashable weak pointer
-
osiris-data
A data management package
-
vecset
A vector-based sorted map, set and keyed-set implementation
-
scopegraphs-lib
A port of scopegraphs to Rust
-
compact-map
'Small map' optimization: store up to a small number of key-value pairs on the stack
-
fastbloom
The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
-
lsph
Learned Spatial HashMap
-
compact_strings
A more compact but limited representation of a list of strings or bytestrings
-
modql-macros
Macros for modql. Not intended to be used directly.
-
polars-ops
More operations on Polars data structures
-
kollect
Collections made ergonomic for gamedev usecases
-
fixedbitset
bitset collection
-
stl-rs
STL like features in idiomatic rust
-
selmr
Package to create and use Simple Explainable Language Multiset Representations
-
rsdict
Fast static rank and select data structure
-
omango-util
Utililites
-
dastral
Reduce boilerplate code, learn data structures & algorithms with Dastral
-
rotbuf
Queue implementation wrapped around the
Bytes
crates’ BytesMut data structure -
stack-queue
Heapless auto-batching queue
-
exhaustive-map
An exhaustive map for types with finite inhabitants
-
more_collections
Additional collections not found in std::collections
-
num
A collection of numeric types and traits for Rust, including bigint, complex, rational, range iterators, generic integers, and more!
-
hashmap_union
Allows the union and intersection of hashmaps
-
bitfield-struct
Struct-like procedural macro for bitfields
-
either
The enum
Either
with variantsLeft
andRight
is a general purpose sum type with two cases -
datafrost
Data format and acceleration structure management
-
houtamelo_utils_gdnative
A collection of utilities shared between Houtamelo's GDNative projects
-
lazy-cogs
Lazy Cogs is a implementation of lazy clonable data structures
-
pipebuf
Efficient byte-stream pipe buffer
-
gix-traverse
gitoxide project
-
bounded-vector
Vec wrapper that guarantees upper and lower bounds on type level
-
gix-diff
Calculate differences between various git objects
-
digit-sequence
Sequence of u8 digits
-
gix-pack
Implements git packs and related data structures
-
matrixable
Traits and structs extending capabilities of matrix-like structures
-
idr-ebr
An efficient concurrent ID to object resolver
-
farmfe_core
Core types and data structures for farm
-
merkle-heapless
Statically-allocated Merkle Tree and Mountain Range
-
orx-concurrent-vec
An efficient, convenient and lightweight grow-only read & write concurrent data structure allowing high performance concurrent collection
-
newtype-uuid
Newtype wrapper around UUIDs
-
fid-rs
High performance FID (Fully Indexable Dictionary) library
-
orx-fixed-vec
An efficient constant access time vector with fixed capacity and pinned elements
-
smooth-json
opinionated, customizable utility to flatten serde_json Value variants into serde_json Objects ready for use in columnar or table-like usages
-
adts
Common abstract data type traits and implementations
-
orx-pinned-vec
PinnedVec
trait defines the interface for vectors which guarantee that elements added to the vector are pinned to their memory locations unless explicitly changed -
genindex
Generational index library
-
vers-vecs
A collection of succinct data structures supported by fast implementations of rank and select queries
-
golomb-coded-set
BIP158 Golomb-Coded Set data structure
-
octs
Finally, a good byte manipulation library
-
fhir-model
FHIR SDK Models
-
standard_card
A Lightweight Library for Efficient Card Representation
-
xsd-types
XSD data types
-
lanyard
UTF-8 C string types
-
bao-tree
BLAKE3 verfiied streaming with custom chunk groups and range set queries
-
linear-hashtbl
Linear probing hash table
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
mutuple
Replace items in Python's immutable tuples
-
chemrust-scanner
The core modules defining the flow and structs of data in computational chemistry routines
-
colibri
Rust data structures for Jitsi Meet Colibri messages
-
orx-concurrent-bag
An efficient, convenient and lightweight grow-only concurrent data structure allowing high performance concurrent collection
-
tiny-solver
Factor graph solver
-
orx-pinned-concurrent-col
A core data structure with a focus to enable high performance, possibly lock-free, concurrent collections using a PinnedVec as the underlying storage
-
nonempty-collections
Correct-by-construction non-empty collections
-
half
Half-precision floating point f16 and bf16 types for Rust implementing the IEEE 754-2008 standard binary16 and bfloat16 types
-
basic_trie
Trie implementation in Rust
-
quantity
Representation of quantites, i.e. of unit valued scalars and arrays.
-
lookups
Improve the data retrieval operations for collections
-
validated
The cumulative sibling of
Result
andEither
-
stapifaction
allowing to easily generate static APIs
-
raw-btree
Generic B-Tree implementation
-
bndpresbufq
Bounds-preserving, optionally limited, buffer queue
-
typed_graph
Staticly typed graph library
-
limq
Queue with optional maximum number of elements constraint
-
uluru
fast, LRU cache implementation
-
orx-linked-list
An efficient and recursive singly and doubly linked list implementation
-
ux
Implement the following non standard integers: u2, u3, u4, u5, u6, u7, u9, u10, u11, u12, u13, u14, u15, u17, u18, u19, u20, u21, u22, u23, u24, u25, u26, u27, u28, u29, u30, u31, u33…
-
easy_linked_list
easy linked list is easy to work
-
loro-preload
Loro internal lib for loading data
-
orx-selfref-col
SelfRefCol
is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees -
im-lists
Persistent unrolled linked lists and vlists
-
know
Framework for Rust
-
fast-graph
A fast, lightweight and extensible implementation of a graph data structure
-
know_yaml
The Know Framework for Rust
-
orx-imp-vec
ImpVec
, standing for immutable push vector 👿, is a data structure which allows appending elements with a shared reference -
destiny-pkg
Destiny 1/2 Tiger package library and tools (unpacker, verification)
-
nodit
Discrete Interval Tree Data-Structures, which are based off BTreeMap
-
pfx
A prefix tree (map and set), implemented without any unsafe
-
arca
Various utilities used in my crates
-
ntex-bytes
Types and traits for working with bytes (bytes crate fork)
-
fastset
Fast set implementation for dense, bounded integer collections, optimized for quick updates and access
-
mown
Maybe owned values. Wrappers for values that can be either owned or borrowed.
-
evenio
An event-driven entity component system
-
nutype
The newtype with guarantees
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
rasn-smi
Data types for handling Structure for Management Information
-
biodivine-lib-bdd
thread-safe implementation of basic binary decision diagrams
-
stealth-lib
functions for ZKP
-
bip39-lexical-data
BIP39 Lexical Data
-
atlas-rb-tree
A textbook implementation of a Red-Black Tree
-
nary_tree
A vec-backed tree structure with tree-specific generational indexes
-
shardtree
A space-efficient Merkle tree with witnessing of marked leaves, checkpointing & state restoration
-
typed_floats
Types for handling floats with type checking at compile time
-
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.
-
memodb
An embedded, in-memory, immutable, copy-on-write database engine
-
routee-compass-core
The core routing algorithms and data structures of the RouteE-Compass energy-aware routing engine
-
quantities
Unit-safe computations with quantities
-
chronologic
Time constraint reasoning (scheduling...)
-
graphrs
package for the creation, manipulation and analysis of graphs
-
committable
Keccak256-based structured commitments
-
ordered-multimap
Insertion ordered multimap
-
jui_file
file tool
-
cbsk_base
locked version cargo crates
-
cola
A text CRDT for real-time collaborative editing
-
small-fixed-array
providing fixed length immutable collections with a low memory footprint
-
egui_suspense
Automatically show loading and error uis for egui
-
ascent-byods-rels
data structures for Ascent relations, made possible by Ascent's BYODS feature
-
to_markdown_table
An easy way to format any data structure into a Markdown table
-
nslice
Structures for interpreting slices of variable length as arrays
-
ascent_base
support library for the ascent package
-
blfilter
Bloom filter implementation using farmhash
-
vf-rs
A set of classes generated from the ValueFlows RDF schema
-
fastdivide
partial port of libdivide. It makes it possible to reduce the cost of divisions.
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
irox-units
Physical Quantities, Units, & Reference Frames Library
-
vec1
a std Vec wrapper assuring that it has at least 1 element
-
rdf-types
Data-structures and traits definitions for RDF
-
makods
The Jostle Tree, a data structure for working with long sequences of variable-width items
-
gtfs-translations
Reads GTFS translations.txt into structures
-
suffix_trie
Suffix trie for searching
-
hpo
Human Phenotype Ontology Similarity
-
bio
A bioinformatics library for Rust. This library provides implementations of many algorithms and data structures that are useful for bioinformatics, but also in other fields.
-
eolib
A core rust library for writing applications related to Endless Online
-
vec-btree-map
Basically just a sorted Vec that can be used as a HashMap
-
containerof
Macros and traits facilitating the use of intrusive structures in Rust
-
superset_map
Map that stores distinct supersets based on the total order defined
-
fufu
-
zipcodes
Query US zipcodes without SQLite
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
smallvec
'Small vector' optimization: store up to a small number of items on the stack
-
manganis
Ergonomic, automatic, cross crate asset collection and optimization
-
indexmap
A hash table with consistent order and fast iteration
-
h3o-ice
Frozen{Map,Set} for H3 cells, based on finite state transducers
-
radicle-cob
Radicle Collaborative Objects library
-
slotmap-map
Slotmap data structure
-
tbytes
A tiny library for reading and writing typed data into buffers
-
copy_arrayvec
Copy arrayvec, does what it says on the tin
-
extindex
Persisted immutable index
-
neighborhood-diversity
computing the neighborhood diversity of simple, undirected graphs
-
ecow
Compact, clone-on-write vector and string
-
combo_vec
A blazingly fast no-std vector-like ADT using the stack (and optionally heap for overflow)
-
ipld-dagpb
IPLD DAG-PB codec
-
ordered_hashmap
Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
-
llist
Lisp-style singly-linked list
-
pas
strided slice
-
typerat
Type-level rational numbers based on
typenum
-
oxrdf
providing basic data structures related to RDF
-
char-list
A persistent string type with the same API as a linked-list of characters
-
signvec
Vector implementation for fast, sign-based manipulation of dynamic collections
-
any-range
AnyRange<T> enum can hold any Range*<T> type
-
kbs-types
Rust (de)serializable types for KBS
-
delete_if_not
unsafely in-place delete function
-
floatd
just num_traits::Float + Debug + Display
-
arc-swap
Atomically swappable Arc
-
floco
validates floats against constraints
-
ball-tree
K-nearest neighbors
-
csvenum
Generate code for enums with associated constants from a .csv in your command line
-
fuid
A UUID-compatible identifier in a friendly base-62 format
-
leetcode-trees-rs
Tree Node LeetCode problems
-
bmap
A bitmap with an internal counter
-
bytes
Types and traits for working with bytes
-
hdf5-dst
DST extensions for HDF5
-
jsonptr
Data structures and logic for resolving, assigning, and deleting by JSON Pointers (RFC 6901)
-
smallbitvec
A bit vector optimized for size and inline storage
-
arrow-ipc
Support for the Arrow IPC format
-
bgpkit-commons
common BGP-related data and functions
-
astro-float
Multiple precision floating-point numbers library
-
astro-float-num
Multiple precision floating point numbers implemented purely in Rust
-
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
-
circular-buffer
Efficient, fixed-size, overwriting circular buffer
-
mivim
-
bool_ext
defines and implements a complete set of
Option
/Result
-style Boolean functional combinators on Rust’sbool
primitive type -
authenticode
working with Authenticode (no-std)
-
rpds-pathtree
Immutable, path-addressable tree data structure
-
slabigator
A linked list that doesn't do dynamic memory allocations
-
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. -
oats-rs
Short, unique ids without the hassle of random uuids
-
ofilter
fast thread-safe Bloom filter
-
orbweaver
building query-able graph structures
-
molecule
Rust bindings for molecule
-
arrow-select
Selection kernels for arrow arrays
-
kempt
Ordered collection types with no unsafe code and no_std support
-
pact
Compact and streamable data format that works anywhere--from web apps to robots
-
gix-commitgraph
Read-only access to the git commitgraph file format
-
pi_append_vec
Only supports append vectors, lock free
-
gix-hashtable
that provides hashtable based data structures optimized to utilize ObjectId keys
-
pi_slot
lock free Slotmap data structure
-
ju-tcs-tbop-24-bebidek-endpoints
providing head and tail functionality
-
mediumvec
Vector types optimized for space, including a 32-bit Vec
-
flatcontainer
A flat container representation for Rust
-
im-pathtree
Immutable, path-addressable tree data structure
-
nanotweaks-proc
moved to https://crates.io/crates/spread_macros
-
metatensor
Self-describing sparse tensor data format for atomistic machine learning and beyond
-
pi_arr
lock-free & auto-expansion array
-
yptoscr
writing yptoscr
-
hi_sparse_bitset
Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
-
datastruct
A pure-data structure builder
-
v_frame
Video Frame data structures, originally part of rav1e
-
bnr-xfs
Pure Rust implementation of the BNR XFS USB
-
bnr
Pure Rust implementation of the BNR XFS USB communication protocol
-
comprehend
Python like list, set and hashmap comprehensions via macros
-
tdb-succinct
succinct data structures used by terminusdb
-
garnish_lang_simple_data
Data implementation for garnish runtimes using simple list of variants
-
garnish_lang
Single library for re-exporting and documenting all Garnish core libraries
-
simple_endian
A create for defining endianness within your data structures, to make handling portable data structures simpler
-
crater
Very generic containers including KD trees, fibonacci heaps, minmax heaps,
-
terees
a collection of tree-like data structures
-
rsurf
A data structure providing range query filtering with Fast Succinct Tries
-
cmsketch
A count min sketch implementation in Rust
-
packbytes
Convert structures to and from packed representavises - byte arrays of fixed size that live on stack
-
dst-container
Containers for DST objects
-
tyght-map
A static type map implementation
-
generator
Stackfull Generator Library in Rust
-
boa_interner
String interner for the Boa JavaScript engine
-
num-bigfloat
Increased precision floating point numbers implemented purely in Rust
-
syzlang-parser
Parse Syzlang language
-
garnish_lang_annotations_collector
organize garnish annotations with related tokens
-
oca-presentation
Lib providing struct for OCA presentation
-
amazed
A graph maze building library
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
b100m-filter
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
-
broomdog
A type-erased map with 'indefinite loanership'
-
bevy_spatial
tracking bevy entities in spatial indices
-
pi_async_graph
async graph
-
valkyrie-ast
Strong typed abstract syntax tree of valkyrie language
-
ploc-bvh
A Bounding Volume Hierarchy based on PLOC
-
extensions-rs
File extension types in Rust
-
foxy_utils
Common types and utilities for
foxy
submodules -
portgraph
Data structure library for directed graphs with first-level ports
-
priority-queue
A Priority Queue implemented as a heap with a function to efficiently change the priority of an item
-
fqdn
FQDN (Fully Qualified Domain Name)
-
hvec
A Vec-like structure that can store different types of different sizes contiguous with each other in memory
-
edtui-jagged
A jagged array data structure for the edtui editor
-
docker-compose-types
Deserialization and Serialization of docker-compose.yml files in a relatively strongly typed fashion
-
cdylib-link-lines
Collection of link-lines useful to build correct cdylibs on targets
-
enumap
A HashMap and HashSet like interface for enums backed by an array
-
tree_multiset
A tree-based multiset 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.
-
gtfs-geojson
converter for GTFS to GeoJSON formats
-
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
-
sbbf-rs
Split block bloom filter implementation
-
tinyvecdeq
VecDeque
-like data structures -
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.
-
pi_slotmap
Slotmap data structure
-
typeslice
type-level slices
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
multi_containers
Ergonomically work with multiple values per key
-
orn
A general implementation of the sum type
-
ordsearch
A data structure for efficient lower-bound lookups
-
evento
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
nybbles
Efficient nibble-sized (4-bit) byte sequence data structure
-
enum2egui
derive macro that creates a set of egui ui databindings from arbitrary data structures. Supports egui v0.26
-
evento-store
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
bitm
bit and bitmap (bit vector) manipulation
-
orx-closure
An explicit closure with absolute seperation of the captured data from the function
-
evento-query
A collection of libraries and tools that help you build DDD, CQRS, and event sourcing
-
cnctd_smart_home
A collection of Smart Home APIs
-
ph
data structures based on perfect hashing
-
im_ternary_tree
Structural sharing ternary tree, i.e. immutable data structure
-
bitworks
meant to provide easy to use bitsets with emphasis on safety
-
cseq
compact sequences
-
hexarr
working with hexagonal grids
-
xsl-rs
A simple library
-
packed_ptr
A configurable & generic tagged pointer implementation in Rust
-
twie
fast and compact prefix tries
-
butils
shared by software included in BSuccinct
-
cseq_benchmark
The program for benchmarking compact sequences and bitmaps
-
stdng
An enhancement for Rust standard library
-
short-uuid
generate and parse short uuids
-
csf_benchmark
The program for benchmarking Compressed Static Functions
-
billios
A soil library
-
aabel-identifier-rs
defines identifier behavior, such comparing them, or generating sequences of identifiers
-
rooting-forms
Generates HTML (rooting) forms from structures
-
awint
Arbitrary width integers
-
mzpeaks
representing peaks in mass spectrometry data
-
quickselect
基于rust的选择算法
-
awint_dag
DAG
awint
functionality -
erased_set
A set of erased types
-
flowcom
collection of UI components for floem
-
field_accessor_pub
A procedural macro to get and set a struct field by String dynamically. This crate is a quick and dirty fork of field_accessor_pub.
-
petal-clustering
A collection of clustering algorithms
-
light_phylogeny
Methods and functions for phylogeny
-
awint_core
Core no-std and no-alloc
awint
functionality -
enum-collections
Collections data structures optimized for Enum, initializable at runtime
-
awint_macros
Accompanying procedural macros to
awint
-
filetreelist
filetree abstraction based on a sorted path list, supports key based navigation events, folding, scrolling and more
-
int-vec-2d
Vectors, points, rectangles, etc. with
i16
coordinates. -
awint_ext
Externally allocating
awint
functionality -
triple_arena
Regular, Chain, Surjection, and Ordered Arenas supporting non-Clone types, deletion, and more
-
hashbag
An unordered multiset implementation using a hash bag
-
indexset
A two-level BTree with fast iteration and indexing operations
-
sif-kdtree
immutable, flat k-d tree
-
piece_table_rs
piece table data structure
-
ftree
A very fast fenwick tree implementation
-
cactus
Immutable parent pointer tree
-
anylist
a list type for any type
-
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…
-
hashmap_settings
HashMap wrapper for layered Settings
-
value_pool
implements a ValuePool struct that makes the creation of self-referential data structures easier and safer
-
ord-collections
offering collections which are pre-sorted automatically
-
json-number
JSON number parsing and storage
-
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
-
merkle-cbt-lean
Special implementation of Complete Merkle Binary Tree for minimal memory footprint
-
opt_struct
Optional collections
-
pin_array
Tiny crate providing an array with structurally projected pinning
-
suggest
A minimal library to provide similar name suggestions like "Did you mean?"
-
iso7816-tlv
tools and utilities for handling TLV data as defined in ISO/IEC 7816-4
-
elkai-rs
solving travelling salesman problems (TSP) based on elkai (LKH 3)
-
amplify
Amplifying Rust language capabilities: multiple generic trait implementations, type wrappers, derive macros
-
svd-rs
A CMSIS-SVD base structures
-
invade
reflect on Rust types and generate code
-
hff-core
Hierarchical File Format: core structure
-
fpdec
Decimal fixed-point arithmetic
-
podded
Zero-copy types for constraint environments
-
enumflags2
Enum-based bit flags
-
uf_rush
A lock-free, thread-safe implementation of the Union-Find (Disjoint-Set) data structure
-
varuint
Variable length signed and unsigned integer types
-
char-buf
A writable, fixed-length
char
buffer usable inno_std
environments -
starlark_map
Map implementation with starlark-rust specific optimizations
-
structures
collection data structures
-
sif-rtree
immutable, flat R-tree
-
statiki
Static friendly data structures
-
errling
A collection of intrinsically useful errors
-
turbostate
Finite State Machine
-
vbox
type erased Box of trait object
-
ha-ndarray
A hardware-accelerated n-dimensional array
-
enumoid
Enum Indexed Containers
-
achan
& convenient representation for any value
-
lctree
Link-Cut-Tree: self-balancing data structure to maintain a forest of rooted trees
-
hdf5-hl
High level bindings to HDF5 High Level API
-
disjoint
Fast and safe implementation of the disjoint-set data structure
-
probly-search
A lightweight full-text search engine with a fully customizable scoring function
-
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
-
kahan_pairs
Generate pairs of integers
-
guppy
Track and query Cargo dependency graphs
-
ranged_integers
An integer restricted to a compile-time defined bounds driven by const generics
-
context-mapper
Single rust macro for generating different maps
-
kv6
Collection of structs to allow reading of Ken Silverman's voxel formats
-
cubic-bezier
Create and modify cubic bezier curves
-
arbitrary-int
Modern and lightweight implementation of u2, u3, u4, ..., u127
-
bpf-ins
working with eBPF instructions
-
bitmaps
Fixed size boolean arrays
-
variant-rs
VARIANT support for Rust. Clean, idiomatic handling of WinAPI/COM results.
-
interning
Thread-Lcoal and Global Interning Library
-
rust_decimal_macros
Shorthand macros to assist creating Decimal types
-
vax-floating
VAX floating-point types
-
tex-glyphs
dealing with glyphs in TeX/pdfTeX fonts as unicode characters
-
map-macro
Declarative macros for statically initializing collections
-
simple-canvas
generic 2 dimensional canvas struct
-
pathlink
A URL type whose path can also be used as a filesystem path, for Rust
-
tcgeneric
Generic data types used internally by TinyChain
-
thinset
A data structure for sparse sets of unsigned integers that sacrifices space for speed
-
tc-value
TinyChain's representation of a value which can be collated and stored
-
tc-state
TinyChain's general state enum
-
rt_ref
Internal
Ref
types forrt_ref
andrt_vec
-
associated_list
An associated list, for cases when the key implements neither Hash nor Ord
-
surface-grid
providing data structures for square-tiled grids wrapped around the surface of certain objects
-
parity-map
For mapping integers based on their parity
-
normdecimal
Always normal decimal numbers
-
tc-collection
TinyChain's collection types
-
implies
A parser for logical formulas
-
rs-ecs
reasonably simple entity component system
-
weedle2
A WebIDL Parser
-
terrain-graph
Graph Library for Rust
-
deep_causality
Computational causality library. Provides causality graph, collections, context and causal reasoning.
-
cve
Mappings for parsing the CVE JSON files
-
foxy_types
Types for
foxy
-
uid_store
Generate short random strings
-
windows-file-info
gathering useful infos about Windows entities(archives, directories or reparse point/symlinks) with developer friendly way
-
kvptree
a lightweight library for sending data around
-
foxy_util
Util for
foxy
-
ciborium-io
Simplified Read/Write traits for no_std usage
-
HArcMut
mutable arc
-
crop
A pretty fast text rope
-
singletonThread
thread in a singleton
-
bosque
A very fast in-place kdtree library
-
idbag
A bag of u32 identifiers
-
messaging
two-way messaging crate
-
map_vec
The Map and Set APIs backed by Vec
-
value-trait
Traits to deal with JSONesque values
-
ds-ext
Extensions to standard Rust data structures which provide additional capabilities
-
flat_enum
Expand nested enum into flattened enum
-
unflatter
unflatter
is a Rust library providing extension traits for flattening and unwrapping nested structures, including nestedOption
andResult
types. It simplifies working with deeply… -
open-coroutine-timer
The time utils
-
unique-id-collection
Collection with unique Id
-
imbl-sized-chunks
Efficient sized chunk datatypes
-
slop-rs
Official implementation of the SLOP data storage language
-
mycelium-bitfield
Structured bitfields, courtesy of Mycelium
-
hash_table_datastruct
Adds a HashTable type, allowing to store values in a table with integer-indexed rows and hashable keys for columns
-
comfy-bounded-ints
Bounded-integer types focused on ergonomics and safety. (See README.md)
-
trust-graph
trust graph
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
multimap
A multimap implementation
-
ldap-types
Implements the basic LDAP types so they can be used in other crates
-
sss_fft
FFT and IFFT for arrays and iterateable collections with modular algorithm interface
-
bstree-file-readonly
Query read-only binary-search tree file, supporting billions of entries in files of tens of GB
-
spade
Delaunay triangulations for the rust ecosystem
-
tnaps
entity-component-system framework in Rust
-
validiter
Iterator adapters for validating iterations
-
chronoflake
Generate unique IDs based on the Snowflake algorithm
-
gfa-reader
Reading gfa format v1
-
dcl_data_structures
Data structures for for deep_causality crate
-
predicates
boolean-valued predicate functions
-
ultragraph
Hypergraph data structure
-
roadmap
model a project roadmap as a directed acyclic graph
-
fallback
A helper library to implement fallback mechaism
-
medianheap
A median heap for keeping track of a running median
-
strict
collections with strict bounds
-
healm
Heap allocated merkle tree
-
mut-rc
Temporarily mutable
Rc<T>
that decays intoRc<T>
-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
velect
A Vec with item / index selection
-
vivalaakam_seattle_collection
Collection provider
-
miny
Box<T> with small value optimization
-
fast-btree
A fast B-tree implementation ported from tlx library
-
dot_tree
Create, query and store binary trees
-
river-ring-buffer
ring buffer implementation
-
retaker
ecs implementation
-
gauze
Probabilistic set membership filters with a simple interface
-
yagraphc
working with Graph data structures and common algorithms on top of it
-
sgflt
Duplicate value filtering
-
arc-atomic
atomic pointer to an
Arc
-
cdragon-prop
Work with BIN files used by Riot
-
crossbeam-skiplist
A concurrent skip list
-
growable-bloom-filter
Scalable Bloom Filters with serde support
-
range_bounds_map
[
RangeBoundsMap
] and [RangeBoundsSet
], Data Structures for storing non-overlapping intervals based of [BTreeMap
] -
discrete_range_map
DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap
-
read-copy-update
locking primitive
-
log-once
Collection of helper macros for logging some events only once
-
generic_event_queue
generic event-queue API
-
vecmap-rs
A vector-based map and set implementation
-
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
-
scroll
A suite of powerful, extensible, generic, endian-aware Read/Write traits for byte buffers
-
feature-set
User defined feature set
-
ndarray-histogram
Histogram support for n-dimensional arrays
-
modio-logger-db
modio-logger Dbus service
-
overtone
An API for creation and management of rich (as in rich-text) musical-ish projects
-
branchless
Algorithms and data structures designed to maximize performance on superscalar processors
-
cursieve
that makes it easy to deserialize byte arrays into annotated Rust structures
-
l6t-file
A part of l6t library: reading, writing and deconding for L6T IFF data
-
l6t-symbolic
A part of l6t library: symbolic data model for different known devices
-
validit
Validate data structures internal state
-
upto
Fixed-capacity and variable length stack allocated arrays
-
anymap3
A safe and convenient store for one value of each type
-
purse
Bag data structure implementation in Rust
-
micromap
The fastest alternative to HashMap, for maps smaller than 20 keys
-
b_trees
Implementations for various binary trees including AVL tree
-
bstree
A Binary Search Tree written in Rust
-
prio-graph
A lazily populated directed acyclic graph with top-level priority ordering
-
hicollections
C-liked Collections
-
ts-builder
Timestamp builder
-
cs-fetcher
Candlestick fetcher
-
indexical
indexed collections
-
vec_key_value_pair
A drop-in replacement for std::HashMap that uses Vec on the backend
-
array_trait
A generic trait for any array, with item as type and length as const parameter
-
oop
Object-Oriented Inheritence in Rust
-
plugx-input
flexible data-structure with diff, merge, and validation
-
unicase_collections
Collection of UniCase datastructures
-
apter
Trees in Rust
-
xorf
implementing xor filters - faster and smaller than bloom and cuckoo filters
-
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
-
leafslug_time
Useful set of time-oriented functions, for my leafslug collection
-
leafslug_effects
Useful set of effectful commands, for my leafslug collection
-
r-collections
Created some collection example LinkedList, Stack and Queue
-
identified_vec
Like HashSet but retaining INSERTION order and without
Hash
requirement on the Element type -
sqrid
Square coordinates and grid-like arrays, with zero dependencies, in a single file
-
case_insensitive_string
A case insensitive string struct
-
arrayset
An array-backed ordered set type
-
shared_resources
shared resources container which is thread-safe, and lock-free
-
elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
rytm-sys
Rust bindings for libanalogrytm
-
number-general
A generic number type for Rust which supports basic math and (de)serialization
-
region_quadtree
A lightweight Region Quadtree
-
civs
Controllably Increasing/Inflating VectorS
-
b-tree
A persistent B+ tree using freqfs
-
grid
Dynamic generic 2D data structure
-
unsized-vec
Like Vec, but for unsized values
-
array2d
A fixed sized two-dimensional array
-
ordered
A wrapper for adding arbitrary partial/total order to a type
-
ax_banyan
Persistent indexable tree data structure
-
xml-schema
Structure generator from XSD source file
-
bloomfilter
Bloom filter implementation
-
ax_banyan_utils
work with banyan trees
-
intervallum
Generic interval and interval set library
-
polytype
A Hindley-Milner polymorphic typing system
-
differential-dataflow-master
An incremental data-parallel dataflow platform
-
lurk-elsa
Append-only collections for Rust where borrows to entries can outlive insertions
-
epsg
EPSG Coordinate Reference System tools & data
-
lock_free_hashtable
Lock-free (almost) insertion only hashtable
-
range-set
Smallvec-backed containers of sorted integer ranges
-
constructivism
Simplify the construction of structured data
-
light-id
Generate and manipulate incremental IDs effortlessly
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
rustifact_extra
Extra features for Rustifact
-
fixed-index-vec
A vector-like data structure whose indices do not change when elements are removed
-
rowan
generic lossless syntax trees
-
nexum
collection of commonly used data structures
-
fervid_core
The core structures and utilities of fervid
-
pi_phf_map
phf_map
-
kaige_ecs
Fork of the Legion ECS library, with some changes to make it more suitable for use in Kaige
-
sqlite-collections
Rust collection types backed by sqlite database files
-
cell-grid
fixed-size 2d grid container suitable for
no_std
game development -
mintaka-types
Mintaka Types
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
stringid
Lightweight system to manage identifier as human readable string and unique number
-
hash_histogram
HashHistogram creates histograms with keys of any hashable data type. Features include rank ordering and mode.
-
fromsuper
Macro helpers to derive new sub-structs from existing super-structs, potentially unpacking Options
-
gridly
managing fixed-size 2D spaces
-
stable_node_set
An ordered set with handles to values
-
fastbloom-rs
Some fast bloom filter implemented by Rust for Python and Rust!
-
pax-properties-coproduct
Static container for program-variable data structures and polymorphic components
-
mco-gen
Stackfull Generator Library in Rust
-
thin-vec
A vec that takes up less space on the stack
-
rust-box
odd set of tools for Rust programming
-
simple-grid
2d-grid structure
-
primitive_fixed_point_decimal
Primitive fixed-point decimal types
-
std-ext
Extend the standard library functionality
-
slotmap
data structure
-
caches
popular caches (support no_std)
-
alot
A forbid-unsafe, generational slot map with usize-sized IDs
-
ofdb-boundary
Serializable, anemic data structures for accessing the OpenFairDB API in a type-safe manner
-
workit
single-threaded work queueing utility
-
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
-
gap_query_interval_tree
that provides a gap-query optimized interval-tree data-structure
-
ergo_avltree_rust
cryptographically authenticated dictionary based on AVL tree
-
itermap
Iterator tools for maps (
HashMap
,BTreeMap
, etc.) -
skippable_map
deserialize wrapper around HashMap which skips non-conforming data
-
mathio
A lightweight, simple and straight-forward opinionated library for math used in other projects
-
standards
A collection of standards for international trade facilitation
-
ati
Introduces the
At
trait, which allows collections to be indexed byu|i{8,16,32,64,128}
andisize
. Supports Python-like negative index, where -1 is last element. -
mdarray
Multidimensional array for Rust
-
gpt_disk_types
GPT (GUID Partition Table) disk data types no_std library
-
product-os-openapi
Product OS : OpenAPI provides a set of structs for defining the structure of an OpenAPI / Swagger specification. This crate is intended to be used with Product OS : Connector.
-
school_library
structures to manage school-related data, including students, classes, and schools
-
sql-json-path
SQL/JSON Path implementation in Rust
-
sets_multisets
API for working with sets and multisets of elements of type usize
-
deferred_vector
A deferred vector implementation
-
history_stack
A collection of containers that support generic history tracking mechanisms
-
gpt_disk_io
GPT (GUID Partition Table) disk IO no_std library
-
dup-indexer
Create a non-duplicated index from Strings, static str, Vec, or Box values
-
resizing-vec
An automatic resizing vector for data with linear increasing ids
-
compact-calendar
Compact representation of a set of days based on a bit-maps
-
aircraft_icao_country
aircraft ICAO codes and their country of origin
-
enum-map
A map with C-like enum keys represented internally as an array
-
hash_cons
A type-safe hash-cons library
-
uguid
GUID (Globally Unique Identifier) no_std library
-
zallocators
Bringing Zig like allocators to Rust
-
data_registry
An unordered data structure with immediate insertion, removal and access
-
mikel_binary_tree
search binary tree implementation in rust
-
graus-db
A high-performance, thread-safe key-value embedded data store
-
yrs-kvstore
Generic persistence layer over Yrs documents
-
ttmap
Trivial implementation of type map
-
iso7816
Types for ISO 7816
-
tree_by_path
A tree data structure featuring nodes addressable using a &Vec<usize> path and avoiding recursion and run-time borrow checking
-
enum-map-derive
Macros 1.1 implementation of #[derive(Enum)]
-
pinned-queue
Queue-like data structure whose elements can never move
-
mstr
2-word, immutable Cow<str>
-
grdf
Generalized RDF graphs and datasets
-
spatial_hash_3d
3D spatial hash grid implementation optimized for speed. What it does/why you'd want one: https://www.youtube.com/watch?v=sx4IIQL0x7c
-
quickphf_codegen
Code generator for creating static maps and sets for use with quickphf
-
truncate-integer
Truncate integers
-
simplecountry
Country Library
-
reconcile
A reconciliation service to sync a key-value map over multiple instances
-
hdrhistogram
A port of HdrHistogram to Rust
-
tinystr
A small ASCII-only bounded length string representation
-
fingertrees
Immutable persisten finger trees
-
zerovec
Zero-copy vector backed by a byte array
-
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)
-
ldtk_map
reading ldtk maps for usage in games
-
bytes-utils
Additional utilities for working with the bytes crate
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
multi-stash
Vector-based arena data structure that reuses vacant slots
-
phf_mut
Perfectly hashed mutable containers
-
dachshund
graph mining library written in Rust. It provides high performance data structures for multiple kinds of graphs, from simple undirected graphs to typed hypergraphs. Dachshund also provides…
-
keyed_priority_queue
Priority queue that support changing priority or early remove by key
-
futures-bounded
bounding futures in size and time
-
fusebox
Mostly safe and sound append-only collection of trait objects
-
y-sync
Yrs synchronization protocol
-
cosmic_undo_2
Undo and redo done the right-way
-
slice-ring-buffer
A double-ended queue that Deref's into a slice
-
librqbit-clone-to-owned
Util traits to represent something that can be made owned and change type at the same time
-
incremental-map
combinators for incremental immutable maps (see crate
incremental
) -
keysymdefs
A collection of key symbol definitions
-
ptr_hash
A minimal perfect hash function adapted from PTHash
-
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…
-
atlv
Algebraic Tag Length Value encoding
-
ordered_hash_map
HashMap which preserves insertion order
-
is_even_odd
categorizing and operating on integers
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
keybindings-parser
parsing human keyboard shortcuts
-
aoc-framework-utils
such as data types, algorithms and functions for aoc-framework-rs
-
aoc-framework-rs
A framework for AdventOfCode coding competition, that handles input, output and provides some core utilities
-
entry_put_ext
Map entry extension for put operations
-
flat-zip
An iterator adaptor to help traverse two-level collections
-
rtrb
A realtime-safe single-producer single-consumer ring buffer
-
rs-bush
Bush data structure
-
array-macro
Array multiple elements constructor syntax
-
batbox-range
Helpers for working with ranges
-
batbox-approx
Approximate comparison
-
batbox-collection
Collection of identifiable objects
-
batbox-cli
cli interface
-
batbox-android
Helper crate for android
-
batbox-diff
Easy struct diffing
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
batbox-logger
logging
-
rpds
Persistent data structures with structural sharing
-
char_index
efficient charwise indexing into a string
-
rbtree-arena
A cache friendly red black tree where nodes live on sequential memory
-
hotel
Collection Data-structure to associate values with keys
-
bellpepper-core
Core elements for a SNARK Circuit library
-
blobary
place for blobs
-
dsll
Fast Thread Safe Doubly Sorted Linked List
-
kvtree
Heterogenous in memory key value tree storage
-
wildbird_macro_derive
Rust Framework | Macro System
-
composite_types
Compose type definitions in the style of typescript
-
const-size-flatten
Flatten and FlatMap with constant inner iterator size
-
multi_index_map
MultiIndexMap: A generic multi index map inspired by boost multi index containers
-
paged
Read and create read-only paged database files
-
pasture-core
A framework for working with point cloud data
-
rpos
Cursor Manager on Table
-
any-rope
A fast and robust arbitrary rope for Rust. Based on Ropey.
-
arr-rs
arrays library
-
pasture-derive
Macro implementations for #[derive(PointType)]
-
nodegraph
A data structure in rust describing a graph of nodes, where each node may contain arbitrary data
-
trips
generic triple store written in Rust
-
modular-bitfield-ordering
Provide u8be..u128be, u8le..u128le for modular-bitfield
-
hrtb-lending-iterator
A lending iterator trait based on higher-rank trait bounds (HRTBs)
-
eventree
creating lossless syntax trees
-
list-fn
A generic lazy list
-
datazoo
Bitset and jagged array data structures
-
every_variant
EveryVariant trait that provides the every_variant method on types. Allows you to easily generate every combination of variants in structures that contains Enums, or in nested enum trees…
-
async_load
Functionality to trigger GMS2 async events from Rust
-
bin-tree
Building Binary Tree
-
lim-bit-vec
Limited bit vectors
-
cita_trie
Modified Patricia Tree (aka Trie)
-
insrcdata
Embed static data as source code
-
autocomplete
Auto-complete feature using Trie data structure
-
dlv-list
Semi-doubly linked list implemented using a vector
-
ambient_element
Element is a React-inspired virtual tree library for the Ambient runtime
-
fvm_ipld_hamt
Sharded IPLD HashMap implementation
-
index-ext
Index slices with arbitrary ints and as arrays
-
unionfind
A union find library made for building type inference engines. Can be used as general purpose datastructure.
-
heapq
Priority Queue with scoring function
-
vec_vec
When dealing with
Vec<Vec<T>>
is unavoidable -
sorbus
A tree manipulation library
-
ndstruct
Structures for N-dimensions
-
grid2d
Two dimensional grid of runtime-defined, but unchangable size
-
ropey
A fast and robust text rope for Rust
-
trk-io
TrackVis (*.trk) reader and writer
-
dayendar
advanced days calendar operations
-
nt-list
Compatible, type-safe, and idiomatic Rust implementations of Windows NT Linked Lists
-
product-os-authentication
Product OS : Authentication provides an entire pre-fabricated framework for user authentication and management including a set of APIs and a database structure of identities
-
range-mutex
A
Mutex<[T]>
-like type, that allows locking different ranges separately -
indexed-bitfield
An indexed bitfield, to track presence or absence of up to 128 elements
-
kurve
Adjacency list graph data structure
-
stack-trait
Stack trait with entry API for the LIFO element
-
flow-graph
A representation of a graph data structure for flow-based programming
-
rj
reactive json
-
merkle-search-tree
A data structure for efficient state-based CRDT replication and anti-entropy
-
vartyint
Read & Write varint encoded integers
-
croaring-sys
Raw bindings to CRoaring
-
wick-settings
Wick's Resource Configuration file data structures and normalization logic
-
prefix_array
A generic container for searching on prefixes of keys
-
file_graph-rs
A tiny crate to generate a tree like structure starting from a folder and branching inwards
-
snowflake_me
A distributed unique ID generator inspired by Twitter's Snowflake
-
quickphf
Runtime code for static data structures based on the PTHash perfect hash function
-
filetrack
persistent logrotated reading and other useful io things
-
graphiti
macro dsl and builder for creating and describing arbitrary sets of related data using a serializable description type
-
enumset
creating compact sets of enums
-
subranges
manage non-interssecting integer intervals
-
smash
A collection of tools
-
hit-data
Hierarchical Indexed Typed data structure
-
not-so-fast
data validation with derive macro
-
vecto
vector2
-
segmentmap
A collection that maintains insertion order
-
fast_forward
Quering collections blazing fast
-
tagged_ufs
A union-find-set implementation, in which sets can be associated with tags. When two sets are united, their tags are merged
-
abi_stable
For doing Rust-to-Rust ffi,writing libraries loaded at program startup
-
cvrdt-exposition
Understanding Convergent Replicated Data Types
-
zngur-def
Data types that define the structure of a zng file
-
errorcon
A small crate for scoping errors and easier error conversion
-
wasmrs-frames
WasmRS RSocket frame decoding, encoding, and data structures
-
bytes_to_type
facilitate byte conversion to specified types using macro generation
-
tetengo_trie
A trie library implemented with a double array
-
atone
A VecDeque and Vec variant that spreads resize load across pushes
-
easy-rsa-registry
Read certificate data from easy-rsa registry
-
frbf
robust, and efficient implementation of the Bloom Filter data structure in Rust
-
esaxx-rs
Wrapping around sentencepiece's esaxxx library
-
vector_mapp
A Vec based map
-
btree-slab
A memory compact Slab-based B-tree implementation
-
btree-range-map
B-tree range map implementation
-
structured
Data structures to handle large, structured data
-
bfield
B-field datastructure implementation in Rust
-
victor_tree
Victor makes vectors
-
sentinel
A sentinel-terminated slice library
-
host-port-pair
Host-port pair type
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
range-traits
Ranges related traits
-
pixel_map
A map of pixels implemented by an MX quadtree
-
dequemap
A no_std compatible implementation of the dequemap crate
-
box-collections
A no_std compatible implementation of the queue crate
-
mmap-bitvec
working with bit-vectors backed by memory-mapped files
-
etc-os-release
Parse /etc/os-release file
-
bonsaidb-files
Efficient large file storage for BonsaiDb
-
regex-map
Associative container where the keys are regular expressions
-
ransel
rank/select succinct data structures
-
tudelft-dsmr-output-generator
Companion library for the TU Delft Software Fundamentals individual assignment
-
gctree
cache-friendly, graph-like, arena-allocated datastructures
-
ex3-ic-stable-structures
A collection of data structures for fearless canister upgrades
-
uberbyte
Bit manipulation for dummies
-
sucds
Succinct data structures in Rust
-
qutee
A quadtree implementation
-
rbloom
efficient and minimalistic bloom filter
-
undo
An undo-redo library
-
utote
Stack allocated uint multiset, with optional SIMD implementations
-
rimu
A data structure template system
-
rimu-parse
A data structure template system
-
gen_value
indexes and values with generations for vectors
-
rimu-value
A data structure template system
-
rimu-eval
A data structure template system
-
rimu-ast
A data structure template system
-
rimu-meta
A data structure template system
-
sorted-vec
Create and maintain sorted vectors and vector-backed sets
-
rimu-stdlib
A data structure template system
-
copy-range
core::ops::Range et al, but Copy and IntoIterator
-
rankmap
rust hash table supporting key ranking
-
stupid_utils
that provides some simple and maybe stupid or useful tools
-
smallbox
Small Box
optimization: store small item on stack and fallback to heap for large item -
cycle_map
Implementations of bi-directionally accessible hashmaps
-
densemap
A collection data structure that is permanently accessible by unique keys and fast iterable
-
exponential-decay-histogram
A histogram which exponentially weights in favor of recent values
-
recursive_array
arrays using recrusive data structures to avoid limitations of the rust compiler
-
mapro
A tiny macro library for creating std::collections
-
fuzzy-search
collections for fuzzy search
-
lmfu
Low Memory Footprint Utilities (String, HashMap, JSON)
-
zerofrom
trait for constructing
-
range-collections
Sets and maps of ranges, backed by smallvec
-
unnamed_entity
Strongly-typed indexing for vectors and other structures
-
pati
Image data structure and format for the Patica editor
-
smart-string
A collection of string types and traits designed for enhanced string manipulation
-
chesspos
Basic structs for representing chess squares
-
rive
ecosystem crate
-
faex
A fast and efficient Compact Data Structures Library
-
bitboard64
A 64-bit bitboard useful for chess programming
-
smart_led_effects
A collection of effects for LED strips
-
im-rope
Unicode strings backed by RRB vectors
-
to_any
Auto derive ToAny trait for any structure
-
hibitset
Hierarchical bit set structure
-
ringbuffer
A fixed-size circular buffer
-
dyobj
improved version of the ECS pattern
-
piecewise-linear
manipulating piecewise linear functions
-
algotrees
VERY early stage project to implement a library of algorithms and data structures in Rust. It has very little features and only supports one data structure (binary trees) at the moment…
-
map_err
map error values
-
fixed-capacity-vec
Variable-length buffer backed by a fixed-size heap array
-
generic-array
Generic types implementing functionality of arrays
-
voxcov
Write something
-
scoped_stack
A scoped stack data structure
-
quarkrs
A collection of small life improvements for rust
-
bridgetree
A space-efficient Merkle tree designed for linear appends with witnessing of marked leaves, checkpointing & state restoration
-
hedel-rs
A Hierarchical Doubly Linked List
-
word-dictionary
data structure for word mapping. It can be used for language translation.
-
rive-models
Revolt API models for the Rive ecosystem
-
time_series_utils
handling time series data
-
b3-stable-structures
A collection of data structures for fearless canister upgrades
-
justly
justified containers
-
blocklist
The project is based on blocklistproject. It provides perfect hash map/set structures for fast lookup of blocklisted items.
-
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).
-
hlist2
Compile-time heterogeneous list implementation
-
iunorm
Map normalized floating-point numbers to/from (un)signed integers
-
variant-map
defines maps to store variants of enums
-
canadensis_dsdl_frontend
Compiler front-end for the Cyphal Data Structure Description Language
-
suid
Sortable (timestamp-first) unique identifier
-
grids
2D grid data structure for games
-
okasaki
A collection of peristent datastructures
-
json-node
A way to work with JSON as a node tree
-
packed-integers
A growable array for integer types in the range
u1
tou31
-
netlist
generic netlist data structure for VLSI design
-
cola-crdt
A text CRDT for real-time collaborative editing
-
append-only-vec
Append-only, concurrent vector