Struct louds::trie::TrieLouds

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

Trie implementation with LOUDS tree.

This structure does not support insertion queries, so you first have to create TrieVec, which supports dynamic insertion, and then convert it to TrieLouds by using TrieLouds::from().

Examples

extern crate louds;
use louds::trie::{TrieVec, TrieLouds, Trie};

let mut t = TrieVec::new();
let keys = &["ax", "ays", "ayt", "azz", "ceg", "cf"];
for key in keys {
    t.insert(key);
}

// Convert
let t = TrieLouds::from(t);
assert!(t.has("ax"));
assert!(t.has("ays"));
assert!(!t.has("c"));

Trait Implementations

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

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

Performs the conversion.

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

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

Returns true if the trie contains key.