diff options
| author | Håvard Pettersen <havardpe@yahooinc.com> | 2024-02-06 14:51:08 +0000 |
|---|---|---|
| committer | Håvard Pettersen <havardpe@yahooinc.com> | 2024-02-06 14:51:08 +0000 |
| commit | a6948ade3670315acfeeae6f92c8c8c75e19dbe5 (patch) | |
| tree | 1e994e43583c277f06f0680ec6fc5d7c4f710fe3 /searchcore/src | |
| parent | d7a8e66652a1b338760c52eabfce42e541be7a28 (diff) | |
make default flow stats more explicit
for both simple and complex leafs
account for number of inner children in complex leafs
account for seek nesting for complex leafs with children
Diffstat (limited to 'searchcore/src')
| -rw-r--r-- | searchcore/src/tests/proton/matching/match_phase_limiter/match_phase_limiter_test.cpp | 3 | ||||
| -rw-r--r-- | searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp | 3 |
2 files changed, 6 insertions, 0 deletions
diff --git a/searchcore/src/tests/proton/matching/match_phase_limiter/match_phase_limiter_test.cpp b/searchcore/src/tests/proton/matching/match_phase_limiter/match_phase_limiter_test.cpp index 824ee891873..5e10d12e16f 100644 --- a/searchcore/src/tests/proton/matching/match_phase_limiter/match_phase_limiter_test.cpp +++ b/searchcore/src/tests/proton/matching/match_phase_limiter/match_phase_limiter_test.cpp @@ -75,6 +75,9 @@ struct MockBlueprint : SimpleLeafBlueprint { { setEstimate(HitEstimate(756, false)); } + search::queryeval::FlowStats calculate_flow_stats(uint32_t docid_limit) const override { + return default_flow_stats(docid_limit, 756, 0); + } SearchIterator::UP createLeafSearch(const TermFieldMatchDataArray &tfmda, bool strict) const override { if (postings_fetched) { diff --git a/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp b/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp index c434203898e..3f533fea28d 100644 --- a/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp +++ b/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp @@ -205,6 +205,9 @@ private: } return search::BitVectorIterator::create(&_activeLids, get_docid_limit(), *tfmd, strict); } + FlowStats calculate_flow_stats(uint32_t docid_limit) const override { + return default_flow_stats(docid_limit, _activeLids.size(), 0); + } SearchIterator::UP createLeafSearch(const TermFieldMatchDataArray &tfmda, bool strict) const override { |