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

- Interface Summary
  Interface | Description
  --- | ---
  Parameterizing | An interface for `Step` implementations that hold a `Parameters` object, which fold in arguments from other steps.
  Path | A Path denotes a particular walk through a `Graph` as defined by a `Traversal`.
  Step<S,E> | A `Step` denotes a unit of computation within a `Traversal`.
  Translator<S,T> | A Translator will translate `Bytecode` into another representation.
  Translator.ScriptTranslator |
  Translator.StepTranslator<S extends TraversalSource,T extends Traversal.Admin<?,?>> |
  Traversal<S,E> | A `Traversal` represents a directed walk over a `Graph`.
  Traversal.Admin<S,E> |
  TraversalEngine | Deprecated As of release 3.2.0, replaced by `Computer`.
  TraversalEngine.Builder | Deprecated
  TraversalSideEffects | A `Traversal` can maintain global sideEffects.
  TraversalSource | A `TraversalSource` is used to create `Traversal` instances.
  TraversalStrategies | A `Traversal` maintains a set of `TraversalStrategy` instances within a TraversalStrategies object.
  TraversalStrategy<S extends TraversalStrategy> | A `TraversalStrategy` defines a particular atomic operation for mutating a `Traversal` prior to its evaluation.
  TraversalStrategy.DecorationStrategy | Implemented by strategies that adds "application logic" to the traversal (e.g.
  TraversalStrategy.FinalizationStrategy | Implemented by strategies that do final behaviors that require a fully compiled traversal to work (e.g.
  TraversalStrategy.OptimizationStrategy | Implemented by strategies that rewrite the traversal to be more efficient, but with the same semantics (e.g.
  TraversalStrategy.ProviderOptimizationStrategy | Implemented by strategies that rewrite the traversal to be more efficient, but with the same semantics.
  TraversalStrategy.VerificationStrategy | Implemented by strategies where there is no more behavioral tweaking of the traversal required.
  Traverser<T> | A `Traverser` represents the current state of an object flowing through a `Traversal`.
  Traverser.Admin<T> | The methods in System.Traverser are useful to underlying Step and Traversal implementations.
  TraverserGenerator | A TraverserGenerator will generate traversers for a particular `Traversal`.

- Class Summary
  Class | Description
  --- | ---
  Bindings | Bindings are used to associate a variable with a value.
  Bytecode | When a `TraversalSource` is manipulated and then a `Traversal` is spawned and mutated, a language agnostic representation of those mutations is recorded in a bytecode instance.
  Bytecode.Binding<V> |
  Bytecode.Instruction |
  CoreTraversalTest |
  P<V> | Predefined `Predicate` values that can be used with
  Path.Exceptions |
  SackFunctions |
  Traversal.Exceptions | A collection of `Exception` types associated with Traversal execution.
  Traversal.Symbols |
  TraversalInterruptionComputerTest |
  TraversalInterruptionTest |
  TraversalSideEffects.Exceptions |
  TraversalSource.Symbols |
  TraversalStrategies.GlobalCache |

- Enum Summary
  Enum | Description
  --- | ---
  Compare | `Compare` is a `BiPredicate` that determines whether the first argument is `==`, `!=`, `>`, `>=`, `<`, `<=` to the second argument.
  Contains | `Contains` is a `BiPredicate` that evaluates whether the first object is contained within (or not within) the second collection object.
  Operator | A set of `BinaryOperator` instances that handle common operations for traversal steps.
  Order | Provides `Comparator` instances for ordering traversers.
  Pop | A `Path` may have multiple values associated with a single label.
  SackFunctions.Barrier |
  Scope | Many `Step` instance can have a variable scope which alter the manner in which the step will behave in relation to how the traversers are processed.
  TraversalEngine.Type |

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