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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/searchlib/query/streaming/phrase_query_node.h>
#include <vespa/searchlib/query/streaming/query.h>
#include <vespa/searchlib/query/streaming/queryterm.h>
#include <vespa/searchlib/query/tree/querybuilder.h>
#include <vespa/searchlib/query/tree/simplequery.h>
#include <vespa/searchlib/query/tree/stackdumpcreator.h>
#include <vespa/vespalib/gtest/gtest.h>
using search::query::QueryBuilder;
using search::query::Node;
using search::query::SimpleQueryNodeTypes;
using search::query::StackDumpCreator;
using search::query::Weight;
using search::streaming::HitList;
using search::streaming::PhraseQueryNode;
using search::streaming::Query;
using search::streaming::QueryTerm;
using search::streaming::QueryNodeRefList;
using search::streaming::QueryNodeResultFactory;
using search::streaming::QueryTermList;
TEST(PhraseQueryNodeTest, test_phrase_evaluate)
{
QueryBuilder<SimpleQueryNodeTypes> builder;
builder.addPhrase(3, "", 0, Weight(0));
{
builder.addStringTerm("a", "", 0, Weight(0));
builder.addStringTerm("b", "", 0, Weight(0));
builder.addStringTerm("c", "", 0, Weight(0));
}
Node::UP node = builder.build();
vespalib::string stackDump = StackDumpCreator::create(*node);
QueryNodeResultFactory empty;
Query q(empty, stackDump);
QueryNodeRefList phrases;
q.getPhrases(phrases);
QueryTermList terms;
q.getLeaves(terms);
for (QueryTerm * qt : terms) {
qt->resizeFieldId(1);
}
// field 0
terms[0]->add(0, 0, 1, 0);
terms[1]->add(0, 0, 1, 1);
terms[2]->add(0, 0, 1, 2);
terms[0]->add(0, 0, 1, 7);
terms[1]->add(0, 1, 1, 8);
terms[2]->add(0, 0, 1, 9);
// field 1
terms[0]->add(1, 0, 1, 4);
terms[1]->add(1, 0, 1, 5);
terms[2]->add(1, 0, 1, 6);
// field 2 (not complete match)
terms[0]->add(2, 0, 1, 1);
terms[1]->add(2, 0, 1, 2);
terms[2]->add(2, 0, 1, 4);
// field 3
terms[0]->add(3, 0, 1, 0);
terms[1]->add(3, 0, 1, 1);
terms[2]->add(3, 0, 1, 2);
// field 4 (not complete match)
terms[0]->add(4, 0, 1, 1);
terms[1]->add(4, 0, 1, 2);
// field 5 (not complete match)
terms[0]->add(5, 0, 1, 2);
terms[1]->add(5, 0, 1, 1);
terms[2]->add(5, 0, 1, 0);
HitList hits;
auto * p = static_cast<PhraseQueryNode *>(phrases[0]);
p->evaluateHits(hits);
ASSERT_EQ(3u, hits.size());
EXPECT_EQ(0u, hits[0].field_id());
EXPECT_EQ(0u, hits[0].element_id());
EXPECT_EQ(2u, hits[0].position());
EXPECT_EQ(1u, hits[1].field_id());
EXPECT_EQ(0u, hits[1].element_id());
EXPECT_EQ(6u, hits[1].position());
EXPECT_EQ(3u, hits[2].field_id());
EXPECT_EQ(0u, hits[2].element_id());
EXPECT_EQ(2u, hits[2].position());
ASSERT_EQ(4u, p->getFieldInfoSize());
EXPECT_EQ(0u, p->getFieldInfo(0).getHitOffset());
EXPECT_EQ(1u, p->getFieldInfo(0).getHitCount());
EXPECT_EQ(1u, p->getFieldInfo(1).getHitOffset());
EXPECT_EQ(1u, p->getFieldInfo(1).getHitCount());
EXPECT_EQ(0u, p->getFieldInfo(2).getHitOffset()); // invalid, but will never be used
EXPECT_EQ(0u, p->getFieldInfo(2).getHitCount());
EXPECT_EQ(2u, p->getFieldInfo(3).getHitOffset());
EXPECT_EQ(1u, p->getFieldInfo(3).getHitCount());
EXPECT_TRUE(p->evaluate());
}
GTEST_MAIN_RUN_ALL_TESTS()
|
