Struct ranagrams::trie::Trie

pub struct Trie {
    pub root: TrieNode,
    pub translator: Translator,
    pub cache: RwLock<HashMap<Arc<CharCount>, Arc<Vec<(Arc<Vec<usize>>, Arc<CharCount>)>>>>,
    pub use_cache: bool,
    pub shuffle: bool,
    // some fields omitted
}

The magical boundary between words and numbers, a Trie wraps a TrieNode and various things used for stringification, destringification, and various caches and denormalizations.

Fields

root: TrieNode

translator: Translator

cache: RwLock<HashMap<Arc<CharCount>, Arc<Vec<(Arc<Vec<usize>>, Arc<CharCount>)>>>>

use_cache: bool

shuffle: bool

Implementations

impl Trie

pub fn new(
    root: TrieNode,
    translator: Translator,
    use_cache: bool,
    shuffle: bool
) -> Trie

pub fn remove(&mut self, word: &[usize])

Removes the given word from the trie

pub fn words_for(
    &self,
    cc: Arc<CharCount>,
    sort_key: &[usize],
    all_words: &bool
) -> Vec<(Arc<Vec<usize>>, Arc<CharCount>)>

Produces the words, in their numeric representation, extractable from a CharCount along with the residual CharCounts remaining after their extraction. More precisely, it is those words sorting at or above the order of the given sort key. The sort key ensures that only one permutation of a given anagram is produced.

pub fn optimize(self, cc: CharCount) -> Trie

pub fn stringify(&self, todo: ToDo) -> String

Convert a ToDo from a linked list of words in numeric representation to a single String representing an anagram.

Trait Implementations

impl Clone for Trie

pub fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.