Modifier and Type | Class and Description |
---|---|
class |
ComputerResultStep<S> |
class |
ConnectedComponentVertexProgramStep |
class |
PageRankVertexProgramStep |
class |
PeerPressureVertexProgramStep |
class |
ProgramVertexProgramStep |
class |
ShortestPathVertexProgramStep |
class |
TraversalVertexProgramStep |
class |
VertexProgramStep |
Modifier and Type | Method and Description |
---|---|
static boolean |
MessagePassingReductionStrategy.endsWithElement(Step<?,?> currentStep) |
Modifier and Type | Method and Description |
---|---|
List<Step> |
AbstractRemoteTraversal.getSteps() |
Modifier and Type | Method and Description |
---|---|
<S2,E2> Traversal.Admin<S2,E2> |
AbstractRemoteTraversal.addStep(int index,
Step<?,?> step) |
Modifier and Type | Class and Description |
---|---|
class |
RemoteStep<S,E>
Sends a
Traversal to a RemoteConnection and iterates back the results. |
Modifier and Type | Method and Description |
---|---|
Step<S,E> |
Step.clone()
Cloning is used to duplicate steps for the purpose of traversal optimization and OLTP replication.
|
default Step<?,E> |
Traversal.Admin.getEndStep()
Get the end/tail of the traversal.
|
Step<E,?> |
Step.getNextStep()
Get the next step to the current step.
|
Step<?,S> |
Step.getPreviousStep()
Get the step prior to the current step.
|
default Step<S,?> |
Traversal.Admin.getStartStep()
Get the start/head of the traversal.
|
Modifier and Type | Method and Description |
---|---|
List<Step> |
Traversal.Admin.getSteps()
Get the
Step instances associated with this traversal. |
Modifier and Type | Method and Description |
---|---|
<S2,E2> Traversal.Admin<S2,E2> |
Traversal.Admin.addStep(int index,
Step<?,?> step)
Add a
Step to an arbitrary point in the traversal. |
default <E2> Traversal.Admin<S,E2> |
Traversal.Admin.addStep(Step<?,E2> step)
Add a
Step to the end of the traversal. |
default boolean |
Step.equals(Step other,
boolean compareIds)
Compare the current step with another step.
|
<S> Traverser.Admin<S> |
TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
default <S> Iterator<Traverser.Admin<S>> |
TraverserGenerator.generateIterator(Iterator<S> starts,
Step<S,?> startStep,
long initialBulk) |
default <S2,E2> Traversal.Admin<S2,E2> |
Traversal.Admin.removeStep(Step<?,?> step)
Remove a
Step from the traversal. |
void |
Step.setNextStep(Step<E,?> step)
Set the step that is next to the current step.
|
void |
Step.setPreviousStep(Step<?,S> step)
Set the step that is previous to the current step.
|
<R> Traverser.Admin<R> |
Traverser.Admin.split(R r,
Step<T,R> step)
Generate a child traverser of the current traverser for current as step and new object location.
|
Modifier and Type | Method and Description |
---|---|
default <E2> GraphTraversal.Admin<S,E2> |
GraphTraversal.Admin.addStep(Step<?,E2> step) |
Modifier and Type | Method and Description |
---|---|
List<Step> |
AbstractLambdaTraversal.getSteps() |
Modifier and Type | Method and Description |
---|---|
<S2,E2> Traversal.Admin<S2,E2> |
AbstractLambdaTraversal.addStep(int index,
Step<?,?> step) |
Modifier and Type | Method and Description |
---|---|
default Step<?,?> |
TraversalParent.asStep() |
Modifier and Type | Method and Description |
---|---|
static void |
GraphComputing.atMaster(Step<?,?> step,
boolean atMaster) |
Modifier and Type | Class and Description |
---|---|
class |
BranchStep<S,E,M> |
class |
ChooseStep<S,E,M>
A step which offers a choice of two or more Traversals to take.
|
class |
LocalStep<S,E> |
class |
OptionalStep<S> |
class |
RepeatStep<S> |
static class |
RepeatStep.RepeatEndStep<S> |
class |
UnionStep<S,E> |
Modifier and Type | Class and Description |
---|---|
class |
AndStep<S> |
class |
ClassFilterStep<S,T> |
class |
CoinStep<S> |
class |
ConnectiveStep<S> |
class |
DedupGlobalStep<S> |
class |
DropStep<S> |
class |
FilterStep<S> |
class |
HasStep<S extends Element> |
class |
IsStep<S> |
class |
LambdaFilterStep<S> |
class |
NoneStep<S> |
class |
NotStep<S> |
class |
OrStep<S> |
class |
PathFilterStep<S> |
class |
RangeGlobalStep<S> |
class |
SampleGlobalStep<S> |
class |
TailGlobalStep<S> |
class |
TimeLimitStep<S> |
class |
TraversalFilterStep<S> |
class |
WherePredicateStep<S> |
class |
WhereTraversalStep<S> |
static class |
WhereTraversalStep.WhereEndStep |
static class |
WhereTraversalStep.WhereStartStep<S> |
Modifier and Type | Class and Description |
---|---|
class |
AddEdgeStartStep |
class |
AddEdgeStep<S> |
class |
AddVertexStartStep |
class |
AddVertexStep<S> |
class |
CallStep<S,E>
Reference implementation for service calls via the
ServiceRegistry and Service APIs. |
class |
CoalesceStep<S,E> |
class |
ConstantStep<S,E> |
class |
CountGlobalStep<S> |
class |
CountLocalStep<S> |
class |
DedupLocalStep<E,S extends Iterable<E>> |
class |
EdgeOtherVertexStep |
class |
EdgeVertexStep |
class |
ElementMapStep<K,E>
Converts a
Element to a Map . |
class |
ElementStep<P extends Property,E extends Element>
Traverse from a Property to its Element.
|
class |
FlatMapStep<S,E> |
class |
FoldStep<S,E> |
class |
GraphStep<S,E extends Element> |
class |
GroupCountStep<S,E> |
class |
GroupStep<S,K,V> |
class |
HasNextStep<S> |
class |
IdStep<S extends Element> |
class |
IndexStep<S,E> |
class |
LabelStep<S extends Element> |
class |
LambdaCollectingBarrierStep<S> |
class |
LambdaFlatMapStep<S,E> |
class |
LambdaMapStep<S,E> |
class |
LoopsStep<S> |
class |
MapStep<S,E>
|
class |
MatchStep<S,E> |
static class |
MatchStep.MatchEndStep |
static class |
MatchStep.MatchStartStep |
class |
MathStep<S> |
class |
MaxGlobalStep<S extends Comparable> |
class |
MaxLocalStep<E extends Comparable,S extends Iterable<E>> |
class |
MeanGlobalStep<S extends Number,E extends Number> |
class |
MeanLocalStep<E extends Number,S extends Iterable<E>> |
class |
MergeEdgeStep<S>
Implementation for the
mergeE() step covering both the start step version and the one used mid-traversal. |
class |
MergeVertexStep<S>
Implementation for the
mergeV() step covering both the start step version and the one used mid-traversal. |
class |
MinGlobalStep<S extends Comparable> |
class |
MinLocalStep<E extends Comparable,S extends Iterable<E>> |
class |
NoOpBarrierStep<S> |
class |
OrderGlobalStep<S,C extends Comparable> |
class |
OrderLocalStep<S,C extends Comparable> |
class |
PathStep<S> |
static class |
ProfileTest.MockStep
ProfileStrategy callback test.
|
class |
ProjectStep<S,E> |
class |
PropertiesStep<E> |
class |
PropertyKeyStep |
class |
PropertyMapStep<K,E> |
class |
PropertyValueStep<E> |
class |
RangeLocalStep<S> |
class |
SackStep<S,E> |
class |
SampleLocalStep<S> |
class |
ScalarMapStep<S,E>
|
class |
SelectOneStep<S,E> |
class |
SelectStep<S,E> |
class |
SumGlobalStep<S extends Number> |
class |
SumLocalStep<E extends Number,S extends Iterable<E>> |
class |
TailLocalStep<S> |
class |
TraversalFlatMapStep<S,E> |
class |
TraversalMapStep<S,E> |
class |
TraversalSelectStep<S,E> |
class |
TreeStep<S> |
class |
UnfoldStep<S,E> |
class |
VertexStep<E extends Element> |
Modifier and Type | Method and Description |
---|---|
static boolean |
GraphStep.isStartStep(Step<?,?> step) |
Modifier and Type | Class and Description |
---|---|
class |
AddPropertyStep<S extends Element> |
class |
AggregateGlobalStep<S> |
class |
AggregateLocalStep<S> |
class |
FailStep<S>
Triggers an immediate failure of the traversal by throwing a
RuntimeException . |
class |
GroupCountSideEffectStep<S,E> |
class |
GroupSideEffectStep<S,K,V> |
class |
IdentityStep<S> |
class |
InjectStep<S> |
class |
IoStep<S>
Handles read and write operations into the
Graph . |
class |
LambdaSideEffectStep<S> |
class |
ProfileSideEffectStep<S> |
class |
SackValueStep<S,A,B> |
class |
SideEffectCapStep<S,E> |
class |
SideEffectStep<S> |
class |
StartStep<S> |
class |
SubgraphStep
A side-effect step that produces an edge induced subgraph.
|
class |
TraversalSideEffectStep<S> |
class |
TreeSideEffectStep<S> |
Modifier and Type | Method and Description |
---|---|
static boolean |
StartStep.isVariableStartStep(Step<?,?> step) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractStep<S,E> |
class |
CollectingBarrierStep<S> |
class |
ComputerAwareStep<S,E> |
static class |
ComputerAwareStep.EndStep<S> |
class |
EmptyStep<S,E> |
class |
ProfileStep<S> |
class |
ReducingBarrierStep<S,E> |
class |
RequirementsStep<S> |
class |
SupplyingBarrierStep<S,E> |
Modifier and Type | Field and Description |
---|---|
protected Step<E,?> |
AbstractStep.nextStep |
protected Step<?,S> |
AbstractStep.previousStep |
Modifier and Type | Method and Description |
---|---|
Step<E,?> |
AbstractStep.getNextStep() |
Step<E,?> |
EmptyStep.getNextStep() |
Step<?,S> |
AbstractStep.getPreviousStep() |
Step<?,S> |
EmptyStep.getPreviousStep() |
Modifier and Type | Method and Description |
---|---|
void |
AbstractStep.setNextStep(Step<E,?> step) |
void |
EmptyStep.setNextStep(Step<E,?> step) |
void |
AbstractStep.setPreviousStep(Step<?,S> step) |
void |
EmptyStep.setPreviousStep(Step<?,S> step) |
Constructor and Description |
---|
ExpandableStepIterator(Step<S,?> hostStep) |
ExpandableStepIterator(Step<S,?> hostStep,
TraverserSet<S> traverserSet) |
Modifier and Type | Class and Description |
---|---|
static class |
ReferenceElementStrategy.ReferenceElementStep<S,E> |
Modifier and Type | Method and Description |
---|---|
<S> Traverser.Admin<S> |
B_LP_O_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
B_LP_NL_O_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
LP_O_OB_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
B_O_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
LP_O_OB_P_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
B_LP_O_P_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
B_O_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
B_NL_O_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
NL_O_OB_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
B_LP_NL_O_P_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
LP_NL_O_OB_P_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
O_OB_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<S> Traverser.Admin<S> |
LP_NL_O_OB_S_SE_SL_TraverserGenerator.generate(S start,
Step<S,?> startStep,
long initialBulk) |
<R> Traverser.Admin<R> |
O_OB_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
B_LP_NL_O_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
B_O_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
LP_O_OB_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
NL_O_OB_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
B_NL_O_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
LP_NL_O_OB_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
LP_O_OB_P_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
O_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
B_LP_NL_O_P_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
LP_NL_O_OB_P_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
B_LP_O_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
ProjectedTraverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
B_LP_O_P_S_SE_SL_Traverser.split(R r,
Step<T,R> step) |
Constructor and Description |
---|
B_LP_NL_O_P_S_SE_SL_Traverser(T t,
Step<T,?> step,
long initialBulk) |
B_LP_NL_O_S_SE_SL_Traverser(T t,
Step<T,?> step,
long initialBulk) |
B_LP_O_P_S_SE_SL_Traverser(T t,
Step<T,?> step,
long initialBulk) |
B_LP_O_S_SE_SL_Traverser(T t,
Step<T,?> step,
long initialBulk) |
B_NL_O_S_SE_SL_Traverser(T t,
Step<T,?> step,
long initialBulk) |
B_O_S_SE_SL_Traverser(T t,
Step<T,?> step,
long initialBulk) |
LP_NL_O_OB_P_S_SE_SL_Traverser(T t,
Step<T,?> step) |
LP_NL_O_OB_S_SE_SL_Traverser(T t,
Step<T,?> step) |
LP_O_OB_P_S_SE_SL_Traverser(T t,
Step<T,?> step) |
LP_O_OB_S_SE_SL_Traverser(T t,
Step<T,?> step) |
NL_O_OB_S_SE_SL_Traverser(T t,
Step<T,?> step) |
O_OB_S_SE_SL_Traverser(T t,
Step<T,?> step) |
Modifier and Type | Method and Description |
---|---|
<R> Traverser.Admin<R> |
EmptyTraverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
DummyTraverser.split(R r,
Step<T,R> step) |
<R> Traverser.Admin<R> |
AbstractTraverser.split(R r,
Step<T,R> step) |
Modifier and Type | Field and Description |
---|---|
protected List<Step> |
DefaultTraversal.steps |
protected List<Step> |
DefaultTraversal.unmodifiableSteps |
Modifier and Type | Method and Description |
---|---|
<A,B,C extends Step<A,B>> |
TraversalMatrix.getStepById(String stepId) |
Modifier and Type | Method and Description |
---|---|
Step<?,E> |
DefaultTraversal.getEndStep() |
Step<S,?> |
DefaultTraversal.getStartStep() |
static <S,E> Step<?,E> |
TraversalHelper.insertTraversal(int insertIndex,
Traversal.Admin<S,E> insertTraversal,
Traversal.Admin<?,?> traversal) |
static <S,E> Step<?,E> |
TraversalHelper.insertTraversal(Step<?,S> previousStep,
Traversal.Admin<S,E> insertTraversal,
Traversal.Admin<?,?> traversal) |
Modifier and Type | Method and Description |
---|---|
List<Step> |
DefaultTraversal.getSteps() |
List<Step> |
EmptyTraversal.getSteps() |
Modifier and Type | Method and Description |
---|---|
<S2,E2> Traversal.Admin<S2,E2> |
DefaultTraversal.addStep(int index,
Step<?,?> step) |
<S2,E2> Traversal.Admin<S2,E2> |
EmptyTraversal.addStep(int index,
Step<?,?> step) |
<E2> Traversal.Admin<S,E2> |
EmptyTraversal.addStep(Step<?,E2> step) |
static void |
TraversalHelper.copyLabels(Step<?,?> fromStep,
Step<?,?> toStep,
boolean moveLabels) |
static void |
TraversalHelper.copyLabels(Step<?,?> fromStep,
Step<?,?> toStep,
boolean moveLabels) |
static Set<String> |
PathUtil.getReferencedLabels(Step step) |
static Set<String> |
PathUtil.getReferencedLabelsAfterStep(Step<?,?> step) |
static String |
TraversalHelper.getShortName(Step step,
int maxLength)
Returns the name of step truncated to maxLength.
|
static <S,E> void |
TraversalHelper.insertAfterStep(Step<S,E> insertStep,
Step<?,S> beforeStep,
Traversal.Admin<?,?> traversal)
Insert a step after a specified step instance.
|
static <S,E> void |
TraversalHelper.insertAfterStep(Step<S,E> insertStep,
Step<?,S> beforeStep,
Traversal.Admin<?,?> traversal)
Insert a step after a specified step instance.
|
static <S,E> void |
TraversalHelper.insertBeforeStep(Step<S,E> insertStep,
Step<E,?> afterStep,
Traversal.Admin<?,?> traversal)
Insert a step before a specified step instance.
|
static <S,E> void |
TraversalHelper.insertBeforeStep(Step<S,E> insertStep,
Step<E,?> afterStep,
Traversal.Admin<?,?> traversal)
Insert a step before a specified step instance.
|
static <S,E> Step<?,E> |
TraversalHelper.insertTraversal(Step<?,S> previousStep,
Traversal.Admin<S,E> insertTraversal,
Traversal.Admin<?,?> traversal) |
static <S,E> void |
TraversalHelper.removeToTraversal(Step<S,?> startStep,
Step<?,E> endStep,
Traversal.Admin<S,E> newTraversal) |
static <S,E> void |
TraversalHelper.removeToTraversal(Step<S,?> startStep,
Step<?,E> endStep,
Traversal.Admin<S,E> newTraversal) |
static <S,E> void |
TraversalHelper.replaceStep(Step<S,E> removeStep,
Step<S,E> insertStep,
Traversal.Admin<?,?> traversal)
Replace a step with a new step.
|
static <S,E> void |
TraversalHelper.replaceStep(Step<S,E> removeStep,
Step<S,E> insertStep,
Traversal.Admin<?,?> traversal)
Replace a step with a new step.
|
static <S,E> int |
TraversalHelper.stepIndex(Step<S,E> step,
Traversal.Admin<?,?> traversal)
Gets the index of a particular step in the
Traversal . |
Modifier and Type | Method and Description |
---|---|
static boolean |
TraversalHelper.anyStepRecursively(Predicate<Step> predicate,
Traversal.Admin<?,?> traversal)
|
static boolean |
TraversalHelper.anyStepRecursively(Predicate<Step> predicate,
TraversalParent step)
Determine if any child step of a
TraversalParent match the step given the provided Predicate . |
Modifier and Type | Method and Description |
---|---|
Step |
Service.ServiceCallContext.getStep() |
Constructor and Description |
---|
ServiceCallContext(Traversal.Admin traversal,
Step step) |
Modifier and Type | Method and Description |
---|---|
static String |
StringFactory.stepString(Step<?,?> step,
Object... arguments) |
Modifier and Type | Class and Description |
---|---|
class |
TinkerCountGlobalStep<S extends Element> |
class |
TinkerMergeEdgeStep<S>
Optimizes
mergeE() searches by attempting to use an index where possible. |
class |
TinkerMergeVertexStep<S>
Optimizes
mergeV() searches by attempting to use an index where possible. |
Modifier and Type | Class and Description |
---|---|
class |
TinkerGraphStep<S,E extends Element> |
Constructor and Description |
---|
MutableMetricsSupplier(Step<?,?> previousStep) |
Copyright © 2013–2022 Apache Software Foundation. All rights reserved.