Version 0.6 of package Trie has just been released in GNU ELPA. You can now find it in M-x list-packages RET.
Trie describes itself as: =================== Trie data structure =================== More at https://elpa.gnu.org/packages/trie.html ## Summary: Quick Overview -------------- A trie is a data structure used to store keys that are ordered sequences of elements (vectors, lists, or strings in Elisp; strings are by far the most common), in such a way that both storage and retrieval are space- and time-efficient. But, more importantly, a variety of more advanced queries can also be performed efficiently: for example, returning all strings with a given prefix, searching for keys matching a given wildcard pattern or regular expression, or searching for all keys that match any of the above to within a given Lewenstein distance. ## Recent NEWS: [Not available 🙁]
