Class SupplyingBarrierStep<S,E>
- java.lang.Object
- 
- org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStep<S,E>
- 
- org.apache.tinkerpop.gremlin.process.traversal.step.util.SupplyingBarrierStep<S,E>
 
 
- 
- All Implemented Interfaces:
- Serializable,- Cloneable,- Iterator<Traverser.Admin<E>>,- Step<S,E>,- Barrier<Boolean>,- MemoryComputing<Boolean>
 - Direct Known Subclasses:
- SideEffectCapStep
 
 public abstract class SupplyingBarrierStep<S,E> extends AbstractStep<S,E> implements Barrier<Boolean> - Author:
- Marko A. Rodriguez (http://markorodriguez.com)
- See Also:
- Serialized Form
 
- 
- 
Field Summary- 
Fields inherited from class org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStepid, labels, nextEnd, nextStep, previousStep, starts, traversal, traverserStepIdAndLabelsSetByChild
 
- 
 - 
Constructor SummaryConstructors Constructor Description SupplyingBarrierStep(Traversal.Admin traversal)
 - 
Method SummaryAll Methods Instance Methods Abstract Methods Concrete Methods Modifier and Type Method Description voidaddBarrier(Boolean barrier)Add a barrier to the step.voidaddStart(Traverser.Admin<S> start)Add a singleTraverser.Adminto the step.voidaddStarts(Iterator<Traverser.Admin<S>> starts)Add an iterator ofTraverser.Adminobjects of type S to the step.SupplyingBarrierStep<S,E>clone()Cloning is used to duplicate steps for the purpose of traversal optimization and OLTP replication.voiddone()A way to hard set that the barrier is complete.MemoryComputeKey<Boolean>getMemoryComputeKey()TheMemoryComputeKeythat will be used by this step.booleanhasNextBarrier()Whether or not the step has an accessible barrier.BooleannextBarrier()Get the next barrier within this step.voidprocessAllStarts()Process all left traversers by do not yield the resultant output.Traverser.Admin<E>processNextStart()voidreset()Reset the state of the step such that it has no incoming starts.protected abstract Esupply()- 
Methods inherited from class org.apache.tinkerpop.gremlin.process.traversal.step.util.AbstractStepaddLabel, equals, getId, getLabels, getNextStep, getPreviousStep, getStarts, getTraversal, hashCode, hasNext, hasStarts, isTraverserStepIdAndLabelsSetByChild, next, prepareTraversalForNextStep, removeLabel, setId, setNextStep, setPreviousStep, setTraversal, toString
 - 
Methods inherited from class java.lang.Objectfinalize, getClass, notify, notifyAll, wait, wait, wait
 - 
Methods inherited from interface java.util.IteratorforEachRemaining, remove
 - 
Methods inherited from interface org.apache.tinkerpop.gremlin.process.traversal.Stepequals, getRequirements
 
- 
 
- 
- 
- 
Constructor Detail- 
SupplyingBarrierSteppublic SupplyingBarrierStep(Traversal.Admin traversal) 
 
- 
 - 
Method Detail- 
supplyprotected abstract E supply() 
 - 
addStartspublic void addStarts(Iterator<Traverser.Admin<S>> starts) Description copied from interface:StepAdd an iterator ofTraverser.Adminobjects of type S to the step.
 - 
addStartpublic void addStart(Traverser.Admin<S> start) Description copied from interface:StepAdd a singleTraverser.Adminto the step.
 - 
resetpublic void reset() Description copied from interface:StepReset the state of the step such that it has no incoming starts. Internal states are to be reset, but any sideEffect data structures are not to be recreated.
 - 
processNextStartpublic Traverser.Admin<E> processNextStart() - Specified by:
- processNextStartin class- AbstractStep<S,E>
 
 - 
clonepublic SupplyingBarrierStep<S,E> clone() Description copied from interface:StepCloning is used to duplicate steps for the purpose of traversal optimization and OLTP replication. When cloning a step, it is important that the steps, the cloned step is equivalent to the state of the step whenStep.reset()is called. Moreover, the previous and next steps should be set toEmptyStep.
 - 
processAllStartspublic void processAllStarts() Description copied from interface:BarrierProcess all left traversers by do not yield the resultant output. This method is useful for steps likeReducingBarrierStep, where traversers can be processed "on the fly" and thus, reduce memory consumption.- Specified by:
- processAllStartsin interface- Barrier<S>
 
 - 
hasNextBarrierpublic boolean hasNextBarrier() Description copied from interface:BarrierWhether or not the step has an accessible barrier.- Specified by:
- hasNextBarrierin interface- Barrier<S>
- Returns:
- whether a barrier exists or not
 
 - 
nextBarrierpublic Boolean nextBarrier() throws NoSuchElementException Description copied from interface:BarrierGet the next barrier within this step. Barriers from parallel steps can be the be merged to create a single step with merge barriers.- Specified by:
- nextBarrierin interface- Barrier<S>
- Returns:
- the next barrier of the step
- Throws:
- NoSuchElementException
 
 - 
addBarrierpublic void addBarrier(Boolean barrier) Description copied from interface:BarrierAdd a barrier to the step. This typically happens when multiple parallel barriers need to become one barrier at a single step.- Specified by:
- addBarrierin interface- Barrier<S>
- Parameters:
- barrier- the barrier to merge in
 
 - 
donepublic void done() Description copied from interface:BarrierA way to hard set that the barrier is complete. This is necessary when parallel barriers don't all have barriers and need hard resetting. The default implementation does nothing.
 - 
getMemoryComputeKeypublic MemoryComputeKey<Boolean> getMemoryComputeKey() Description copied from interface:MemoryComputingTheMemoryComputeKeythat will be used by this step.- Specified by:
- getMemoryComputeKeyin interface- MemoryComputing<S>
- Returns:
- the MemoryComputeKey to use
 
 
- 
 
-