| Interface | Description | 
|---|---|
| Cursor<K,V> | A  Cursorcan be used to traverse aTrie, visit each node
 step by step and makeCursor.Decisions on each step how to continue with
 traversing theTrie. | 
| KeyAnalyzer<K> | The  KeyAnalyzerprovides bit-level access to keys
 for thePatriciaTrie. | 
| 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  Trieutilities | 
| Enum | Description | 
|---|---|
| Cursor.Decision | 
Copyright © 2018 The Apache Software Foundation