Package | Description |
---|---|
org.apache.lucene.search.suggest.tst |
Ternary Search Tree based autosuggest.
|
Modifier and Type | Field and Description |
---|---|
(package private) TernaryTreeNode |
TernaryTreeNode.eqKid
a reference object to the node containing character next to this node's character as
occurring in the inserted token.
|
(package private) TernaryTreeNode |
TernaryTreeNode.hiKid
a reference object to the node containing character higher than this node's character.
|
(package private) TernaryTreeNode |
TernaryTreeNode.loKid
a reference object to the node containing character smaller than this node's character.
|
(package private) TernaryTreeNode |
TSTLookup.root |
Modifier and Type | Method and Description |
---|---|
TernaryTreeNode |
TSTAutocomplete.insert(TernaryTreeNode currentNode,
java.lang.CharSequence s,
java.lang.Object val,
int x)
Inserts a key in TST creating a series of Binary Search Trees at each node.
|
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<TernaryTreeNode> |
TSTAutocomplete.prefixCompletion(TernaryTreeNode root,
java.lang.CharSequence s,
int x)
Auto-completes a given prefix query using Depth-First Search with the end
of prefix as source node each time finding a new leaf to get a complete key
to be added in the suggest list.
|
Modifier and Type | Method and Description |
---|---|
void |
TSTAutocomplete.balancedTree(java.lang.Object[] tokens,
java.lang.Object[] vals,
int lo,
int hi,
TernaryTreeNode root)
Inserting keys in TST in the order middle,small,big (lexicographic measure)
recursively creates a balanced tree which reduces insertion and search
times significantly.
|
TernaryTreeNode |
TSTAutocomplete.insert(TernaryTreeNode currentNode,
java.lang.CharSequence s,
java.lang.Object val,
int x)
Inserts a key in TST creating a series of Binary Search Trees at each node.
|
java.util.ArrayList<TernaryTreeNode> |
TSTAutocomplete.prefixCompletion(TernaryTreeNode root,
java.lang.CharSequence s,
int x)
Auto-completes a given prefix query using Depth-First Search with the end
of prefix as source node each time finding a new leaf to get a complete key
to be added in the suggest list.
|
private void |
TSTLookup.readRecursively(DataInput in,
TernaryTreeNode node) |
private void |
TSTLookup.writeRecursively(DataOutput out,
TernaryTreeNode node) |