Interface | Description |
---|---|
Cursor<K,V> |
A
Cursor can be used to traverse a Trie , visit each node
step by step and make Cursor.Decision s 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 Byte s |
CharacterKeyAnalyzer |
A
KeyAnalyzer for Character s |
CharArrayKeyAnalyzer |
An
KeyAnalyzer for char[] s |
IntegerKeyAnalyzer |
A
KeyAnalyzer for Integer s |
LongKeyAnalyzer |
A
KeyAnalyzer for Long s |
PatriciaTrie<K,V> |
PATRICIA
Trie |
ShortKeyAnalyzer |
A
KeyAnalyzer for Short s |
StringKeyAnalyzer |
An
KeyAnalyzer for String s |
Tries |
A collection of
Trie utilities |
Enum | Description |
---|---|
Cursor.Decision |
Copyright © 2005-2009 Roger Kapsi, Sam Berlin. All Rights Reserved.