Struct ranagrams::trie::TrieNode

pub struct TrieNode {
    pub terminal: bool,
    pub children: Box<[Option<TrieNode>]>,
}

A node in a trie (retrieval tree) representing a word list. A TrieNode contains a boolean indicating whether it is the end of a word and a list of child nodes representing possible continuations of the prefix represented by the node itself.

Fields

terminal: bool

children: Box<[Option<TrieNode>]>

Implementations

impl TrieNode

pub fn contains(&self, word: &[usize]) -> bool

pub fn size(&self) -> usize

pub fn get(&self, i: usize) -> Option<&TrieNode>

Trait Implementations

impl Clone for TrieNode

pub fn clone(&self) -> TrieNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TrieNode

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

Formats the value using the given formatter.

impl PartialEq<TrieNode> for TrieNode

pub fn eq(&self, other: &TrieNode) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &TrieNode) -> bool

This method tests for !=.

impl StructuralPartialEq for TrieNode