Struct Trie 

pub struct Trie { /* private fields */ }

A trie (prefix tree) storing strings of bytes.

Supports insert and search in O(|key|) time.

Implementations

impl Trie

pub fn new() -> Self

Create a new empty trie.

pub fn insert(&mut self, key: &str)

Insert a string into the trie.

Time complexity: O(|key|).

pub fn search(&self, key: &str) -> bool

Return true if key was previously inserted into the trie.

Time complexity: O(|key|).

pub fn starts_with(&self, prefix: &str) -> bool

Return true if any key in the trie starts with prefix.

Time complexity: O(|prefix|).

Trait Implementations

impl Default for Trie

fn default() -> Self

Returns the “default value” for a type.