You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by ok...@apache.org on 2015/06/08 23:35:14 UTC
incubator-tinkerpop git commit: minor grammar fix in the-traversal.
Repository: incubator-tinkerpop
Updated Branches:
refs/heads/master ca733b534 -> 51a184627
minor grammar fix in the-traversal.
Project: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/commit/51a18462
Tree: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/tree/51a18462
Diff: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/diff/51a18462
Branch: refs/heads/master
Commit: 51a1846272ffbe79df7a77be2d6fe6b763d84bc1
Parents: ca733b5
Author: Marko A. Rodriguez <ok...@gmail.com>
Authored: Mon Jun 8 15:35:09 2015 -0600
Committer: Marko A. Rodriguez <ok...@gmail.com>
Committed: Mon Jun 8 15:35:09 2015 -0600
----------------------------------------------------------------------
docs/src/the-traversal.asciidoc | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/blob/51a18462/docs/src/the-traversal.asciidoc
----------------------------------------------------------------------
diff --git a/docs/src/the-traversal.asciidoc b/docs/src/the-traversal.asciidoc
index 52aabb3..c9c4f62 100644
--- a/docs/src/the-traversal.asciidoc
+++ b/docs/src/the-traversal.asciidoc
@@ -263,7 +263,7 @@ g.V().sideEffect{println "first: ${it}"}.sideEffect{println "second: ${it}"}.ite
g.V().sideEffect{println "first: ${it}"}.barrier().sideEffect{println "second: ${it}"}.iterate()
----
-The theory behind a "bulking optimization" is simple. If there are one million traversers are vertex 1, then there is no need to calculate one million `both()`-computations. Instead, represent those one million traversers as a single traverser with a `Traverser.bulk()` equal to one million and execute `both()` once. A bulking optimization example is made more salient on a larger graph. Therefore, the example below leverages the <<grateful-dead,Grateful Dead graph>>.
+The theory behind a "bulking optimization" is simple. If there are one million traversers at vertex 1, then there is no need to calculate one million `both()`-computations. Instead, represent those one million traversers as a single traverser with a `Traverser.bulk()` equal to one million and execute `both()` once. A bulking optimization example is made more salient on a larger graph. Therefore, the example below leverages the <<grateful-dead,Grateful Dead graph>>.
[gremlin-groovy]
----