The **search‑trie** library provides a tiny (<0.5 KB) in‑memory trie for fast prefix matching of strings, returning the longest stored key that matches a query in O(length) time. It offers two builders—`buildCharacterTrie` for dense, short keys and `buildWordTrie` for longer, word‑based keys—making it useful for developers who need quick look‑ups of paths, URLs, or other hierarchical strings (e.g., package directories, import paths, or object property usage).