Modifier and Type | Method and Description |
---|---|
Traverser<S> |
ComputerResultStep.processNextStart() |
Modifier and Type | Interface and Description |
---|---|
static interface |
Traverser.Admin<T>
The methods in System.Traverser are useful to underlying Step and Traversal implementations.
|
Modifier and Type | Method and Description |
---|---|
Traverser<T> |
Traverser.clone()
Traverser cloning is important when splitting a traverser at a bifurcation point in a traversal.
|
Modifier and Type | Method and Description |
---|---|
void |
Step.addStart(Traverser<S> start)
Add a single
Traverser to the step. |
default void |
Traversal.Admin.addStart(Traverser<S> start)
Add a single
Traverser object to the head of the traversal. |
default int |
Traverser.compareTo(Traverser<T> other)
If the underlying object of the traverser is comparable, compare it with the other traverser.
|
Modifier and Type | Method and Description |
---|---|
void |
Step.addStarts(Iterator<Traverser<S>> starts)
Add a iterator of
Traverser objects of type S to the step. |
default void |
Traversal.Admin.addStarts(Iterator<Traverser<S>> starts)
Add an iterator of
Traverser objects to the head/start of the traversal. |
Modifier and Type | Method and Description |
---|---|
static <A,M,E2> GraphTraversal<A,E2> |
__.branch(Function<Traverser<A>,M> function) |
default <M,E2> GraphTraversal<S,E2> |
GraphTraversal.branch(Function<Traverser<E>,M> function) |
static <A> GraphTraversal<A,A> |
__.emit(Predicate<Traverser<A>> emitPredicate) |
default GraphTraversal<S,E> |
GraphTraversal.emit(Predicate<Traverser<E>> emitPredicate) |
static <A> GraphTraversal<A,A> |
__.filter(Predicate<Traverser<A>> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.filter(Predicate<Traverser<E>> predicate) |
static <A,E2> GraphTraversal<A,E2> |
__.flatMap(Function<Traverser<A>,Iterator<E2>> function) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.flatMap(Function<Traverser<E>,Iterator<E2>> function) |
static <A,E2> GraphTraversal<A,E2> |
__.map(Function<Traverser<A>,E2> function) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.map(Function<Traverser<E>,E2> function) |
static <A> GraphTraversal<A,A> |
__.sideEffect(Consumer<Traverser<A>> consumer) |
default GraphTraversal<S,E> |
GraphTraversal.sideEffect(Consumer<Traverser<E>> consumer) |
static <A> GraphTraversal<A,A> |
__.until(Predicate<Traverser<A>> untilPredicate) |
default GraphTraversal<S,E> |
GraphTraversal.until(Predicate<Traverser<E>> untilPredicate) |
Modifier and Type | Method and Description |
---|---|
void |
ElementValueTraversal.addStart(Traverser<Element> start) |
void |
AbstractLambdaTraversal.addStart(Traverser<S> start) |
void |
FilterTraversal.addStart(Traverser<S> start) |
void |
FilterTraverserTraversal.addStart(Traverser<S> start) |
void |
HasNextTraversal.addStart(Traverser<S> start) |
void |
IdentityTraversal.addStart(Traverser<S> start) |
void |
LoopTraversal.addStart(Traverser<S> start) |
void |
MapTraversal.addStart(Traverser<S> start) |
void |
MapTraverserTraversal.addStart(Traverser<S> start) |
void |
TokenTraversal.addStart(Traverser<S> start) |
Constructor and Description |
---|
FilterTraverserTraversal(Predicate<Traverser<S>> predicate) |
MapTraverserTraversal(Function<Traverser<S>,E> function) |
Modifier and Type | Method and Description |
---|---|
protected Traverser<E> |
LocalStep.processNextStart() |
Modifier and Type | Method and Description |
---|---|
protected Iterator<Traverser<E>> |
BranchStep.computerAlgorithm() |
protected Iterator<Traverser<S>> |
RepeatStep.computerAlgorithm() |
protected Iterator<Traverser<S>> |
RepeatStep.RepeatEndStep.computerAlgorithm() |
protected Iterator<Traverser<E>> |
BranchStep.standardAlgorithm() |
protected Iterator<Traverser<S>> |
RepeatStep.standardAlgorithm() |
protected Iterator<Traverser<S>> |
RepeatStep.RepeatEndStep.standardAlgorithm() |
Modifier and Type | Method and Description |
---|---|
protected Traverser<S> |
ConjunctionStep.processNextStart() |
protected Traverser<S> |
ConjunctionStep.ConjunctionMarker.processNextStart() |
protected Traverser<S> |
FilterStep.processNextStart() |
protected Traverser<S> |
HasTraversalStep.processNextStart() |
Modifier and Type | Method and Description |
---|---|
Predicate<Traverser<S>> |
LambdaFilterStep.getPredicate() |
Constructor and Description |
---|
LambdaFilterStep(Traversal.Admin traversal,
Predicate<Traverser<S>> predicate) |
Modifier and Type | Method and Description |
---|---|
protected Traverser<Vertex> |
AddVertexStartStep.processNextStart() |
protected Traverser<E> |
FlatMapStep.processNextStart() |
Traverser<Map<E,Long>> |
GroupCountStep.processNextStart() |
Traverser<Map<K,R>> |
GroupStep.processNextStart() |
protected Traverser<E> |
MapStep.processNextStart() |
Traverser<Tree> |
TreeStep.processNextStart() |
Modifier and Type | Method and Description |
---|---|
E |
FoldStep.FoldBiFunction.apply(E seed,
Traverser<S> traverser) |
Constructor and Description |
---|
LambdaFlatMapStep(Traversal.Admin traversal,
Function<Traverser<S>,Iterator<E>> function) |
LambdaMapStep(Traversal.Admin traversal,
Function<Traverser<S>,E> function) |
Modifier and Type | Method and Description |
---|---|
protected Traverser<Map<String,E>> |
MatchStep.processNextStart() |
Constructor and Description |
---|
TraversalUpdater(MatchStep.TraversalWrapper<A,B> w,
Iterator<A> inputs,
Traverser<A> start,
String as) |
Modifier and Type | Method and Description |
---|---|
Traverser<S> |
ProfileStep.next() |
protected Traverser<S> |
GraphStep.processNextStart() |
protected Traverser<S> |
IdentityStep.processNextStart() |
protected Traverser<S> |
ProfileStep.processNextStart() |
protected Traverser<S> |
SideEffectStep.processNextStart() |
protected Traverser<S> |
StartStep.processNextStart() |
Constructor and Description |
---|
LambdaSideEffectStep(Traversal.Admin traversal,
Consumer<Traverser<S>> consumer) |
Modifier and Type | Field and Description |
---|---|
protected Traverser<E> |
AbstractStep.nextEnd |
Modifier and Type | Field and Description |
---|---|
protected BiFunction<E,Traverser<S>,E> |
ReducingBarrierStep.reducingBiFunction |
Modifier and Type | Method and Description |
---|---|
Traverser<E> |
AbstractStep.next() |
Traverser<E> |
EmptyStep.next() |
protected abstract Traverser<E> |
AbstractStep.processNextStart() |
Traverser<S> |
CollectingBarrierStep.processNextStart() |
protected Traverser<E> |
ComputerAwareStep.processNextStart() |
protected Traverser<S> |
ComputerAwareStep.EndStep.processNextStart() |
protected Traverser<S> |
MarkerIdentityStep.processNextStart() |
protected Traverser<S> |
PathIdentityStep.processNextStart() |
Traverser<E> |
ReducingBarrierStep.processNextStart() |
Traverser<E> |
SupplyingBarrierStep.processNextStart() |
Modifier and Type | Method and Description |
---|---|
protected abstract Iterator<Traverser<E>> |
ComputerAwareStep.computerAlgorithm() |
protected abstract Iterator<Traverser<E>> |
ComputerAwareStep.standardAlgorithm() |
Modifier and Type | Method and Description |
---|---|
void |
AbstractStep.addStart(Traverser<S> start) |
void |
EmptyStep.addStart(Traverser<S> start) |
Modifier and Type | Method and Description |
---|---|
void |
AbstractStep.addStarts(Iterator<Traverser<S>> starts) |
void |
EmptyStep.addStarts(Iterator<Traverser<S>> starts) |
void |
ReducingBarrierStep.setBiFunction(BiFunction<E,Traverser<S>,E> reducingBiFunction) |
Modifier and Type | Class and Description |
---|---|
class |
B_O_P_PA_S_SE_SL_Traverser<T> |
class |
B_O_PA_S_SE_SL_Traverser<T> |
class |
B_O_Traverser<T> |
class |
O_Traverser<T> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractPathTraverser<T> |
class |
AbstractTraverser<T> |
class |
EmptyTraverser<T> |
Modifier and Type | Method and Description |
---|---|
void |
TraverserSet.sort(Comparator<Traverser<S>> comparator) |
Modifier and Type | Method and Description |
---|---|
void |
DefaultTraversal.addStart(Traverser<S> start) |
void |
EmptyTraversal.addStart(Traverser<S> start) |
Modifier and Type | Method and Description |
---|---|
void |
DefaultTraversal.addStarts(Iterator<Traverser<S>> starts) |
void |
EmptyTraversal.addStarts(Iterator<Traverser<S>> starts) |
Copyright © 2013–2015 Apache Software Foundation. All rights reserved.