Class Trie
A Trie is used to store a dictionary of words and their stems.
Actually, what is stored are words with their respective patch commands. A trie can be termed forward (keys read from left to right) or backward (keys read from right to left). This property will vary depending on the language for which a Trie is constructed.
Inheritance
Assembly: Lucene.Net.Analysis.Stempel.dll
Syntax
public class Trie : objectConstructors
| Name | Description |
|---|---|
| Trie(IDataInput) | Constructor for the Trie object. |
| Trie(Boolean) | Constructor for the Trie object. |
| Trie(Boolean, Int32, IList<String>, IList<Row>) | Constructor for the Trie object. |
Methods
| Name | Description |
|---|---|
| Add(String, String) | Add the given key associated with the given patch command. If either parameter is null this method will return without executing. |
| GetAll(String) | Gets the all attribute of the Trie object |
| GetCells() | Return the number of cells in this Trie object. |
| GetCellsPnt() | Gets the cellsPnt attribute of the Trie object |
| GetCellsVal() | Gets the cellsVal attribute of the Trie object |
| GetFully(String) | Return the element that is stored in a cell associated with the given key. |
| GetLastOnPath(String) | Return the element that is stored as last on a path associated with the given key. |
| PrintInfo(TextWriter, String) | writes debugging info to the printstream |
| Reduce(Reduce) | Remove empty rows from the given Trie and return the newly reduced Trie. |
| Store(IDataOutput) | Write this Trie to the given output stream. |
