Interface GraphComputing
- All Known Subinterfaces:
GraphStepContract<S,E>
- All Known Implementing Classes:
BranchStep,ChooseStep,ComputerAwareStep,ComputerAwareStep.EndStep,DedupGlobalStep,ElementMapStep,GraphStep,GraphStepPlaceholder,MatchStep,MatchStep.MatchEndStep,ProfileSideEffectStep,RepeatStep,RepeatStep.RepeatEndStep,TinkerGraphStep,UnionStep
public interface GraphComputing
A
GraphComputing step is one that will change its behavior whether its on a GraphComputer or not.
ComputerFinalizationStrategy is responsible for calling the onGraphComputer() method.
This method is only called for global children steps of a TraversalParent.- Author:
- Marko A. Rodriguez (http://markorodriguez.com)
-
Method Summary
Modifier and TypeMethodDescriptiondefault voidatMaster(boolean atMaster) Some steps should behave different whether they are executing at the master traversal or distributed across the worker traversals.static voidvoidThe step will be executing on aGraphComputer.
-
Method Details
-
onGraphComputer
void onGraphComputer()The step will be executing on aGraphComputer. -
atMaster
default void atMaster(boolean atMaster) Some steps should behave different whether they are executing at the master traversal or distributed across the worker traversals. The default implementation does nothing.- Parameters:
atMaster- whether the step is currently executing at master
-
atMaster
-