Struct ValueBucketArray

pub(crate) struct ValueBucketArray<'v, const N: usize, const CAP: usize, C: Count, K: Key, V: Copy>(BucketArray<'v, N, CAP, C, V>, PhantomData<K>);

Concrete bucket array with a single BucketArrayMemory for value storage

Keys are used for bucket indexing but the remainder bits are not stored.

Tuple Fields

0: BucketArray<'v, N, CAP, C, V>

1: PhantomData<K>

Implementations

impl<'v, const N: usize, const CAP: usize, C: Count, K: Key, V: Copy> ValueBucketArray<'v, N, CAP, C, K, V>

pub(crate) fn new(value_mem: &'v mut BucketArrayMemory<N, CAP, V>) -> Self

A new ValueBucketArray wraps one mutable BucketArrayMemory reference and adds a counts array to track which items are valid.

Trait Implementations

impl<'v, const N: usize, const CAP: usize, C: Count, K: Key, V: Copy> Insert<K, V> for ValueBucketArray<'v, N, CAP, C, K, V>

fn insert(&mut self, key: K, value: V) -> Result<(), ()>

Append a new item to its sorting bucket, or return Err(()) if it’s full

impl<'v, const N: usize, const CAP: usize, C: Count, K: Key, V: Copy> Shape<K> for ValueBucketArray<'v, N, CAP, C, K, V>

const NUM_BUCKETS: usize = N

Number of buckets in the array

fn item_range(&self, bucket: usize) -> Range<usize>

Get the range of items within a single bucket.

fn divisor(&self) -> K

Get the key divisor: the number of buckets but as a Key instance.

fn split_wide_key(&self, key: K) -> (usize, K)

Split a wide key into the bucket index and the remaining bits.

fn join_wide_key(&self, bucket: usize, remainder: K) -> K

Rebuild a wide key from its split components.

impl<'v, const N: usize, const CAP: usize, C: Count, K: Key, V: Copy> ValueLookup<V> for ValueBucketArray<'v, N, CAP, C, K, V>

fn item_value(&self, bucket: usize, item: usize) -> V

Retrieve the Value for a particular item