| 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> |
The
KeyAnalyzer provides bit-level access to keys
for the PatriciaTrie. |
| Trie<K,V> |
Defines the interface for a prefix tree, an ordered tree data structure.
|
| Class | Description |
|---|---|
| PatriciaTrie<K,V> |
PATRICIA
Trie |
| Tries |
A collection of
Trie utilities |
| Enum | Description |
|---|---|
| Cursor.Decision |
Copyright © 2018 The Apache Software Foundation