Struct radix_trie::SubTrie

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

Immutable view of a sub-tree a larger trie.

Implementations

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

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

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, 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.

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

fn len(self) -> usize

Number of key/value pairs stored in this trie.

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).

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

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

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

Return an iterator over the keys of the Trie.

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

Return an iterator over the values of the Trie.

fn prefix(self) -> &'a Nibblet

Get the prefix of this node.