[E-merge < T674] Implement merge.node

cpp/merge_module/algorithm/merge.cpp

@@ -1,11 +1,102 @@
 #include "merge.hpp"
-
 #include <algorithm>
 #include <optional>
 #include <string_view>
 #include <unordered_map>
 #include "mgp.hpp"
 
+bool Merge::LabelsContained(const std::unordered_set<std::string_view> &labels, const mgp::Node &node) {
+  bool contained = false;
+  auto size = labels.size();  // this works if labels are unique, which they are
+  size_t counter = 0;
+
+  for (const auto label : node.Labels()) {
+    if (labels.find(label) != labels.end()) {
+      counter++;
+    }
+  }
+
+  if (counter == size) {
+    contained = true;
+  }
+
+  return contained;
+}
+
+bool Merge::IdentProp(const mgp::Map &identProp, const mgp::Node &node) {
+  bool match = true;
+  for (const auto &[key, value] : identProp) {
+    if (value != node.GetProperty(std::string(key))) {
+      match = false;
+    }
+  }
+  return match;
+}
+
+void Merge::Node(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_memory *memory) {
+  mgp::MemoryDispatcherGuard guard{memory};
+  const auto arguments = mgp::List(args);
+  const auto record_factory = mgp::RecordFactory(result);
+  try {
+    auto graph = mgp::Graph(memgraph_graph);
+    auto labels = arguments[0].ValueList();
+    auto identProp = arguments[1].ValueMap();
+    auto createProp = arguments[2].ValueMap();
+    auto matchProp = arguments[3].ValueMap();
+    std::unordered_set<std::string_view> label_set;
+    std::unordered_map<std::string_view, mgp::Value> identProp_map;
+    std::unordered_map<std::string_view, mgp::Value> createProp_map;
+    std::unordered_map<std::string_view, mgp::Value> matchProp_map;
+    /*conversion of mgp::Maps to unordered_map for easier use of SetProperties(it expects an unordered map as
+     * argument)*/
+    auto convert_to_map = [](const auto& source, auto& destination) {
+        for (const auto& [key, value] : source) {
+            destination.emplace(key, value);
+        }
+    };
+    convert_to_map(identProp, identProp_map);
+
+    convert_to_map(createProp, createProp_map);
+
+    convert_to_map(matchProp, matchProp_map);
+
+
+    /*creating a set of labels for O(1) check of labels*/
+    for (const auto elem : labels) {
+      const auto label = elem.ValueString();
+      if (label.empty()) {
+        throw mgp::ValueException("List of labels cannot contain empty string!");
+      }
+      label_set.insert(elem.ValueString());
+    }
+
+    bool matched = false;
+    for (auto node : graph.Nodes()) {
+      /*check if node already exists, if true, merge, if not, create*/
+      if (LabelsContained(label_set, node) && IdentProp(identProp, node)) {
+        matched = true;
+        node.SetProperties(matchProp_map);
+        auto record = record_factory.NewRecord();
+        record.Insert(std::string(kNodeRes).c_str(), node);
+      }
+    }
+    if (!matched) {
+      auto node = graph.CreateNode();
+      for (const auto label : label_set) {
+        node.AddLabel(label);
+      }
+      node.SetProperties(identProp_map);  // when merge creates it creates identyfing props also
+      node.SetProperties(createProp_map);
+      auto record = record_factory.NewRecord();
+      record.Insert(std::string(kNodeRes).c_str(), node);
+    }
+
+  } catch (const std::exception &e) {
+    record_factory.SetErrorMessage(e.what());
+    return;
+  }
+}
+
 namespace {
 
 template <typename T>

cpp/merge_module/algorithm/merge.hpp

@@ -2,6 +2,9 @@
 
 #include <mgp.hpp>
 
+#include <unordered_map>
+#include <unordered_set>
+
 namespace Merge {
 
 /* relationship constants */
@@ -14,6 +17,20 @@ constexpr const std::string_view kRelationshipArg5 = "endNode";
 constexpr const std::string_view kRelationshipArg6 = "onMatchProps";
 constexpr const std::string_view kRelationshipResult = "rel";
 
+/* node constants */
+constexpr std::string_view kProcedureNode = "node";
+constexpr std::string_view kNodeArg1 = "labels";
+constexpr std::string_view kNodeArg2 = "identProps";
+constexpr std::string_view kNodeArg3 = "createProps";
+constexpr std::string_view kNodeArg4 = "matchProps";
+constexpr std::string_view kNodeRes = "node";
+
 void Relationship(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_memory *memory);
 
+
+
+void Node(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_memory *memory);
+bool IdentProp(const mgp::Map &identProp, const mgp::Node &node);
+bool LabelsContained(const std::unordered_set<std::string_view> &labels, const mgp::Node &node);
+
 }  // namespace Merge

cpp/merge_module/merge_module.cpp

@@ -5,6 +5,12 @@
 extern "C" int mgp_init_module(struct mgp_module *module, struct mgp_memory *memory) {
   try {
     mgp::MemoryDispatcherGuard guard{memory};
+    AddProcedure(Merge::Node, std::string(Merge::kProcedureNode).c_str(), mgp::ProcedureType::Write,
+                 {mgp::Parameter(std::string(Merge::kNodeArg1).c_str(), {mgp::Type::List, mgp::Type::String}),
+                  mgp::Parameter(std::string(Merge::kNodeArg2).c_str(), {mgp::Type::Map, mgp::Type::Any}),
+                  mgp::Parameter(std::string(Merge::kNodeArg3).c_str(), {mgp::Type::Map, mgp::Type::Any}),
+                  mgp::Parameter(std::string(Merge::kNodeArg4).c_str(), {mgp::Type::Map, mgp::Type::Any})},
+                 {mgp::Return(std::string(Merge::kNodeRes).c_str(), mgp::Type::Node)}, module, memory);
 
     AddProcedure(Merge::Relationship, Merge::kProcedureRelationship, mgp::ProcedureType::Write,
                  {mgp::Parameter(Merge::kRelationshipArg1, mgp::Type::Node),

e2e_correctness/merge_test/test_node1/input.cyp

@@ -0,0 +1 @@
+CREATE (:Dog:Dog {name: "Rex", id:0}), (:Human:Employee {name: "Junior", id:1}),(:Human:Boss {name: "Senior", id:2})

e2e_correctness/merge_test/test_node1/test.yml

@@ -0,0 +1,5 @@
+memgraph_query: >
+  CALL merge.node(["Human"],{name: "Senior"},{},{name:"Boss"}) YIELD node RETURN node;
+
+neo4j_query: >
+  CALL apoc.merge.node(["Human"],{name: "Senior"},{},{name: "Boss"}) YIELD node;

e2e_correctness/merge_test/test_node2/input.cyp

@@ -0,0 +1 @@
+CREATE (:Dog:Dog {name: "Rex", id:0}), (:Human:Employee {name: "Rex", id:1}),(:Human:Boss {name: "Senior", id:2})

e2e_correctness/merge_test/test_node2/test.yml

@@ -0,0 +1,5 @@
+memgraph_query: >
+  CALL merge.node([],{name: "Rex"},{},{name:"Carlito"}) YIELD node RETURN node;
+
+neo4j_query: >
+  MERGE (n {name: "Rex" }) ON CREATE SET n += {} ON MATCH SET n += {name: "Carlito"} RETURN n;

e2e_correctness/merge_test/test_node3/input.cyp

@@ -0,0 +1 @@
+CREATE (:Dog:Dog {name: "Rex", id:0}), (:Human:Employee {name: "Junior", id:1}),(:Human:Boss {name: "Senior", id:2})

e2e_correctness/merge_test/test_node3/test.yml

@@ -0,0 +1,5 @@
+memgraph_query: >
+  CALL merge.node([],{},{},{graph:"this_one"}) YIELD node RETURN node;
+
+neo4j_query: >
+  MERGE (n) ON CREATE SET n += {} ON MATCH SET n += {graph:"this_one"} RETURN n;

e2e_correctness/merge_test/test_node4/input.cyp

@@ -0,0 +1 @@
+CREATE (:Dog:Dog {name: "Rex", id:0}), (:Human:Employee {name: "Junior", id:1}),(:Human:Boss {name: "Senior", id:2})

e2e_correctness/merge_test/test_node4/test.yml

@@ -0,0 +1,5 @@
+memgraph_query: >
+  CALL merge.node(["Dog"],{name: "Rico"},{height:199, id:9},{}) YIELD node RETURN node;
+
+neo4j_query: >
+  CALL apoc.merge.node(["Dog"],{name: "Rico"},{height:199, id:9},{}) YIELD node;

e2e_correctness/merge_test/test_node5/input.cyp

@@ -0,0 +1 @@
+CREATE (:Dog:Dog {name: "Rex", id:0}), (:Human:Employee {name: "Junior", id:1}),(:Human:Boss {name: "Senior", id:2})

e2e_correctness/merge_test/test_node5/test.yml

@@ -0,0 +1,5 @@
+memgraph_query: >
+  CALL merge.node(["Dog"],{name: "Rex"},{height:199},{graph:"this_one"}) YIELD node RETURN node;
+
+neo4j_query: >
+  CALL apoc.merge.node(["Dog"],{name: "Rex"},{height:124727},{graph:"this_one"}) YIELD node;

e2e_correctness/merge_test/test_node6/input.cyp

@@ -0,0 +1 @@
+CREATE (:Dog:Dog {name: "Rex", id:0}), (:Human:Boss {name: "", id:1}),(:Human:Boss {name: "", id:2})

e2e_correctness/merge_test/test_node6/test.yml

@@ -0,0 +1,5 @@
+memgraph_query: >
+  CALL merge.node(["Human","Boss"],{name: ""},{height:199},{name:"Le Boss"}) YIELD node RETURN node;
+
+neo4j_query: >
+  CALL apoc.merge.node(["Human","Boss"],{name: ""},{height:124727},{name:"Le Boss"}) YIELD node;