Struct RadixTrieN

pub struct RadixTrieN(Vec<Trie<&'static str, Vec<&'static [&'static str]>>>);

A container wrapping a collection of radix tries that map static string slices to lists of string slice arrays. This structure is designed to group multiple tries, enabling efficient organization and retrieval of sequences of static strings by leveraging trie-based lookups for operations such as prefix search and related string queries.

Tuple Fields

0: Vec<Trie<&'static str, Vec<&'static [&'static str]>>>

Implementations

impl RadixTrieN

pub fn new(len: usize) -> Self

Creates a new instance of the specialized trie collection with a specified number of inner trie elements.

Initializes the generator by taking a length parameter and generating a vector with that many default trie structures. Each inner trie is created using its default constructor, and the resulting collection is encapsulated within the instance.

pub fn insert(&mut self, key: &'static [&'static str])

Inserts a provided key composed of static string slices into a multi-layer trie structure. This function iterates over the key’s components paired with corresponding trie elements and updates each trie by appending the key to an existing entry or inserting a new entry when none exists.

pub fn superfixes( &self, key: &'static [&'static str], ) -> impl Iterator<Item = &'static [&'static str]> + '_

Returns an iterator over candidate key slices that are recognized as superfixes relative to the provided key.

Determines the most significant component of the key based on length and queries the corresponding subtrie, then filters and flattens the resulting values to yield only those keys that satisfy the superfix property with respect to the original key.

pub fn prefixes( &self, key: &'static [&'static str], ) -> impl Iterator<Item = &'static [&'static str]> + '_

Returns an iterator that produces all stored string sequences from the underlying trie that qualify as prefixes of the provided key sequence.

Operates by selecting the key element with the smallest length to determine the appropriate subtrie, then iterates over candidate values from that subtrie. The iterator is filtered to include only those sequence elements that satisfy the prefix relationship with the full key as determined by a predicate.