C# Class Lucene.Net.Index.Memory.MemoryIndex.Info

Index data structure for a field; Contains the tokenized term texts and their positions.
显示文件 Open project: apache/lucenenet Class Usage Examples

Public Methods

Method Description
Info ( BytesRefHash terms, SliceByteStartArray sliceArray, int numTokens, int numOverlapTokens, float boost, int lastPosition, int lastOffset, long sumTotalTermFreq ) : Lucene.Net.Util
SortTerms ( ) : void

Sorts hashed terms into ascending order, reusing memory along the way. Note that sorting is lazily delayed until required (often it's not required at all). If a sorted view is required then hashing + sort + binary search is still faster and smaller than TreeMap usage (which would be an alternative and somewhat more elegant approach, apart from more sophisticated Tries / prefix trees).

Method Details

Info() public method

public Info ( BytesRefHash terms, SliceByteStartArray sliceArray, int numTokens, int numOverlapTokens, float boost, int lastPosition, int lastOffset, long sumTotalTermFreq ) : Lucene.Net.Util
terms Lucene.Net.Util.BytesRefHash
sliceArray SliceByteStartArray
numTokens int
numOverlapTokens int
boost float
lastPosition int
lastOffset int
sumTotalTermFreq long
return Lucene.Net.Util

SortTerms() public method

Sorts hashed terms into ascending order, reusing memory along the way. Note that sorting is lazily delayed until required (often it's not required at all). If a sorted view is required then hashing + sort + binary search is still faster and smaller than TreeMap usage (which would be an alternative and somewhat more elegant approach, apart from more sophisticated Tries / prefix trees).
public SortTerms ( ) : void
return void