Struct Trie

pub struct Trie<C: Hash + Eq> { /* private fields */ }

Prefix trie, easily augmentable by adding more fields and/or methods

Implementations

impl<C: Hash + Eq> Trie<C>

pub fn insert(&mut self, word: impl IntoIterator<Item = C>) -> usize

Inserts a word into the trie, and returns the index of its node.

pub fn get(&self, word: impl IntoIterator<Item = C>) -> Option<usize>

Finds a word in the trie, and returns the index of its node.

Trait Implementations

impl<C: Hash + Eq> Default for Trie<C>

fn default() -> Self

Creates an empty trie with a root node.