updated upgrade docs.
Project: http://git-wip-us.apache.org/repos/asf/tinkerpop/repo Commit: http://git-wip-us.apache.org/repos/asf/tinkerpop/commit/1f76f1e9 Tree: http://git-wip-us.apache.org/repos/asf/tinkerpop/tree/1f76f1e9 Diff: http://git-wip-us.apache.org/repos/asf/tinkerpop/diff/1f76f1e9 Branch: refs/heads/master Commit: 1f76f1e9b1bb3bd980cd3b143228a2c324220477 Parents: 8ff6bdf Author: Marko A. Rodriguez <[email protected]> Authored: Wed Sep 27 11:54:17 2017 -0600 Committer: Marko A. Rodriguez <[email protected]> Committed: Wed Sep 27 11:54:17 2017 -0600 ---------------------------------------------------------------------- docs/src/upgrade/release-3.3.x.asciidoc | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/tinkerpop/blob/1f76f1e9/docs/src/upgrade/release-3.3.x.asciidoc ---------------------------------------------------------------------- diff --git a/docs/src/upgrade/release-3.3.x.asciidoc b/docs/src/upgrade/release-3.3.x.asciidoc index e677995..f18dcd1 100644 --- a/docs/src/upgrade/release-3.3.x.asciidoc +++ b/docs/src/upgrade/release-3.3.x.asciidoc @@ -29,12 +29,35 @@ Please see the link:https://github.com/apache/tinkerpop/blob/3.3.1/CHANGELOG.asc === Upgrading for Users +==== Changed Typing on `from()` and `to()` + +The `from()` and `to()` steps of `GraphTraversal` have a `Traversal<E,Vertex>` overload. The `E` has been changed to `?` +in order to reduce `< >`-based coersion in strongly type Gremlin language variants. + ==== addV(traversal) and addE(traversal) The `GraphTraversal` and `GraphTraversalSource` methods of `addV()` and `addE()` have been extended to support dynamic label determination upon element creation. Both these methods can take a `Traversal<?, String>` where the first `String` returned by the traversal is used as the label of the respective element. +[source,groovy] +---- +gremlin> g = TinkerFactory.createModern().traversal() +==>graphtraversalsource[tinkergraph[vertices:6 edges:6], standard] +gremlin> g.addV(V().has('name','marko').label()). + property('name','stephen') +==>v[13] +gremlin> g.V().has('name','stephen').valueMap(true) +==>[name:[stephen],label:person,id:13] +gremlin> g.V().has('name','stephen'). + addE(V().hasLabel('software').inE().label()). + to(V().has('name','lop')) +==>e[15][13-created->3] +gremlin> g.V().has('name','stephen').outE().valueMap(true) +==>[label:created,id:15] +gremlin> +---- + ==== PageRankVertexProgram There were two major bugs in the way in which PageRank was being calculated in `PageRankVertexProgram`. First, teleportation
