Lucene++ - a full-featured, c++ search engine
API Documentation


SegmentMergeQueue.h
Go to the documentation of this file.
1 // Copyright (c) 2009-2014 Alan Wright. All rights reserved.
3 // Distributable under the terms of either the Apache License (Version 2.0)
4 // or the GNU Lesser General Public License.
6 
7 #ifndef SEGMENTMERGEQUEUE_H
8 #define SEGMENTMERGEQUEUE_H
9 
10 #include "PriorityQueue.h"
11 
12 namespace Lucene {
13 
14 class SegmentMergeQueue : public PriorityQueue<SegmentMergeInfoPtr> {
15 public:
16  SegmentMergeQueue(int32_t size);
17  virtual ~SegmentMergeQueue();
18 
20 
21 public:
22  void close();
23 
24 protected:
25  virtual bool lessThan(const SegmentMergeInfoPtr& first, const SegmentMergeInfoPtr& second);
26 };
27 
28 }
29 
30 #endif
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)
boost::shared_ptr< SegmentMergeInfo > SegmentMergeInfoPtr
Definition: LuceneTypes.h:212

clucene.sourceforge.net