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
39
40
41
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "posting_priority_queue.h"
namespace search {
/*
* Provide priority queue semantics for a set of posting readers with
* merging to a posting writer.
*/
template <class Reader, class Writer>
class PostingPriorityQueueMerger : public PostingPriorityQueue<Reader>
{
uint32_t _merge_chunk;
public:
using Parent = PostingPriorityQueue<Reader>;
using Vector = typename Parent::Vector;
using Parent::_heap_limit;
using Parent::_vec;
using Parent::adjust;
using Parent::empty;
using Parent::lowest;
using Parent::setup;
PostingPriorityQueueMerger()
: Parent(),
_merge_chunk(0u)
{
}
void set_merge_chunk(uint32_t merge_chunk) { _merge_chunk = merge_chunk; }
void mergeHeap(Writer& writer, const IFlushToken& flush_token, uint32_t remaining_merge_chunk) __attribute__((noinline));
static void mergeOne(Writer& writer, Reader& reader, const IFlushToken &flush_token, uint32_t remaining_merge_chunk) __attribute__((noinline));
static void mergeTwo(Writer& writer, Reader& reader1, Reader& reader2, const IFlushToken& flush_token, uint32_t& remaining_merge_chunk) __attribute__((noinline));
static void mergeSmall(Writer& writer, typename Vector::iterator ib, typename Vector::iterator ie, const IFlushToken &flush_token, uint32_t& remaining_merge_chunk) __attribute__((noinline));
void merge(Writer& writer, const IFlushToken& flush_token) __attribute__((noinline));
};
}
|
