Class TSTAutocomplete
Ternary Search Trie implementation.
Inheritance
System.Object
TSTAutocomplete
Assembly: Lucene.Net.Suggest.dll
Syntax
public class TSTAutocomplete : objectMethods
| Name | Description |
|---|---|
| BalancedTree(Object[], Object[], Int32, Int32, TernaryTreeNode) | Inserting keys in TST in the order middle,small,big (lexicographic measure) recursively creates a balanced tree which reduces insertion and search times significantly. |
| Insert(TernaryTreeNode, String, Object, Int32) | Inserts a key in TST creating a series of Binary Search Trees at each node. The key is actually stored across the eqKid of each node in a successive manner. |
| PrefixCompletion(TernaryTreeNode, String, Int32) | 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. |
