Skip to content
This repository has been archived by the owner on Dec 22, 2020. It is now read-only.

Latest commit

 

History

History
25 lines (16 loc) · 805 Bytes

README.md

File metadata and controls

25 lines (16 loc) · 805 Bytes
Raw

⚠️ This repository is no longer actively maintained.

It should be working, for the most part, but is likely not free of bugs.

Radix Tree

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, and entrySet methods currently return new sets rather than views.

License

This project is licensed under the MIT license.

Background

I implemented this structure while working on the Phon project in early 2012. The work is inspired by Tahseen's implementation.