Trie

A Trie string lookup data structure.

@param (V) the Trie entry type

interface Trie (

V

) {

bool put(string s, V v);

bool put(V v);

V remove(string s);

V get(string s);

V get(string s, int offset, int len);

V get(ByteBuffer b);

V get(ByteBuffer b, int offset, int len);

V getBest(string s);

V getBest(string s, int offset, int len);

V getBest(byte[] b, int offset, int len);

V getBest(ByteBuffer b, int offset, int len);

Set!string keySet();

bool isFull();

bool isCaseInsensitive();

void clear();

}

Members

Functions

clear void clear(): Undocumented in source.
get V get(string s): Get an exact match from a string key
get V get(string s, int offset, int len): Get an exact match from a string key
get V get(ByteBuffer b): Get an exact match from a segment of a ByteBuufer as key
get V get(ByteBuffer b, int offset, int len): Get an exact match from a segment of a ByteBuufer as key
getBest V getBest(string s): Get the best match from key in a string.
getBest V getBest(string s, int offset, int len): Get the best match from key in a string.
getBest V getBest(byte[] b, int offset, int len): Get the best match from key in a byte array. The key is assumed to by ISO_8859_1 characters.
getBest V getBest(ByteBuffer b, int offset, int len): Get the best match from key in a byte buffer. The key is assumed to by ISO_8859_1 characters.
isCaseInsensitive bool isCaseInsensitive(): Undocumented in source.
isFull bool isFull(): Undocumented in source.
keySet Set!string keySet(): Undocumented in source.
put bool put(string s, V v): Put an entry into the Trie
put bool put(V v): Put a value as both a key and a value.
remove V remove(string s): Undocumented in source.

Meta

Source

See Implementation

hunt collection Trie interfaces

Trie