The **digits‑trie** library implements a fast prefix‑tree (trie) that works exclusively with strings composed of digits. It lets JavaScript developers store values keyed by digit strings and efficiently retrieve exact matches, check for missing keys, and find the longest matching prefix of a longer digit string—useful for tasks such as phone‑number lookup, routing tables, or any numeric‑string indexing. It’s available via Bower or npm for front‑end or Node.js projects.