blob: 49d5fb0f9fba85fc764e8fcd65ff914f22103630 (
plain) (
blame)
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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "same_element_query_node.h"
#include <cassert>
namespace search::streaming {
bool
SameElementQueryNode::evaluate() const {
HitList hl;
return ! evaluateHits(hl).empty();
}
void
SameElementQueryNode::addChild(QueryNode::UP child) {
assert(dynamic_cast<const QueryTerm *>(child.get()) != nullptr);
AndQueryNode::addChild(std::move(child));
}
const HitList &
SameElementQueryNode::evaluateHits(HitList & hl) const
{
hl.clear();
if ( !AndQueryNode::evaluate()) return hl;
HitList tmpHL;
const auto & children = getChildren();
unsigned int numFields = children.size();
unsigned int currMatchCount = 0;
std::vector<unsigned int> indexVector(numFields, 0);
auto curr = static_cast<const QueryTerm *> (children[currMatchCount].get());
bool exhausted( curr->evaluateHits(tmpHL).empty());
for (; !exhausted; ) {
auto next = static_cast<const QueryTerm *>(children[currMatchCount+1].get());
unsigned int & currIndex = indexVector[currMatchCount];
unsigned int & nextIndex = indexVector[currMatchCount+1];
const auto & currHit = curr->evaluateHits(tmpHL)[currIndex];
uint32_t currElemId = currHit.element_id();
const HitList & nextHL = next->evaluateHits(tmpHL);
size_t nextIndexMax = nextHL.size();
while ((nextIndex < nextIndexMax) && (nextHL[nextIndex].element_id() < currElemId)) {
nextIndex++;
}
if ((nextIndex < nextIndexMax) && (nextHL[nextIndex].element_id() == currElemId)) {
currMatchCount++;
if ((currMatchCount+1) == numFields) {
Hit h = nextHL[indexVector[currMatchCount]];
hl.emplace_back(h.field_id(), h.element_id(), h.element_weight(), 0);
currMatchCount = 0;
indexVector[0]++;
}
} else {
currMatchCount = 0;
indexVector[currMatchCount]++;
}
curr = static_cast<const QueryTerm *>(children[currMatchCount].get());
exhausted = (nextIndex >= nextIndexMax) || (indexVector[currMatchCount] >= curr->evaluateHits(tmpHL).size());
}
return hl;
}
}
|
