V - public class ArrayTernaryTrie<V> extends AbstractTrie<V>
| Constructor and Description |
|---|
ArrayTernaryTrie() |
ArrayTernaryTrie(ArrayTernaryTrie<V> trie,
double factor)
Copy Trie and change capacity by a factor
|
ArrayTernaryTrie(boolean insensitive) |
ArrayTernaryTrie(boolean insensitive,
int capacityInNodes) |
ArrayTernaryTrie(int capacityInNodes) |
| Modifier and Type | Method and Description |
|---|---|
V |
get(ByteBuffer b,
int offset,
int length)
Get and exact match from a segment of a ByteBuufer as key
|
V |
get(String s,
int offset,
int length)
Get and exact match from a String key
|
V |
getBest(ByteBuffer b,
int offset,
int len)
Get the best match from key in a byte buffer.
|
V |
getBest(String s)
Get the best match from key in a String.
|
V |
getBest(String s,
int offset,
int length)
Get the best match from key in a String.
|
boolean |
isFull() |
Set<String> |
keySet() |
boolean |
put(String s,
V v)
Put and entry into the Trie
|
String |
toString() |
get, get, getBest, isCaseInsensitive, put, removepublic ArrayTernaryTrie()
public ArrayTernaryTrie(boolean insensitive)
public ArrayTernaryTrie(int capacityInNodes)
public ArrayTernaryTrie(boolean insensitive,
int capacityInNodes)
public ArrayTernaryTrie(ArrayTernaryTrie<V> trie, double factor)
trie - factor - public boolean put(String s, V v)
Tries - The key for the entryv - The value of the entrypublic V get(String s, int offset, int length)
Tries - The keyoffset - The offset within the string of the keylength - the length of the keypublic V get(ByteBuffer b, int offset, int length)
Trieb - The bufferoffset - The offset within the buffer of the keylength - the length of the keypublic V getBest(String s)
Triepublic V getBest(String s, int offset, int length)
Tries - The stringoffset - The offset within the string of the keylength - the length of the keypublic V getBest(ByteBuffer b, int offset, int len)
Trieb - The bufferoffset - The offset within the buffer of the keylen - the length of the keypublic boolean isFull()
Copyright © 1995-2013 Mort Bay Consulting. All Rights Reserved.