Struct BitTrie 

pub struct BitTrie<K: TrieKey, V> { /* private fields */ }

Implementations

impl<K: TrieKey, V> BitTrie<K, V>

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get_index(&self, key: &[u8]) -> Option<usize>

pub fn get(&self, key: &[u8]) -> Option<&V>

pub fn get_mut(&mut self, key: &[u8]) -> Option<&mut V>

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

pub fn iter(&self) -> Cursor<'_, K, V>

pub fn iter_last(&self) -> Cursor<'_, K, V>

pub fn iter_mut(&mut self) -> CursorMut<'_, K, V>

Public forward mutable cursor: a lending tree-walk that hands out &mut V borrows tied to the cursor (see CursorMut). Parked before the first key — call next()/first() to position.

pub fn iter_mut_last(&mut self) -> CursorMut<'_, K, V>

Public reverse mutable cursor: a lending tree-walk parked on the last key (see CursorMut).

pub fn into_keys_values(self) -> (Vec<K>, Vec<V>)

Trait Implementations

impl<K: Clone + TrieKey, V: Clone> Clone for BitTrie<K, V>

where K::Store: Clone,

fn clone(&self) -> BitTrie<K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: TrieKey, V> Default for BitTrie<K, V>

fn default() -> Self

Returns the “default value” for a type.