Uses of Class
org.apache.lucene.search.suggest.tst.TernaryTreeNode
Packages that use TernaryTreeNode
-
Uses of TernaryTreeNode in org.apache.lucene.search.suggest.tst
Methods in org.apache.lucene.search.suggest.tst that return TernaryTreeNodeModifier and TypeMethodDescriptionTSTAutocomplete.insert
(TernaryTreeNode currentNode, CharSequence s, Object val, int x) Inserts a key in TST creating a series of Binary Search Trees at each node.Methods in org.apache.lucene.search.suggest.tst that return types with arguments of type TernaryTreeNodeModifier and TypeMethodDescriptionTSTAutocomplete.prefixCompletion
(TernaryTreeNode root, 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.Methods in org.apache.lucene.search.suggest.tst with parameters of type TernaryTreeNodeModifier and TypeMethodDescriptionvoid
TSTAutocomplete.balancedTree
(Object[] tokens, 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.TSTAutocomplete.insert
(TernaryTreeNode currentNode, CharSequence s, Object val, int x) Inserts a key in TST creating a series of Binary Search Trees at each node.TSTAutocomplete.prefixCompletion
(TernaryTreeNode root, 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.