Erlang Trie Implementation
The data structure is only for storing keys as strings (lists of integers), but is able to get performance close to the process dictionary when doing key lookups (based on results here with the benchmark here). So, this data structure is (currently) the quickest for lookups on key-value pairs where all keys are strings, if you ignore the process dictionary (which many argue should never be used).
The implementation stores leaf nodes as the string suffix because it is a PATRICIA trie (PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric, D.R.Morrison (1968)). Storing leaf nodes this way helps avoid single child leafs (compressing the tree a little bit).
The full OTP dict API is supported in addition to other functions. Functions like foldl, iter, itera, and foreach traverse in alphabetical order. Functions like map and foldr traverse in reverse alphabetical order. There are also functions like
is_prefixed that check if a prefix exists within the trie. The functions with a
"_similar" suffix like
foldr_similar all operate with trie elements that share a common prefix with the supplied string. The functions
pattern_parse/2 utilize patterns that contain a
"*"wildcard character(s) (equivalent to ".+" regex while
"**"is forbidden). The function
find_match/2 operates on a trie filled with patterns when supplied a string non-pattern, while the function
fold_match/4 operates on a trie without patterns when supplied a string pattern.
The btrie data structure was added because many people wanted a quick associative data structure for binary keys. However, other alternatives provide better efficiency, so the btrie is best used for functions that can not be found elsewhere (or perhaps extra-long keys)... more testing would be needed to determine the best use-cases of the btrie.
Michael Truog (mjtruog at protonmail dot com)