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
|
// 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("document_reprocessing_handler_test");
#include <vespa/searchcore/proton/reprocessing/document_reprocessing_handler.h>
#include <vespa/searchlib/index/docbuilder.h>
#include <vespa/vespalib/testkit/testapp.h>
using namespace document;
using namespace proton;
using namespace search::index;
template <typename ReprocessingType, typename DocumentType>
struct MyProcessor : public ReprocessingType
{
typedef std::shared_ptr<MyProcessor<ReprocessingType, DocumentType> > SP;
uint32_t _lid;
DocumentId _docId;
MyProcessor() : _lid(0), _docId() {}
virtual void handleExisting(uint32_t lid, DocumentType doc) override {
_lid = lid;
_docId = doc.getId();
}
};
typedef MyProcessor<IReprocessingReader, const Document &> MyReader;
typedef MyProcessor<IReprocessingRewriter, Document &> MyRewriter;
const vespalib::string DOC_ID = "id:test:searchdocument::0";
struct FixtureBase
{
DocumentReprocessingHandler _handler;
DocBuilder _docBuilder;
FixtureBase(uint32_t docIdLimit);
~FixtureBase();
Document::UP createDoc() {
return _docBuilder.startDocument(DOC_ID).endDocument();
}
};
FixtureBase::FixtureBase(uint32_t docIdLimit)
: _handler(docIdLimit),
_docBuilder(Schema())
{ }
FixtureBase::~FixtureBase() {}
struct ReaderFixture : public FixtureBase
{
MyReader::SP _reader1;
MyReader::SP _reader2;
ReaderFixture()
: ReaderFixture(std::numeric_limits<uint32_t>::max())
{
}
ReaderFixture(uint32_t docIdLimit)
: FixtureBase(docIdLimit),
_reader1(new MyReader()),
_reader2(new MyReader())
{
_handler.addReader(_reader1);
_handler.addReader(_reader2);
}
};
struct RewriterFixture : public FixtureBase
{
MyRewriter::SP _rewriter1;
MyRewriter::SP _rewriter2;
RewriterFixture()
: RewriterFixture(std::numeric_limits<uint32_t>::max())
{
}
RewriterFixture(uint32_t docIdLimit)
: FixtureBase(docIdLimit),
_rewriter1(new MyRewriter()),
_rewriter2(new MyRewriter())
{
_handler.addRewriter(_rewriter1);
_handler.addRewriter(_rewriter2);
}
};
TEST_F("require that handler propagates visit of existing document to readers", ReaderFixture)
{
f._handler.visit(23u, *f.createDoc());
EXPECT_EQUAL(23u, f._reader1->_lid);
EXPECT_EQUAL(DOC_ID, f._reader1->_docId.toString());
EXPECT_EQUAL(23u, f._reader2->_lid);
EXPECT_EQUAL(DOC_ID, f._reader2->_docId.toString());
}
TEST_F("require that handler propagates visit of existing document to rewriters", RewriterFixture)
{
f._handler.getRewriteVisitor().visit(23u, *f.createDoc());
EXPECT_EQUAL(23u, f._rewriter1->_lid);
EXPECT_EQUAL(DOC_ID, f._rewriter1->_docId.toString());
EXPECT_EQUAL(23u, f._rewriter2->_lid);
EXPECT_EQUAL(DOC_ID, f._rewriter2->_docId.toString());
}
TEST_F("require that handler skips out of range visit to readers",
ReaderFixture(10))
{
f._handler.visit(23u, *f.createDoc());
EXPECT_EQUAL(0u, f._reader1->_lid);
EXPECT_EQUAL(DocumentId().toString(), f._reader1->_docId.toString());
EXPECT_EQUAL(0u, f._reader2->_lid);
EXPECT_EQUAL(DocumentId().toString(), f._reader2->_docId.toString());
}
TEST_F("require that handler skips out of range visit to rewriters",
RewriterFixture(10))
{
f._handler.getRewriteVisitor().visit(23u, *f.createDoc());
EXPECT_EQUAL(0u, f._rewriter1->_lid);
EXPECT_EQUAL(DocumentId().toString(), f._rewriter1->_docId.toString());
EXPECT_EQUAL(0u, f._rewriter2->_lid);
EXPECT_EQUAL(DocumentId().toString(), f._rewriter2->_docId.toString());
}
TEST_MAIN()
{
TEST_RUN_ALL();
}
|