public interface RadixTree<T>
| Modifier and Type | Method and Description |
|---|---|
String |
complete(String prefix)
Complete the a prefix to the point where ambiguity starts.
|
boolean |
contains(String key)
Check if the tree contains any entry corresponding to the given key.
|
boolean |
delete(String key)
Delete a key and its associated value from the tree.
|
T |
find(String key)
Find a value based on its corresponding key.
|
long |
getSize()
Return the size of the Radix tree
|
void |
insert(String key,
T value)
Insert a new string key and its value to the tree.
|
ArrayList<T> |
searchPrefix(String prefix,
int recordLimit)
Search for all the keys that start with given prefix.
|
void insert(String key, T value) throws DuplicateKeyException
key - The string key of the objectvalue - The value that need to be stored corresponding to the given
key.DuplicateKeyExceptionboolean delete(String key)
key - The key of the node that need to be deletedT find(String key)
key - The key for which to search the tree.boolean contains(String key)
key - The key that needto be searched in the tree.ArrayList<T> searchPrefix(String prefix, int recordLimit)
prefix - The prefix for which keys need to be searchrecordLimit - The limit for the resultslong getSize()
Copyright © 2015 Bluebrain Project. All rights reserved.