Cleanup redundant asciidoc formatting from clauses examples (#583)

Author: stefano-ottolenghi

modules/ROOT/pages/clauses/clause_composition.adoc

@@ -85,28 +85,28 @@ The query only has read clauses, so the state of the graph remains unchanged and
 MATCH (john:Person {name: 'John'})
 ----
 |
-[options="header",cols="1"]
+[options="header",cols="1m"]
 !===
 ! john
-! ({name: 'John'})
+! (:Person {name: 'John'})
 !===
 
 | ----
 MATCH (john)-[:FRIEND]->(friend)
 ----
 |
-[options="header",cols="1, 1"]
+[options="header",cols="1m, 1m"]
 !===
 ! john             ! friend
-! ({name: 'John'}) ! ({name: 'Sara'})
-! ({name: 'John'}) ! ({name: 'Joe'})
+! (:Person {name: 'John'}) ! (:Person {name: 'Sara'})
+! (:Person {name: 'John'}) ! (:Person {name: 'Joe'})
 !===
 
 | ----
 RETURN friend.name AS friendName
 ----
 |
-[options="header",cols="1"]
+[options="header",cols="1m"]
 !===
 ! friendName
 ! 'Sara'
@@ -157,11 +157,11 @@ and for each such node it creates another node with  the `name` property set to
 MATCH (j:Person) WHERE j.name STARTS WITH "J"
 ----
 |
-[options="header",cols="1"]
+[options="header",cols="1m"]
 !===
 ! j
-! ({name: 'John'})
-! ({name: 'Joe'})
+! (:Person {name: 'John'})
+! (:Person {name: 'Joe'})
 !===
 |
 [graphviz]
@@ -215,11 +215,11 @@ label = "{Person\|name = \'Maria\'\l}"
 CREATE (j)-[:FRIEND]->(jj:Person {name: "Jay-jay"})
 ----
 |
-[options="header",cols="1, 1"]
+[options="header",cols="1m, 1m"]
 !===
 ! j                ! jj
-! ({name: 'John'}) ! ({name: 'Jay-jay'})
-! ({name: 'Joe'})  ! ({name: 'Jay-jay'})
+! (:Person {name: 'John'}) ! (:Person {name: 'Jay-jay'})
+! (:Person {name: 'Joe'})  ! (:Person {name: 'Jay-jay'})
 !===
 |
 
@@ -327,10 +327,10 @@ RETURN count(*) AS count
 CREATE (jj:Person {name: "Jay-jay"})
 ----
 |
-[options="header",cols="1"]
+[options="header",cols="1m"]
 !===
 ! jj
-! ({name: 'Jay-jay'})
+! (:Person {name: 'Jay-jay'})
 !===
 |
 
@@ -383,7 +383,7 @@ label = "{Person\|name = \'Jay-jay\'\l}"
 RETURN count(*) AS count
 ----
 |
-[options="header",cols="1"]
+[options="header",cols="1m"]
 !===
 ! count
 ! 1
@@ -437,12 +437,12 @@ label = "{Person\|name = \'Jay-jay\'\l}"
 MATCH (j:Person) WHERE j.name STARTS WITH "J"
 ----
 |
-[options="header",cols="1"]
+[options="header",cols="1m"]
 !===
 ! j
-! ({name: 'John'})
-! ({name: 'Joe'})
-! ({name: 'Jay-jay'})
+! (:Person {name: 'John'})
+! (:Person {name: 'Joe'})
+! (:Person {name: 'Jay-jay'})
 !===
 |
 [graphviz]
@@ -498,7 +498,7 @@ label = "{Person\|name = \'Jay-jay\'\l}"
 RETURN count(*) AS count
 ----
 |
-[options="header",cols="1"]
+[options="header",cols="1m"]
 !===
 ! count
 ! 3
@@ -566,11 +566,11 @@ The different invocations of the subquery are executed in turn, in the order of
 
 Later invocations of the subquery can observe writes made by earlier invocations of the subquery.
 
-.Table of intermediate results and state of the graph in a query qith `CALL {}`
+.Table of intermediate results and state of the graph in a query with `CALL {}`
 ======
 Using the same example graph as above, this example shows the table of intermediate results and the state of the graph after each clause for the following query:
 
-[source,cypher, indent=0]
+[source,cypher]
 ----
 MATCH (john:Person {name: 'John'})
 SET john.friends = []
@@ -595,10 +595,10 @@ CALL {
 MATCH (john:Person {name: 'John'})
 ----
 |
-[options="header",cols="1, 1"]
+[options="header",cols="1m"]
 !===
 ! john
-! ({name: 'John'})
+! (:Person {name: 'John'})
 !===
 |
 [graphviz]
@@ -654,10 +654,10 @@ label = "{Person\|name = \'Maria\'\l}"
 SET john.friends = []
 ----
 |
-[options="header",cols="1, 1"]
+[options="header",cols="1m"]
 !===
 ! john
-! ({name: 'John', friends: []})
+! (:Person {name: 'John', friends: []})
 !===
 |
 [graphviz]
@@ -702,11 +702,11 @@ label = "{Person\|name = \'Maria\'\l}"
 MATCH (john)-[:FRIEND]->(friend)
 ----
 |
-[options="header",cols="1, 1"]
+[options="header",cols="1m, 1m"]
 !===
 ! john             ! friend
-! ({name: 'John', friends: []}) ! ({name: 'Sara'})
-! ({name: 'John', friends: []}) ! ({name: 'Joe'})
+! (:Person {name: 'John', friends: []}) ! (:Person {name: 'Sara'})
+! (:Person {name: 'John', friends: []}) ! (:Person {name: 'Joe'})
 !===
 |
 [graphviz]
@@ -757,10 +757,10 @@ label = "{Person\|name = \'Maria\'\l}"
 WITH *, john.friends AS friends
 ----
 |
-[options="header",cols="2, 1, 1"]
+[options="header",cols="2m, 1m, 1m"]
 !===
 ! john                          ! friend           ! friends
-! ({name: 'John', friends: []}) ! ({name: 'Sara'}) ! []
+! (:Person {name: 'John', friends: []}) ! (:Person {name: 'Sara'}) ! []
 !===
 |
 [graphviz]
@@ -803,10 +803,10 @@ label = "{Person\|name = \'Maria\'\l}"
 SET john.friends = friends + friend.name
 ----
 
-|[options="header",cols="2, 1, 1"]
+|[options="header",cols="2m, 1m, 1m"]
 !===
 ! john                                ! friend           ! friends
-! ({name: 'John', friends: ['Sara']}) ! ({name: 'Sara'}) ! []
+! (:Person {name: 'John', friends: ['Sara']}) ! (:Person {name: 'Sara'}) ! []
 !===
 |
 [graphviz]
@@ -851,10 +851,10 @@ label = "{Person\|name = \'Maria\'\l}"
 WITH *, john.friends AS friends
 ----
 |
-[options="header",cols="2, 1, 1"]
+[options="header",cols="2m, 1m, 1m"]
 !===
 ! john                                ! friend           ! friends
-! ({name: 'John', friends: ['Sara']}) ! ({name: 'Joe'}) ! ['Sara']
+! (:Person {name: 'John', friends: ['Sara']}) ! (:Person {name: 'Joe'}) ! ['Sara']
 !===
 |
 [graphviz]
@@ -897,10 +897,10 @@ label = "{Person\|name = \'Maria\'\l}"
 SET john.friends = friends + friend.name
 ----
 
-|[options="header",cols="2, 1, 1"]
+|[options="header",cols="2m, 1m, 1m"]
 !===
 ! john                                       ! friend           ! friends
-! ({name: 'John', friends: ['Sara', 'Joe']}) ! ({name: 'Joe'}) ! ['Sara']
+! (:Person {name: 'John', friends: ['Sara', 'Joe']}) ! (:Person {name: 'Joe'}) ! ['Sara']
 !===
 |
 [graphviz]
@@ -958,4 +958,4 @@ This is called xref::execution-plans/index.adoc#eagerness-laziness[lazy evaluati
 It only materializes intermediate results when needed.
 In many read-write queries it is unproblematic to execute clauses interleaved, but when it is not,
 Cypher must ensure that the table of intermediate results gets materialized at the right time(s).
-This is done by inserting an xref::execution-plans/operators.adoc#query-plan-eager[`Eager`] operator into the execution plan.
+This is done by inserting an xref::execution-plans/operators.adoc#query-plan-eager[`Eager`] operator into the execution plan.

modules/ROOT/pages/clauses/foreach.adoc

@@ -51,8 +51,8 @@ FOREACH (n IN nodes(p) | SET n.marked = true)
 .Result
 [role="queryresult",options="footer",cols="1*<m"]
 |===
-1+|(empty result)
-1+d|Rows: 0 +
+|(empty result)
+d|Rows: 0 +
 Properties set: 4
 |===
 

modules/ROOT/pages/clauses/index.adoc

@@ -54,7 +54,7 @@ m| xref:clauses/listing-settings.adoc[SHOW SETTINGS]
 m| xref::clauses/load-csv.adoc[LOAD CSV]
 | Use when importing data from CSV files.
 
-m| xref::clauses/call-subquery.adoc#subquery-call-in-transactions[`+CALL { ... } IN TRANSACTIONS+`]
+m| xref::clauses/call-subquery.adoc#subquery-call-in-transactions[CALL { ... } IN TRANSACTIONS]
 | This clause may be used to prevent an out-of-memory error from occurring when importing large amounts of data using `LOAD CSV`.
 
 |===
@@ -99,13 +99,13 @@ The returned expressions may all be aliased using `AS`.
 |===
 | Clause | Description
 
-m| xref::clauses/return.adoc[+RETURN ... [AS]+]
+m| xref::clauses/return.adoc[RETURN ... [AS]]
 | Defines what to include in the query result set.
 
-m| xref::clauses/with.adoc[+WITH ... [AS]+]
+m| xref::clauses/with.adoc[WITH ... [AS]]
 | Allows query parts to be chained together, piping the results from one to be used as starting points or criteria in the next.
 
-m| xref::clauses/unwind.adoc[+UNWIND ... [AS]+]
+m| xref::clauses/unwind.adoc[UNWIND ... [AS]]
 | Expands a list into a sequence of rows.
 
 |===
@@ -169,7 +169,7 @@ These comprise sub-clauses that must operate as part of reading clauses.
 m| xref::clauses/where.adoc[WHERE]
 | Adds constraints to the patterns in a `MATCH` or `OPTIONAL MATCH` clause or filters the results of a `WITH` clause.
 
-m| xref::clauses/order-by.adoc[+ORDER BY [ASC[ENDING] \| DESC[ENDING]]+]
+m| xref::clauses/order-by.adoc[ORDER BY [ASC[ENDING\] \| DESC[ENDING\]\]]
 | A sub-clause following `RETURN` or `WITH`, specifying that the output should be sorted in either ascending (the default) or descending order.
 
 m| xref::clauses/skip.adoc[SKIP]
@@ -199,7 +199,7 @@ m| --- xref::clauses/merge.adoc#query-merge-on-create-on-match[ON CREATE]
 m| --- xref::clauses/merge.adoc#query-merge-on-create-on-match[ON MATCH]
 | Used in conjunction with `MERGE`, this write sub-clause specifies the actions to take if the pattern already exists.
 
-m| xref::clauses/call.adoc[+CALL ... [YIELD ... ]+]
+m| xref::clauses/call.adoc[CALL ... [YIELD ... ]]
 | Invokes a procedure deployed in the database and return any results.
 
 |===
@@ -232,10 +232,10 @@ Duplicates are retained.
 |===
 |Clause |Description
 
-m| xref::clauses/call-subquery.adoc[+CALL { ... }+]
+m| xref::clauses/call-subquery.adoc[CALL { ... }]
 | Evaluates a subquery, typically used for post-union processing or aggregations.
 
-m| xref::clauses/call-subquery.adoc#subquery-call-in-transactions[+CALL { ... } IN TRANSACTIONS+]
+m| xref::clauses/call-subquery.adoc#subquery-call-in-transactions[CALL { ... } IN TRANSACTIONS]
 a|
 Evaluates a subquery in separate transactions.
 Typically used when modifying or importing large amounts of data.

modules/ROOT/pages/clauses/limit.adoc

@@ -48,11 +48,11 @@ Limit to 3 rows by the example query.
 .Result
 [role="queryresult",options="header,footer",cols="1*<m"]
 |===
-| +n.name+
-| +"A"+
-| +"B"+
-| +"C"+
-1+d|Rows: 3
+| n.name
+| "A"
+| "B"
+| "C"
+d|Rows: 3
 |===
 
 
@@ -76,11 +76,11 @@ So randomly limit to 1, 2, or 3 rows.
 .Result
 [role="queryresult",options="header,footer",cols="1*<m"]
 |===
-| +n.name+
-| +"A"+
-| +"B"+
-| +"C"+
-1+d|Rows: 3
+| n.name
+| "A"
+| "B"
+| "C"
+d|Rows: 3
 |===
 
 
@@ -103,8 +103,8 @@ This query returns nothing, but creates one node:
 .Result
 [role="queryresult",options="footer",cols="1*<m"]
 |===
-1+|(empty result)
-1+d|Rows: 0 +
+|(empty result)
+d|Rows: 0 +
 Nodes created: 1
 |===
 
@@ -122,8 +122,8 @@ This query returns nothing, but writes one property:
 .Result
 [role="queryresult",options="footer",cols="1*<m"]
 |===
-1+|(empty result)
-1+d|Rows: 0 +
+|(empty result)
+d|Rows: 0 +
 Properties set: 1
 |===
 
@@ -143,9 +143,8 @@ Writes `locked` property on one node and return that node:
 .Result
 [role="queryresult",options="header,footer",cols="1*<m"]
 |===
-| +n+
-| +{locked:true,name:"A",age:60}+
-1+d|Rows: 1 +
+| n
+| {locked:true,name:"A",age:60}
+d|Rows: 1 +
 Properties set: 1
 |===
-