Trie
interface.See: Description
Class | Description |
---|---|
AbstractBitwiseTrie<K,V> | |
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.Reference<E> |
A
AbstractPatriciaTrie.Reference allows us to return something through a Method's
argument list. |
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 . |
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: