The methods of the FieldSortedHitQueue class are listed below. For a complete list of FieldSortedHitQueue class members, see the FieldSortedHitQueue Members topic.
![]() | Should be called when the object at top changes values. Still log(n) worst case, but it's at least twice as fast to { pq.top().change(); pq.adjustTop(); }instead of { o = pq.pop(); o.change(); pq.push(o); } |
![]() | Removes all entries from the PriorityQueue. |
![]() | Determines whether the specified Object is equal to the current Object. |
![]() | Serves as a hash function for a particular type. GetHashCode is suitable for use in hashing algorithms and data structures like a hash table. |
![]() | returns the maximum score encountered by elements inserted via insert() |
![]() | Gets the Type of the current instance. |
![]() | Overloaded. |
![]() | |
![]() | Returns whether ais less relevant than b. |
![]() | Removes and returns the least element of the PriorityQueue in log(size) time. |
![]() | Adds an object to a PriorityQueue in log(size) time. If one tries to add more objects than maxSize from initialize a RuntimeException (ArrayIndexOutOfBound) is thrown. |
![]() | Returns the number of elements currently stored in the PriorityQueue. |
![]() | Returns the least element of the PriorityQueue in constant time. |
![]() | Returns a String that represents the current Object. |
![]() | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
![]() | Subclass constructors must call this. |
![]() | Creates a shallow copy of the current Object. |
FieldSortedHitQueue Class | Lucene.Net.Search Namespace | |