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.
-
Notifications
You must be signed in to change notification settings - Fork 6
A very memory-efficient trie (radix tree) implementation
License
bryanduxbury/lightweight_trie
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A very memory-efficient trie (radix tree) implementation
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published