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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "wand_bench_setup.hpp"
using namespace rise;
namespace {
constexpr uint32_t NUM_CHILDREN=300;
constexpr uint32_t LIMIT = 5000000;
template <typename WeakAndType, typename RiseType>
void checkWandHits(WandFactory &vespa, WandFactory &rise, uint32_t step, uint32_t filter) {
WandSetup vespaSetup(vespa, NUM_CHILDREN, LIMIT);
WandSetup riseSetup(rise, NUM_CHILDREN, LIMIT);
SearchIterator::UP s1 = vespaSetup.create();
s1->initFullRange();
SearchIterator::UP s2 = riseSetup.create();
s2->initFullRange();
ASSERT_TRUE(dynamic_cast<WeakAndType*>(s1.get()) != 0);
ASSERT_TRUE(dynamic_cast<WeakAndType*>(s2.get()) == 0);
ASSERT_TRUE(dynamic_cast<RiseType*>(s2.get()) != 0);
ASSERT_TRUE(dynamic_cast<RiseType*>(s1.get()) == 0);
s1->seek(1);
s2->seek(1);
while (!s1->isAtEnd() &&
!s2->isAtEnd())
{
ASSERT_EQUAL(s1->getDocId(), s2->getDocId());
if ((filter == 0) || ((s1->getDocId() % filter) != 0)) {
s1->unpack(s1->getDocId());
s2->unpack(s2->getDocId());
}
s1->seek(s1->getDocId() + step);
s2->seek(s2->getDocId() + step);
}
ASSERT_TRUE(s1->isAtEnd());
ASSERT_TRUE(s2->isAtEnd());
}
} // namespace <unnamed>
TEST("require that mod search works") {
Stats stats;
auto search = std::make_unique<ModSearch>(stats, 3, 8, 3, nullptr);
SimpleResult hits;
hits.search(*search);
EXPECT_EQUAL(SimpleResult().addHit(3).addHit(6), hits);
}
//---- WeakAndSearch ------------------------------------------------------------------------------
TEST_FF("require that (array) WAND and RISE WAND gives the same hits",
VespaArrayWandFactory(NUM_CHILDREN), TermFrequencyRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<WeakAndSearch, TermFrequencyRiseWand>(f1, f2, 1, 0);
}
TEST_FF("require that (heap) WAND and RISE WAND gives the same hits",
VespaHeapWandFactory(NUM_CHILDREN), TermFrequencyRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<WeakAndSearch, TermFrequencyRiseWand>(f1, f2, 1, 0);
}
TEST_FF("require that (array) WAND and RISE WAND gives the same hits with filtering and skipping",
VespaArrayWandFactory(NUM_CHILDREN), TermFrequencyRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<WeakAndSearch, TermFrequencyRiseWand>(f1, f2, 123, 5);
}
TEST_FF("require that (heap) WAND and RISE WAND gives the same hits with filtering and skipping",
VespaHeapWandFactory(NUM_CHILDREN), TermFrequencyRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<WeakAndSearch, TermFrequencyRiseWand>(f1, f2, 123, 5);
}
//---- ParallelWeakAndSearch ----------------------------------------------------------------------
TEST_FF("require that (array) PWAND and RISE WAND gives the same hits",
VespaParallelArrayWandFactory(NUM_CHILDREN), DotProductRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<ParallelWeakAndSearch, DotProductRiseWand>(f1, f2, 1, 0);
}
TEST_FF("require that (heap) PWAND and RISE WAND gives the same hits",
VespaParallelHeapWandFactory(NUM_CHILDREN), DotProductRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<ParallelWeakAndSearch, DotProductRiseWand>(f1, f2, 1, 0);
}
TEST_FF("require that (array) PWAND and RISE WAND gives the same hits with filtering and skipping",
VespaParallelArrayWandFactory(NUM_CHILDREN), DotProductRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<ParallelWeakAndSearch, DotProductRiseWand>(f1, f2, 123, 5);
}
TEST_FF("require that (heap) PWAND and RISE WAND gives the same hits with filtering and skipping",
VespaParallelHeapWandFactory(NUM_CHILDREN), DotProductRiseWandFactory(NUM_CHILDREN))
{
checkWandHits<ParallelWeakAndSearch, DotProductRiseWand>(f1, f2, 123, 5);
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
