CTR docs fixes

Cole-Greer · Cole-Greer · commit a7012c6ab265 · 2024-10-24T11:19:33.000-07:00
diff --git a/docs/src/dev/io/graphbinary.asciidoc b/docs/src/dev/io/graphbinary.asciidoc
@@ -273,7 +273,7 @@ Where:
 - `{parent}` is a fully qualified typed value composed of `{type_code}{type_info}{value_flag}{value}` which contains
 the parent `Vertex`. Note that as TinkerPop currently send "references" only, this value will always be `null`.
 - `{properties}` is a fully qualified typed value composed of `{type_code}{type_info}{value_flag}{value}` which contains
-the properties for the edge. Note that as TinkerPop currently send "references" only this value will always be `null`.
+the properties for the edge.
 
 ==== Path
 
@@ -340,7 +340,7 @@ Where:
 - `{id}` is a fully qualified typed value composed of `{type_code}{type_info}{value_flag}{value}`.
 - `{label}` is a `String` value.
 - `{properties}` is a fully qualified typed value composed of `{type_code}{type_info}{value_flag}{value}` which contains
-properties. Note that as TinkerPop currently send "references" only, this value will always be `null`.
+properties.
 
 ==== VertexProperty
 
@@ -354,7 +354,7 @@ Where:
 - `{parent}` is a fully qualified typed value composed of `{type_code}{type_info}{value_flag}{value}` which contains
 the parent `Vertex`. Note that as TinkerPop currently send "references" only, this value will always be `null`.
 - `{properties}` is a fully qualified typed value composed of `{type_code}{type_info}{value_flag}{value}` which contains
-properties. Note that as TinkerPop currently send "references" only, this value will always be `null`.
+properties.
 
 ==== Barrier
 
diff --git a/docs/src/reference/the-traversal.asciidoc b/docs/src/reference/the-traversal.asciidoc
@@ -383,6 +383,7 @@ Spawn steps, which actually yield a traversal, typically match the names of exis
 * `inject()` - Inserts arbitrary objects to start the traversal (<<inject-step, example>>).
 * `mergeE()` - Adds an `Edge` in a "create if not exist" fashion to start the traversal (<<mergeedge-step, example>>)
 * `mergeV()` - Adds a `Vertex` in a "create if not exist" fashion to start the traversal (<<mergevertex-step, example>>)
+* `union()` - Merges the results of an arbitrary number of child traversals to start the traversal (<<union-step, example>>).
 * `V()` - Reads vertices from the graph to start the traversal (<<graph-step, example>>).
 
 [[graph-traversal-steps]]
