pub type AssociativeArray<K, V> = HashMap<K, V>;Expand description
Hash map (std) or B-Tree map (no_std) for key-value storage
std mode (HashMap):
- Lookup: O(1) average, O(n) worst case
- Insert: O(1) amortized
- Hasher: SipHash 1-3 (cryptographic, DoS resistant)
- Load factor: Grows at 90% capacity
no_std mode (BTreeMap):
- Lookup: O(log n)
- Insert: O(log n)
- Node size: Optimized for cache lines
- Ordering: Requires
K: Ord
Aliased Typeยง
pub struct AssociativeArray<K, V> { /* private fields */ }