2 releases
Uses new Rust 2024
new 0.1.1 | Mar 12, 2025 |
---|---|
0.1.0 | Dec 16, 2024 |
#495 in Data structures
133 downloads per month
46KB
657 lines
MuleMap<🫏,🗺>
MuleMap
is a hybrid between a HashMap
and a lookup table. It improves performance for frequently accessed keys in a known range. If a key (integer) is in the user specified range, then its value will be stored directly in the lookup table. Benchmarks (using random selection) start to show speed improvements when about 50% of the key accesses are in the lookup table. Performance is almost identical to HashMap
with less than 50%. MuleMap
tries to match the API of the standard library HashMap
- making it a drop-in replacement for HashMap
.
Example
use mule_map::MuleMap;
use std::num::NonZero;
type Hash = fnv_rs::FnvBuildHasher; // Use whatever hash function you prefer
// Using Entry API
let mut mule_map = MuleMap::<u32, usize, Hash>::new();
assert_eq!(mule_map.get(5), None);
let entry = mule_map.entry(5);
entry.or_insert(10);
assert_eq!(mule_map.get(5), Some(&10));
// Using NonZero and bump
let mut mule_map_non_zero = MuleMap::<u32, NonZero<i32>, Hash>::default();
mule_map_non_zero.bump_non_zero(10);
mule_map_non_zero.bump_non_zero(10);
mule_map_non_zero.bump_non_zero(999_999);
mule_map_non_zero.bump_non_zero(999_999);
assert_eq!(mule_map_non_zero.get(10), NonZero::<i32>::new(2).as_ref());
assert_eq!(mule_map_non_zero.get(999_999),NonZero::<i32>::new(2).as_ref());
Highlights
- All primitive integer types are supported for keys (
u8
,u16
,u32
,u64
,u128
,usize
,i8
,i16
,i32
,i64
,i128
, andisize
). - All corresponding
NonZero<T>
types are supported for keys. NonZero<T>
key types take advantage of the niche optimizations (guaranteed by the rust compiler) by being stored as anOption<NonZero<T>>
. This is used bybump_non_zero()
to directly castOption<NonZero<T>>
to it's underlying integer type (using bytemuck - no unsafe code) and directly incrementing its value. See benchmarks for details.- NOTE: Currently the type of a const generic can't depend on another generic type argument, so
TABLE_MIN_VALUE
can't use the same type as the key. Because of this, I am usingi128
, but that means we can't represent values nearu128::MAX
. Hopefully having frequent keys nearu128::MAX
is extremely rare.
Benchmarks
License
Licensed under either of:
- Apache License, Version 2.0, (LICENSE-APACHE or https://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or https://opensource.org/licenses/MIT)
at your option.
Dependencies
~0.4–1MB
~20K SLoC