A PriorityQueue maintains a partial ordering of its elements such that the
least element can always be found in constant time. Put()'s and pop()'s
require log(size) time.
NOTE: This class pre-allocates a full array of
length , in {@link #initialize}.
Namespace: Lucene.Net.UtilCopyC#
maxSize+1
Assembly: Lucene.Net (in Lucene.Net.dll) Version: 2.9.4.1
Syntax
C# |
---|
public abstract class PriorityQueue |
Visual Basic |
---|
Public MustInherit Class PriorityQueue |
Visual C++ |
---|
public ref class PriorityQueue abstract |
Inheritance Hierarchy
System..::..Object
Lucene.Net.Util..::..PriorityQueue
Lucene.Net.Search..::..FieldSortedHitQueue
Lucene.Net.Search..::..FieldValueHitQueue
Lucene.Net.Search..::..FuzzyQuery..::..ScoreTermQueue
Lucene.Net.Search..::..HitQueue
Lucene.Net.Util..::..PriorityQueue
Lucene.Net.Search..::..FieldSortedHitQueue
Lucene.Net.Search..::..FieldValueHitQueue
Lucene.Net.Search..::..FuzzyQuery..::..ScoreTermQueue
Lucene.Net.Search..::..HitQueue