tries | Radix tree implementations

tries is a Java library. tries has no bugs, it has no vulnerabilities, it has build file available, it has a Permissive License and it has low support. You can download it from GitHub.

The main entry-point for the library is the Tries class, applications wanting to create tries, must first create a Tries instance by using one of its serial methods to select which types of objects are to be serialized into the tries. The application may then create a custom instance by chaining calls (eg. by adapting the serialization, or changing the ordering) before creating a trie via one of the methods newTrie(), copyTrie() or readTrie(). Some applications may benefit from providing their own element serialization instead of relying on those provided by the package. This is done by implementing the TrieSerialization interface, and calling its tries() method. Applications may also provide their own implementation of the nodes that store the trie data, instead of using one already provided by this package. To do so the TrieNodeSource interface must be implemented which also entails implementation of the TrieNodes, TrieNode and TrieNodePath interfaces. Very few applications will require this level of control, and most will be well served by at least one of the implementations provided by this library, and available via the Trie.sourceFor...() methods.