This structure represents an encoder that maps unique keys to integer codes while storing associated values.
It encapsulates a vector of key-value pairs alongside a hash map that records the corresponding code for each key.
A structure representing an iterator that traverses ancestors in a trie based on a specific key.
It maintains a reference to a trie mapping static string keys to associated values and an optional key used to initiate and guide the iteration process.
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.
An enumeration representing a recursive interval tree that can contain either an inner node with associated intervals or a terminal leaf with a stored value.
Checks whether each element in the first slice is a prefix of its corresponding element in the second slice.
This function iterates over paired elements from both slices and returns true only if every element from the first slice is a starting substring of the corresponding element in the second slice, ensuring a complete prefix match across the pair of slices.