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


Loading...
Searching...
No Matches
SegmentMergeQueue.h
Go to the documentation of this file.
1
2// 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
12namespace Lucene {
13
14class SegmentMergeQueue : public PriorityQueue<SegmentMergeInfoPtr> {
15public:
18
20
21public:
22 void close();
23
24protected:
25 virtual bool lessThan(const SegmentMergeInfoPtr& first, const SegmentMergeInfoPtr& second);
26};
27
28}
29
30#endif
#define LUCENE_CLASS(Name)
Definition LuceneObject.h:24
A PriorityQueue maintains a partial ordering of its elements such that the least element can always b...
Definition PriorityQueue.h:20
int32_t size() const
Returns the number of elements currently stored in the PriorityQueue.
Definition PriorityQueue.h:133
Definition SegmentMergeQueue.h:14
SegmentMergeQueue(int32_t size)
virtual bool lessThan(const SegmentMergeInfoPtr &first, const SegmentMergeInfoPtr &second)
Determines the ordering of objects in this priority queue. Subclasses must define this one method.
Definition AbstractAllTermDocs.h:12
boost::shared_ptr< SegmentMergeInfo > SegmentMergeInfoPtr
Definition LuceneTypes.h:212

clucene.sourceforge.net