| Package | Description |
|---|---|
| org.apache.tinkerpop.gremlin.process.traversal | |
| org.apache.tinkerpop.gremlin.process.traversal.strategy.optimization |
| Modifier and Type | Method and Description |
|---|---|
default Class<TraversalStrategy.OptimizationStrategy> |
TraversalStrategy.OptimizationStrategy.getTraversalCategory() |
| Modifier and Type | Class and Description |
|---|---|
class |
AdjacentToIncidentStrategy
This strategy looks for vertex- and value-emitting steps followed by a
CountGlobalStep and replaces the
pattern with an edge- or property-emitting step followed by a CountGlobalStep. |
class |
FilterRankingStrategy
FilterRankingStrategy reorders filter- and order-steps according to their rank.
|
class |
IdentityRemovalStrategy
IdentityRemovalStrategy looks for IdentityStep instances and removes them. |
class |
IncidentToAdjacentStrategy
This strategy looks for
.outE().inV(), .inE().outV() and .bothE().otherV()
and replaces these step sequences with .out(), .in() or .both() respectively. |
class |
MatchPredicateStrategy
MatchWhereStrategy will fold any post-
where() step that maintains a traversal constraint into
match(). |
class |
OrderLimitStrategy |
class |
PathProcessorStrategy |
class |
RangeByIsCountStrategy
This strategy optimizes any occurrence of
CountGlobalStep followed by an IsStep. |
| Modifier and Type | Method and Description |
|---|---|
Set<Class<? extends TraversalStrategy.OptimizationStrategy>> |
IncidentToAdjacentStrategy.applyPrior() |
Set<Class<? extends TraversalStrategy.OptimizationStrategy>> |
PathProcessorStrategy.applyPrior() |
Set<Class<? extends TraversalStrategy.OptimizationStrategy>> |
MatchPredicateStrategy.applyPrior() |
Set<Class<? extends TraversalStrategy.OptimizationStrategy>> |
AdjacentToIncidentStrategy.applyPrior() |
Set<Class<? extends TraversalStrategy.OptimizationStrategy>> |
FilterRankingStrategy.applyPrior() |
Copyright © 2013–2016 Apache Software Foundation. All rights reserved.