| Interface | Description | 
|---|---|
| Path | |
| Step<S,E> | |
| Translator<S,T> | A Translator will translate  Bytecodeinto another representation. | 
| Translator.ScriptTranslator | Translates bytecode to a string representation. | 
| Translator.ScriptTranslator.TypeTranslator | Provides a way for the  Translator.ScriptTranslatorto convert various data types to their string
 representations in their target language. | 
| Translator.StepTranslator<S extends TraversalSource,T extends Traversal.Admin<?,?>> | Translates bytecode to actual steps. | 
| Traversal<S,E> | |
| Traversal.Admin<S,E> | |
| TraversalSideEffects | A  Traversalcan maintain global sideEffects. | 
| TraversalSource | A  TraversalSourceis used to createTraversalinstances. | 
| TraversalStrategies | A  Traversalmaintains a set ofTraversalStrategyinstances within a TraversalStrategies object. | 
| TraversalStrategy<S extends TraversalStrategy> | A  TraversalStrategydefines a particular atomic operation for mutating aTraversalprior 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  Traverserrepresents the current state of an object flowing through aTraversal. | 
| 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 | Description | 
|---|---|
| AnonymousTraversalSource<T extends TraversalSource> | Provides a unified way to construct a  TraversalSourcefrom the perspective of the traversal. | 
| Bindings | Bindings are used to associate a variable with a value. | 
| Bytecode | When a  TraversalSourceis manipulated and then aTraversalis spawned and mutated, a language
 agnostic representation of those mutations is recorded in a bytecode instance. | 
| Bytecode.Binding<V> | |
| Bytecode.Instruction | |
| IO | Fields that can be provided to the  GraphTraversalSource.io(String)using theGraphTraversal.with(String,Object)step modulator to provide additional configurations. | 
| P<V> | Predefined  Predicatevalues that can be used with | 
| Path.Exceptions | |
| SackFunctions | |
| TextP | Predefined  Predicatevalues that can be used asStringfilters. | 
| Traversal.Exceptions | A collection of  Exceptiontypes associated with Traversal execution. | 
| Traversal.Symbols | |
| TraversalSideEffects.Exceptions | |
| TraversalSource.Symbols | |
| TraversalStrategies.GlobalCache | 
| Enum | Description | 
|---|---|
| Compare | Compareis aBiPredicatethat determines whether the first argument is==,!=,>,>=,<,<=to the second argument. | 
| Contains | Containsis aBiPredicatethat evaluates whether the first object is contained within (or not
 within) the second collection object. | 
| Operator | A set of  BinaryOperatorinstances that handle common operations for traversal steps. | 
| Order | Provides  Comparatorinstances for ordering traversers. | 
| Pop | A  Pathmay have multiple values associated with a single label. | 
| SackFunctions.Barrier | |
| Scope | Many  Stepinstance can have a variable scope which alter the manner in which the step will behave in
 relation to how the traversers are processed. | 
| Text | Textis aBiPredicatethat determines whether the first string starts with, starts
 not with, ends with, ends not with, contains or does not contain the second string argument. | 
Copyright © 2013–2020 Apache Software Foundation. All rights reserved.