-
hashbrown
port of Google's SwissTable hash map
-
indexmap
A hash table with consistent order and fast iteration
-
moka
A fast and concurrent cache library inspired by Java Caffeine
-
ahash
A non-cryptographic hash function using AES-NI for high performance
-
phf
Runtime support for perfect hash function data structures
-
dashmap
Blazing fast concurrent HashMap for Rust
-
fnv
Fowler–Noll–Vo hash function
-
scc
High-performance containers and utilities for concurrent and asynchronous programming
-
clru
An LRU cache implementation with constant time operations and weighted semantic
-
litemap
A key-value Map implementation based on a flat, sorted Vec
-
linked-hash-map
A HashMap wrapper that holds key-value pairs in insertion order
-
mini-moka
A lighter edition of Moka, a fast and concurrent cache library
-
indicium
in-memory search for collections and key-value stores
-
fallible_collections
adds fallible allocation api to std collections
-
flurry
Rust port of Java's ConcurrentHashMap
-
maplit
Collection “literal” macros for HashMap, HashSet, BTreeMap, and BTreeSet
-
phf_codegen
Codegen library for PHF types
-
intmap
Specialized HashMap for integer keys
-
multimap
A multimap implementation
-
metrohash
high quality, high performance hash algorithm
-
former
A flexible implementation of the Builder pattern supporting nested builders and collection-specific subformers
-
typedmap
A hash map (dash map). A type of value is defined by trait implemented on key type
-
equivalent
Traits for key comparison in maps
-
memo-map
implementing a synchronized map for memoization
-
gxhash
non-cryptographic algorithm
-
micromap
The fastest alternative to HashMap, for maps smaller than 20 keys
-
hashlru
LRU cache
-
papaya
A fast and ergonomic concurrent hash-table for read-heavy workloads
-
cow_hashbrown
port of Google's SwissTable hash map with copy-on-write support
-
halfbrown
Multi backend HashMap for higher performance on different key space sizes
-
griddle
A HashMap variant that spreads resize load across inserts
-
hash_hasher
A hasher which is designed to work with already-hashed or hash-like data
-
landmass
A navigation system for video game characters to walk around levels
-
query_map
VectorMap is a generic wrapper around HashMap<String, Vec<String>> to handle different transformations like URL query strings
-
t1ha
T1AH (Fast Positive Hash) hash function
-
weak-table
Weak hash maps and sets
-
collection_tools
Collection of general purpose tools to manipulate collections( containers like Vec/HashMap/HashSet )
-
pretty_assertions_sorted
Wrapper around the
rust-pretty-assertionscrate that allows for the ability to sort the Debug output -
hud-slice-by-8
HUD Software's Rust improved implementation of the Intel Slice-By-8 algorithm
-
velcro
Convenience macros for initializing vectors, hash maps and other Rust collections
-
fast-able
The world's martial arts are fast and unbreakable; 天下武功 唯快不破
-
type-map
typemap container with FxHashMap
-
case_insensitive_hashmap
A HashMap that uses case-insensitive strings as keys
-
delay_map
HashMap collections whose entries expire after a given time
-
mapped_futures
A collection of futures based on FuturesUnordered that supports insertion, removal and mutation of futures by key
-
anymap2
A safe and convenient store for one value of each type
-
pthash
Rust bindings for PTHash
-
odht
hash tables that can be mapped from disk into memory without the need for up-front decoding
-
tld
Top Level domain static hash map, tld list is obtained from of iana.org
-
serde-tuple-vec-map
Deserialize a serialized map to a Vec<(K, V)> in serde
-
keyed-set
Keyed Set: a hashbrown-based HashSet that indexes based on projections of its elements
-
cachemap2
A concurrent insert-only hashmap for caching values
-
pi_map
Define a Triat: map for the mapped schema, and provide two built-in implementations of HashMap and vecmap
-
stupid_utils
that provides some simple and maybe stupid or useful tools
-
enum-collections
Collections data structures optimized for Enum, initializable at runtime
-
map-macro
Declarative macros for statically initializing collections
-
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
-
vclock
vector clock
-
supply-chain-trust-example-crate-000006
port of Google's SwissTable hash map
-
stable-map
A hash map with temporarily stable indices
-
lsph
Learned Spatial HashMap
-
cow_hashmap
Hashmap with copy-on-write semantics that requires no locks
-
hotel
Collection Data-structure to associate values with keys
-
typemap_rev
A hashmap, but stores types as keys
-
supply-chain-trust-example-crate-000069
A non-cryptographic hash function using AES-NI for high performance
-
memory-db
In-memory implementation of hash-db, useful for tests
-
merge-yaml-hash
YAML Hash with merge/update capabilities
-
fvm_ipld_hamt
Sharded IPLD HashMap implementation
-
rucksack
A terminal-based secrets manager, generator, and importer/exporter (Firefox, Chrome) backed with a concurrent hashmap
-
cityhasher
A pure Rust implementation of Google's CityHash hashing algorithm
-
cityhash-sys
Rust binding of Google CityHash algorithm
-
rbtree
the rbtree for Rust
-
hybridmap
Hybrid map using smallvec and the std hashmap
-
multi-map
Like a std::collection::HashMap, but allows you to use either of two different keys to retrieve items
-
map-to-javascript-html
serializing a map to JavaScript code in HTML usually for dynamically generating strings on web pages
-
map
map!macro andmap_insert!macro, to create a HashMap collection and insert key-value pairs. Inspired by thevec!macro. -
bytesbox
ByteBox is a high-performance hash map implementation optimized for byte slices. It efficiently maps keys and values of type Vec<u8>, providing full ownership of the data. ByteBox uses…
-
lexis
Generates human-readable sequences from numeric values using a predefined word list
-
small_len
A small library for storing the length in the smallest internal type
-
equivalent-flipped
Similar to
equivalentcrate, but flipsKandQ -
agb_hashmap
no_std hashmap implementation intended for use in the
agblibrary -
defaultmap
HashMap with an automatic default for missing keys
-
whirlwind
Collection of thread-safe, asynchronous data structures
-
small-map
An inline SIMD accelerated hashmap designed for small amount of data
-
co_managed
Create managed sub coroutines. Managed sub coroutines will be cancelled when the parent exit
-
emap
A map with a fixed capacity and integers as keys
-
sharded
Safe, fast, and obvious concurrent collections
-
hashers
A collection of non-cryptographic hashing algorithms for Rust
-
supply-chain-trust-example-crate-000019
A hash table with consistent order and fast iteration
-
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…
-
folklore
A lock-free concurrent hash map
-
timedmap
A hash map with expiring key-value pairs
-
light-ini
Event-driven parser for the INI file format
-
linear-hashtbl
Linear probing hash table
-
merg
Merge multiple values into one
-
alist
Association list offering fast lookups while preserving insertion order
-
ty_map_gen
A type projecting map generator
-
leapfrog
A fast, lock-free concurrent hash map
-
svi
a function to interpolate variables in a hashmap into a format string
-
scdb
A very simple and fast key-value store but persisting data to disk, with a 'localStorage-like' API
-
lockmap
A high-performance, thread-safe HashMap implementation for Rust that provides fine-grained locking at the key level
-
mbarc-map
Minimally-blocking, Atomic Reference Counted Map
-
phf_mut
Perfectly hashed mutable containers
-
nohashmap
Use HashMap syntax in Rust for non-hashable types
-
vec-btree-map
Basically just a sorted Vec that can be used as a HashMap
-
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.
-
hashmap_settings
HashMap wrapper for layered Settings
-
common-cache
A hierarchical cache data structure that prioritizes the most commonly used and recently accessed items and can dynamically grow and shrink in size
-
freeform
A small library for being able to store free-form data
-
fhash
Blazingly fast hash for HashMaps in Rust
-
conf_parser
small library for handling conf files
-
delta-collections
Data structures with revertable operations called deltas
-
jsonmap
store values of multiple types value in one Map
-
expiringdict
A dict / HashMap whose items expire over time
-
chashmap-async
Concurrent async hash maps with key-scoped locking
-
expiringmap
a HashMap-backed TTL map
-
musemap
Fast DoS-resistant hashmap based on MuseAir hash algorithm
-
lmfu
Low Memory Footprint Utilities (String, HashMap, JSON)
-
micromap-rawl
Fork of Micromap https://github.com/yegor256/micromap, the fastest alternative to HashMap, for maps smaller than 20 keys
-
prehash
storing values with precomputed hashes
-
izihawa-tantivy-stacker
term hashmap used for indexing
-
roughly-rs
RoughlyRight API
-
disjoint-collections
Disjoint-set data structures
-
httplite
A super lightweight HTTP server written in Rust, made to resemble the functionality of the "NET/HTTP" module in Go
-
mule-map
A hybrid between a HashMap and a lookup table
-
argmap
parse command-line arguments into a hashmap and vec of positional args
-
cfgmap
A special hashmap made with configuration in mind
-
rapidsync
Rapid & threadsafe embedded data stores
-
hashable-map
Wrappers for HashMap and HashSet that implement Hash
-
indexmap-nostd
A no_std compatible implementation of the indexmap crate
-
hashbrown_tstd
port of Google's SwissTable hash map
-
db-map
A local, Send & Sync, key-value store that acts like a HashMap
-
rutin_dashmap
Blazing fast concurrent HashMap for Rust
-
remote_hash_map
Remote hash map
-
simplicio
Gets rid of the boilerplate in rust
-
literally
Macro literals for members of std::collections
-
hash-rings
Implementations of various hash rings
-
tantivy-stacker
term hashmap used for indexing
-
ordered_hashmap
Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
-
key-node-list
Doubly-linked list that stores key-node pairs
-
indexedlinkedhashmap
An indexable LinkedHashMap. The user defines the data structure that controls order.
-
sortedvec
a sorted vector that enables quick lookups
-
hash_ord
lib contains OrdMap(avl tree) and HashMap(use avl to resolve collision);
-
tinymap
A map structure that stores its data on the stack
-
densevec
Map like collection with usize indices that stores values contiguosly
-
extract_map
A HashMap for memory efficent storage of value types which contain their own keys
-
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…
-
quickscope
Multi-layer HashMap and HashSet implementations for performant representation of variable scopes
-
counted_map
a hashmap that automatically assigns keys to pushed values
-
napmap
Async HashMap that halts requester tasks until the requested data is accessible
-
hashable_weak
A hashable weak pointer
-
non-random-state
Deterministic HashMap and HashSets
-
expiremap
Key-Value map where each value has a custom expiry time
-
moka-cht
Lock-free resizeable concurrent hash table
-
pb-atomic-hash-map
An atomic hash map
-
chashmap-serde
Fast, concurrent hash maps with extensive API and Serde support
-
cht
Lockfree resizeable concurrent hash table
-
murmurhash3
MurmurHash3 implementation
-
tree-mapper
generating a hierarchical mapping of files and directories represented as a HashMap. The mapping reflects the directory structure and file levels, allowing for efficient retrieval and…
-
chashmap
Fast, concurrent hash maps with extensive API
-
vacp2p_pmtree
Persistent Merkle Tree in Rust
-
ritelinked
HashMap-like containers that hold their key-value pairs in a user controllable order
-
double-map
A HashMap with double key to single data/value
-
ttmap
Trivial implementation of type map
-
implhm
Simplified library of collision-handling HashMaps
-
cycle_map
Implementations of bi-directionally accessible hashmaps
-
oomfi
A minimal Bloom Filter implementation in Rust
-
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…
-
thisisplural
#[derive(Plural)] for creating frictionless new types with any collection type like Vec or HashMap
-
futures-waitmap
future-based concurrent event waiting hashmap
-
hydroperfox-lateformat
Late formatting of string parameters
-
dashmap-shard
port of Google's SwissTable hash map
-
mapcomp
Python-like list comprehensions for standard containers
-
hash-trie
Hash Array Mapped Trie (HAMT) Immutable Set Implementation
-
shoogah
Add some syntactic 'shoogah' to Rust
-
transient-hashmap
HashMap with transient entries
-
waitcache
An ever-growing concurrent hash map with key-level locking granularity
-
anyid
ambiguous identifier
-
small_iter_fields
get an iterator, or get the length, or convert to a hashmap from an enum
-
hash_set_map
HashSetMap, K=hash(V),V=V | So uh.. yeah. HashSetMap. ⛓️
-
ptr_hash
A minimal perfect hash function adapted from PTHash
-
gtrie
Generic trie implementation with a support of different key and value types
-
nummap
Defines a wrapper around a
HashMapof number values which behaves as if ALL keys are mapped but0values are not stored -
vectorize
Converts maps to vecs for serialization
-
comparer
track changes in a HashMap over several iterations
-
storage-map
Concurrent append-only map storage
-
vec_key_value_pair
A drop-in replacement for std::HashMap and std::HashSet that use Vec on the backend
-
optempty
Tools for working types that may be empty. E.g., an empty
String,Vec,HashMap, etc. -
cons
Fast and simple hash consing
-
holyhashmap
A hash map with stable indices
-
try-from-map
A derive macro for converting a HashMap<String, String> into a struct
-
defaultdict
A hashmap implementation that mirrors the python defaultdict
-
memory
HashMap implementation with forget function
-
discord-indexmap
A fork of the popular
indexmaplibrary that adds a few extra APIs that are yet to be upstreamed -
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…
-
lit2
Collection helper libraries and “literal” macros for HashMap, HashSet, BTreeMap, and BTreeSet
-
mashmap
A flat HashMap that supports multiple entries per key
-
common_macros
common macros like
hash_map!orhash_set!(WIP) -
scherben-map
Concurrent Sharded HashMap for Rust
-
pi_hash
Provide unified hasher, HashMap and HashSet, The hash algorithm used can be determined by compiling conditions
-
veho
a iterable toolset
-
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…
-
actix-storage-hashmap
actix-storage based on hashmap
-
segmentmap
A collection that maintains insertion order
-
quickphf_codegen
Code generator for creating static maps and sets for use with quickphf
-
nohash-hasher
std::hash::Hasherwhich does not hash at all -
automap
pattern to implement key-value maps where the value type contains the key type
-
hash-chain
A tiered hashmap and hashset implementation that allows for easily representing lexically scoped variables
-
animejs-rs
anime.js bindings for rust
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
multi_mut
Methods on HashMap and BTreeMap for safely getting multiple mutable references to the contained values
-
identity-hash
std::hash::Hasherwhich does not hash at all -
merge-hashmap
Merge multiple values into one
-
rust-freqdist
Frequency Distribution in Rust
-
helper
provided some useful proc macros for Rust
-
compact-map
'Small map' optimization: store up to a small number of key-value pairs on the stack
-
periodic-rs
Bounded datastructures
-
serde-ordered-collections
Ordered serialization/deserialization serde functionality
-
concurrent_open_map
A concurrent hashmap implementation in Rust
-
string_template
Very simple string template for Rust
-
rahashmap
Fork of standard library HashMap with additional functionality
-
fn-map
Abstraction around HashMap. Uses closure to compute and store value.
-
dashmap_with_out_t_map_trait
Blazing fast concurrent HashMap for Rust
-
maplit2
Collection helper libraries and “literal” macros for HashMap, HashSet, BTreeMap, and BTreeSet
Try searching with DuckDuckGo.