public class TinkerMergeEdgeStep<S> extends MergeEdgeStep<S>
mergeE() searches by attempting to use an index where possible.callbackRegistry, PLACEHOLDER_VERTEXid, labels, nextEnd, nextStep, previousStep, starts, traversal, traverserStepIdAndLabelsSetByChild| Constructor and Description | 
|---|
| TinkerMergeEdgeStep(MergeEdgeStep step) | 
| Modifier and Type | Method and Description | 
|---|---|
| protected Stream<Edge> | createSearchStream(Map<Object,Object> search)Use the  Mapof search criteria to most efficiently return aStream<Edge>of matching elements. | 
addChildOption, clone, configure, flatMap, getCallbackRegistry, getLocalChildren, getMutatingCallbackRegistry, getOnCreateTraversal, getOnMatchTraversal, getParameters, getRequirements, getSearchCreateTraversal, hashCode, isFirst, isStart, processNextStart, reset, resolveVertex, setTraversal, toString, tryAttachVertex, validateMapInputcloseIteratoraddLabel, addStart, addStarts, equals, getId, getLabels, getNextStep, getPreviousStep, getStarts, getTraversal, hasNext, hasStarts, isTraverserStepIdAndLabelsSetByChild, next, prepareTraversalForNextStep, removeLabel, setId, setNextStep, setPreviousStepfinalize, getClass, notify, notifyAll, wait, wait, waitaddGlobalChild, addLocalChild, asStep, close, getGlobalChildren, getSelfAndChildRequirements, integrateChild, removeGlobalChild, removeLocalChild, replaceLocalChildforEachRemaining, removepublic TinkerMergeEdgeStep(MergeEdgeStep step)
protected Stream<Edge> createSearchStream(Map<Object,Object> search)
MergeEdgeStepMap of search criteria to most efficiently return a Stream<Edge> of matching elements.
 Providers might override this method when extending this step to provide their own optimized mechanisms for
 matching the list of edges. 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 MergeEdgeStep<S>Copyright © 2013–2022 Apache Software Foundation. All rights reserved.