| Modifier and Type | Method and Description |
|---|---|
GraphTraversalSource |
GraphManager.ManagedGraphProvider.traversal(Graph graph,
TraversalStrategy... strategies) |
default GraphTraversalSource |
GraphProvider.traversal(Graph graph,
TraversalStrategy... strategies)
Create a
GraphTraversalSource from a Graph instance. |
| Modifier and Type | Class and Description |
|---|---|
class |
HadoopIoStrategy
The default implementation of the
IoStep is a single threaded operation and doesn't properly take into
account the method by which OLAP read/writes take place with Hadoop. |
| Modifier and Type | Class and Description |
|---|---|
class |
Neo4jGraphStepStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
VertexProgramStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
ComputerFinalizationStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
GraphFilterStrategy |
class |
MessagePassingReductionStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
RemoteStrategy
Reconstructs a
Traversal by appending a RemoteStep to its end. |
| Modifier and Type | Interface and Description |
|---|---|
interface |
TraversalStrategy<S extends TraversalStrategy>
A
TraversalStrategy defines a particular atomic operation for mutating a Traversal prior to its evaluation. |
| Modifier and Type | Interface and Description |
|---|---|
static interface |
TraversalStrategy.DecorationStrategy
Implemented by strategies that adds "application logic" to the traversal (e.g.
|
static interface |
TraversalStrategy.FinalizationStrategy
Implemented by strategies that do final behaviors that require a fully compiled traversal to work (e.g.
|
static interface |
TraversalStrategy.OptimizationStrategy
Implemented by strategies that rewrite the traversal to be more efficient, but with the same semantics
(e.g.
|
static interface |
TraversalStrategy.ProviderOptimizationStrategy
Implemented by strategies that rewrite the traversal to be more efficient, but with the same semantics.
|
static interface |
TraversalStrategy.VerificationStrategy
Implemented by strategies where there is no more behavioral tweaking of the traversal required.
|
| Modifier and Type | Field and Description |
|---|---|
static List<Class<? extends TraversalStrategy>> |
TraversalStrategies.STRATEGY_CATEGORIES |
| Modifier and Type | Method and Description |
|---|---|
default <T extends TraversalStrategy> |
TraversalStrategies.getStrategy(Class<T> traversalStrategyClass)
Return the
TraversalStrategy instance associated with the provided class. |
| Modifier and Type | Method and Description |
|---|---|
static Set<TraversalStrategy<?>> |
TraversalStrategies.sortStrategies(Set<TraversalStrategy<?>> strategies)
Sorts the list of provided strategies such that the
applyPost()
and applyPrior() dependencies are respected. |
List<TraversalStrategy<?>> |
TraversalStrategies.toList()
Return all the
TraversalStrategy singleton instances associated with this TraversalStrategies. |
| Modifier and Type | Method and Description |
|---|---|
TraversalStrategies |
TraversalStrategies.addStrategies(TraversalStrategy<?>... strategies)
Add all the provided
TraversalStrategy instances to the current collection. |
default TraversalSource |
TraversalSource.withStrategies(TraversalStrategy... traversalStrategies)
Add an arbitrary collection of
TraversalStrategy instances to the traversal source. |
| Modifier and Type | Method and Description |
|---|---|
default int |
TraversalStrategy.compareTo(Class<? extends TraversalStrategy> otherTraversalCategory) |
default int |
TraversalStrategy.DecorationStrategy.compareTo(Class<? extends TraversalStrategy> otherTraversalCategory) |
default int |
TraversalStrategy.OptimizationStrategy.compareTo(Class<? extends TraversalStrategy> otherTraversalCategory) |
default int |
TraversalStrategy.ProviderOptimizationStrategy.compareTo(Class<? extends TraversalStrategy> otherTraversalCategory) |
default int |
TraversalStrategy.FinalizationStrategy.compareTo(Class<? extends TraversalStrategy> otherTraversalCategory) |
default int |
TraversalStrategy.VerificationStrategy.compareTo(Class<? extends TraversalStrategy> otherTraversalCategory) |
static Set<TraversalStrategy<?>> |
TraversalStrategies.sortStrategies(Set<TraversalStrategy<?>> strategies)
Sorts the list of provided strategies such that the
applyPost()
and applyPrior() dependencies are respected. |
static void |
TraversalStrategies.visit(Map<Class<? extends TraversalStrategy>,Set<Class<? extends TraversalStrategy>>> dependencyMap,
List<Class<? extends TraversalStrategy>> sortedStrategyClasses,
Set<Class<? extends TraversalStrategy>> seenStrategyClases,
List<Class<? extends TraversalStrategy>> unprocessedStrategyClasses,
Class<? extends TraversalStrategy> strategyClass) |
static void |
TraversalStrategies.visit(Map<Class<? extends TraversalStrategy>,Set<Class<? extends TraversalStrategy>>> dependencyMap,
List<Class<? extends TraversalStrategy>> sortedStrategyClasses,
Set<Class<? extends TraversalStrategy>> seenStrategyClases,
List<Class<? extends TraversalStrategy>> unprocessedStrategyClasses,
Class<? extends TraversalStrategy> strategyClass) |
static void |
TraversalStrategies.visit(Map<Class<? extends TraversalStrategy>,Set<Class<? extends TraversalStrategy>>> dependencyMap,
List<Class<? extends TraversalStrategy>> sortedStrategyClasses,
Set<Class<? extends TraversalStrategy>> seenStrategyClases,
List<Class<? extends TraversalStrategy>> unprocessedStrategyClasses,
Class<? extends TraversalStrategy> strategyClass) |
static void |
TraversalStrategies.visit(Map<Class<? extends TraversalStrategy>,Set<Class<? extends TraversalStrategy>>> dependencyMap,
List<Class<? extends TraversalStrategy>> sortedStrategyClasses,
Set<Class<? extends TraversalStrategy>> seenStrategyClases,
List<Class<? extends TraversalStrategy>> unprocessedStrategyClasses,
Class<? extends TraversalStrategy> strategyClass) |
static void |
TraversalStrategies.visit(Map<Class<? extends TraversalStrategy>,Set<Class<? extends TraversalStrategy>>> dependencyMap,
List<Class<? extends TraversalStrategy>> sortedStrategyClasses,
Set<Class<? extends TraversalStrategy>> seenStrategyClases,
List<Class<? extends TraversalStrategy>> unprocessedStrategyClasses,
Class<? extends TraversalStrategy> strategyClass) |
static void |
TraversalStrategies.visit(Map<Class<? extends TraversalStrategy>,Set<Class<? extends TraversalStrategy>>> dependencyMap,
List<Class<? extends TraversalStrategy>> sortedStrategyClasses,
Set<Class<? extends TraversalStrategy>> seenStrategyClases,
List<Class<? extends TraversalStrategy>> unprocessedStrategyClasses,
Class<? extends TraversalStrategy> strategyClass) |
| Modifier and Type | Method and Description |
|---|---|
GraphTraversalSource |
GraphTraversalSource.withStrategies(TraversalStrategy... traversalStrategies)
Add an arbitrary collection of
TraversalStrategy instances to the traversal source. |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractTraversalStrategy<S extends TraversalStrategy> |
class |
TraversalStrategyProxy<T extends TraversalStrategy>
This class is for use with
Bytecode and for serialization purposes. |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractTraversalStrategy<S extends TraversalStrategy> |
class |
TraversalStrategyProxy<T extends TraversalStrategy>
This class is for use with
Bytecode and for serialization purposes. |
| Modifier and Type | Class and Description |
|---|---|
class |
ConnectiveStrategy
|
class |
ElementIdStrategy
Provides a degree of control over element identifier assignment as some graphs don't provide that feature.
|
class |
EventStrategy
A strategy that raises events when
Mutating steps are encountered and successfully executed. |
class |
HaltedTraverserStrategy |
class |
OptionsStrategy
This strategy will not alter the traversal.
|
class |
PartitionStrategy
PartitionStrategy partitions the vertices, edges and vertex properties of a graph into String named
partitions (i.e. |
class |
RequirementsStrategy |
class |
SackStrategy
The
SackStrategy is used internal to the withSack() steps of TraversalSource and is not
typically constructed directly. |
class |
SideEffectStrategy |
class |
SubgraphStrategy
This
TraversalStrategy provides a way to limit the view of a Traversal. |
class |
TranslationStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
MatchAlgorithmStrategy |
class |
ProfileStrategy |
class |
ReferenceElementStrategy
A strategy that detaches traversers with graph elements as references (i.e.
|
| Modifier and Type | Class and Description |
|---|---|
class |
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. |
class |
CountStrategy
This strategy optimizes any occurrence of
CountGlobalStep followed by an IsStep. |
class |
EarlyLimitStrategy
This strategy looks for
RangeGlobalSteps that can be moved further left in the traversal and thus be applied
earlier. |
class |
FilterRankingStrategy
FilterRankingStrategy reorders filter- and order-steps according to their rank. |
class |
IdentityRemovalStrategy
IdentityRemovalStrategy looks for IdentityStep instances and removes them. |
class |
IncidentToAdjacentStrategy
This strategy looks for
.outE().inV(), .inE().outV() and .bothE().otherV()
and replaces these step sequences with .out(), .in() or .both() respectively. |
class |
InlineFilterStrategy
This strategy analyzes filter-steps with child traversals that themselves are pure filters.
|
class |
LazyBarrierStrategy
LazyBarrierStrategy is an OLTP-only strategy that automatically inserts a NoOpBarrierStep after every
FlatMapStep if neither path-tracking nor partial path-tracking is required, and the next step is not the
traversal's last step or a Barrier. |
class |
MatchPredicateStrategy
MatchWhereStrategy will fold any post-where() step that maintains a traversal constraint into
match(). |
class |
OrderLimitStrategy
OrderLimitStrategy is an OLAP strategy that folds a RangeGlobalStep into a preceding
OrderGlobalStep. |
class |
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. |
class |
PathRetractionStrategy |
class |
RepeatUnrollStrategy
RepeatUnrollStrategy is an OLTP-only strategy that unrolls any RepeatStep if it uses a constant
number of loops (times(x)) and doesn't emit intermittent elements. |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractWarningVerificationStrategy
Base
TraversalStrategy class that is configurable to throw warnings or exceptions. |
class |
ComputerVerificationStrategy |
class |
EdgeLabelVerificationStrategy
EdgeLabelVerificationStrategy does not allow edge traversal steps to have no label specified. |
class |
LambdaRestrictionStrategy
LambdaRestrictionStrategy does not allow lambdas to be used in a Traversal. |
class |
ReadOnlyStrategy
Detects steps marked with
Mutating and throws an IllegalStateException if one is found. |
class |
ReservedKeysVerificationStrategy
This verification strategy detects property keys that should not be used by the traversal.
|
class |
StandardVerificationStrategy |
| Modifier and Type | Field and Description |
|---|---|
protected Set<TraversalStrategy<?>> |
DefaultTraversalStrategies.traversalStrategies |
| Modifier and Type | Method and Description |
|---|---|
static <A extends TraversalStrategy> |
BytecodeHelper.findStrategies(Bytecode bytecode,
Class<A> clazz)
Parses
Bytecode to find TraversalStrategy objects in the source instructions. |
static <A extends TraversalStrategy> |
BytecodeUtil.findStrategies(Bytecode bytecode,
Class<A> clazz)
Deprecated.
As of release 3.4.9, replaced by
BytecodeHelper.findStrategies(Bytecode, Class). |
<T extends TraversalStrategy> |
DefaultTraversalStrategies.getStrategy(Class<T> traversalStrategyClass) |
| Modifier and Type | Method and Description |
|---|---|
List<TraversalStrategy<?>> |
EmptyTraversalStrategies.toList() |
List<TraversalStrategy<?>> |
DefaultTraversalStrategies.toList() |
| Modifier and Type | Method and Description |
|---|---|
TraversalStrategies |
EmptyTraversalStrategies.addStrategies(TraversalStrategy<?>... strategies) |
TraversalStrategies |
DefaultTraversalStrategies.addStrategies(TraversalStrategy<?>... strategies) |
| Modifier and Type | Method and Description |
|---|---|
static void |
TraversalHelper.applySingleLevelStrategies(Traversal.Admin<?,?> parentTraversal,
Traversal.Admin<?,?> childTraversal,
Class<? extends TraversalStrategy> stopAfterStrategy) |
| Modifier and Type | Class and Description |
|---|---|
class |
SparkInterceptorStrategy |
class |
SparkSingleIterationStrategy |
| Modifier and Type | Method and Description |
|---|---|
protected TraversalStrategy |
TraversalStrategySerializer.readValue(Buffer buffer,
GraphBinaryReader context) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
TraversalStrategySerializer.writeValue(TraversalStrategy value,
Buffer buffer,
GraphBinaryWriter context) |
| Modifier and Type | Method and Description |
|---|---|
static String |
StringFactory.traversalStrategyString(TraversalStrategy traversalStrategy) |
| Modifier and Type | Class and Description |
|---|---|
class |
TinkerGraphCountStrategy
This strategy will do a direct
TinkerHelper.getVertices(org.apache.tinkerpop.gremlin.tinkergraph.structure.TinkerVertex, org.apache.tinkerpop.gremlin.structure.Direction, java.lang.String...)
size call if the traversal is a count of the vertices and edges of the graph or a one-to-one map chain thereof. |
class |
TinkerGraphStepStrategy |
Copyright © 2013–2020 Apache Software Foundation. All rights reserved.