Struct BytesIndexMap

pub struct BytesIndexMap<V> { /* private fields */ }

An IndexMap where the keys are always u8 slices which are pre-hashed.

Implementations

impl<V> BytesIndexMap<V>

pub fn new() -> Self

pub fn reserve(&mut self, additional: usize)

pub fn len(&self) -> IdxSize

pub fn is_empty(&self) -> bool

pub fn entry<'k>(&mut self, hash: u64, key: &'k [u8]) -> Entry<'_, 'k, V>

pub unsafe fn get_index_unchecked(&self, idx: IdxSize) -> (u64, &[u8], &V)

Gets the hash, key and value at the given index by insertion order.

Safety

The index must be less than len().

pub fn iter_hash_keys(&self) -> impl Iterator<Item = (u64, &[u8])>

Iterates over the (hash, key) pairs in insertion order.

Trait Implementations

impl<V> Default for BytesIndexMap<V>

fn default() -> Self

Returns the “default value” for a type.