You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by rd...@apache.org on 2019/07/14 15:18:17 UTC

[tinkerpop] branch master updated: duplicate ids - 'anchor:' is only for creating links to the same place but with a different id

This is an automated email from the ASF dual-hosted git repository.

rdale pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/tinkerpop.git


The following commit(s) were added to refs/heads/master by this push:
     new 9e4a4a1  duplicate ids - 'anchor:' is only for creating links to the same place but with a different id
     new 8197e29  Merge branch 'tp34'
9e4a4a1 is described below

commit 9e4a4a1d161049f15dd342655038ababc4280695
Author: Robert Dale <ro...@gmail.com>
AuthorDate: Sun Jul 14 11:16:28 2019 -0400

    duplicate ids - 'anchor:' is only for creating links to the same place but with a different id
---
 docs/src/reference/implementations-spark.asciidoc | 1 -
 docs/src/reference/the-graphcomputer.asciidoc     | 1 -
 2 files changed, 2 deletions(-)

diff --git a/docs/src/reference/implementations-spark.asciidoc b/docs/src/reference/implementations-spark.asciidoc
index e64b467..808129f 100644
--- a/docs/src/reference/implementations-spark.asciidoc
+++ b/docs/src/reference/implementations-spark.asciidoc
@@ -122,7 +122,6 @@ references to that Spark Context. The exception to this rule are those propertie
 
 Finally, there is a `spark` object that can be used to manage persisted RDDs (see <<interacting-with-spark, Interacting with Spark>>).
 
-anchor:clonevertexprogramusingspark[]
 [[clonevertexprogramusingspark]]
 ===== Using CloneVertexProgram
 
diff --git a/docs/src/reference/the-graphcomputer.asciidoc b/docs/src/reference/the-graphcomputer.asciidoc
index a2c2db6..a2a8315 100644
--- a/docs/src/reference/the-graphcomputer.asciidoc
+++ b/docs/src/reference/the-graphcomputer.asciidoc
@@ -460,7 +460,6 @@ custom distance properties or traversals can lead to much longer runtimes and a
 
 Note that `GraphTraversal` provides a <<shortestpath-step,`shortestPath()`>>-step.
 
-anchor:clonevertexprogram[]
 [[clonevertexprogram]]
 === CloneVertexProgram