Skip to content

bryanduxbury/lightweight_trie

Repository files navigation

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.

About

A very memory-efficient trie (radix tree) implementation

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages