| 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 |
VertexProgramRestrictionStrategy
Detects the presence of a
VertexProgramStrategy and throws an IllegalStateException if it is found. |
| Modifier and Type | Class and Description |
|---|---|
class |
RemoteStrategy
Reconstructs a
Traversal by appending a RemoteStep to its end. |
| 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 |
SeedStrategy
A strategy that resets the specified
seed value for Seedable steps, which in turn will produce
deterministic results from those steps. |
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 |
ByModulatorOptimizationStrategy
This strategy looks for standard traversals in by-modulators and replaces them with more optimized traversals
(e.g.
|
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 |
ProductiveByStrategy
Takes an argument of
by() and wraps it CoalesceStep so that the result is either the initial
Traversal argument or null. |
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 | 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 |
class |
TinkerMergeEVStepStrategy
Optimizes
mergeV() and mergeE() search lookups by using TinkerMergeVertexStep and
TinkerMergeEdgeStep respectively. |
Copyright © 2013–2022 Apache Software Foundation. All rights reserved.