Fix minor grammatical error in reference docs. CTR

Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/52ae7852
Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/52ae7852
Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/52ae7852

Branch: refs/heads/TINKERPOP-1507
Commit: 52ae78524287e82a6c0853473159549616c72fca
Parents: d68f7cb
Author: Stephen Mallette <[email protected]>
Authored: Mon Oct 24 06:25:16 2016 -0400
Committer: Stephen Mallette <[email protected]>
Committed: Mon Oct 24 06:25:16 2016 -0400

----------------------------------------------------------------------
 docs/src/reference/the-traversal.asciidoc | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/52ae7852/docs/src/reference/the-traversal.asciidoc
----------------------------------------------------------------------
diff --git a/docs/src/reference/the-traversal.asciidoc 
b/docs/src/reference/the-traversal.asciidoc
index 3530be3..0c7ffef 100644
--- a/docs/src/reference/the-traversal.asciidoc
+++ b/docs/src/reference/the-traversal.asciidoc
@@ -2100,7 +2100,7 @@ supplier yields a single traverser to continue to the 
next step. Examples includ
 
 In Gremlin OLAP (see <<traversalvertexprogram,`TraversalVertexProgram`>>), a 
barrier is introduced at the end of
 every <<vertex-steps,adjacent vertex step>>. This means that the traversal 
does its best to compute as much as
-possible at the current, local vertex. What is can't compute without 
referencing an adjacent vertex is aggregated
+possible at the current, local vertex. What it can't compute without 
referencing an adjacent vertex is aggregated
 into a barrier collection. When there are no more traversers at the local 
vertex, the barriered traversers are the
 messages that are propagated to remote vertices for further processing.
 

Reply via email to