Trait radix_trie::TrieCommon[−][src]

pub trait TrieCommon<'a, K: 'a, V: 'a>: ContainsTrieNode<'a, K, V> where
    K: TrieKey,
    Self: Sized, {
    fn len(self) -> usize;

    fn children(self) -> Children<'a, K, V>ⓘ
Notable traits for Children<'a, K, V>
impl<'a, K, V> Iterator for Children<'a, K, V>    type Item = SubTrie<'a, K, V>;
;

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

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

    fn is_empty(self) -> bool { ... }

    fn is_leaf(self) -> bool { ... }

    fn iter(self) -> Iter<'a, K, V>ⓘ
Notable traits for Iter<'a, K, V>
impl<'a, K, V> Iterator for Iter<'a, K, V>    type Item = (&'a K, &'a V);
 { ... }

    fn keys(self) -> Keys<'a, K, V>ⓘ
Notable traits for Keys<'a, K, V>
impl<'a, K, V> Iterator for Keys<'a, K, V>    type Item = &'a K;
 { ... }

    fn values(self) -> Values<'a, K, V>ⓘ
Notable traits for Values<'a, K, V>
impl<'a, K, V> Iterator for Values<'a, K, V>    type Item = &'a V;
 { ... }

    fn prefix(self) -> &'a Nibblet { ... }
}
Expand description

Common functionality available for tries and subtries.

Required methods

Number of key/value pairs stored in this trie.

Return an iterator over the child subtries of this node.

Provided methods

Get the key stored at this node, if any.

Get the value stored at this node, if any.

Determine if the Trie contains 0 key-value pairs.

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

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

Return an iterator over the keys of the Trie.

Return an iterator over the values of the Trie.

Get the prefix of this node.

Implementors