PATRICIA Trie

Practical Algorithm to Retrieve Information Coded in Alphanumeric

This is a general purpose implementation of a PATRICIA Trie in Java. It implements the SortedMap interface and integrates well with the Java Collections Framework. You can use any kind of Objects for Keys as long as they can be accessed bit-wise. You can find examples in the wiki and there is a blog post with some additional information about the implementation.

The PATRICIA Trie is also known under the names Radix and Crit Bit Tree.

CODE: As of version 0.3 the code is being hosted on Github.com. The code for version 0.2 (and earlier) and the binaries remain on this page.

If you're looking for a simpler version of the PATRICIA Trie then please take a look at my simple-patricia-trie project on Github.

NOTE: This implementation has been contributed to Apache Commons Collections and Google Collections Library.