Struct qp_trie::SubTrie

pub struct SubTrie<'a, K: 'a, V: 'a> { /* fields omitted */ }

Methods

impl<'a, K: 'a, V: 'a> SubTrie<'a, K, V>

pub fn is_empty(&self) -> bool

Returns true if the subtrie has no entries.

impl<'a, K: Borrow<[u8]>, V> SubTrie<'a, K, V>

Important traits for Iter<'a, K, V>

impl<'a, K: 'a, V: 'a> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);

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

Important traits for Iter<'a, K, V>

impl<'a, K: 'a, V: 'a> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);

pub fn iter_prefix<L: Borrow<[u8]>>(&self, prefix: L) -> Iter<K, V>

pub fn subtrie<L: Borrow<[u8]>>(&self, prefix: L) -> SubTrie<K, V>

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

Trait Implementations

impl<'a, K: Debug, V: Debug> Debug for SubTrie<'a, K, V>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'a, K: 'a, V: 'a> IntoIterator for SubTrie<'a, K, V>

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, K: Borrow<[u8]>, V, L: Borrow<[u8]>> Index<L> for SubTrie<'a, K, V>

type Output = V

The returned type after indexing.

fn index(&self, key: L) -> &V

Performs the indexing (container[index]) operation.