a trie (aka prefix trie) is a way of storing string values such that for an input string (e.g. autocomplete) all matching stored values can be re__trie__ved efficiently
listed alphabetically:
- burst-trie - burst trie implementation, seems to be written in a Java style, no readme, not sure how fast it is
- datrie - double array trie - a trie that uses arrays instead of objects for faster + smaller serialization
- dtrie - trie based on minimal automaton, has stress tests, API is coupled to node though (requires
fs
) - glob-trie - trie with pattern matching expressions like * ? \ etc, has stress tests
- iptrie - radix/patricia trie implementation specifically for IPv4 and IPv6 addresses
- [marisa-trie](https://code.google.com/p/mari