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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
// Copyright Yahoo. 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/searchcore/proton/matching/partial_result.h>
#include <vespa/vespalib/util/box.h>
using proton::matching::PartialResult;
using namespace vespalib;
void checkMerge(const std::vector<double> &a, const std::vector<double> &b,
size_t maxHits, const std::vector<double> &expect)
{
PartialResult res_a(maxHits, false);
PartialResult res_b(maxHits, false);
for (size_t i = 0; i < a.size(); ++i) {
res_a.add(search::RankedHit(i, a[i]));
}
res_a.totalHits(a.size());
for (size_t i = 0; i < b.size(); ++i) {
res_b.add(search::RankedHit(i, b[i]));
}
res_b.totalHits(b.size());
res_a.merge(res_b);
EXPECT_EQUAL(a.size() + b.size(), res_a.totalHits());
ASSERT_EQUAL(expect.size(), res_a.size());
for (size_t i = 0; i < expect.size(); ++i) {
EXPECT_EQUAL(expect[i], res_a.hit(i).getRank());
}
}
void checkMerge(const std::vector<std::string> &a, const std::vector<std::string> &b,
size_t maxHits, const std::vector<std::string> &expect)
{
size_t len = 0;
PartialResult res_a(maxHits, true);
PartialResult res_b(maxHits, true);
len = 0;
for (size_t i = 0; i < a.size(); ++i) {
len += a[i].size();
res_a.add(search::RankedHit(i, 0.0), PartialResult::SortRef(a[i].data(), a[i].size()));
}
res_a.totalHits(a.size());
EXPECT_EQUAL(len, res_a.sortDataSize());
len = 0;
for (size_t i = 0; i < b.size(); ++i) {
len += b[i].size();
res_b.add(search::RankedHit(i, 0.0), PartialResult::SortRef(b[i].data(), b[i].size()));
}
res_b.totalHits(b.size());
EXPECT_EQUAL(len, res_b.sortDataSize());
res_a.merge(res_b);
EXPECT_EQUAL(a.size() + b.size(), res_a.totalHits());
ASSERT_EQUAL(expect.size(), res_a.size());
len = 0;
for (size_t i = 0; i < expect.size(); ++i) {
len += expect[i].size();
EXPECT_EQUAL(expect[i], std::string(res_a.sortData(i).first, res_a.sortData(i).second));
}
EXPECT_EQUAL(len, res_a.sortDataSize());
}
TEST("require that partial results can be created without sort data") {
PartialResult res(100, false);
EXPECT_EQUAL(0u, res.size());
EXPECT_EQUAL(100u, res.maxSize());
EXPECT_EQUAL(0u, res.totalHits());
EXPECT_FALSE(res.hasSortData());
EXPECT_EQUAL(0u, res.sortDataSize());
res.add(search::RankedHit(1, 10.0));
res.add(search::RankedHit(2, 5.0));
res.totalHits(1000);
EXPECT_EQUAL(1000u, res.totalHits());
ASSERT_EQUAL(2u, res.size());
EXPECT_EQUAL(1u, res.hit(0).getDocId());
EXPECT_EQUAL(10.0, res.hit(0).getRank());
EXPECT_EQUAL(2u, res.hit(1).getDocId());
EXPECT_EQUAL(5.0, res.hit(1).getRank());
}
TEST("require that partial results can be created with sort data") {
std::string str1("aaa");
std::string str2("bbb");
PartialResult res(100, true);
EXPECT_EQUAL(0u, res.size());
EXPECT_EQUAL(100u, res.maxSize());
EXPECT_EQUAL(0u, res.totalHits());
EXPECT_TRUE(res.hasSortData());
EXPECT_EQUAL(0u, res.sortDataSize());
res.add(search::RankedHit(1, 10.0), PartialResult::SortRef(str1.data(), str1.size()));
res.add(search::RankedHit(2, 5.0), PartialResult::SortRef(str2.data(), str2.size()));
res.totalHits(1000);
EXPECT_EQUAL(1000u, res.totalHits());
ASSERT_EQUAL(2u, res.size());
EXPECT_EQUAL(1u, res.hit(0).getDocId());
EXPECT_EQUAL(10.0, res.hit(0).getRank());
EXPECT_EQUAL(str1.data(), res.sortData(0).first);
EXPECT_EQUAL(str1.size(), res.sortData(0).second);
EXPECT_EQUAL(2u, res.hit(1).getDocId());
EXPECT_EQUAL(5.0, res.hit(1).getRank());
EXPECT_EQUAL(str2.data(), res.sortData(1).first);
EXPECT_EQUAL(str2.size(), res.sortData(1).second);
}
TEST("require that partial results without sort data are merged correctly") {
TEST_DO(checkMerge(make_box(5.0, 4.0, 3.0), make_box(4.5, 3.5), 3, make_box(5.0, 4.5, 4.0)));
TEST_DO(checkMerge(make_box(4.5, 3.5), make_box(5.0, 4.0, 3.0), 3, make_box(5.0, 4.5, 4.0)));
TEST_DO(checkMerge(make_box(1.0), make_box(2.0), 10, make_box(2.0, 1.0)));
TEST_DO(checkMerge(make_box(2.0), make_box(1.0), 10, make_box(2.0, 1.0)));
TEST_DO(checkMerge(std::vector<double>(), make_box(1.0), 10, make_box(1.0)));
TEST_DO(checkMerge(make_box(1.0), std::vector<double>(), 10, make_box(1.0)));
TEST_DO(checkMerge(std::vector<double>(), make_box(1.0), 0, std::vector<double>()));
TEST_DO(checkMerge(make_box(1.0), std::vector<double>(), 0, std::vector<double>()));
TEST_DO(checkMerge(std::vector<double>(), std::vector<double>(), 10, std::vector<double>()));
}
TEST("require that partial results with sort data are merged correctly") {
TEST_DO(checkMerge(make_box<std::string>("a", "c", "e"), make_box<std::string>("b", "d"), 3, make_box<std::string>("a", "b", "c")));
TEST_DO(checkMerge(make_box<std::string>("b", "d"), make_box<std::string>("a", "c", "e"), 3, make_box<std::string>("a", "b", "c")));
TEST_DO(checkMerge(make_box<std::string>("a"), make_box<std::string>("aa"), 10, make_box<std::string>("a", "aa")));
TEST_DO(checkMerge(make_box<std::string>("aa"), make_box<std::string>("a"), 10, make_box<std::string>("a", "aa")));
TEST_DO(checkMerge(std::vector<std::string>(), make_box<std::string>("a"), 10, make_box<std::string>("a")));
TEST_DO(checkMerge(make_box<std::string>("a"), std::vector<std::string>(), 10, make_box<std::string>("a")));
TEST_DO(checkMerge(std::vector<std::string>(), make_box<std::string>("a"), 0, std::vector<std::string>()));
TEST_DO(checkMerge(make_box<std::string>("a"), std::vector<std::string>(), 0, std::vector<std::string>()));
TEST_DO(checkMerge(std::vector<std::string>(), std::vector<std::string>(), 10, std::vector<std::string>()));
}
TEST("require that lower docid is preferred when sorting on rank") {
PartialResult res_a(1, false);
PartialResult res_b(1, false);
PartialResult res_c(1, false);
res_a.add(search::RankedHit(2, 1.0));
res_b.add(search::RankedHit(3, 1.0));
res_c.add(search::RankedHit(1, 1.0));
res_a.merge(res_b);
ASSERT_EQUAL(1u, res_a.size());
EXPECT_EQUAL(2u, res_a.hit(0).getDocId());
res_a.merge(res_c);
ASSERT_EQUAL(1u, res_a.size());
EXPECT_EQUAL(1u, res_a.hit(0).getDocId());
}
TEST("require that lower docid is preferred when using sortspec") {
std::string foo("foo");
PartialResult res_a(1, true);
PartialResult res_b(1, true);
PartialResult res_c(1, true);
res_a.add(search::RankedHit(2, 1.0), PartialResult::SortRef(foo.data(), foo.size()));
res_b.add(search::RankedHit(3, 1.0), PartialResult::SortRef(foo.data(), foo.size()));
res_c.add(search::RankedHit(1, 1.0), PartialResult::SortRef(foo.data(), foo.size()));
res_a.merge(res_b);
ASSERT_EQUAL(1u, res_a.size());
EXPECT_EQUAL(2u, res_a.hit(0).getDocId());
res_a.merge(res_c);
ASSERT_EQUAL(1u, res_a.size());
EXPECT_EQUAL(1u, res_a.hit(0).getDocId());
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
