This is an automated email from the ASF dual-hosted git repository.
colegreer pushed a commit to branch 3.5-dev
in repository https://gitbox.apache.org/repos/asf/tinkerpop.git
The following commit(s) were added to refs/heads/3.5-dev by this push:
new 1d5b509462 CTR Add Changelog and docs for
https://github.com/apache/tinkerpop/pull/2164
1d5b509462 is described below
commit 1d5b509462b23922abfcc24b6a56b6341ef5ac8f
Author: Cole-Greer <[email protected]>
AuthorDate: Thu Jul 27 18:10:18 2023 -0700
CTR Add Changelog and docs for https://github.com/apache/tinkerpop/pull/2164
---
CHANGELOG.asciidoc | 1 +
docs/src/reference/the-graphcomputer.asciidoc | 4 +++-
2 files changed, 4 insertions(+), 1 deletion(-)
diff --git a/CHANGELOG.asciidoc b/CHANGELOG.asciidoc
index e05b81edf6..c672610fd4 100644
--- a/CHANGELOG.asciidoc
+++ b/CHANGELOG.asciidoc
@@ -38,6 +38,7 @@
image::https://raw.githubusercontent.com/apache/tinkerpop/master/docs/static/ima
* Removed `jcabi-manifests` dependency from `gremlin-core`, `gremlin-driver`,
and `gremlin-server`.
* Fixed a bug that caused the `GremlinGroovyScriptEngine` to throw a
`MissingMethodException` when calling a static method in __ with the same name
as an enum.
* Deprecated Neo4j-Gremlin
+* Added `VertexPropertyFilter` to `GraphComputer`
[[release-3-5-6]]
=== TinkerPop 3.5.6 (Release Date: May 1, 2023)
diff --git a/docs/src/reference/the-graphcomputer.asciidoc
b/docs/src/reference/the-graphcomputer.asciidoc
index c21f762a94..940608544a 100644
--- a/docs/src/reference/the-graphcomputer.asciidoc
+++ b/docs/src/reference/the-graphcomputer.asciidoc
@@ -589,14 +589,16 @@ Most OLAP jobs do not require the entire source graph to
faithfully execute thei
----
graph.computer().
vertices(hasLabel("person")).
+ vertexProperties(__.properties("name")).
edges(bothE("knows")).
program(PageRankVertexProgram...)
----
-There are two methods for constructing a `GraphFilter`.
+There are three methods for constructing a `GraphFilter`.
* `vertices(Traversal<Vertex,Vertex>)`: A traversal that will be used that can
only analyze a vertex and its properties.
If the traversal `hasNext()`, the input `Vertex` is passed to the
`GraphComputer`.
+* `vertexProperties(Traversal<Vertex, ? extends Property<?>)`: A traversal
that will either let the vertex property pass or not.
* `edges(Traversal<Vertex,Edge>)`: A traversal that will iterate all legal
edges for the source vertex.
`GraphFilter` is a "push-down predicate" that providers can reason on to
determine the most efficient way to provide
