Struct TrieNode 

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

Implementation of a trie tree structure. In Sozu this is used to store and lookup domains recursively. Each node represents a “level domain”. A leaf node (leftmost label) can be a wildcard, a regex pattern or a plain string. Leaves also store a value associated with the complete domain. For Sozu it is a list of (PathRule, MethodRule, ClusterId). See the Router strucure.

Implementations

impl<V: Debug + Clone> TrieNode<V>

pub fn new(key: Key, value: V) -> TrieNode<V>

pub fn wildcard(key: Key, value: V) -> TrieNode<V>

pub fn root() -> TrieNode<V>

pub fn is_empty(&self) -> bool

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

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

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

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

pub fn lookup_with_path<'a, 'b>( &'b self, partial_key: &'a [u8], accept_wildcard: bool, trace: TrieMatches<'a, 'b>, ) -> Option<(&'b KeyValue<Key, V>, TrieMatches<'a, 'b>)>

Look up partial_key and additionally collect the non-literal segments that matched along the way (TrieMatches).

Equivalent to lookup for callers that don’t need the captures, but frontends with $HOST[n] rewrite templates need the matched segments to fill the placeholders. The accumulator is passed in by value so callers can pre-size it (Vec::with_capacity) and we own the path returned alongside the value.

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

pub fn lookup_mut( &mut self, partial_key: &[u8], accept_wildcard: bool, ) -> Option<&mut KeyValue<Key, V>>

pub fn print(&self)

pub fn print_recursive(&self, partial_key: &[u8], indent: u8)

pub fn for_each_value_mut<F: FnMut(&mut V)>(&mut self, f: &mut F)

Visit every stored value in the trie (the literal key_value and the leftmost wildcard slot of every node, plus all regex-subtree leaves) and invoke f on each. Used by the router to walk all routes for cross-cutting refreshes (e.g. listener- default HSTS reflow) without rebuilding the trie.

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

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

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

pub fn domain_lookup_mut( &mut self, key: &[u8], accept_wildcard: bool, ) -> Option<&mut KeyValue<Key, V>>

pub fn size(&self) -> usize

pub fn to_hashmap(&self) -> HashMap<Key, V>

pub fn to_hashmap_recursive(&self, h: &mut HashMap<Key, V>)

Trait Implementations

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

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

Formats the value using the given formatter.

impl<V: Default> Default for TrieNode<V>

fn default() -> TrieNode<V>

Returns the “default value” for a type.

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

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.