Struct TrieMap 

pub struct TrieMap<K, V, A = u8> { /* private fields */ }

Implementations

impl<K, V, A: Clone + Eq + Hash> TrieMap<K, V, A>

pub fn new() -> Self

pub fn clear(&mut self)

pub fn contains<T: AsRef<[A]> + ?Sized>(&self, key: &T) -> bool

where K: Borrow<T>,

pub fn get<T: AsRef<[A]> + ?Sized>(&self, key: &T) -> Option<&V>

where K: Borrow<T>,

pub fn get_mut<T: AsRef<[A]> + ?Sized>(&mut self, key: &T) -> Option<&mut V>

where K: Borrow<T>,

pub fn insert<T: AsRef<[A]> + ?Sized>(&mut self, key: &T, val: V) -> Option<V>

where K: Borrow<T>,

pub fn is_empty(&self) -> bool

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

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

pub fn iter_prefix<T: AsRef<[A]> + ?Sized>(&self, prefix: &T) -> Iter<'_, &V>

where K: Borrow<T>,

pub fn iter_prefix_mut<T: AsRef<[A]> + ?Sized>( &mut self, prefix: &T, ) -> Iter<'_, &mut V>

where K: Borrow<T>,

pub fn len(&self) -> usize

Trait Implementations

impl<K, V, A: Clone + Eq + Hash> Default for TrieMap<K, V, A>

fn default() -> Self

Returns the “default value” for a type.

impl<A: Clone + Eq + Hash, T: AsRef<[A]> + ?Sized, K: Borrow<T>, V> Index<&T> for TrieMap<K, V, A>

type Output = V

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<A: Clone + Eq + Hash, T: AsRef<[A]> + ?Sized, K: Borrow<T>, V> IndexMut<&T> for TrieMap<K, V, A>

fn index_mut(&mut self, key: &T) -> &mut Self::Output

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