Struct BitReclaimMap 

pub struct BitReclaimMap<K: ?Sized + ToIndex, V, const N: usize> {
    map: IndexMap<K, V, N>,
    free: BitAlloc<N>,
}

This is an IndexMap that additionally tracks which indices are occupied through a bitset.

Fields

map: IndexMap<K, V, N>

free: BitAlloc<N>

Implementations

impl<K: ?Sized + ToIndex, V, const N: usize> BitReclaimMap<K, V, N>

pub const fn new() -> Self

pub fn insert(&mut self, value: V) -> Result<usize, Error>

pub fn remove(&mut self, idx: &K) -> Option<V>

impl<K: Copy + ToIndex, V, const N: usize> BitReclaimMap<K, V, N>

pub fn insert_with( &mut self, f: impl FnOnce(usize) -> Result<(K, V), Error>, ) -> Result<K, Error>

Trait Implementations

impl<K: ?Sized + ToIndex, V, const N: usize> Get<K> for BitReclaimMap<K, V, N>

type Output = V

fn get<Q: Borrow<K>>(&self, index: Q) -> Option<&Self::Output>

impl<K: ?Sized + ToIndex, V, const N: usize> GetMut<K> for BitReclaimMap<K, V, N>

fn get_mut<Q: Borrow<K>>(&mut self, index: Q) -> Option<&mut Self::Output>

fn get2_mut<Q: Borrow<K>>( &mut self, index1: Q, index2: Q, ) -> (Option<&mut Self::Output>, Option<&mut Self::Output>)

fn get3_mut<Q: Borrow<K>>( &mut self, index1: Q, index2: Q, index3: Q, ) -> (Option<&mut Self::Output>, Option<&mut Self::Output>, Option<&mut Self::Output>)

impl<K: Copy + ToIndex, V, const N: usize> Index<K> for BitReclaimMap<K, V, N>

type Output = V

The returned type after indexing.

fn index(&self, index: K) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K: Copy + ToIndex, V, const N: usize> IndexMut<K> for BitReclaimMap<K, V, N>

fn index_mut(&mut self, index: K) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.