Struct Trie 

pub struct Trie { /* private fields */ }

Trie (Prefix Tree) for string storage and retrieval

Implementations

impl Trie

pub fn new() -> Self

Create a new empty trie

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

Insert a word into the trie

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

Search for a word in the trie

pub fn starts_with(&self, prefix: &str) -> bool

Check if any word starts with the given prefix

pub fn words_with_prefix(&self, prefix: &str) -> Vec<String>

Get all words with the given prefix

pub fn all_words(&self) -> Vec<String>

Get all words stored in the trie

pub fn word_count(&self) -> usize

Get the number of words stored in the trie

pub fn serialize(&self) -> String

Serialize the trie to a string representation

pub fn visualize(&self) -> String

Visualize the trie structure

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

Compare two tries for structural equality

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

Check if this trie contains all words from another trie

pub fn statistics(&self) -> TrieStatistics

Get trie statistics

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

Remove a word from the trie

pub fn longest_common_prefix(&self) -> String

Get the longest common prefix of all words in the trie

Trait Implementations

impl Clone for Trie

fn clone(&self) -> Trie

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Trie

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

Formats the value using the given formatter.

impl Default for Trie

fn default() -> Self

Returns the “default value” for a type.