Struct Trie 

pub struct Trie { /* private fields */ }

Recursively-defined prefix trie. Typically constructed with Trie::new() for the root node, then insert()ed into many times. Querying for simple existence of a word in the Trie can be performed with contains().

More advanced usage includes using find() to find sub-Trie structures to efficiently search for existince of many words with similar prefixes. See https://github.com/glennhartmann/aoc24/blob/fa21b5787382765a598381c3a0583258b645dc86/src/days/day_19.rs for an example.

Empty strings are considered to exist in every Trie by default.

Implementations

impl Trie

pub fn new() -> Self

Create a new Trie root node containing the empty string.

pub fn with_prefix(s: &str, is_terminal: bool) -> Self

Create a sub-node with an existing prefix, whether terminal or not, or can be used to create a root node which does not contain the empty string.

pub fn insert(&mut self, word: &str)

Insert a word into the Trie.

pub fn find(&self, word: &str) -> Option<&Self>

Find the node within the Trie described by word. Note that the returned node may not be terminal. Can be used as any other Trie, for example to continue searching for many suffixes that share the same prefix.

pub fn contains(&self, word: &str) -> bool

Whether the Trie contains word.

pub fn is_terminal(&self) -> bool

pub fn prefix(&self) -> &str

Trait Implementations

impl Default for Trie

fn default() -> Self

Returns the “default value” for a type.