Github user okram commented on a diff in the pull request:
https://github.com/apache/incubator-tinkerpop/pull/310#discussion_r62851083
--- Diff:
tinkergraph-gremlin/src/main/java/org/apache/tinkerpop/gremlin/tinkergraph/process/computer/TinkerGraphComputer.java
---
@@ -54,6 +56,12 @@
*/
public final class TinkerGraphComputer implements GraphComputer {
+ static {
+ // GraphFilters are expensive w/ TinkerGraphComputer as everything
is already in memory
--- End diff --
`TinkerGraphComputer` already has the entire graph loaded in memory. Thus,
when you add a `GraphFilter`, what I'm doing is creating a `Set<Object>` of
edge IDs that are allowed. Then, every `Vertex.edges()` is filtered by
`edge.id() in Set<Object>`. Its lame. As such, edge-based `GraphFilters` are
expensive in `TinkerGraphComputer`.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastruct...@apache.org or file a JIRA ticket
with INFRA.
---
