Struct Trie

pub struct Trie<'a, T> { /* private fields */ }

Trie is a data structure that stores a set of strings. It is used to find the longest match of a string.

Example

use rk_utils::Trie;

let mut trie = Trie::new();
trie.insert(vec!["a", "b", "c"], 1);
trie.insert(vec!["a", "b", "d"], 2);

assert_eq!(trie.find_longest_match(vec!["a", "b", "c", "d"]), Some(&1));
assert_eq!(trie.find_longest_match(vec!["a", "b", "d", "e"]), Some(&2));

Implementations

impl<'a, T> Trie<'a, T>

pub fn new() -> Self

Create a new Trie.

pub fn insert(&mut self, path: Vec<&'a str>, data: T)

Insert a path of nodes with data.

pub fn find_longest_match(&'a self, request_path: Vec<&'a str>) -> Option<&T>

Find the longest match of a path of nodes. It returns the data associated with the longest matched path.

Trait Implementations

impl<'a, T> Default for Trie<'a, T>

fn default() -> Self

Returns the “default value” for a type.