Publish

1 files changed, 80 insertions, 0 deletions

diff --git a/searchlib/src/tests/predicate/predicate_interval_posting_list_test.cpp b/searchlib/src/tests/predicate/predicate_interval_posting_list_test.cpp
new file mode 100644
index 00000000000..1c44c096717
--- /dev/null
+++ b/searchlib/src/tests/predicate/predicate_interval_posting_list_test.cpp
@@ -0,0 +1,80 @@
+// Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
+// Unit tests for predicate_interval_posting_list.
+
+#include <vespa/log/log.h>
+LOG_SETUP("predicate_interval_posting_list_test");
+#include <vespa/fastos/fastos.h>
+
+#include <vespa/searchlib/predicate/predicate_tree_annotator.h>
+#include <vespa/searchlib/predicate/predicate_interval_posting_list.h>
+#include <vespa/vespalib/testkit/testapp.h>
+
+using namespace search;
+using namespace search::predicate;
+namespace {
+
+struct DummyDocIdLimitProvider : public DocIdLimitProvider {
+    virtual uint32_t getDocIdLimit() const { return 10000; }
+    virtual uint32_t getCommittedDocIdLimit() const { return 10000; }
+};
+
+vespalib::GenerationHandler generation_handler;
+vespalib::GenerationHolder generation_holder;
+DummyDocIdLimitProvider limit_provider;
+SimpleIndexConfig config;
+const uint64_t hash = 0x123;
+
+TEST("require that empty posting list starts at 0.") {
+    PredicateIndex index(generation_handler, generation_holder, limit_provider, config, 8);
+    btree::EntryRef ref;
+    PredicateIntervalPostingList<PredicateIndex::BTreeIterator>
+    posting_list(index.getIntervalStore(), index.getIntervalIndex().getBTreePostingList(ref));
+    EXPECT_EQUAL(0u, posting_list.getDocId());
+    EXPECT_EQUAL(0u, posting_list.getInterval());
+    EXPECT_FALSE(posting_list.next(0));
+}
+
+TEST("require that posting list can iterate.") {
+    PredicateIndex index(generation_handler, generation_holder, limit_provider, config, 8);
+    const auto &interval_index = index.getIntervalIndex();
+    for (uint32_t id = 1; id < 100; ++id) {
+        PredicateTreeAnnotations annotations(id);
+        auto &vec = annotations.interval_map[hash];
+        for (uint32_t i = 0; i < id; ++i) {
+            vec.push_back(Interval{(i + 1) << 16 | 0xffff});
+        }
+        index.indexDocument(id, annotations);
+    }
+    index.commit();
+    auto it = interval_index.lookup(hash);
+    ASSERT_TRUE(it.valid());
+    auto ref = it.getData();
+
+    PredicateIntervalPostingList<PredicateIndex::BTreeIterator>
+        posting_list(index.getIntervalStore(), interval_index.getBTreePostingList(ref));
+    EXPECT_EQUAL(0u, posting_list.getDocId());
+    EXPECT_EQUAL(0u, posting_list.getInterval());
+    EXPECT_TRUE(posting_list.next(0));
+    EXPECT_EQUAL(1u, posting_list.getDocId());
+    EXPECT_EQUAL(0x0001ffffu, posting_list.getInterval());
+    ASSERT_FALSE(posting_list.nextInterval());
+    ASSERT_TRUE(posting_list.next(1));
+    EXPECT_EQUAL(2u, posting_list.getDocId());
+    EXPECT_EQUAL(0x0001ffffu, posting_list.getInterval());
+    ASSERT_TRUE(posting_list.nextInterval());
+    EXPECT_EQUAL(0x0002ffffu, posting_list.getInterval());
+    ASSERT_FALSE(posting_list.nextInterval());
+
+    ASSERT_TRUE(posting_list.next(50));
+    EXPECT_EQUAL(51u, posting_list.getDocId());
+    for (uint32_t i = 0; i < 50; ++i) {
+        EXPECT_EQUAL((i + 1) << 16 | 0xffff, posting_list.getInterval());
+        ASSERT_TRUE(posting_list.nextInterval());
+    }
+    EXPECT_EQUAL(0x0033ffffu, posting_list.getInterval());
+    ASSERT_FALSE(posting_list.nextInterval());
+}
+
+}  // namespace
+
+TEST_MAIN() { TEST_RUN_ALL(); }