Repository: tinkerpop Updated Branches: refs/heads/master 99007d8b6 -> 8eb0affbc
fixed some links - CTR Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/3243f63c Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/3243f63c Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/3243f63c Branch: refs/heads/master Commit: 3243f63cbfd24f9c52a9648df2a36bf48ff10169 Parents: 31b7604 Author: Robert Dale <robd...@gmail.com> Authored: Mon Dec 18 13:02:05 2017 -0500 Committer: Robert Dale <robd...@gmail.com> Committed: Mon Dec 18 13:02:05 2017 -0500 ---------------------------------------------------------------------- docs/src/reference/gremlin-applications.asciidoc | 4 ++-- docs/src/reference/the-graphcomputer.asciidoc | 2 +- docs/src/reference/the-traversal.asciidoc | 6 +++--- 3 files changed, 6 insertions(+), 6 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/3243f63c/docs/src/reference/gremlin-applications.asciidoc ---------------------------------------------------------------------- diff --git a/docs/src/reference/gremlin-applications.asciidoc b/docs/src/reference/gremlin-applications.asciidoc index 6135af9..1c6843d 100644 --- a/docs/src/reference/gremlin-applications.asciidoc +++ b/docs/src/reference/gremlin-applications.asciidoc @@ -1638,7 +1638,7 @@ client.submit("[1,2,3,x]", params); ---- The more parameters that are used in a script the more expensive the compilation step becomes. Gremlin Server has a -`OpProcessor` setting called `maxParameters`, which is mentioned in the <<opprocess-configuration,OpProcessor Configuration>> +`OpProcessor` setting called `maxParameters`, which is mentioned in the <<opprocessor-configurations,OpProcessor Configuration>> section. It controls the maximum number of parameters that can be passed to the server for script evaluation purposes. Use of this setting can prevent accidental long run compilations, which individually are not terribly oppressive to the server, but taken as a group under high concurrency would be considered detrimental. @@ -2086,7 +2086,7 @@ profile { g.V().iterate() }.prettyPrint() [[describe-graph]] ==== Describe Graph -A good implementation of the Gremlin APIs will validate their features against the xref:validating-with-gremlin-test[Gremlin test suite]. +A good implementation of the Gremlin APIs will validate their features against the link:../dev/provider/#validating-with-gremlin-test[Gremlin test suite]. To learn more about a specific implementation's compliance with the test suite, use the `describeGraph` function. The following shows the output for `HadoopGraph`: http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/3243f63c/docs/src/reference/the-graphcomputer.asciidoc ---------------------------------------------------------------------- diff --git a/docs/src/reference/the-graphcomputer.asciidoc b/docs/src/reference/the-graphcomputer.asciidoc index 0fb9daa..4276f5d 100644 --- a/docs/src/reference/the-graphcomputer.asciidoc +++ b/docs/src/reference/the-graphcomputer.asciidoc @@ -507,7 +507,7 @@ possible to get a global view of a sideEffect until after an iteration has occur In some situations, a "stale" local representation of the sideEffect is sufficient to ensure the intended semantics of the traversal are respected. However, this is not generally true so be wary of traversals that require global views of a sideEffect. To ensure a fresh global representation, use `barrier()` prior to accessing the global sideEffect. Note that this -only comes into play with custom steps and <<lambda-steps,lambda steps>>. The standard Gremlin step library is respective of OLAP semantics. +only comes into play with custom steps and <<general-steps,lambda steps>>. The standard Gremlin step library is respective of OLAP semantics. . When evaluating traversals that rely on path information (i.e. the history of the traversal), practical computational limits can easily be reached due the link:http://en.wikipedia.org/wiki/Combinatorial_explosion[combinatoric explosion] of data. With path computing enabled, every traverser is unique and thus, must be enumerated as opposed to being http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/3243f63c/docs/src/reference/the-traversal.asciidoc ---------------------------------------------------------------------- diff --git a/docs/src/reference/the-traversal.asciidoc b/docs/src/reference/the-traversal.asciidoc index 42bec58..6bf3059 100644 --- a/docs/src/reference/the-traversal.asciidoc +++ b/docs/src/reference/the-traversal.asciidoc @@ -420,7 +420,7 @@ on a step-by-step level and thus, as discussed in their respective section of th * <<simplepath-step, `simplePath()`>>: filter if the traverser's path is simple given `by()`-modulation. * <<sample-step, `sample()`>>: sample using the value returned by `by()`-modulation. * <<where-step, `where()`>>: determine the predicate given the testing of the results of `by()`-modulation. -* <<groupCount-step,`groupCount()`>>: count those groups where the group keys are the result of `by()`-modulation. +* <<groupcount-step,`groupCount()`>>: count those groups where the group keys are the result of `by()`-modulation. * <<group-step, `group()`>>: create group keys and values according to `by()`-modulation. * <<order-step, `order()`>>: order the objects by the results of a `by()`-modulation. * <<path-step, `path()`>>: get the path of the traverser where each path element is `by()`-modulated. @@ -1271,7 +1271,7 @@ g.V().hasLabel('person'). [[option-step]] === Option Step -An option to a <<branch-step,`branch()`>> or <<choose-step,`choose()`>>. +An option to a <<general-steps,`branch()`>> or <<choose-step,`choose()`>>. [[optional-step]] === Optional Step @@ -3308,4 +3308,4 @@ var social = graph.Traversal().WithRemote(connection); social.Persons("marko").Knows("josh"); social.Persons("marko").YoungestFriendsAge(); social.Persons().Filter(CreatedAtLeast(2)).Count(); ----- \ No newline at end of file +----
