summaryrefslogtreecommitdiffstats
path: root/searchcore/src/tests/proton/feed_and_search
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 /searchcore/src/tests/proton/feed_and_search
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 'searchcore/src/tests/proton/feed_and_search')
-rw-r--r--searchcore/src/tests/proton/feed_and_search/feed_and_search.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/searchcore/src/tests/proton/feed_and_search/feed_and_search.cpp b/searchcore/src/tests/proton/feed_and_search/feed_and_search.cpp
index 4580865b3a4..ca45108b698 100644
--- a/searchcore/src/tests/proton/feed_and_search/feed_and_search.cpp
+++ b/searchcore/src/tests/proton/feed_and_search/feed_and_search.cpp
@@ -125,7 +125,7 @@ void Test::testSearch(Searchable &source,
SimpleStringTerm node(term, field_name, 0, search::query::Weight(0));
Blueprint::UP result = source.createBlueprint(requestContext,
FieldSpecList().add(FieldSpec(field_name, 0, handle)), node);
- result->fetchPostings(true);
+ result->fetchPostings(search::queryeval::ExecuteInfo::TRUE);
SearchIterator::UP search_iterator =
result->createSearch(*match_data, true);
search_iterator->initFullRange();