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
|
// Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/log/log.h>
LOG_SETUP("search_path_test");
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/searchcore/fdispatch/search/search_path.h>
#include <vespa/searchcore/fdispatch/search/fnet_search.h>
#include <iostream>
using namespace fdispatch;
template <typename T>
vespalib::string
toString(const T &val)
{
std::ostringstream oss;
oss << "[";
bool first = true;
for (auto v : val) {
if (!first) oss << ",";
oss << v;
first = false;
}
oss << "]";
return oss.str();
}
void
assertParts(const std::vector<size_t> &exp, const SearchPath::NodeList &act)
{
std::string expStr = toString(exp);
std::string actStr = toString(act);
std::cout << "assertParts(" << expStr << "," << actStr << ")" << std::endl;
EXPECT_EQUAL(expStr, actStr);
}
void
assertElement(const std::vector<size_t> &parts, size_t row, const SearchPath::Element &elem)
{
assertParts(parts, elem.nodes());
EXPECT_TRUE(elem.hasRow());
EXPECT_EQUAL(row, elem.row());
}
void
assertElement(const std::vector<size_t> &parts, const SearchPath::Element &elem)
{
assertParts(parts, elem.nodes());
EXPECT_FALSE(elem.hasRow());
}
void
assertSinglePath(const std::vector<size_t> &parts, const vespalib::string &spec, size_t numNodes=0)
{
SearchPath p(spec, numNodes);
EXPECT_EQUAL(1u, p.elements().size());
assertElement(parts, p.elements().front());
}
void
assertSinglePath(const std::vector<size_t> &parts, size_t row, const vespalib::string &spec, size_t numNodes=0)
{
SearchPath p(spec, numNodes);
EXPECT_EQUAL(1u, p.elements().size());
assertElement(parts, row, p.elements().front());
}
TEST("requireThatSinglePartCanBeSpecified")
{
assertSinglePath({0}, "0/");
}
TEST("requireThatMultiplePartsCanBeSpecified")
{
assertSinglePath({1,3,5}, "1,3,5/");
}
TEST("requireThatRangePartsCanBeSpecified")
{
assertSinglePath({1,2,3}, "[1,4>/", 6);
}
TEST("requireThatAllPartsCanBeSpecified")
{
assertSinglePath({0,1,2,3}, "*/", 4);
}
TEST("requireThatRowCanBeSpecified")
{
assertSinglePath({1}, 2, "1/2");
}
TEST("requireThatMultipleSimpleElementsCanBeSpecified")
{
SearchPath p("0/1;2/3", 3);
EXPECT_EQUAL(2u, p.elements().size());
assertElement({0}, 1, p.elements()[0]);
assertElement({2}, 3, p.elements()[1]);
}
TEST("requireThatMultipleComplexElementsCanBeSpecified")
{
SearchPath p("0,2,4/1;1,3,5/3", 6);
EXPECT_EQUAL(2u, p.elements().size());
assertElement({0,2,4}, 1, p.elements()[0]);
assertElement({1,3,5}, 3, p.elements()[1]);
}
TEST("requireThatMultipleElementsWithoutRowsCanBeSpecified")
{
SearchPath p("0/;1/", 2);
EXPECT_EQUAL(2u, p.elements().size());
assertElement({0}, p.elements()[0]);
assertElement({1}, p.elements()[1]);
}
TEST("require that sizeof FastS_FNET_SearchNode is reasonable")
{
EXPECT_EQUAL(240u, sizeof(FastS_FNET_SearchNode));
EXPECT_EQUAL(40u, sizeof(search::common::SortDataIterator));
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
