| Barrier<B> |
A Barrier is any step that requires all left traversers to be processed prior to emitting result traversers to the right.
|
| ByModulating |
|
| Bypassing |
A ByPassing step can be stated (at runtime) to simply enact the identity function.
|
| ComparatorHolder<S,C extends Comparable> |
|
| Configuring |
|
| FromToModulating |
FromToModulating are for Steps that support from()- and to()-modulation. |
| Generating<S,E> |
A Generating step is one that has a side-effect that needs post-processing prior to being returned.
|
| GraphComputing |
A GraphComputing step is one that will change its behavior whether its on a GraphComputer or not. |
| Grouping<S,K,V> |
|
| HasContainerHolder |
|
| LambdaHolder |
This is a marker interface stating that the Step contains a
lambda/anonymous function. |
| LocalBarrier<S> |
|
| MapReducer<MK,MV,RK,RV,R> |
|
| MemoryComputing<M> |
|
| Mutating<E extends Event> |
A marker interface for steps that modify the graph.
|
| Parameterizing |
An interface for Step implementations that hold a Parameters object, which fold in arguments from
other steps. |
| PathProcessor |
|
| Profiling |
A Step can implement this interface in order to receive a reference to the MutableMetrics object
for the Step. |
| ProfilingAware |
Marks a Step as one that is aware of profiling. |
| Ranging |
|
| ReadWriting |
An interface that defines a Step as one that handles IO based operations for a Graph. |
| Scoping |
This interface is implemented by Step implementations that access labeled path steps, side-effects or
Map values by key, such as select('a') step. |
| Seedable |
An interface implemented by steps that have some form of Random usage that can be configured by way of a
seed to allow for deterministic behavior of the step.
|
| SideEffectCapable<S,E> |
A SideEffectCapable step stores a side-effect data structure accessible by a side-effect key.
|
| TimesModulating |
|
| TraversalOptionParent<M,S,E> |
|
| TraversalParent |
|