Package org.apache.commons.collections4.trie

This package contains implementations of the Trie interface.

The implementations are in the form of direct implementations and decorators. A decorator wraps another implementation of the interface to add some specific additional functionality.

The following implementations are provided in the package:

• PatriciaTrie - an implementation of a PATRICIA trie

The following decorators are provided:

• Unmodifiable - ensures the collection cannot be altered

Class Summary

Class	Description
AbstractBitwiseTrie<K,V>	This class provides some basic Trie functionality and utility methods for actual bitwise Trie implementations.
AbstractBitwiseTrie.BasicEntry<K,V>	A basic implementation of Map.Entry.
AbstractPatriciaTrie<K,V>	This class implements the base PATRICIA algorithm and everything that is related to the Map interface.
AbstractPatriciaTrie.TrieEntry<K,V>	A Trie is a set of AbstractPatriciaTrie.TrieEntry nodes.
KeyAnalyzer<K>	Defines the interface to analyze Trie keys on a bit level.
PatriciaTrie<E>	Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric).
UnmodifiableTrie<K,V>	An unmodifiable Trie.