7 #ifndef SEGMENTMERGEQUEUE_H
8 #define SEGMENTMERGEQUEUE_H
A PriorityQueue maintains a partial ordering of its elements such that the least element can always b...
Definition: PriorityQueue.h:20
Definition: SegmentMergeQueue.h:14
int32_t size() const
Returns the number of elements currently stored in the PriorityQueue.
Definition: PriorityQueue.h:133
virtual bool lessThan(const SegmentMergeInfoPtr &first, const SegmentMergeInfoPtr &second)
Determines the ordering of objects in this priority queue. Subclasses must define this one method...
#define LUCENE_CLASS(Name)
Definition: LuceneObject.h:24
Definition: AbstractAllTermDocs.h:12
SegmentMergeQueue(int32_t size)
virtual ~SegmentMergeQueue()
boost::shared_ptr< SegmentMergeInfo > SegmentMergeInfoPtr
Definition: LuceneTypes.h:212