| Modifier and Type | Class and Description | 
|---|---|
| class  | GraphFilterStrategy | 
| class  | MessagePassingReductionStrategy | 
| Modifier and Type | Method and Description | 
|---|---|
| Set<Class<? extends TraversalStrategy.OptimizationStrategy>> | MessagePassingReductionStrategy. applyPrior() | 
| 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  | ByModulatorOptimizationStrategyThis strategy looks for standard traversals in by-modulators and replaces them with more optimized traversals
 (e.g. | 
| class  | CountStrategyThis strategy optimizes any occurrence of  CountGlobalStepfollowed by anIsStep. | 
| class  | EarlyLimitStrategyThis strategy looks for  RangeGlobalSteps that can be moved further left in the traversal and thus be applied
 earlier. | 
| class  | FilterRankingStrategyFilterRankingStrategyreorders 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  | InlineFilterStrategyThis strategy analyzes filter-steps with child traversals that themselves are pure filters. | 
| class  | LazyBarrierStrategyLazyBarrierStrategyis an OLTP-only strategy that automatically inserts aNoOpBarrierStepafter everyFlatMapStepif neither path-tracking nor partial path-tracking is required, and the next step is not the
 traversal's last step or aBarrier. | 
| class  | MatchPredicateStrategyMatchWhereStrategywill fold any post-where()step that maintains a traversal constraint intomatch(). | 
| class  | OrderLimitStrategyOrderLimitStrategyis an OLAP strategy that folds aRangeGlobalStepinto a precedingOrderGlobalStep. | 
| class  | PathProcessorStrategyPathProcessStrategyis an OLAP strategy that does its best to turn non-local children inwhere()andselect()into local children by inlining components of the non-local child. | 
| class  | PathRetractionStrategy | 
| class  | ProductiveByStrategyTakes an argument of  by()and wraps itCoalesceStepso that the result is either the initialTraversalargument ornull. | 
| class  | RepeatUnrollStrategyRepeatUnrollStrategyis an OLTP-only strategy that unrolls anyRepeatStepif it uses a constant
 number of loops (times(x)) and doesn't emit intermittent elements. | 
Copyright © 2013–2022 Apache Software Foundation. All rights reserved.