| Interface | Description |
|---|---|
| Path | |
| Step<S,E> | |
| Translator<S,T> |
A Translator will translate
Bytecode into another representation. |
| Translator.ScriptTranslator |
Translates bytecode to a Script representation.
|
| Translator.ScriptTranslator.TypeTranslator |
Provides a way for the
Translator.ScriptTranslator to 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
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 | Description |
|---|---|
| AnonymousTraversalSource<T extends TraversalSource> |
Provides a unified way to construct a
TraversalSource from the perspective of the traversal. |
| 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 | |
| IO |
Fields that can be provided to the
GraphTraversalSource.io(String) using the
GraphTraversal.with(String,Object) step modulator to provide additional configurations. |
| P<V> |
Predefined
Predicate values that can be used with |
| Path.Exceptions | |
| SackFunctions | |
| Script |
General representation of script
|
| TextP |
Predefined
Predicate values that can be used as String filters. |
| Translator.ScriptTranslator.AbstractTypeTranslator | |
| Traversal.Exceptions |
A collection of
Exception types associated with Traversal execution. |
| Traversal.Symbols | |
| TraversalSideEffects.Exceptions | |
| TraversalSource.Symbols | |
| TraversalStrategies.GlobalCache |
| 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. |
| GraphOp |
A
GraphOp or "graph operation" is a static Bytecode form that does not translate to a traversal
but instead refers to a specific function to perform on a graph instance. |
| 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. |
| Text |
Text is a BiPredicate that 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–2022 Apache Software Foundation. All rights reserved.