Struct simple_trie::Trie

pub struct Trie {
    pub nodes: Vec<Node>,
    pub synonym_dict: Vec<Vec<String>>,
}

Fields

nodes: Vec<Node>

synonym_dict: Vec<Vec<String>>

Implementations

impl Trie

pub fn new() -> Trie

pub fn insert(&mut self, string: &str, val: Option<u32>)

pub fn insert_synonym(&mut self, string: &str, synonyms: Vec<String>)

pub fn search(&self, string: &str) -> Option<u32>

pub fn longest_common_prefix_search(&self, string: &str) -> Option<(u32, usize)>

pub fn common_prefix_search(&self, string: &str) -> Vec<(u32, usize)>

pub fn get_all_tokens(&self, input: &str) -> Vec<Token>

function that gets the highest scoring (sum of values) combination of tokens