Awesome
Lightweight Trie
This is a very memory-efficient implementation of a String-keyed trie (radix tree) in Java. It's designed to use as little memory as possible while still giving reasonably fast lookup time.
This is a very memory-efficient implementation of a String-keyed trie (radix tree) in Java. It's designed to use as little memory as possible while still giving reasonably fast lookup time.