(self, expect_effect=True)
| 685 | self.assert_graph_eq() |
| 686 | |
| 687 | def test11_delete_node_effect(self, expect_effect=True): |
| 688 | # test the deletion of a node by an effect |
| 689 | |
| 690 | # no leftovers from previous test |
| 691 | self.env.assertFalse(self.monitor_containt_effect()) |
| 692 | |
| 693 | # using 'n' and 'x' to try and introduce "duplicated" deletions |
| 694 | q = "MATCH (n) WITH n as n, n as x DELETE n, x" |
| 695 | res = self.query_master_and_wait(q) |
| 696 | self.env.assertGreater(res.nodes_deleted, 1) |
| 697 | |
| 698 | if(expect_effect): |
| 699 | self.wait_for_effect() |
| 700 | else: |
| 701 | self.wait_for_query() |
| 702 | |
| 703 | self.assert_graph_eq() |
| 704 | |
| 705 | def test12_merge_node(self, expect_effect=True): |
| 706 | # test create and update of a node by an effect |
no test coverage detected