From c4f1199b80b920a8a06e0dfea8651c13c864660c Mon Sep 17 00:00:00 2001
From: Andi Skrgat <andi8647@gmail.com>
Date: Mon, 15 May 2023 12:48:19 +0200
Subject: [PATCH] Create set remove delete

---
 tests/unit/query_plan_create_set_remove_delete.cpp    | 8 ++++----
 tests/unit/query_plan_v2_create_set_remove_delete.cpp | 6 +++---
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/tests/unit/query_plan_create_set_remove_delete.cpp b/tests/unit/query_plan_create_set_remove_delete.cpp
index c53e7215d..64a20a0fc 100644
--- a/tests/unit/query_plan_create_set_remove_delete.cpp
+++ b/tests/unit/query_plan_create_set_remove_delete.cpp
@@ -292,7 +292,7 @@ TEST(QueryPlan, CreateExpand) {
     }
 
     for (auto vertex : dba.Vertices(memgraph::storage::View::OLD)) {
-      dba.PrefetchOutEdges();
+      dba.PrefetchOutEdges(vertex);
       auto maybe_edges = vertex.OutEdges(memgraph::storage::View::OLD);
       MG_ASSERT(maybe_edges.HasValue());
       for (auto edge : *maybe_edges) {
@@ -1132,7 +1132,7 @@ TEST(QueryPlan, SetProperty) {
 
   EXPECT_EQ(CountEdges(&dba, memgraph::storage::View::OLD), 2);
   for (auto vertex : dba.Vertices(memgraph::storage::View::OLD)) {
-    dba.PrefetchOutEdges();
+    dba.PrefetchOutEdges(vertex);
     auto maybe_edges = vertex.OutEdges(memgraph::storage::View::OLD);
     ASSERT_TRUE(maybe_edges.HasValue());
     for (auto edge : *maybe_edges) {
@@ -1189,7 +1189,7 @@ TEST(QueryPlan, SetProperties) {
 
     EXPECT_EQ(CountEdges(&dba, memgraph::storage::View::OLD), 1);
     for (auto vertex : dba.Vertices(memgraph::storage::View::OLD)) {
-      dba.PrefetchOutEdges();
+      dba.PrefetchOutEdges(vertex);
       auto maybe_edges = vertex.OutEdges(memgraph::storage::View::OLD);
       ASSERT_TRUE(maybe_edges.HasValue());
       for (auto edge : *maybe_edges) {
@@ -1378,7 +1378,7 @@ TEST(QueryPlan, RemoveProperty) {
 
   EXPECT_EQ(CountEdges(&dba, memgraph::storage::View::OLD), 2);
   for (auto vertex : dba.Vertices(memgraph::storage::View::OLD)) {
-    dba.PrefetchOutEdges();
+    dba.PrefetchOutEdges(vertex);
     auto maybe_edges = vertex.OutEdges(memgraph::storage::View::OLD);
     ASSERT_TRUE(maybe_edges.HasValue());
     for (auto edge : *maybe_edges) {
diff --git a/tests/unit/query_plan_v2_create_set_remove_delete.cpp b/tests/unit/query_plan_v2_create_set_remove_delete.cpp
index 8aea81eba..79c62cb43 100644
--- a/tests/unit/query_plan_v2_create_set_remove_delete.cpp
+++ b/tests/unit/query_plan_v2_create_set_remove_delete.cpp
@@ -46,8 +46,8 @@ TEST(QueryPlan, CreateNodeWithAttributes) {
     const auto &v = node_value.ValueVertex();
     EXPECT_TRUE(*v.HasLabel(memgraph::storage::View::NEW, label));
     EXPECT_EQ(v.GetProperty(memgraph::storage::View::NEW, property)->ValueInt(), 42);
-    dba->PrefetchInEdges();
-    dba->PrefetchOutEdges();
+    dba->PrefetchInEdges(v.impl_);
+    dba->PrefetchOutEdges(v.impl_);
     EXPECT_EQ(CountIterable(*v.InEdges(memgraph::storage::View::NEW)), 0);
     EXPECT_EQ(CountIterable(*v.OutEdges(memgraph::storage::View::NEW)), 0);
     // Invokes LOG(FATAL) instead of erroring out.
@@ -115,7 +115,7 @@ TEST(QueryPlan, ScanAllByLabel) {
     // Add labeled vertices
     for (int i = 0; i < 42; ++i) {
       auto v = dba->CreateVertex();
-      ASSERT_TRUE(v->AddLabel(label).HasValue());
+      ASSERT_TRUE(v.AddLabel(label).HasValue());
     }
     EXPECT_FALSE(dba->Commit().HasError());
   }