Standardise admonitions (#1382)

Most admonitions are either [NOTE], [TIP], [IMPORTANT].
This tries to standardise their use, using the following guidelines:

[NOTE]: Use for general information or observations that are helpful but
not critical.
[TIP]: Use for optional advice, shortcuts, or suggestions that enhance
understanding or efficiency.
[IMPORTANT]: Use for essential information that the reader must follow
to avoid mistakes or problems.

Author: JPryce-Aklundh

modules/ROOT/pages/clauses/clause-composition.adoc

@@ -128,10 +128,8 @@ The next section will explore these non-linear composition and write clauses.
 In a Cypher query, read and write clauses can take turns.
 The most important aspect of read-write queries is that the state of the graph also changes between clauses.
 
-[IMPORTANT]
-====
+[NOTE]
 A clause can never observe writes made by a later clause, and will observe all writes done by the previous clauses.
-====
 
 As of Cypher 25, read and write clauses can be combined in any order.
 That is, a write clause followed by a read clause no longer requires a separating xref:clauses/with.adoc[`WITH`] clause in order for the read clause to observe the changes made by a preceding write clause.

modules/ROOT/pages/clauses/foreach.adoc

@@ -12,9 +12,7 @@ This means that if you `CREATE` a node variable within a `FOREACH`, you will _no
 Within the `FOREACH` parentheses, you can do any of the updating commands -- `SET`, `REMOVE`, `CREATE`, `MERGE`, `DELETE`, and `FOREACH`.
 
 [TIP]
-====
 If you want to execute an additional `MATCH` for each element in a list then the xref::clauses/unwind.adoc[`UNWIND`] clause would be a more appropriate command.
-====
 
 image::graph-foreach-clause.svg[Person nodes connected between themselves via knows relationships,width=600,role=popup]
 

modules/ROOT/pages/clauses/load-csv.adoc

@@ -808,7 +808,7 @@ RETURN DISTINCT file() AS path
 |===
 ====
 
-[TIP]
+[NOTE]
 `file()` always returns a local path, even when loading remote CSV files.
 For remote resources, `file()` returns the temporary local path it was downloaded to.
 

modules/ROOT/pages/clauses/optional-match.adoc

@@ -14,11 +14,6 @@ The `WHERE` clause is part of the pattern description, and its predicates will b
 This matters especially in the case of multiple (`OPTIONAL`) `MATCH` clauses, where it is crucial to put `WHERE` together with the `MATCH` it belongs to.
 
 
-[TIP]
-====
-To understand the patterns used in the `OPTIONAL MATCH` clause, read xref::patterns/index.adoc[Patterns].
-====
-
 == Example graph
 
 The following graph is used for the examples below:

modules/ROOT/pages/clauses/order-by.adoc

@@ -10,7 +10,7 @@ It can also be used as a standalone clause, either on its own or in combination
 `ORDER BY` relies on comparisons to sort the output (see xref:values-and-types/ordering-equality-comparison.adoc[] for more details).
 You can sort on different values, such as node or relationship properties, IDs, or the result of expressions.
 
-[IMPORTANT]
+[NOTE]
 Unless `ORDER BY` is used, Neo4j does not guarantee the row order of a query result.
 
 

modules/ROOT/pages/clauses/remove.adoc

@@ -4,17 +4,12 @@
 = REMOVE
 
 The `REMOVE` clause is used to remove properties from nodes and relationships, and to remove labels from nodes.
-
-[TIP]
-====
-For deleting nodes and relationships, see xref::clauses/delete.adoc[`DELETE`].
-====
+To delete nodes and relationships, use the xref::clauses/delete.adoc[`DELETE`] clause.
 
 [NOTE]
-====
 Removing labels from a node is an idempotent operation: if you try to remove a label from a node that does not have that label on it, nothing happens.
 The query statistics will tell you if something needed to be done or not.
-====
+
 
 == Example graph
 

modules/ROOT/pages/clauses/return.adoc

@@ -95,10 +95,7 @@ d|Rows: 1
 |===
 
 [TIP]
-====
-To only return the value of a property, do not not return the full node/relationship.
-This will improve performance.
-====
+It is more performant to return properties rather than the full node or relationship.
 
 
 [[return-all-elements]]

modules/ROOT/pages/clauses/with.adoc

@@ -13,7 +13,7 @@ The `WITH` clause serves multiple purposes in Cypher:
 * xref:clauses/with.adoc#ordering-pagination[Order and paginate results]
 * xref:clauses/with.adoc#filter-results[Filter results]
 
-[IMPORTANT]
+[NOTE]
 As of Cypher 25, `WITH` is no longer required as a separator between a write and a read clause.
 
 [[example-graph]]

modules/ROOT/pages/expressions/predicates/comparison-operators.adoc

@@ -14,7 +14,7 @@ Cypher contains the following comparison operators:
 * `IS NULL`
 * `IS NOT NULL`
 
-[TIP]
+[NOTE]
 For more information about how Cypher orders and compares different value types, see xref:values-and-types/ordering-equality-comparison.adoc[Values and types -> Equality, ordering, and comparison of value types]
 
 

modules/ROOT/pages/functions/aggregating.adoc

@@ -9,9 +9,8 @@ An aggregating function performs a calculation over a set of values, returning a
 Aggregation can be computed over all the matching paths, or it can be further divided by introducing xref:functions/aggregating.adoc#grouping-keys[grouping keys].
 
 [TIP]
-====
-To learn more about how Cypher handles aggregations performed on zero rows, refer to link:https://neo4j.com/developer/kb/understanding-aggregations-on-zero-rows/[Neo4j Knowledge Base -> Understanding aggregations on zero rows].
-====
+To learn more about how Cypher handles aggregations performed on zero rows, visit link:https://neo4j.com/developer/kb/understanding-aggregations-on-zero-rows/[Neo4j Knowledge Base -> Understanding aggregations on zero rows].
+
 
 == Example graph
 
@@ -182,10 +181,9 @@ All the values are collected and returned in a single list:
 |===
 
 [TIP]
-====
 Neo4j maintains a transactional count store for holding count metadata, which can significantly increase the speed of queries using the `count()` function.
 For more information about the count store, refer to link:https://neo4j.com/developer/kb/fast-counts-using-the-count-store/[Neo4j Knowledge Base -> Fast counts using the count store].
-====
+
 
 === Using `count(*)` to return the number of nodes