public final class TreeStep<S> extends ReducingBarrierStep<S,Tree> implements MapReducer, TraversalParent, PathProcessor
| Modifier and Type | Class and Description | 
|---|---|
| static class  | TreeStep.TreeMapReduce | 
ReducingBarrierStep.DefaultMapReducePathProcessor.ElementRequirementbyPass, REDUCING, reducingBiFunction, seedSupplierid, labels, nextEnd, nextStep, previousStep, starts, traversal, traverserStepIdAndLabelsSetByChild| Constructor and Description | 
|---|
| TreeStep(Traversal.Admin traversal) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | addLocalChild(Traversal.Admin<?,?> treeTraversal) | 
| TreeStep<S> | clone()Cloning is used to duplicate steps for the purpose of traversal optimization and OLTP replication. | 
| List<Traversal.Admin<Object,Object>> | getLocalChildren() | 
| MapReduce<MapReduce.NullObject,Tree,MapReduce.NullObject,Tree,Tree> | getMapReduce() | 
| Set<TraverserRequirement> | getRequirements()Provide the necessary  TraverserRequirementthat must be met by the traverser in order for the step to function properly. | 
| int | hashCode() | 
| Traverser<Tree> | processNextStart() | 
| void | reset()Reset the state of the step such that it has no incoming starts. | 
| String | toString() | 
onEngine, processAllStarts, setBiFunction, setSeedSupplieraddLabel, addStart, addStarts, equals, getId, getLabels, getNextStep, getPreviousStep, getTraversal, hasNext, next, removeLabel, setId, setNextStep, setPreviousStep, setTraversalfinalize, getClass, notify, notifyAll, wait, wait, waitaddGlobalChild, asStep, getGlobalChildren, getSelfAndChildRequirements, integrateChild, removeGlobalChild, removeLocalChildgetMaxRequirementforEachRemaining, removepublic TreeStep(Traversal.Admin traversal)
public List<Traversal.Admin<Object,Object>> getLocalChildren()
getLocalChildren in interface TraversalParentpublic void addLocalChild(Traversal.Admin<?,?> treeTraversal)
addLocalChild in interface TraversalParentpublic Set<TraverserRequirement> getRequirements()
StepTraverserRequirement that must be met by the traverser in order for the step to function properly.
 The provided default implements returns an empty set.getRequirements in interface Step<S,Tree>public MapReduce<MapReduce.NullObject,Tree,MapReduce.NullObject,Tree,Tree> getMapReduce()
getMapReduce in interface MapReducergetMapReduce in class ReducingBarrierStep<S,Tree>public TreeStep<S> clone()
StepEmptyStep.public int hashCode()
hashCode in class AbstractStep<S,Tree>public Traverser<Tree> processNextStart()
processNextStart in class ReducingBarrierStep<S,Tree>public String toString()
toString in class AbstractStep<S,Tree>public void reset()
StepCopyright © 2013–2015 Apache Software Foundation. All rights reserved.