-
hashbrown
port of Google's SwissTable hash map
-
indexmap
A hash table with consistent order and fast iteration
-
ahash
A non-cryptographic hash function using AES-NI for high performance
-
yaml-rust2
A fully YAML 1.2 compliant YAML parser
-
dashmap
Blazing fast concurrent HashMap for Rust
-
rustdoc-types
Types for rustdoc's json output
-
scc
A collection of high-performance asynchronous/concurrent containers with both asynchronous and synchronous interfaces
-
papaya
A fast and ergonomic concurrent hash-table for read-heavy workloads
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
fnv
Fowler–Noll–Vo hash function
-
clru
An LRU cache implementation with constant time operations and weighted semantic
-
gxhash
non-cryptographic algorithm
-
intmap
Specialized HashMap for integer keys
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
indicium
in-memory search for collections and key-value stores
-
parse_link_header
parsing HTTP Link header
-
fixed-map
A fixed map where storage layout is calculated by a procedural macro
-
flurry
Rust port of Java's ConcurrentHashMap
-
type-map
typemap container with FxHashMap
-
hashbag
An unordered multiset implementation using a hash bag
-
iddqd
Maps where keys borrow from values, including bijective and trijective maps
-
merge
multiple values into one
-
micromap
The fastest alternative to HashMap, for maps smaller than 20 keys
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
equivalent
Traits for key comparison in maps
-
ringmap
A hash table with consistent deque-like order and fast iteration
-
maplit
Collection “literal” macros for HashMap, HashSet, BTreeMap, and BTreeSet
-
typemap_rev
A hashmap, but stores types as keys
-
steel-core
Core compiler and VM implementation for steel
-
once_map
Single assignment and lazy maps
-
collection_tools
General purpose tools to manipulate collections( containers like Vec/HashMap/HashSet )
-
enum-table
creating tables with enums as key
-
flashmap
A lock-free eventually consistent concurrent hash map
-
gix-hashtable
that provides hashtable based data structures optimized to utilize ObjectId keys
-
serde_json_any_key
Workaround for "key must be a string" error with serde_json. De/serialize any HashMap<K,V>, Vec<K,V>, Iter<(&K,&V)>, or Iter<&(K,V)> as a JSON map.
-
typedmap
A hash map (dash map). A type of value is defined by trait implemented on key type
-
relastic
lib inspired by Serilog for application-wide logging to Elastic
-
ordered_hash_map
HashMap which preserves insertion order
-
pfds
Purely Functional Data Structures
-
delay_map
HashMap collections whose entries expire after a given time
-
hashmap_settings
HashMap wrapper for layered Settings
-
lock_free_hashtable
Lock-free (almost) insertion only hashtable
-
collection_literals
macros for initializing any collection
-
clashmap
Sharded hashmap suitable for fast concurrent access
-
fast-able
The world's martial arts are fast and unbreakable; 天下武功 唯快不破
-
starshard
A blazing-fast sharded concurrent HashMap using hashbrown and RwLock, with lazy shards, atomic length cache, async support, conditional operations, batch operations, TTL/metrics/transactions
-
scc2
High-performance containers and utilities for concurrent and asynchronous programming
-
tether-map
Order-preserving linked hash map with O(1) reordering
-
arceos-hashmap
Exercise about supporting HashMap for ArceOS
-
halfbrown
Multi backend HashMap for higher performance on different key space sizes
-
pstd
parts of Rust std library ( different implementations, features not yet stabilised etc )
-
diff-struct
A trait for diffing and applying diffs to types
-
jsph-tg-arceos-tutorial-exercise-hashmap
Exercise about supporting HashMap for ArceOS
-
lockmap
A high-performance, thread-safe HashMap and LRU cache with fine-grained per-key locking
-
lsph
Learned Spatial HashMap
-
mambo_map
lightweight, simple, minimally blocking multithreaded hashtable
-
t1ha
T1AH (Fast Positive Hash) hash function
-
mule-map
A hybrid between a HashMap and a lookup table
-
tld
Top Level domain static hash map, tld list is obtained from of iana.org
-
leapfrog
A fast, lock-free concurrent hash map
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
small_hash_map
A hash map optimized for small collections with automatic stack-to-heap transition
-
veilid-hashlink
Fork of hashlink modified to meet the needs of the Veilid project. HashMap-like containers that hold their key-value pairs in a user controllable order
-
firims
fixed range integer maps and sets
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
keyring_map
A hash map with multiple keys per value using a ring structure to minimize allocations
-
enum-collections
EnumMap implemented in safe rust
-
kovan-map
Lock-free concurrent hash maps using kovan memory reclamation
-
flash-map
GPU-native concurrent hash map with bulk-only API. Robin Hood hashing, SoA layout, CUDA kernels. Designed for blockchain state, HFT, and batch-parallel workloads.
-
xet-core-structures
Core data structures including MerkleHash, metadata shards, and Xorb objects
-
defaultmap
HashMap with an automatic default for missing keys
-
anchormap
Lock-free concurrent hash map: elements never move after insertion, enabling lock-free reads
-
rstared
decorator that adds rstar::RTree to collections such as HashMap, BTreeMap, StableVec, thunderdome::Arena
-
etchdb
A fast, embedded database for Rust. Minimal dependencies. No C code. No build scripts.
-
hybridmap
Hybrid map using smallvec and the std hashmap
-
champ-trie
Persistent hash map based on CHAMP — canonical form, O(1) structural equality via AdHash, COW structural sharing
-
serde-tuple-vec-map
Deserialize a serialized map to a Vec<(K, V)> in serde
-
tantivy-stacker
term hashmap used for indexing
-
mapped_futures
A collection of futures based on FuturesUnordered that supports insertion, removal and mutation of futures by key
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
evicting_cache_map
An Evicting LRU cache supporting prune hooks
-
unique_id_lookup
Associative Array specifically designed for integer keys. Significant performance boost over conventional hash maps.
-
compile_time_ls_colours
A compile-time map of LS_COLORS-style extension-to-colour mappings
-
hashlru
LRU cache
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
kv-parser
parser of key-value-files as hash maps
-
odht
hash tables that can be mapped from disk into memory without the need for up-front decoding
-
linhash
Linear Hashing implementation
-
horde
threads
-
shash
An arbitrary-length-input hash function for competitive programming and experimental purposes
-
rbtree
the rbtree for Rust
-
mphf
An exercise in implementing minimal perfect hash table
-
seq-map
Sequential Map
-
yslib
ysaf standard library
-
griddle
A HashMap variant that spreads resize load across inserts
-
devsper-memory
Distributed AI Swarm Runtime
-
seam-codegen
TypeScript codegen and manifest types for SeamJS CLI
-
seqmap
A blazing fast seqlock-based concurrent hashmap where every data cell is its own seqlock, suitable for thousands of concurrent readers and writers
-
uniques
Analyze items in a slice and calculate the unique, first, duplicate, and subsequent items and their indices
-
pretty_assertions_sorted_fork
Wrapper around the
rust-pretty-assertionscrate that allows for the ability to sort the Debug output -
boxchars
allows to manipulate Box Drawing Chars
-
hash-injector
Hasher+BuildHasher to inject particular hash
-
linear-hashtbl
Linear probing hash table
-
faithea
A HTTP framework
-
steel-quickscope
Fork of quickscope for use in steel
-
onnx_graph
ONNX graph parser and execution engine for deep neural networks
-
hashslab
A hash table with data accessible by index
-
structible
A macro for defining virtual structs backed by maps
-
dashtable
A concurrent raw hash table
-
native-json
Native JSON for Rust
-
compact-dict
A highly customizable, open-addressing dictionary in Rust
-
janql
lightweight, persistent key-value store written in Rust
-
dmfr-dataset-reader
Reads transitland folder and outputs graph of valid feeds and operators
-
comparer
track changes in a HashMap/DashMap over several iterations
-
cachemap2
A concurrent insert-only hashmap for caching values
-
turbovault-graph
Link graph and note relationship analysis
-
pathgraph
Array-indexed hashmap
-
svi
A function to interpolate variables in a hashmap into a format string
-
embed-struct
embedding data structures
-
weirdboi_utils
A collection of utility macros
-
identity_map
Identity-based maps
-
envfmt
Expands environment variables in string
-
hashheap
data structures that combine a hashmap and a min/max priority heap, with main operations requiring O(1) or O(log n) time
-
eldek-tad
A project for learning Abstract Data Types (ADTs) in Rust. Heavily inspired by Java's implementation.
-
uord
unordered pairs (or more generally, unordered sets)
-
defaultdict
A hashmap implementation that mirrors the python defaultdict
-
hop-hash
hash table using 8-way hopscotch hashing with constant-time worst-case lookups, and SIMD acceleration
-
swiss-table
An educational Rust implementation of the Swiss Table hash map algorithm
-
map-macro
Declarative macros for statically initializing collections
-
train-map
A trained hash map
-
list_ordered_hashmap
An insertion-ordered hash map that provides O(1) (amortized) insertion, lookup, update and removal
-
mapgraph
A directed graph that can also be used as an arbitrary map
-
hashmap-mem
Fast, low-overhead in-memory hashmap implementation optimized for performance using fxhash
-
lookupvec
Container with Vec-like properties that also offers O(1) lookup of items based on an id field
-
from_form
From forms to your structs
-
map-to-javascript-html
serializing a map to JavaScript code in HTML usually for dynamically generating strings on web pages
-
izihawa-tantivy-stacker
term hashmap used for indexing
-
just_template
code gen via templates
-
ticker-sniffer
extracting multiple stock ticker symbols from a text document
-
mashmap
A flat HashMap that supports multiple entries per key
-
stackmap
A fast stack-only hashmap for small high-performance scenarios
-
luru
A custom implemented hash map that has a fixed amount
-
helper
provided some useful proc macros for Rust
-
agb_hashmap
no_std hashmap implementation intended for use in the
agblibrary -
prehash
storing values with precomputed hashes
-
multi_range_map
A range map for overlapping ranges
-
case_insensitive_hashmap
A HashMap that uses case-insensitive strings as keys
-
sema-core
Core types and environment for the Sema programming language
-
expiration_list
A datastructure for items that expire
-
multi-map
Like a std::collection::HashMap, but allows you to use either of two different keys to retrieve items
-
triple-r
Macros to for the recuerdame crate
-
dotenv_lib
A dotenv file parser
-
scdb
A very simple and fast key-value store but persisting data to disk, with a 'localStorage-like' API
-
cynos-index
Index implementations for Cynos database
-
fakeowned
convert from &Borrowed to &Owned <<safely>>
-
php_serde
Serde support for PHP's serialization format
-
pi_map
Define a Triat: map for the mapped schema, and provide two built-in implementations of HashMap and vecmap
-
hypercounter
An atomic, lock-free, hash map-like counter structure
-
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…
-
merge-hashmap
Merge multiple values into one
-
ld-lucivy-stacker
term hashmap used for indexing
-
keyed_concurrent_queue
concurrent queue which you can key on like a HashMap
-
turbo_atlas_icons
A system for declarative ui icon rendering with Bevy
-
entry_put_ext
Map entry extension for put operations
-
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
-
roughly-rs
RoughlyRight API
-
linked-hash-table
A linked hash table implementation for insert-order iteration and efficient lookups
-
turboflight
concurrent single-flight implementation
-
tinymap
A map structure that stores its data on the stack
-
argmap
parse command-line arguments into a hashmap and vec of positional args
-
sema-stdlib
Standard library (350+ native functions) for the Sema programming language
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
stashmap
zero-heap non-cryptographic Minimal HashMap, with serde support
-
timedmap
A hash map with expiring key-value pairs
-
disjoint-collections
Disjoint-set data structures
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
vectorize
Converts maps to vecs for serialization
-
carbonmap
Lock-free concurrent hash map for Rust with zero GC
-
chiralmap
Left-Right map using IndexMap
-
sprsdata
Data structures based on sparse and dense arrays
-
hash-map-id
HashMap wrapper with incremental ID (u64) as key
-
cfgmap
A special hashmap made with configuration in mind
-
qlrumap
An LRU HashMap with an optional passive ttl feature
-
chashmap-async
Concurrent async hash maps with key-scoped locking
-
fp-nohash-hasher
std::hash::Hasherwhich does not hash at all -
wasm-bindgen-utils
helpers that make working with wasm-bindgen easy
-
hash_ord
lib contains OrdMap(avl tree) and HashMap(use avl to resolve collision);
-
mbarc-map
Minimally-blocking, Atomic Reference Counted Map
-
densevec
Map like collection with usize indices that stores values contiguosly
-
opendiskmap
Single-threaded disk-backed hash map with memory-mapped file backing
-
wang_utils_map
个人使用的rust工具库
-
mini-sqlite-dump
creating sqlite3 dump files from Rust
-
zoecss-config
Configuration model, merging, and compilation for ZoeCSS
-
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…
-
moka-cht
Lock-free resizeable concurrent hash table
-
swap-pool
Allow objects to be stored either in RAM or on disk
-
quickscope
Multi-layer HashMap and HashSet implementations for performant representation of variable scopes
-
chashmap-serde
Fast, concurrent hash maps with extensive API and Serde support
-
sharded
Safe, fast, and obvious concurrent collections
-
string_templater
A string templater to inject values in a string template
-
minesweeprs
Probabalistic minesweeper solver, based on https://mrgris.com/projects/minesweepr/
-
rusty-cmd
creating custom line-oriented command interpreters in Rust
-
petitset
An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap
-
spimdisasm
MIPS disassembler
-
cht
Lockfree resizeable concurrent hash table
-
double-map
A HashMap with double key to single data/value
-
hmdb
Typesafe, read optimized, transactional, persistent, in-memory, key-value store
-
drtahash
A non-cryptographic hash function using AES-NI for high performance
-
concurrent_diskmap
Multi-threaded disk-backed hash map with sharded locking (work in progress)
-
rust_nb
but generic Naive Bayes Model in Rust
-
miniconf-pest-parser
PEG (pest) parser for the MiniConf configuration format with sections and key=value values
-
collectivity
Generic collection traits
-
phf_mut
Perfectly hashed mutable containers
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
identity-hash
std::hash::Hasherwhich does not hash at all -
clsx
A flexible class name composition utility for Rust, inspired by clsx and tailwind-merge
-
cycle_map
Implementations of bi-directionally accessible hashmaps
-
cyclotomic
high-performance library for exact operations in cyclotomic fields
-
autom
Automaton
-
tao-of-rust
《Rust编程之道》随书源码
-
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…
-
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…
-
folklore
A lock-free concurrent hash map
-
drthashbrown
port of Google's SwissTable hash map
-
transient-hashmap
HashMap with transient entries
-
alt-std
Alternative Lightweight Std library for making small executables and shared objects
-
janusmap
Lock free, concurrent hash map
-
dashmap-shard
port of Google's SwissTable hash map
-
hash-trie
Hash Array Mapped Trie (HAMT) Immutable Set Implementation
-
iter-group
grouping (key,value) iterators into maps of collections
-
simplicio
Gets rid of the boilerplate in rust
-
delta-collections
Data structures with revertable operations called deltas
-
remote_hash_map
Remote hash map
-
ttmap
Trivial implementation of type map
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
rax
Rust wrapper for the ANSI C Radix Tree "rax" https://github.com/antirez/rax implementation used in Redis
-
hash_set_map
HashSetMap, K=hash(V),V=V | So uh.. yeah. HashSetMap. ⛓️
-
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…
-
discord-indexmap
A fork of the popular
indexmaplibrary that adds a few extra APIs that are yet to be upstreamed -
stable-map
A hash map with temporarily stable indices
-
common_macros
common macros like
hash_map!orhash_set!(WIP) -
symbol-map
Memory-efficient mapping from values to integer identifiers (AKA a lexicon or symbol table), with options for fast bidirectional lookup
Try searching with DuckDuckGo.