Class TopOrdAndSingleQueue
Keeps highest results, first by largest float value, then tie break by smallest ord.
NOTE: This was TopOrdAndFloatQueue in LuceneInherited Members
PriorityQueue<OrdAndValue<float>>.Add(OrdAndValue<float>)
PriorityQueue<OrdAndValue<float>>.Insert(OrdAndValue<float>)
PriorityQueue<OrdAndValue<float>>.InsertWithOverflow(OrdAndValue<float>)
PriorityQueue<OrdAndValue<float>>.Top
PriorityQueue<OrdAndValue<float>>.Pop()
PriorityQueue<OrdAndValue<float>>.UpdateTop()
PriorityQueue<OrdAndValue<float>>.Count
PriorityQueue<OrdAndValue<float>>.Clear()
PriorityQueue<OrdAndValue<float>>.HeapArray
Namespace: Lucene.Net.Facet
Assembly: Lucene.Net.Facet.dll
Syntax
public class TopOrdAndSingleQueue : PriorityQueue<OrdAndValue<float>>
Constructors
TopOrdAndSingleQueue(int)
Initializes a new instance of TopOrdAndSingleQueue with the
specified topN
size.
Declaration
public TopOrdAndSingleQueue(int topN)
Parameters
Type | Name | Description |
---|---|---|
int | topN |
Methods
LessThan(OrdAndValue<float>, OrdAndValue<float>)
Determines the ordering of objects in this priority queue. Subclasses must define this one method.
Declaration
protected override bool LessThan(OrdAndValue<float> a, OrdAndValue<float> b)
Parameters
Type | Name | Description |
---|---|---|
OrdAndValue<float> | a | |
OrdAndValue<float> | b |
Returns
Type | Description |
---|---|
bool |
|