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