Struct louds::trie::TrieVec

pub struct TrieVec<T> { /* fields omitted */ }

Naive trie implementation supporting dynamic insertion.

Methods

impl<'a, T> TrieVec<T>

pub fn new() -> TrieVec<T>

pub fn bf_iter(&'a self) -> BFIter<'a, T>

pub fn children(&self) -> &Vec<(T, Box<Self>)>

pub fn terminal(&self) -> bool

pub fn children_len(&self) -> usize

impl<T: Eq + PartialOrd + Ord + Clone> TrieVec<T>

pub fn insert<K: AsRef<[T]>>(&mut self, key: K)

Trait Implementations

impl<T: Clone> From<TrieVec<T>> for TrieLouds<T>

fn from(t: TrieVec<T>) -> Self

Performs the conversion.

impl<T: Debug> Debug for TrieVec<T>

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

Formats the value using the given formatter.

impl<T: Eq + PartialOrd + Ord> Trie<T> for TrieVec<T>

fn has<K: AsRef<[T]>>(&self, key: K) -> bool

Returns true if the trie contains key.