| Interface | Description |
|---|---|
| Cursor<K,V> |
A
Cursor can be used to traverse a Trie, visit each node
step by step and make Cursor.Decisions on each step how to continue with
traversing the Trie. |
| KeyAnalyzer<K> |
Defines the interface to analyze
Trie keys on a bit level. |
| Trie<K,V> |
Defines the interface for a prefix tree, an ordered tree data structure.
|
| Class | Description |
|---|---|
| AbstractKeyAnalyzer<K> | |
| ByteArrayKeyAnalyzer |
A
KeyAnalyzer for byte[]s |
| ByteKeyAnalyzer |
A
KeyAnalyzer for Bytes |
| CharacterKeyAnalyzer |
A
KeyAnalyzer for Characters |
| CharArrayKeyAnalyzer |
An
KeyAnalyzer for char[]s |
| IntegerKeyAnalyzer |
A
KeyAnalyzer for Integers |
| LongKeyAnalyzer |
A
KeyAnalyzer for Longs |
| PatriciaTrie<K,V> |
PATRICIA
Trie |
| ShortKeyAnalyzer |
A
KeyAnalyzer for Shorts |
| StringKeyAnalyzer |
An
KeyAnalyzer for Strings |
| Tries |
A collection of
Trie utilities |
| Enum | Description |
|---|---|
| Cursor.Decision |
Copyright © 2005-2009 Roger Kapsi, Sam Berlin. All Rights Reserved.