From 1f238e569acbc2a41be497d4fe1b1b797e5ae902 Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Tue, 14 Oct 2008 00:12:44 +0000 Subject: Eliminate unnecessary array[] decoration in examples of recursive cycle detection. --- src/test/regress/expected/with.out | 2 +- src/test/regress/sql/with.sql | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) (limited to 'src') diff --git a/src/test/regress/expected/with.out b/src/test/regress/expected/with.out index e8d3e43b7b6..765910d48ba 100644 --- a/src/test/regress/expected/with.out +++ b/src/test/regress/expected/with.out @@ -465,7 +465,7 @@ insert into graph values with recursive search_graph(f, t, label, path, cycle) as ( select *, array[row(g.f, g.t)], false from graph g union all - select g.*, path || array[row(g.f, g.t)], row(g.f, g.t) = any(path) + select g.*, path || row(g.f, g.t), row(g.f, g.t) = any(path) from graph g, search_graph sg where g.f = sg.t and not cycle ) diff --git a/src/test/regress/sql/with.sql b/src/test/regress/sql/with.sql index d37f0d9723e..3107cbcb911 100644 --- a/src/test/regress/sql/with.sql +++ b/src/test/regress/sql/with.sql @@ -266,7 +266,7 @@ insert into graph values with recursive search_graph(f, t, label, path, cycle) as ( select *, array[row(g.f, g.t)], false from graph g union all - select g.*, path || array[row(g.f, g.t)], row(g.f, g.t) = any(path) + select g.*, path || row(g.f, g.t), row(g.f, g.t) = any(path) from graph g, search_graph sg where g.f = sg.t and not cycle ) -- cgit v1.2.3