Version 0.17 of package Dict-Tree has just been released in GNU ELPA. You can now find it in M-x list-packages RET.
Dict-Tree describes itself as: ========================= Dictionary data structure ========================= More at https://elpa.gnu.org/packages/dict-tree.html ## Summary: A dict-tree (created using `dictree-create') is used to store strings, along with arbitrary data associated with each string. (Note that the "strings" can be any sequence data type, not just Elisp strings.) As well as basic data insertion (`dictree-insert'), manipulation (`dictree-insert'), and retrieval (`dictree-lookup', `dictree-member-p'), a dict-tree can perform sophisticated queries on strings, including: - retrieve all completions of a prefix (`dictree-complete') - retrieve all strings that match a regular expression (`dictree-regexp-search') - retrieve all fuzzy matches to a string, i.e. matches within a specified Lewenstein distance (a.k.a. edit distance) (`dictree-fuzzy-match') ## Recent NEWS: [Not available 🙁]
