Eliminate unnecessary array[] decoration in examples of recursive cycle

tglsfdc · tglsfdc · commit 1f238e569acb · 2008-10-14T00:12:44.000Z
detection.
diff --git a/doc/src/sgml/queries.sgml b/doc/src/sgml/queries.sgml
@@ -1,4 +1,4 @@
-<!-- $PostgreSQL: pgsql/doc/src/sgml/queries.sgml,v 1.48 2008/10/13 16:25:19 tgl Exp $ -->
+<!-- $PostgreSQL: pgsql/doc/src/sgml/queries.sgml,v 1.49 2008/10/14 00:12:44 tgl Exp $ -->
 
 <chapter id="queries">
  <title>Queries</title>
@@ -1639,7 +1639,7 @@ WITH RECURSIVE search_graph(id, link, data, depth, path, cycle) AS (
         FROM graph g
       UNION ALL
         SELECT g.id, g.link, g.data, sg.depth + 1,
-          path || ARRAY[g.id],
+          path || g.id,
           g.id = ANY(path)
         FROM graph g, search_graph sg
         WHERE g.id = sg.link AND NOT cycle
@@ -1664,7 +1664,7 @@ WITH RECURSIVE search_graph(id, link, data, depth, path, cycle) AS (
         FROM graph g
       UNION ALL
         SELECT g.id, g.link, g.data, sg.depth + 1,
-          path || ARRAY[ROW(g.f1, g.f2)],
+          path || ROW(g.f1, g.f2),
           ROW(g.f1, g.f2) = ANY(path)
         FROM graph g, search_graph sg
         WHERE g.id = sg.link AND NOT cycle
diff --git 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
@@ -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
 )

Original file line number	Diff line number	Diff line change
`@@ -465,7 +465,7 @@ insert into graph values`
`465`	`465`	`with recursive search_graph(f, t, label, path, cycle) as (`
`466`	`466`	`select *, array[row(g.f, g.t)], false from graph g`
`467`	`467`	`union all`
`468`		`- select g.*, path \|\| array[row(g.f, g.t)], row(g.f, g.t) = any(path)`
	`468`	`+ select g.*, path \|\| row(g.f, g.t), row(g.f, g.t) = any(path)`
`469`	`469`	`from graph g, search_graph sg`
`470`	`470`	`where g.f = sg.t and not cycle`
`471`	`471`	`)`
Original file line number	Diff line number	Diff line change
`@@ -266,7 +266,7 @@ insert into graph values`
`266`	`266`	`with recursive search_graph(f, t, label, path, cycle) as (`
`267`	`267`	`select *, array[row(g.f, g.t)], false from graph g`
`268`	`268`	`union all`
`269`		`- select g.*, path \|\| array[row(g.f, g.t)], row(g.f, g.t) = any(path)`
	`269`	`+ select g.*, path \|\| row(g.f, g.t), row(g.f, g.t) = any(path)`
`270`	`270`	`from graph g, search_graph sg`
`271`	`271`	`where g.f = sg.t and not cycle`
`272`	`272`	`)`