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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "equivsearch.h"
namespace search::queryeval {
template <bool strict>
class EquivImpl : public OrLikeSearch<strict, NoUnpack>
{
private:
fef::MatchData::UP _inputMatchData;
fef::TermMatchDataMerger _merger;
bool _valid;
protected:
void doUnpack(uint32_t docid) override;
public:
/**
* Create a new Equiv Search with the given children.
*
* @param children the search objects that should be equivalent
**/
EquivImpl(MultiSearch::Children children,
fef::MatchData::UP inputMatchData,
const fef::TermMatchDataMerger::Inputs &inputs,
const fef::TermFieldMatchDataArray &outputs);
};
template<bool strict>
EquivImpl<strict>::EquivImpl(MultiSearch::Children children,
fef::MatchData::UP inputMatchData,
const fef::TermMatchDataMerger::Inputs &inputs,
const fef::TermFieldMatchDataArray &outputs)
: OrLikeSearch<strict, NoUnpack>(std::move(children), NoUnpack()),
_inputMatchData(std::move(inputMatchData)),
_merger(inputs, outputs),
_valid(outputs.valid())
{
}
template<bool strict>
void
EquivImpl<strict>::doUnpack(uint32_t docid)
{
if (_valid) {
MultiSearch::doUnpack(docid);
_merger.merge(docid);
}
}
SearchIterator::UP
EquivSearch::create(Children children,
fef::MatchData::UP inputMatchData,
const fef::TermMatchDataMerger::Inputs &inputs,
const fef::TermFieldMatchDataArray &outputs,
bool strict)
{
if (strict) {
return std::make_unique<EquivImpl<true>>(std::move(children), std::move(inputMatchData), inputs, outputs);
} else {
return std::make_unique<EquivImpl<false>>(std::move(children), std::move(inputMatchData), inputs, outputs);
}
}
}
|
