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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "searchhistory.h"
#include "trackedsearch.h"
#include <vespa/searchlib/queryeval/fake_search.h>
#include <vespa/searchlib/queryeval/searchiterator.h>
#include <string>
namespace search::queryeval::test {
/**
* Defines the hits to be returned by a wand-like subsearch and creates a TrackedSearch.
**/
struct LeafSpec
{
std::string name;
int32_t weight;
int32_t maxWeight;
FakeResult result;
SearchIterator::UP search;
LeafSpec(const std::string &n, int32_t w = 100)
: name(n),
weight(w),
maxWeight(std::numeric_limits<int32_t>::min()),
result(),
search()
{}
LeafSpec(LeafSpec && other) = default;
~LeafSpec() {}
LeafSpec && doc(uint32_t docid) && {
result.doc(docid);
return std::move(*this);
}
LeafSpec && doc(uint32_t docid, int32_t w) && {
result.doc(docid);
result.weight(w);
result.pos(0);
maxWeight = std::max(maxWeight, w);
return std::move(*this);
}
LeafSpec && itr(SearchIterator::UP si) && {
search = std::move(si);
return std::move(*this);
}
LeafSpec && itr(SearchIterator *si) && {
search.reset(si);
return std::move(*this);
}
SearchIterator::UP create(SearchHistory &hist, fef::TermFieldMatchData *tfmd) {
if (search) {
return SearchIterator::UP(new TrackedSearch(name, hist, std::move(search)));
} else if (tfmd != nullptr) {
return SearchIterator::UP(new TrackedSearch(name, hist, result, *tfmd,
MinMaxPostingInfo(0, maxWeight)));
}
return SearchIterator::UP(new TrackedSearch(name, hist, result,
MinMaxPostingInfo(0, maxWeight)));
}
};
}
|
