database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2026-10-25 01:39:28 +03:00
Code Activity

Make some tests more stable by adding more explicit ordering

Browse Source 
for some tests added by commit 2f094e7ac6, based on buildfarm results
This commit is contained in:
Peter Eisentraut
2026-03-16 16:24:22 +01:00
parent fba4233c83
commit cd8844e7db
4 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/test/regress/expected/create_property_graph.out
View File

@@ -653,7 +653,7 @@ SELECT * FROM information_schema.pg_property_data_types ORDER BY property_graph_
regression | create_property_graph_tests | gt | n | text | | | | | | regression | | | | | | | | | regression | pg_catalog | text | | | | | n
(39 rows)
SELECT * FROM information_schema.pg_property_graph_privileges WHERE grantee LIKE 'regress%' ORDER BY property_graph_name;
SELECT * FROM information_schema.pg_property_graph_privileges WHERE grantee LIKE 'regress%' ORDER BY property_graph_name, grantor, grantee, privilege_type;
grantor | grantee | property_graph_catalog | property_graph_schema | property_graph_name | privilege_type | is_grantable
---------------------+---------------------+------------------------+-----------------------------+---------------------+----------------+--------------
regress_graph_user1 | regress_graph_user1 | regression | create_property_graph_tests | g1 | SELECT | YES

2
src/test/regress/expected/graph_table.out
View File

@@ -446,7 +446,7 @@ SELECT * FROM GRAPH_TABLE (g1 MATCH (src IS vl1 | vl2 | vl3)-[conn]->(dest) COLU
-- graph'ical query: find a vertex which is not connected to any other vertex as a source or a destination.
WITH all_connected_vertices AS (SELECT svn, dvn FROM GRAPH_TABLE (g1 MATCH (src)-[conn]->(dest) COLUMNS (src.vname AS svn, dest.vname AS dvn))),
all_vertices AS (SELECT vn FROM GRAPH_TABLE (g1 MATCH (vertex) COLUMNS (vertex.vname AS vn)))
SELECT vn FROM all_vertices EXCEPT (SELECT svn FROM all_connected_vertices UNION SELECT dvn FROM all_connected_vertices);
SELECT vn FROM all_vertices EXCEPT (SELECT svn FROM all_connected_vertices UNION SELECT dvn FROM all_connected_vertices) ORDER BY vn;
vn
-----
v13

2
src/test/regress/sql/create_property_graph.sql
View File

@@ -278,7 +278,7 @@ SELECT * FROM information_schema.pg_element_table_properties ORDER BY property_g
SELECT * FROM information_schema.pg_label_properties ORDER BY property_graph_name, label_name, property_name;
SELECT * FROM information_schema.pg_labels ORDER BY property_graph_name, label_name;
SELECT * FROM information_schema.pg_property_data_types ORDER BY property_graph_name, property_name;
SELECT * FROM information_schema.pg_property_graph_privileges WHERE grantee LIKE 'regress%' ORDER BY property_graph_name;
SELECT * FROM information_schema.pg_property_graph_privileges WHERE grantee LIKE 'regress%' ORDER BY property_graph_name, grantor, grantee, privilege_type;
-- test object address functions
SELECT pg_describe_object(classid, objid, objsubid) as obj,

2
src/test/regress/sql/graph_table.sql
View File

@@ -298,7 +298,7 @@ SELECT * FROM GRAPH_TABLE (g1 MATCH (src IS vl1 | vl2 | vl3)-[conn]->(dest) COLU
-- graph'ical query: find a vertex which is not connected to any other vertex as a source or a destination.
WITH all_connected_vertices AS (SELECT svn, dvn FROM GRAPH_TABLE (g1 MATCH (src)-[conn]->(dest) COLUMNS (src.vname AS svn, dest.vname AS dvn))),
all_vertices AS (SELECT vn FROM GRAPH_TABLE (g1 MATCH (vertex) COLUMNS (vertex.vname AS vn)))
SELECT vn FROM all_vertices EXCEPT (SELECT svn FROM all_connected_vertices UNION SELECT dvn FROM all_connected_vertices);
SELECT vn FROM all_vertices EXCEPT (SELECT svn FROM all_connected_vertices UNION SELECT dvn FROM all_connected_vertices) ORDER BY vn;
-- query all connections using a label shared by vertices and edges
SELECT sn, cn, dn FROM GRAPH_TABLE (g1 MATCH (src IS l1)-[conn IS l1]->(dest IS l1) COLUMNS (src.elname AS sn, conn.elname AS cn, dest.elname AS dn));