public class TinkerMergeVertexStep<S> extends MergeVertexStep<S>
mergeV()
searches by attempting to use an index where possible.callbackRegistry
id, labels, nextEnd, nextStep, previousStep, starts, traversal, traverserStepIdAndLabelsSetByChild
Constructor and Description |
---|
TinkerMergeVertexStep(MergeVertexStep step) |
Modifier and Type | Method and Description |
---|---|
protected Stream<Vertex> |
createSearchStream(Map<Object,Object> search)
Use the
Map of search criteria to most efficiently return a Stream<Vertex> of matching elements. |
addChildOption, clone, configure, flatMap, getCallbackRegistry, getLocalChildren, getMutatingCallbackRegistry, getOnCreateTraversal, getOnMatchTraversal, getParameters, getRequirements, getSearchCreateTraversal, hashCode, isFirst, isStart, processNextStart, reset, setTraversal, toString, validateMapInput
closeIterator
addLabel, addStart, addStarts, equals, getId, getLabels, getNextStep, getPreviousStep, getStarts, getTraversal, hasNext, hasStarts, isTraverserStepIdAndLabelsSetByChild, next, prepareTraversalForNextStep, removeLabel, setId, setNextStep, setPreviousStep
finalize, getClass, notify, notifyAll, wait, wait, wait
addGlobalChild, addLocalChild, asStep, close, getGlobalChildren, getSelfAndChildRequirements, integrateChild, removeGlobalChild, removeLocalChild, replaceLocalChild
forEachRemaining, remove
public TinkerMergeVertexStep(MergeVertexStep step)
protected Stream<Vertex> createSearchStream(Map<Object,Object> search)
MergeVertexStep
Map
of search criteria to most efficiently return a Stream<Vertex>
of matching elements.
Providers might override this method when extending this step to provide their own optimized mechanisms for
matching the list of vertices. This implementation is only optimized for the T.id
so any other usage
will simply be in-memory filtering which could be slow.createSearchStream
in class MergeVertexStep<S>
Copyright © 2013–2022 Apache Software Foundation. All rights reserved.