Struct sozu_lib::network::trie::TrieNode

pub struct TrieNode<V> { /* fields omitted */ }

Methods

impl<V: Debug> TrieNode<V>

fn new(partial: &[u8], key: Key, value: V) -> TrieNode<V>

fn root() -> TrieNode<V>

fn split(&mut self, index: usize)

fn insert(&mut self, key: Key, value: V) -> InsertResult

fn insert_recursive(&mut self,
                    partial_key: &[u8],
                    key: &Key,
                    value: V)
                    -> InsertResult

fn remove(&mut self, key: &Key) -> RemoveResult

fn remove_recursive(&mut self, partial_key: &[u8]) -> RemoveResult

fn lookup(&self, partial_key: &[u8]) -> Option<&KeyValue<Key, V>>

fn domain_insert(&mut self, key: Key, value: V) -> InsertResult

fn domain_remove(&mut self, key: &Key) -> RemoveResult

fn domain_lookup(&self, key: &[u8]) -> Option<&KeyValue<Key, V>>

fn domain_lookup_recursive(&self,
                           partial_key: &[u8])
                           -> Option<&KeyValue<Key, V>>

fn print(&self)

fn print_recursive(&self, indent: u8)

Trait Implementations

impl<V: Debug> Debug for TrieNode<V>

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

Formats the value using the given formatter.

impl<V: PartialEq> PartialEq for TrieNode<V>

fn eq(&self, __arg_0: &TrieNode<V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &TrieNode<V>) -> bool

This method tests for !=.