Class TrieST

src/strings/tries.rs:53–56

The TrieST represents an symbol table of key-value pairs, with string keys and generic values. It supports the usual put, get, contains, delete, len, and is-empty, methods. It also provides character-based methods for finding the string in the symbol table that is the *longest prefix* of a given prefix, finding all strings in the symbol table that s*tart with* a given prefix, and finding all strin

/// The len, and is-empty operations take constant time.
/// Construction takes constant time.
pub struct TrieST<T> {
    root: Option<NonNull<Node<T>>>,
    n: usize,
}

struct Node<T> {
    val: Option<T>,