gqlite 1.8.1 → 1.8.2

data/ext/gqlitedb/src/tests/connection/redb.rs

@@ -37,3 +37,11 @@ fn test_count_distinct_end_to_end()
   let connection = builder.create().unwrap();
   super::test_count_distinct_end_to_end(connection);
 }
+
+#[test]
+fn test_shortest_with_explicit_minimum_hop_count()
+{
+  let builder = crate::Connection::builder().backend(crate::Backend::Redb);
+  let connection = builder.create().unwrap();
+  super::test_shortest_with_explicit_minimum_hop_count(connection);
+}

data/ext/gqlitedb/src/tests/connection.rs

@@ -141,3 +141,40 @@ fn test_count_distinct_end_to_end(connection: crate::Connection)
   let count: i64 = table.value(0, 0).unwrap().try_into().unwrap();
   assert_eq!(count, 3, "should count distinct friends");
 }
+
+fn test_shortest_with_explicit_minimum_hop_count(connection: crate::Connection)
+{
+  connection
+    .execute_oc_query(
+      r#"
+      CREATE (a:Station {name: 'A'}),
+             (x:Station {name: 'X'}),
+             (d:Station {name: 'D'}),
+             (a)-[:LINK]->(d),
+             (a)-[:LINK]->(x),
+             (x)-[:LINK]->(d)
+      "#,
+      Default::default(),
+    )
+    .unwrap();
+
+  let result = connection
+    .execute_oc_query(
+      r#"MATCH p = SHORTEST 1 (a:Station {name: 'A'})-[:LINK*2..4]->(d:Station {name: 'D'}) RETURN length(p) AS len"#,
+      Default::default(),
+    )
+    .unwrap();
+
+  let table = result.try_into_table().unwrap();
+  assert_eq!(
+    table.rows(),
+    1,
+    "should find exactly one path with min_hops=2, got {} rows",
+    table.rows()
+  );
+  let len: i64 = table.value(0, 0).unwrap().try_into().unwrap();
+  assert_eq!(
+    len, 2,
+    "should return path of length 2 (A->X->D), not the direct 1-hop edge (A->D)"
+  );
+}