Expand description
Implementations of key-based storage.
Provides tools for mapping, indexing, and efficiently organizing data through unique keys, including maps, sets, and other key-value structures.
Extends: std::{collections}
Macros§
- define_
static_ map - Build a custom static hashmap.
Structs§
- BTree
Map alloc
- 📦
alloc
An ordered map based on a B-Tree. - BTree
Set alloc
- 📦
alloc
An ordered set based on a B-Tree. - Example
Static MapU16 - HashMap
dep_hashbrown
orstd
- 📦
std?
An unordered hash map implemented with quadratic probing and SIMD lookup. - HashSet
dep_hashbrown
orstd
std?
An unordered hash set implemented as aHashMap
where the value is()
Enums§
- BTree
MapEntry alloc
alloc
An ordered map based on a B-Tree.- Hash
MapEntry dep_hashbrown
orstd
- 📦
std?
A view into a single entry in a map, which may either be vacant or occupied. - Static
MapEntry - Represents an entry in a static map allowing for in-place mutation or insertion.
Type Aliases§
- Hash
MapFx hash
and (std
, ordep_hashbrown
andhash
) - A
HashMap
using a default Fx hasher. - Hash
MapStd std
- The
HashMap
in the standard library. - Hash
SetFx hash
and (std
, ordep_hashbrown
andhash
) - A
HashSet
using a default Fx hasher. - Hash
SetStd std
- The
HashSet
in the standard library.