summaryrefslogtreecommitdiffstats
path: root/searchlib/src/apps
diff options
context:
space:
mode:
authorHenning Baldersheim <balder@yahoo-inc.com>2019-12-24 11:09:34 +0000
committerHenning Baldersheim <balder@yahoo-inc.com>2019-12-31 15:58:39 +0000
commit7d7b46f012b4f9bbd416f17a945204acc28c6ae5 (patch)
tree96a4cc5f82fea12b073e70522219c5c6b36ffbec /searchlib/src/apps
parent6d7909e022817be11b5f088cbd1e537d9b71919d (diff)
Add ExecutionInfo to propagate more information than just strictness to fetchPostings.
The estimated hitrate that each iterator will will enable smarter query evaluation. Especially will it be possible to figure out if static up front cost can be avoided.
Diffstat (limited to 'searchlib/src/apps')
-rw-r--r--searchlib/src/apps/tests/memoryindexstress_test.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/searchlib/src/apps/tests/memoryindexstress_test.cpp b/searchlib/src/apps/tests/memoryindexstress_test.cpp
index 1571cef630b..a7689cd6b9f 100644
--- a/searchlib/src/apps/tests/memoryindexstress_test.cpp
+++ b/searchlib/src/apps/tests/memoryindexstress_test.cpp
@@ -323,9 +323,9 @@ Fixture::readWork(uint32_t cnt)
} else {
++nonEmptyCount;
}
- result->fetchPostings(true);
+ result->fetchPostings(ExecuteInfo::TRUE);
SearchIterator::UP search = result->createSearch(*match_data, true);
- if (!EXPECT_TRUE(search.get() != 0)) {
+ if (!EXPECT_TRUE(search)) {
LOG(error, "Did not get search iterator");
break;
}
@@ -418,7 +418,7 @@ verifyResult(const FakeResult &expect,
EXPECT_EQUAL(expect.inspect().size(), result->getState().estimate().estHits);
EXPECT_EQUAL(expect.inspect().empty(), result->getState().estimate().empty);
- result->fetchPostings(true);
+ result->fetchPostings(ExecuteInfo::TRUE);
SearchIterator::UP search = result->createSearch(*match_data, true);
if (!EXPECT_TRUE(search.get() != 0)) {
return false;