7 #ifndef FIELDDOCSORTEDHITQUEUE_H
8 #define FIELDDOCSORTEDHITQUEUE_H
virtual bool lessThan(const FieldDocPtr &first, const FieldDocPtr &second)
Returns whether first is less relevant than second.
FieldDocSortedHitQueue(int32_t size)
void setFields(Collection< SortFieldPtr > fields)
Allows redefinition of sort fields if they are null. This is to handle the case using ParallelMultiSe...
A PriorityQueue maintains a partial ordering of its elements such that the least element can always b...
Definition: PriorityQueue.h:20
Collection< SortFieldPtr > getFields()
Returns the fields being used to sort.
virtual ~FieldDocSortedHitQueue()
Collects sorted results from Searchable's and collates them. The elements put into this queue must be...
Definition: FieldDocSortedHitQueue.h:16
int32_t size() const
Returns the number of elements currently stored in the PriorityQueue.
Definition: PriorityQueue.h:133
Collection< CollatorPtr > collators
Definition: FieldDocSortedHitQueue.h:27
#define LUCENE_CLASS(Name)
Definition: LuceneObject.h:24
Definition: AbstractAllTermDocs.h:12
Collection< SortFieldPtr > fields
Definition: FieldDocSortedHitQueue.h:21
Collection< CollatorPtr > hasCollators(Collection< SortFieldPtr > fields)
Returns an array of collators, possibly null. The collators correspond to any SortFields which were g...
boost::shared_ptr< FieldDoc > FieldDocPtr
Definition: LuceneTypes.h:350