Interface GraphComputing
-
- All Known Implementing Classes:
BranchStep,ChooseStep,ComputerAwareStep,ComputerAwareStep.EndStep,DedupGlobalStep,ElementMapStep,GraphStep,MatchStep,MatchStep.MatchEndStep,ProfileSideEffectStep,RepeatStep,RepeatStep.RepeatEndStep,TinkerGraphStep,UnionStep
public interface GraphComputingAGraphComputingstep is one that will change its behavior whether its on aGraphComputeror not.ComputerFinalizationStrategyis responsible for calling theonGraphComputer()method. This method is only called for global children steps of aTraversalParent.- Author:
- Marko A. Rodriguez (http://markorodriguez.com)
-
-
Method Summary
All Methods Static Methods Instance Methods Abstract Methods Default Methods Modifier and Type Method Description default voidatMaster(boolean atMaster)Some steps should behave different whether they are executing at the master traversal or distributed across the worker traversals.static voidatMaster(Step<?,?> step, boolean atMaster)voidonGraphComputer()The step will be executing on aGraphComputer.
-
-
-
Method Detail
-
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
static void atMaster(Step<?,?> step, boolean atMaster)
-
-