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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
// Copyright 2018 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/vespalib/util/stringfmt.h>
#include <vespa/searchlib/queryeval/leaf_blueprints.h>
#include <vespa/searchlib/queryeval/simpleresult.h>
#include <vespa/searchlib/queryeval/same_element_blueprint.h>
#include <vespa/searchlib/queryeval/same_element_search.h>
#include <vespa/searchlib/queryeval/emptysearch.h>
#include <vespa/searchcommon/attribute/i_search_context.h>
#include <vespa/searchlib/attribute/searchcontextelementiterator.h>
#include <vespa/vespalib/test/insertion_operators.h>
using namespace search::fef;
using namespace search::queryeval;
using search::attribute::SearchContextElementIterator;
void verify_elements(SameElementSearch &se, uint32_t docid, const std::initializer_list<uint32_t> list) {
std::vector<uint32_t> expect(list);
std::vector<uint32_t> actual;
se.find_matching_elements(docid, actual);
EXPECT_EQUAL(actual, expect);
}
std::unique_ptr<SameElementBlueprint> make_blueprint(const std::vector<FakeResult> &children, bool fake_attr = false) {
auto result = std::make_unique<SameElementBlueprint>("foo", false);
for (size_t i = 0; i < children.size(); ++i) {
uint32_t field_id = i;
vespalib::string field_name = vespalib::make_string("f%u", field_id);
FieldSpec field = result->getNextChildField(field_name, field_id);
auto fake = std::make_unique<FakeBlueprint>(field, children[i]);
fake->is_attr(fake_attr);
result->addTerm(std::move(fake));
}
return result;
}
Blueprint::UP finalize(Blueprint::UP bp, bool strict) {
Blueprint::UP result = Blueprint::optimize(std::move(bp));
result->fetchPostings(ExecuteInfo::create(strict));
result->freeze();
return result;
}
SimpleResult find_matches(const std::vector<FakeResult> &children) {
auto md = MatchData::makeTestInstance(0, 0);
auto bp = finalize(make_blueprint(children), false);
auto search = bp->createSearch(*md, false);
return SimpleResult().search(*search, 1000);
}
FakeResult make_result(const std::vector<std::pair<uint32_t,std::vector<uint32_t> > > &match_data) {
FakeResult result;
uint32_t pos_should_be_ignored = 0;
for (const auto &doc: match_data) {
result.doc(doc.first);
for (const auto &elem: doc.second) {
result.elem(elem).pos(++pos_should_be_ignored);
}
}
return result;
}
TEST("require that simple match can be found") {
auto a = make_result({{5, {1,3,7}}});
auto b = make_result({{5, {3,5,10}}});
SimpleResult result = find_matches({a, b});
SimpleResult expect({5});
EXPECT_EQUAL(result, expect);
}
TEST("require that matching elements can be identified") {
auto a = make_result({{5, {1,3,7,12}}, {10, {1,2,3}}});
auto b = make_result({{5, {3,5,7,10}}, {10, {4,5,6}}});
auto bp = finalize(make_blueprint({a,b}), false);
auto md = MatchData::makeTestInstance(0, 0);
auto search = bp->createSearch(*md, false);
search->initRange(1, 1000);
SameElementSearch *se = dynamic_cast<SameElementSearch*>(search.get());
ASSERT_TRUE(se != nullptr);
TEST_DO(verify_elements(*se, 5, {3, 7}));
TEST_DO(verify_elements(*se, 10, {}));
TEST_DO(verify_elements(*se, 20, {}));
}
TEST("require that children must match within same element") {
auto a = make_result({{5, {1,3,7}}});
auto b = make_result({{5, {2,5,10}}});
SimpleResult result = find_matches({a, b});
SimpleResult expect;
EXPECT_EQUAL(result, expect);
}
TEST("require that strict iterator seeks to next hit") {
auto md = MatchData::makeTestInstance(0, 0);
auto a = make_result({{5, {1,2}}, {7, {1,2}}, {8, {1,2}}, {9, {1,2}}});
auto b = make_result({{5, {3}}, {6, {1,2}}, {7, {2,4}}, {9, {1}}});
auto bp = finalize(make_blueprint({a,b}), true);
auto search = bp->createSearch(*md, true);
search->initRange(1, 1000);
EXPECT_LESS(search->getDocId(), 1u);
EXPECT_FALSE(search->seek(1));
EXPECT_EQUAL(search->getDocId(), 7u);
EXPECT_TRUE(search->seek(9));
EXPECT_EQUAL(search->getDocId(), 9u);
EXPECT_FALSE(search->seek(10));
EXPECT_TRUE(search->isAtEnd());
}
TEST("require that results are estimated appropriately") {
auto a = make_result({{5, {0}}, {5, {0}}, {5, {0}}});
auto b = make_result({{5, {0}}, {5, {0}}});
auto c = make_result({{5, {0}}, {5, {0}}, {5, {0}}, {5, {0}}});
auto bp = finalize(make_blueprint({a,b,c}), true);
EXPECT_EQUAL(bp->getState().estimate().estHits, 2u);
}
TEST("require that children are sorted") {
auto a = make_result({{5, {0}}, {5, {0}}, {5, {0}}});
auto b = make_result({{5, {0}}, {5, {0}}});
auto c = make_result({{5, {0}}, {5, {0}}, {5, {0}}, {5, {0}}});
auto bp = finalize(make_blueprint({a,b,c}), true);
EXPECT_EQUAL(dynamic_cast<SameElementBlueprint&>(*bp).terms()[0]->getState().estimate().estHits, 2u);
EXPECT_EQUAL(dynamic_cast<SameElementBlueprint&>(*bp).terms()[1]->getState().estimate().estHits, 3u);
EXPECT_EQUAL(dynamic_cast<SameElementBlueprint&>(*bp).terms()[2]->getState().estimate().estHits, 4u);
}
TEST("require that attribute iterators are wrapped for element unpacking") {
auto a = make_result({{5, {1,3,7}}});
auto b = make_result({{5, {3,5,10}}});
auto bp = finalize(make_blueprint({a,b}, true), true);
auto md = MatchData::makeTestInstance(0, 0);
auto search = bp->createSearch(*md, false);
SameElementSearch *se = dynamic_cast<SameElementSearch*>(search.get());
ASSERT_TRUE(se != nullptr);
ASSERT_EQUAL(se->children().size(), 2u);
EXPECT_TRUE(dynamic_cast<SearchContextElementIterator*>(se->children()[0].get()) != nullptr);
EXPECT_TRUE(dynamic_cast<SearchContextElementIterator*>(se->children()[1].get()) != nullptr);
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
