Struct TrieNode 

pub struct TrieNode<K: Eq + Ord + Clone, V> {
    pub value: Option<V>,
    pub children: Vec<(K, TrieNode<K, V>)>,
}

A node in the Trie, it holds a value, and a list of children nodes

Fields

value: Option<V>

children: Vec<(K, TrieNode<K, V>)>

sorted

Implementations

impl<K: Eq + Ord + Clone, V> TrieNode<K, V>

pub fn new() -> Self

pub fn insert<I: Iterator<Item = (usize, K)>>( &mut self, key: I, value_cb: impl FnMut(&mut TrieNode<K, V>, Option<usize>), cur: Option<usize>, ) -> Option<&mut V>

Insert a node in the trie

pub fn remove_subtree<I: Iterator<Item = K>>(&mut self, key: Peekable<I>)

pub fn find_node<I: Iterator<Item = K>>(&self, key: I) -> Option<&Self>

Recursively find a node searching through children

pub fn find_node_mut<I: Iterator<Item = K>>( &mut self, key: I, ) -> Option<&mut Self>

pub fn set_value(&mut self, value: V)

pub fn get_value(&self) -> Option<&V>

pub fn may_be_leaf(&self) -> bool

Trait Implementations

impl<K: Clone + Eq + Ord + Clone, V: Clone> Clone for TrieNode<K, V>

fn clone(&self) -> TrieNode<K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug + Eq + Ord + Clone, V: Debug> Debug for TrieNode<K, V>

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

Formats the value using the given formatter.

impl<T: Eq + Ord + Clone, U> Default for TrieNode<T, U>

fn default() -> Self

Returns the “default value” for a type.