Expand description
A small inline SIMD-accelerated hashmap designed for small amounts of data.
SmallMap stores data inline when the number of elements is small (up to N),
and automatically spills to the heap when it grows beyond that threshold.
§Examples
use small_map::SmallMap;
let mut map: SmallMap<8, &str, i32> = SmallMap::new();
map.insert("a", 1);
map.insert("b", 2);
assert_eq!(map.get(&"a"), Some(&1));
assert!(map.contains_key(&"b"));
assert!(map.is_inline()); // Still stored inlineStructs§
- Into
Keys - A consuming iterator over the keys of a
SmallMap. - Into
Values - A consuming iterator over the values of a
SmallMap. - Keys
- An iterator over the keys of a
SmallMap. - Values
- An iterator over the values of a
SmallMap.
Enums§
Traits§
- Equivalent
- Key equivalence trait.