public final class MatchStep<S,E> extends ComputerAwareStep<S,Map<String,E>> implements TraversalParent, Scoping, PathProcessor
Modifier and Type | Class and Description |
---|---|
static class |
MatchStep.CountMatchAlgorithm |
static class |
MatchStep.GreedyMatchAlgorithm |
static class |
MatchStep.Helper |
static interface |
MatchStep.MatchAlgorithm |
static class |
MatchStep.MatchEndStep |
static class |
MatchStep.MatchStartStep |
static class |
MatchStep.TraversalType |
ComputerAwareStep.EndStep<S>
Scoping.Variable
PathProcessor.ElementRequirement
id, labels, nextEnd, nextStep, previousStep, starts, traversal, traverserStepIdAndLabelsSetByChild
TYPICAL_GLOBAL_REQUIREMENTS, TYPICAL_GLOBAL_REQUIREMENTS_ARRAY, TYPICAL_LOCAL_REQUIREMENTS, TYPICAL_LOCAL_REQUIREMENTS_ARRAY
Constructor and Description |
---|
MatchStep(Traversal.Admin traversal,
ConnectiveStep.Connective connective,
Traversal... matchTraversals) |
Modifier and Type | Method and Description |
---|---|
void |
addGlobalChild(Traversal.Admin<?,?> globalChildTraversal) |
MatchStep<S,E> |
clone()
Cloning is used to duplicate steps for the purpose of traversal optimization and OLTP replication.
|
protected Iterator<Traverser.Admin<Map<String,E>>> |
computerAlgorithm() |
ConnectiveStep.Connective |
getConnective() |
List<Traversal.Admin<Object,Object>> |
getGlobalChildren() |
Set<String> |
getKeepLabels() |
MatchStep.MatchAlgorithm |
getMatchAlgorithm() |
Set<String> |
getMatchEndLabels() |
Set<String> |
getMatchStartLabels() |
Set<TraverserRequirement> |
getRequirements()
Provide the necessary
TraverserRequirement that must be met by the traverser in order for the step to function properly. |
Set<String> |
getScopeKeys() |
int |
hashCode() |
void |
removeGlobalChild(Traversal.Admin<?,?> globalChildTraversal) |
void |
reset()
Reset the state of the step such that it has no incoming starts.
|
void |
setDedupLabels(Set<String> labels) |
void |
setKeepLabels(Set<String> labels) |
void |
setMatchAlgorithm(Class<? extends MatchStep.MatchAlgorithm> matchAlgorithmClass) |
void |
setTraversal(Traversal.Admin<?,?> parentTraversal)
Set the
Traversal that this step is contained within. |
protected Iterator<Traverser.Admin<Map<String,E>>> |
standardAlgorithm() |
String |
toString() |
onGraphComputer, processNextStart
addLabel, addStart, addStarts, equals, getId, getLabels, getNextStep, getPreviousStep, getTraversal, hasNext, next, removeLabel, setId, setNextStep, setPreviousStep
finalize, getClass, notify, notifyAll, wait, wait, wait
addLocalChild, asStep, getLocalChildren, getSelfAndChildRequirements, integrateChild, removeLocalChild
getNullableScopeValue, getScopeValue
getMaxRequirement, processTraverserPathLabels
forEachRemaining, remove
public MatchStep(Traversal.Admin traversal, ConnectiveStep.Connective connective, Traversal... matchTraversals)
public ConnectiveStep.Connective getConnective()
public void addGlobalChild(Traversal.Admin<?,?> globalChildTraversal)
addGlobalChild
in interface TraversalParent
public void removeGlobalChild(Traversal.Admin<?,?> globalChildTraversal)
removeGlobalChild
in interface TraversalParent
public List<Traversal.Admin<Object,Object>> getGlobalChildren()
getGlobalChildren
in interface TraversalParent
public void setKeepLabels(Set<String> labels)
setKeepLabels
in interface PathProcessor
public Set<String> getKeepLabels()
getKeepLabels
in interface PathProcessor
public Set<String> getScopeKeys()
getScopeKeys
in interface Scoping
public void reset()
Step
public void setMatchAlgorithm(Class<? extends MatchStep.MatchAlgorithm> matchAlgorithmClass)
public MatchStep.MatchAlgorithm getMatchAlgorithm()
public MatchStep<S,E> clone()
Step
EmptyStep
.public void setTraversal(Traversal.Admin<?,?> parentTraversal)
Step
Traversal
that this step is contained within.setTraversal
in interface Step<S,Map<String,E>>
setTraversal
in class AbstractStep<S,Map<String,E>>
parentTraversal
- the new traversal for this stepprotected Iterator<Traverser.Admin<Map<String,E>>> standardAlgorithm() throws NoSuchElementException
standardAlgorithm
in class ComputerAwareStep<S,Map<String,E>>
NoSuchElementException
protected Iterator<Traverser.Admin<Map<String,E>>> computerAlgorithm() throws NoSuchElementException
computerAlgorithm
in class ComputerAwareStep<S,Map<String,E>>
NoSuchElementException
public Set<TraverserRequirement> getRequirements()
Step
TraverserRequirement
that must be met by the traverser in order for the step to function properly.
The provided default implements returns an empty set.Copyright © 2013–2016 Apache Software Foundation. All rights reserved.