Trait louds::trie::Trie

pub trait Trie<T> {
    fn has<K: AsRef<[T]>>(&self, key: K) -> bool;
}

An ordered tree to manage a set of keys. It can answer whether it contains a given key or not.

Keys are any values that can be converted to a slice of alphabets (type T).

Required Methods

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

Returns true if the trie contains key.

Implementors

• impl<T: Eq + PartialOrd + Ord> Trie<T> for TrieLouds<T>

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