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:
The following decorators are provided:
| Modifier and Type | Class and Description |
|---|---|
| public abstract class | AbstractBitwiseTrie<
the type of the keys in this map K, the type of the values in this map V>This class provides some basic |
| pack-priv abstract class | AbstractPatriciaTrie<K, V>
This class implements the base PATRICIA algorithm and everything that
is related to the |
| public abstract class | KeyAnalyzer<
the type of objects that may be compared by this analyzer K>Defines the interface to analyze |
| public class | PatriciaTrie<
the type of the values in this map E>Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric). |
| public class | UnmodifiableTrie<
the type of the keys in this map K, the type of the values in this map V>An unmodifiable |