- clear
void clear()
Undocumented in source. Be warned that the author may not have intended to support it.
- get
V get(string s, int offset, int len)
Undocumented in source. Be warned that the author may not have intended to support it.
- get
V get(ByteBuffer b, int offset, int len)
Undocumented in source. Be warned that the author may not have intended to support it.
- getBest
V getBest(byte[] b, int offset, int len)
Undocumented in source. Be warned that the author may not have intended to support it.
- getBest
V getBest(string s, int offset, int len)
Undocumented in source. Be warned that the author may not have intended to support it.
- getBest
V getBest(ByteBuffer b, int offset, int len)
Undocumented in source. Be warned that the author may not have intended to support it.
- isFull
bool isFull()
Undocumented in source. Be warned that the author may not have intended to support it.
- keySet
Set!(string) keySet()
Undocumented in source. Be warned that the author may not have intended to support it.
- put
bool put(string s, V v)
Undocumented in source. Be warned that the author may not have intended to support it.
- toString
string toString()
Undocumented in source. Be warned that the author may not have intended to support it.
A Trie string lookup data structure using a tree <p> This implementation is always case insensitive and is optimal for a variable number of fixed strings with few special characters. </p> <p> This Trie is stored in a Tree and is unlimited in capacity </p> <p> <p> This Trie is not Threadsafe and contains no mutual exclusion or deliberate memory barriers. It is intended for an ArrayTrie to be built by a single thread and then used concurrently by multiple threads and not mutated during that access. If concurrent mutations of the Trie is required external locks need to be applied. </p>
@param (V) the entry type