aboutsummaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2008-10-14 00:12:44 +0000
committerTom Lane <tgl@sss.pgh.pa.us>2008-10-14 00:12:44 +0000
commit1f238e569acbc2a41be497d4fe1b1b797e5ae902 (patch)
treef45da2fcad39a305d785b9dafce639bc1c3f2a69 /src
parente3b0117459fd24b15cb5e88f563b5d87f051cfdc (diff)
downloadpostgresql-1f238e569acbc2a41be497d4fe1b1b797e5ae902.tar.gz
postgresql-1f238e569acbc2a41be497d4fe1b1b797e5ae902.zip
Eliminate unnecessary array[] decoration in examples of recursive cycle
detection.
Diffstat (limited to 'src')
-rw-r--r--src/test/regress/expected/with.out2
-rw-r--r--src/test/regress/sql/with.sql2
2 files changed, 2 insertions, 2 deletions
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
)