⚠️ This repository is no longer actively maintained.It should be working, for the most part, but is likely not free of bugs.
An implementation of the Radix Tree data
structure in Java. A radix tree maps strings to values, allowing efficient
string lookup and prefix queries. This implementation mostly implements the
java.util.Map
interface, minus the following:
keySet
,values
, andentrySet
methods currently return new sets rather than views.
This project is licensed under the MIT license.
I implemented this structure while working on the Phon project in early 2012. The work is inspired by Tahseen's implementation.