| 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  | AdjacentToIncidentStrategyThis strategy looks for vertex- and value-emitting steps followed by a  CountGlobalStepand replaces the
 pattern with an edge- or property-emitting step followed by aCountGlobalStep. | 
| class  | FilterRankingStrategyFilterRankingStrategy reorders filter- and order-steps according to their rank. | 
| class  | IdentityRemovalStrategyIdentityRemovalStrategylooks forIdentityStepinstances and removes them. | 
| class  | IncidentToAdjacentStrategyThis strategy looks for  .outE().inV(),.inE().outV()and.bothE().otherV()and replaces these step sequences with.out(),.in()or.both()respectively. | 
| class  | MatchPredicateStrategyMatchWhereStrategy will fold any post- where()step that maintains a traversal constraint intomatch(). | 
| class  | RangeByIsCountStrategyThis strategy optimizes any occurrence of  CountGlobalStepfollowed by anIsStep. | 
| Modifier and Type | Method and Description | 
|---|---|
| Set<Class<? extends TraversalStrategy.OptimizationStrategy>> | AdjacentToIncidentStrategy. applyPrior() | 
| Set<Class<? extends TraversalStrategy.OptimizationStrategy>> | FilterRankingStrategy. applyPrior() | 
| Set<Class<? extends TraversalStrategy.OptimizationStrategy>> | MatchPredicateStrategy. applyPrior() | 
Copyright © 2013–2015 Apache Software Foundation. All rights reserved.