OpenCypher regression test - RETURN clause (#2301)

* add return[1-3].test * add return[5-8].test * add missing "-SKIP" * fix return6.test scenarios 17-21 --------- Co-authored-by: Russell Liu <russell.liu@uwaterloo.ca>
kuzudb · Nov 27, 2023 · 0e1edec · 0e1edec
1 parent 8d87c16
commit 0e1edec
Show file tree

Hide file tree

Showing 7 changed files with 632 additions and 0 deletions.
diff --git a/test/test_files/tck/return/return1.test b/test/test_files/tck/return/return1.test
@@ -0,0 +1,22 @@
+-GROUP TCKReturn1
+-DATASET CSV tck
+
+--
+
+# Returning a list property
+-CASE Scenario1
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, numbers INT64[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {numbers: [1, 2, 3]});
+---- ok
+-STATEMENT MATCH (n) RETURN n;
+---- 1
+{_ID: 0:0, _LABEL: A, ID: 0, numbers: [1,2,3]}
+
+# Fail when returning an undefined variable
+-CASE Scenario2
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT MATCH () RETURN foo;
+---- error
+Binder exception: Variable foo is not in scope.
diff --git a/test/test_files/tck/return/return2.test b/test/test_files/tck/return/return2.test
@@ -0,0 +1,204 @@
+-GROUP TCKReturn2
+-DATASET CSV tck
+
+--
+
+# Arithmetic expressions should propagate null values
+-CASE Scenario1
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT RETURN 1 + (2 - (3 * (4 / (5 ^ (6 % null))))) AS a;
+---- 1
+
+
+# Returning a node property value
+-CASE Scenario2
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, num INT64, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {num: 1});
+---- ok
+-STATEMENT MATCH (a) RETURN a.num;
+---- 1
+1
+
+# Missing node property should become null
+-CASE Scenario3
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, num INT64, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {num: 1});
+---- ok
+-STATEMENT MATCH (a) RETURN a.name;
+---- 1
+
+
+# Returning a relationship property value
+-CASE Scenario4
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE REL TABLE T(FROM A TO A, num INT64);
+---- ok
+-STATEMENT CREATE (:A)-[:T {num: 1}]->(:A);
+---- ok
+-STATEMENT MATCH ()-[r]->() RETURN r.num;
+---- 1
+1
+
+# Missing relationship property should become null
+-CASE Scenario5
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE REL TABLE T(FROM A TO A, name INT64);
+---- ok
+-STATEMENT CREATE (:A)-[:T {name: 1}]->(:A);
+---- ok
+-STATEMENT MATCH ()-[r]->() RETURN r.name2;
+---- 1
+
+
+# Adding a property and a literal in projection
+-CASE Scenario6
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, num INT64, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {num: 1});
+---- ok
+-STATEMENT MATCH (a) RETURN a.num + 1 AS foo;
+---- 1
+2
+
+# Adding list properties in projection
+-CASE Scenario7
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, list1 INT64[], list2 INT64[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {list1: [1, 2, 3], list2: [4, 5]});
+---- ok
+-STATEMENT MATCH (a) RETURN list_concat(a.list2, a.list1) AS foo;
+---- 1
+[4,5,1,2,3]
+
+# Returning label predicate expression
+-CASE Scenario8
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE NODE TABLE Foo(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A), (:Foo);
+---- ok
+-STATEMENT MATCH (n) RETURN LABEL(n) = 'Foo';
+---- 2
+True
+False
+
+# Returning a projected map
+-CASE Scenario9
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, numbers INT64[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {numbers: [1, 2, 3]});
+---- ok
+-STATEMENT RETURN {a: 1, b: 'foo'};
+---- 1
+{a: 1, b: foo}
+
+# Return count aggregation over an empty graph
+-CASE Scenario10
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT MATCH (a) RETURN count(a) > 0;
+---- 1
+False
+
+# RETURN does not lose precision on large integers
+-CASE Scenario11
+-STATEMENT CREATE NODE TABLE TheLabel(id INT64, PRIMARY KEY(id));
+---- ok
+-STATEMENT CREATE (:TheLabel {id: 4611686018427387905});
+---- ok
+-STATEMENT MATCH (p:TheLabel) RETURN p.id;
+---- 1
+4611686018427387905
+
+# Projecting a list of nodes and relationships
+-CASE Scenario12
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE NODE TABLE B(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE REL TABLE T(FROM A To B);
+---- ok
+-STATEMENT CREATE (a:A)-[:T]->(b:B);
+---- ok
+-STATEMENT MATCH (n)-[r]->(m) RETURN [n, r, m] AS r;
+---- 1
+[{_ID: 0:0, _LABEL: A, ID: 0},(0:0)-{_LABEL: T, _ID: 2:0}->(1:0),{_ID: 1:0, _LABEL: B, ID: 0}]
+
+# Projecting a map of nodes and relationships
+-CASE Scenario13
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE NODE TABLE B(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE REL TABLE T(FROM A To B);
+---- ok
+-STATEMENT CREATE (a:A)-[:T]->(b:B);
+---- ok
+-STATEMENT MATCH (n)-[r]->(m) RETURN {node1: n, rel: r, node2: m} AS m;
+---- 1
+{node1: {_ID: 0:0, _LABEL: A, ID: 0}, rel: (0:0)-{_LABEL: T, _ID: 2:0}->(1:0), node2: {_ID: 1:0, _LABEL: B, ID: 0}}
+
+# Do not fail when returning type of deleted relationships
+-CASE Scenario14
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE REL TABLE T(FROM A TO A);
+---- ok
+-STATEMENT CREATE (:A)-[:T]->(:A);
+---- ok
+-STATEMENT MATCH ()-[r]->() DELETE r RETURN LABEL(r);
+---- 1
+T
+
+# Fail when returning properties of deleted nodes
+-CASE Scenario15
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, num INT64, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {num: 0});
+---- ok
+-STATEMENT MATCH (n) DELETE n RETURN n.num;
+---- error
+EntityNotFound: DeletedEntityAccess
+
+# Fail when returning labels of deleted nodes
+-CASE Scenario16
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A);
+---- ok
+-STATEMENT MATCH (n) DELETE n RETURN LABEL(n);
+---- error
+EntityNotFound: DeletedEntityAccess
+
+# Fail when returning properties of deleted relationships
+-CASE Scenario17
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE REL TABLE T(FROM A TO A, num INT64);
+---- ok
+-STATEMENT CREATE (:A)-[:T {num: 0}]->(:A);
+---- ok
+-STATEMENT MATCH ()-[r]->() DELETE r RETURN r.num;
+---- error
+EntityNotFound: DeletedEntityAccess
+
+# Fail on projecting a non-existent function
+-CASE Scenario18
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT MATCH (a) RETURN foo(a);
+---- error
+Catalog exception: FOO function does not exist.
diff --git a/test/test_files/tck/return/return3.test b/test/test_files/tck/return/return3.test
@@ -0,0 +1,39 @@
+-GROUP TCKReturn3
+-DATASET CSV tck
+
+--
+
+# Returning multiple expressions
+-CASE Scenario1
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A);
+---- ok
+-STATEMENT MATCH (a) RETURN a.id IS NOT NULL AS a, a IS NOT NULL AS b;
+---- 1
+False|True
+
+# Returning multiple node property values
+-CASE Scenario2
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, name STRING, age INT64, seasons INT64[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {name: 'Philip J. Fry', age: 2046, seasons: [1, 2, 3, 4, 5, 6, 7]});
+---- ok
+-STATEMENT MATCH (a) RETURN a.name, a.age, a.seasons;
+---- 1
+Philip J. Fry|2046|[1,2,3,4,5,6,7]
+
+# Projecting nodes and relationships
+-CASE Scenario3
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE NODE TABLE B(ID SERIAL, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE REL TABLE T(FROM A To B);
+---- ok
+-STATEMENT CREATE (a:A)-[:T]->(b:B);
+---- ok
+-STATEMENT MATCH (a)-[r]->() RETURN a AS foo, r AS bar;
+---- 1
+{_ID: 0:0, _LABEL: A, ID: 0}|(0:0)-{_LABEL: T, _ID: 2:0}->(1:0)
diff --git a/test/test_files/tck/return/return5.test b/test/test_files/tck/return/return5.test
@@ -0,0 +1,62 @@
+-GROUP TCKReturn5
+-DATASET CSV tck
+
+--
+
+# DISTINCT inside aggregation should work with lists in maps
+-CASE Scenario1
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, list STRING[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {list: ['A', 'B']}), (:A {list: ['A', 'B']});
+---- ok
+-STATEMENT MATCH (n) RETURN count(DISTINCT {name: n.list}) AS count;
+---- 1
+1
+
+# DISTINCT on nullable values
+-CASE Scenario2
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, name STRING, PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {name: 'Florescu'}), (:A), (:A);
+---- ok
+-STATEMENT MATCH (n) RETURN DISTINCT n.name;
+---- 2
+Florescu
+
+
+# DISTINCT inside aggregation should work with nested lists in maps
+-CASE Scenario3
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, list STRING[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {list: ['A', 'B']}), (:A {list: ['A', 'B']});
+---- ok
+-STATEMENT MATCH (n) RETURN count(DISTINCT {name: [[n.list, n.list], [n.list, n.list]]}) AS count;
+---- 1
+1
+
+# DISTINCT inside aggregation should work with nested lists of maps in maps
+-CASE Scenario4
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, list STRING[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {list: ['A', 'B']}), (:A {list: ['A', 'B']});
+---- ok
+-STATEMENT MATCH (n) RETURN count(DISTINCT {name: [{name2: n.list}, {baz: {apa: n.list}}]}) AS count;
+---- 1
+1
+
+# Aggregate on list values
+-CASE Scenario5
+-SKIP
+-STATEMENT CREATE NODE TABLE A(ID SERIAL, color STRING[], PRIMARY KEY(ID));
+---- ok
+-STATEMENT CREATE (:A {color: ['red']}),
+                  (:A {color: ['blue']}),
+                  (:A {color: ['red']});
+---- ok
+-STATEMENT MATCH (a) RETURN DISTINCT a.color, count(*);
+---- 2
+[red]|2
+[blue]|1