From f78b5b2f99f558f6467667ac76583178ac4fdeaf Mon Sep 17 00:00:00 2001 From: antoniofilipovic Date: Tue, 16 Aug 2022 17:24:36 +0200 Subject: [PATCH] fix build on test query_procedures_mgp_graph --- tests/unit/query_procedures_mgp_graph.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/tests/unit/query_procedures_mgp_graph.cpp b/tests/unit/query_procedures_mgp_graph.cpp index 63f16eae5..3354fe451 100644 --- a/tests/unit/query_procedures_mgp_graph.cpp +++ b/tests/unit/query_procedures_mgp_graph.cpp @@ -96,25 +96,25 @@ size_t CountMaybeIterables(TMaybeIterable &&maybe_iterable) { void CheckEdgeCountBetween(const MgpVertexPtr &from, const MgpVertexPtr &to, const size_t number_of_edges_between) { EXPECT_EQ(CountMaybeIterables(std::visit( memgraph::utils::Overloaded{ - [vertex](auto impl) { return impl->InEdges(memgraph::storage::View::NEW); }, + [](auto impl) { return impl.InEdges(memgraph::storage::View::NEW); }, }, from->impl)), 0); EXPECT_EQ(CountMaybeIterables(std::visit( memgraph::utils::Overloaded{ - [vertex](auto impl) { return impl->OutEdges(memgraph::storage::View::NEW); }, + [](auto impl) { return impl.OutEdges(memgraph::storage::View::NEW); }, }, from->impl)), number_of_edges_between); EXPECT_EQ(CountMaybeIterables(std::visit( memgraph::utils::Overloaded{ - [vertex](auto impl) { return impl->InEdges(memgraph::storage::View::NEW); }, + [](auto impl) { return impl.InEdges(memgraph::storage::View::NEW); }, }, to->impl)), number_of_edges_between); EXPECT_EQ(CountMaybeIterables(std::visit( memgraph::utils::Overloaded{ - [vertex](auto impl) { return impl->OutEdges(memgraph::storage::View::NEW); }, + [](auto impl) { return impl.OutEdges(memgraph::storage::View::NEW); }, }, to->impl)), 0);