blob: faa690252f79b79f324ee5515f860da4ae4cef79 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
/*------------------------------------------------------------------------------
* Copyright (C) 2003-2006 Ben van Klinken and the CLucene Team
*
* Distributable under the terms of either the Apache License (Version 2.0) or
* the GNU Lesser General Public License, as specified in the COPYING file.
------------------------------------------------------------------------------*/
#ifndef _lucene_index_SegmentMergeQueue_
#define _lucene_index_SegmentMergeQueue_
#if defined(_LUCENE_PRAGMA_ONCE)
# pragma once
#endif
#include "CLucene/util/PriorityQueue.h"
#include "SegmentMergeInfo.h"
CL_NS_DEF(index)
class SegmentMergeQueue :public CL_NS(util)::PriorityQueue<SegmentMergeInfo*,CL_NS(util)::Deletor::Object<SegmentMergeInfo> > {
public:
//Constructor
//Creates a queue of length size
SegmentMergeQueue(const int32_t size);
//Destructor
//Does nothing as its parent class will clean up everything
~SegmentMergeQueue();
//Closes and destroyes all SegmentMergeInfo Instances in the queue
void close();
protected:
//Overloaded method that implements the lessThan operator for the parent class
//This method is used by the parent class Priority queue to reorder its internal
//data structures. This implementation check if stiA is less than the current term of stiB.
bool lessThan(SegmentMergeInfo* stiA, SegmentMergeInfo* stiB);
};
CL_NS_END
#endif
|
