diff --git a/src/engine/PathSearch.cpp b/src/engine/PathSearch.cpp index 3135fa00e..fba074fe1 100644 --- a/src/engine/PathSearch.cpp +++ b/src/engine/PathSearch.cpp @@ -87,8 +87,8 @@ bool PathSearch::knownEmptyResult() { return subtree_->knownEmptyResult(); }; vector PathSearch::resultSortedOn() const { return {}; }; // _____________________________________________________________________________ -ResultTable PathSearch::computeResult() { - shared_ptr subRes = subtree_->getResult(); +Result PathSearch::computeResult([[maybe_unused]] bool requestLaziness) { + std::shared_ptr subRes = subtree_->getResult(); IdTable idTable{allocator()}; idTable.setNumColumns(getResultWidth()); diff --git a/src/engine/PathSearch.h b/src/engine/PathSearch.h index c8876acca..f7ad8c4b1 100644 --- a/src/engine/PathSearch.h +++ b/src/engine/PathSearch.h @@ -96,7 +96,7 @@ class PathSearch : public Operation { vector resultSortedOn() const override; - ResultTable computeResult() override; + Result computeResult([[maybe_unused]] bool requestLaziness) override; VariableToColumnMap computeVariableToColumnMap() const override; private: diff --git a/test/PathSearchTest.cpp b/test/PathSearchTest.cpp index f6912100b..8d04c001a 100644 --- a/test/PathSearchTest.cpp +++ b/test/PathSearchTest.cpp @@ -6,7 +6,7 @@ #include "engine/PathSearch.h" #include "engine/QueryExecutionTree.h" -#include "engine/ResultTable.h" +#include "engine/Result.h" #include "engine/ValuesForTesting.h" #include "gmock/gmock.h" #include "util/IdTableHelpers.h" @@ -22,14 +22,14 @@ using Vars = std::vector>; } // namespace -ResultTable performPathSearch(PathSearchConfiguration config, IdTable input, +Result performPathSearch(PathSearchConfiguration config, IdTable input, Vars vars) { auto qec = getQec(); auto subtree = ad_utility::makeExecutionTree( qec, std::move(input), vars); PathSearch p = PathSearch(qec, std::move(subtree), config); - return p.computeResult(); + return p.computeResult(false); } TEST(PathSearchTest, constructor) {