Github user okram commented on a diff in the pull request:
https://github.com/apache/tinkerpop/pull/560#discussion_r103210119
--- Diff:
gremlin-core/src/test/java/org/apache/tinkerpop/gremlin/process/traversal/strategy/optimization/FilterRankingStrategyTest.java
---
@@ -106,7 +106,7 @@ public void doTest() {
{__.dedup().has("value", 0).or(not(has("age")), has("age",
10)).has("value", 1), __.has("value", 0).has("value", 1).or(not(has("age")),
has("age", 10)).dedup(),
Collections.singletonList(InlineFilterStrategy.instance())},
{__.dedup().filter(out()).has("value", 0), has("value",
0).filter(out()).dedup(), Collections.emptyList()},
{filter(out()).dedup().has("value", 0), has("value",
0).filter(out()).dedup(), Collections.emptyList()},
- {__.as("a").out().has("age").where(P.eq("a")),
__.as("a").out().where(P.eq("a")).has("age"), Collections.emptyList()},
+ {__.as("a").out().has("age").where(P.eq("a")),
__.as("a").out().has("age").where(P.eq("a")), Collections.emptyList()},
--- End diff --
`where(eq('a')` might be faster, but probably not. But we don't know what
the `P` predicate is. If its something more complex, than `==` then it will be
slower. And no, `ReferenceVertex` doesn't come into play here as those are
resolved at "attachment" and not dynamically in mid-traversal.
---
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 [email protected] or file a JIRA ticket
with INFRA.
---
