# Package org.apache.tinkerpop.gremlin.process.traversal.strategy.optimization

- Class Summary
  Class | Description
  --- | ---
  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`.
  CountStrategy | This strategy optimizes any occurrence of `CountGlobalStep` followed by an `IsStep`.
  EarlyLimitStrategy | This strategy looks for `RangeGlobalStep`'s that can be moved further left in the traversal and thus be applied applied earlier.
  EarlyLimitStrategyProcessTest |
  FilterRankingStrategy | FilterRankingStrategy reorders filter- and order-steps according to their rank.
  IdentityRemovalStrategy | `IdentityRemovalStrategy` looks for `IdentityStep` instances and removes them.
  IncidentToAdjacentStrategy | This strategy looks for `.outE().inV()`, `.inE().outV()` and `.bothE().otherV()` and replaces these step sequences with `.out()`, `.in()` or `.both()` respectively.
  IncidentToAdjacentStrategyProcessTest |
  InlineFilterStrategy | InlineFilterStrategy analyzes filter-steps with child traversals that themselves are pure filters.
  LazyBarrierStrategy |
  MatchPredicateStrategy | MatchWhereStrategy will fold any post-`where()` step that maintains a traversal constraint into `match()`.
  OrderLimitStrategy |
  PathProcessorStrategy | PathProcessStrategy is an OLAP strategy that does its best to turn non-local children in `where()` and `select()` into local children by inlining components of the non-local child.
  PathRetractionStrategy |
  RepeatUnrollStrategy |

Copyright © 2013–2019 Apache Software Foundation. All rights reserved.