From d00ca45668718eeeb2e0b691a50c2efcbd9adcb5 Mon Sep 17 00:00:00 2001 From: D024504 Date: Tue, 7 Nov 2023 10:37:40 +0100 Subject: [PATCH] Typos to be corrected with next errata --- docs/odata-data-aggregation-ext/odata-data-aggregation-ext.html | 2 +- docs/odata-data-aggregation-ext/odata-data-aggregation-ext.md | 2 +- odata-data-aggregation-ext/6 Hierarchical Transformations.md | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.html b/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.html index fcc342831..65a75e914 100644 --- a/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.html +++ b/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.html @@ -2836,7 +2836,7 @@

}

6.2.2 Transformation traverse

-

The traverse transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.

+

The traverse transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.

\(H\), \(Q\) and \(p\) are the first three parameters defined above.

The fourth parameter \(h\) of the traverse transformation is either preorder or postorder. \(S\) is an optional fifth parameter as defined above. Let \(H'\) be the output set of the transformation sequence \(S\) applied to \(H\), or let \(H'\) be the collection of root nodes in the recursive hierarchy \((H,Q)\) if \(S\) is not specified. Nodes in \(H'\) are called start nodes in this subsection (see example 117).

All following parameters are optional and form a list \(o\) of expressions that could also be passed as a $orderby system query option. If \(o\) is present, the transformation stable-sorts \(H'\) by \(o\).

diff --git a/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.md b/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.md index a2d9a7578..a68bd897f 100644 --- a/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.md +++ b/docs/odata-data-aggregation-ext/odata-data-aggregation-ext.md @@ -2809,7 +2809,7 @@ results in ### 6.2.2 Transformation `traverse` -The traverse transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order. +The `traverse` transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order. $H$, $Q$ and $p$ are the first three parameters defined [above](#CommonParametersforHierarchicalTransformations). diff --git a/odata-data-aggregation-ext/6 Hierarchical Transformations.md b/odata-data-aggregation-ext/6 Hierarchical Transformations.md index 4f4efe1ae..a68504830 100644 --- a/odata-data-aggregation-ext/6 Hierarchical Transformations.md +++ b/odata-data-aggregation-ext/6 Hierarchical Transformations.md @@ -179,7 +179,7 @@ results in ### ##subsubsec Transformation `traverse` -The traverse transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order. +The `traverse` transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order. $H$, $Q$ and $p$ are the first three parameters defined [above](#CommonParametersforHierarchicalTransformations).