Struct radix_trie::SubTrie

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

Immutable view of a sub-tree a larger trie.

Methods

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

pub fn get<Q: ?Sized>(&self, key: &Q) -> SubTrieResult<&V> where
    K: Borrow<Q>,
    Q: TrieKey, 

Look up the value for the given key, which should be an extension of this subtrie's key.

The key may be any borrowed form of the trie's key type, but TrieKey on the borrowed form must match those for the key type

Trait Implementations

impl<'a: 'b, 'b, K: 'a, V: 'a> TrieCommon<'a, K, V> for &'b SubTrie<'a, K, V> where
    K: TrieKey, 

fn len(self) -> usize

Number of key/value pairs stored in this trie.

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

impl<'a, K, V> Iterator for Children<'a, K, V> type Item = SubTrie<'a, K, V>;

fn children(self) -> Children<'a, K, V>

Return an iterator over the child subtries of this node.

fn key(self) -> Option<&'a K>

Get the key stored at this node, if any.

fn value(self) -> Option<&'a V>

Get the value stored at this node, if any.

fn is_empty(self) -> bool

Determine if the Trie contains 0 key-value pairs.

fn is_leaf(self) -> bool

Determine if the trie is a leaf node (has no children).

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

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

fn iter(self) -> Iter<'a, K, V>

Return an iterator over the keys and values of the Trie.

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

impl<'a, K, V> Iterator for Keys<'a, K, V> type Item = &'a K;

fn keys(self) -> Keys<'a, K, V>

Return an iterator over the keys of the Trie.

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

impl<'a, K, V> Iterator for Values<'a, K, V> type Item = &'a V;

fn values(self) -> Values<'a, K, V>

Return an iterator over the values of the Trie.

fn prefix(self) -> &'a NibbleVec

Get the prefix of this node.

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

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

Formats the value using the given formatter.