| 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 |
|---|---|
default void |
Traversal.Admin.addStart(Traverser<S> start)
Add a single
Traverser object to the head of the traversal. |
void |
Step.addStart(Traverser<S> start)
Add a single
Traverser to the step. |
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 |
Traversal.Admin.addStarts(java.util.Iterator<Traverser<S>> starts)
Add an iterator of
Traverser objects to the head/start of the traversal. |
void |
Step.addStarts(java.util.Iterator<Traverser<S>> starts)
Add a iterator of
Traverser objects of type S to the step. |
| Modifier and Type | Method and Description |
|---|---|
Traverser<S> |
ComputerResultStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
static <T> java.util.Comparator<Traverser<T>> |
GraphComputerHelper.chainComparators(java.util.List<java.util.Comparator<T>> comparators) |
| Modifier and Type | Method and Description |
|---|---|
default GraphTraversal<A,A> |
ElementTraversal.branch(java.util.function.Function<Traverser<A>,java.util.Collection<java.lang.String>> function) |
default <A> GraphTraversal<A,A> |
AnonymousGraphTraversal.branch(java.util.function.Function<Traverser<A>,java.util.Collection<java.lang.String>> function) |
default GraphTraversal<S,E> |
GraphTraversal.branch(java.util.function.Function<Traverser<E>,java.util.Collection<java.lang.String>> function) |
default GraphTraversal<A,A> |
ElementTraversal.emit(java.util.function.Predicate<Traverser<A>> emitPredicate) |
default <A> GraphTraversal<A,A> |
AnonymousGraphTraversal.emit(java.util.function.Predicate<Traverser<A>> emitPredicate) |
default GraphTraversal<S,E> |
GraphTraversal.emit(java.util.function.Predicate<Traverser<E>> emitPredicate) |
default GraphTraversal<A,A> |
ElementTraversal.filter(java.util.function.Predicate<Traverser<A>> predicate) |
default <A> GraphTraversal<A,A> |
AnonymousGraphTraversal.filter(java.util.function.Predicate<Traverser<A>> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.filter(java.util.function.Predicate<Traverser<E>> predicate) |
default <A,E2> GraphTraversal<A,E2> |
AnonymousGraphTraversal.flatMap(java.util.function.Function<Traverser<A>,java.util.Iterator<E2>> function) |
default <E2> GraphTraversal<A,E2> |
ElementTraversal.flatMap(java.util.function.Function<Traverser<A>,java.util.Iterator<E2>> function) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.flatMap(java.util.function.Function<Traverser<E>,java.util.Iterator<E2>> function) |
default <A,E2> GraphTraversal<A,E2> |
AnonymousGraphTraversal.map(java.util.function.Function<Traverser<A>,E2> function) |
default <E2> GraphTraversal<A,E2> |
ElementTraversal.map(java.util.function.Function<Traverser<A>,E2> function) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.map(java.util.function.Function<Traverser<E>,E2> function) |
default GraphTraversal<A,A> |
ElementTraversal.sideEffect(java.util.function.Consumer<Traverser<A>> consumer) |
default <A> GraphTraversal<A,A> |
AnonymousGraphTraversal.sideEffect(java.util.function.Consumer<Traverser<A>> consumer) |
default GraphTraversal<S,E> |
GraphTraversal.sideEffect(java.util.function.Consumer<Traverser<E>> consumer) |
default GraphTraversal<A,A> |
ElementTraversal.until(java.util.function.Predicate<Traverser<A>> untilPredicate) |
default <A> GraphTraversal<A,A> |
AnonymousGraphTraversal.until(java.util.function.Predicate<Traverser<A>> untilPredicate) |
default GraphTraversal<S,E> |
GraphTraversal.until(java.util.function.Predicate<Traverser<E>> untilPredicate) |
| Modifier and Type | Method and Description |
|---|---|
Traverser<S> |
BranchStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
protected java.util.Iterator<Traverser<E>> |
UnionStep.computerAlgorithm() |
protected java.util.Iterator<Traverser<S>> |
RepeatStep.computerAlgorithm() |
protected java.util.Iterator<Traverser<E>> |
ChooseStep.computerAlgorithm() |
java.util.function.Predicate<Traverser<S>> |
RepeatStep.getEmitPredicate() |
java.util.function.Predicate<Traverser<S>> |
RepeatStep.getUntilPredicate() |
protected java.util.Iterator<Traverser<E>> |
UnionStep.standardAlgorithm() |
protected java.util.Iterator<Traverser<S>> |
RepeatStep.standardAlgorithm() |
protected java.util.Iterator<Traverser<E>> |
ChooseStep.standardAlgorithm() |
| Modifier and Type | Method and Description |
|---|---|
java.util.Collection<java.lang.String> |
BranchStep.GoToLabels.apply(Traverser<S> traverser) |
boolean |
RepeatStep.doEmit(Traverser<S> traverser) |
boolean |
RepeatStep.doUntil(Traverser<S> traverser) |
boolean |
RepeatStep.LoopPredicate.test(Traverser<S> traverser) |
boolean |
RepeatStep.TraversalPredicate.test(Traverser<S> traverser) |
| Modifier and Type | Method and Description |
|---|---|
static <A,B,C extends Traversal<A,B>> |
RepeatStep.addEmitToTraversal(C traversal,
java.util.function.Predicate<Traverser<B>> emitPredicate) |
static <A,B,C extends Traversal<A,B>> |
RepeatStep.addUntilToTraversal(C traversal,
java.util.function.Predicate<Traverser<B>> untilPredicate) |
void |
RepeatStep.setEmitPredicate(java.util.function.Predicate<Traverser<S>> emitPredicate) |
void |
BranchStep.setFunction(java.util.function.Function<Traverser<S>,java.util.Collection<java.lang.String>> function) |
void |
RepeatStep.setUntilPredicate(java.util.function.Predicate<Traverser<S>> untilPredicate) |
| Modifier and Type | Method and Description |
|---|---|
protected Traverser<S> |
RouteStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
protected Traverser<S> |
FilterStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
org.javatuples.Pair<java.util.function.Supplier<java.util.Set>,java.util.function.BiFunction<java.util.Set,Traverser<S>,java.util.Set>> |
DedupStep.getReducer() |
| Modifier and Type | Method and Description |
|---|---|
void |
FilterStep.setPredicate(java.util.function.Predicate<Traverser<S>> predicate) |
| Modifier and Type | Field and Description |
|---|---|
protected java.util.function.Function<Traverser<S>,java.util.Map<java.lang.String,E>> |
SelectStep.selectFunction |
| Modifier and Type | Method and Description |
|---|---|
protected Traverser<E> |
MapStep.processNextStart() |
protected Traverser<E> |
FlatMapStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
void |
MapStep.setFunction(java.util.function.Function<Traverser<S>,E> function) |
void |
FlatMapStep.setFunction(java.util.function.Function<Traverser<S>,java.util.Iterator<E>> function) |
| Modifier and Type | Method and Description |
|---|---|
protected Traverser<java.util.Map<java.lang.String,E>> |
MatchStep.processNextStart() |
| Constructor and Description |
|---|
TraversalUpdater(MatchStep.TraversalWrapper<A,B> w,
java.util.Iterator<A> inputs,
Traverser<A> start,
java.lang.String as) |
| Modifier and Type | Method and Description |
|---|---|
Traverser<java.lang.Double> |
SumStep.processNextStart() |
protected Traverser<S> |
StartStep.processNextStart() |
protected Traverser<S> |
SideEffectStep.processNextStart() |
Traverser<E> |
SideEffectCapStep.processNextStart() |
protected Traverser<S> |
InjectStep.processNextStart() |
Traverser<java.lang.Long> |
CountStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
void |
SideEffectStep.setConsumer(java.util.function.Consumer<Traverser<S>> consumer) |
| Modifier and Type | Method and Description |
|---|---|
protected Traverser<E> |
ComputerAwareStep.processNextStart() |
Traverser<S> |
BarrierStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
protected abstract java.util.Iterator<Traverser<E>> |
ComputerAwareStep.computerAlgorithm() |
protected abstract java.util.Iterator<Traverser<E>> |
ComputerAwareStep.standardAlgorithm() |
| 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> |
| Modifier and Type | Class and Description |
|---|---|
class |
EmptyTraverser<T> |
| Modifier and Type | Field and Description |
|---|---|
protected Traverser<E> |
AbstractStep.nextEnd |
| Modifier and Type | Method and Description |
|---|---|
Traverser<E> |
EmptyStep.next() |
Traverser<E> |
AbstractStep.next() |
protected abstract Traverser<E> |
AbstractStep.processNextStart() |
| Modifier and Type | Method and Description |
|---|---|
void |
EmptyTraversal.addStart(Traverser<S> start) |
void |
EmptyStep.addStart(Traverser<S> start) |
void |
DefaultTraversal.addStart(Traverser<S> start) |
void |
AbstractStep.addStart(Traverser<S> start) |
| Modifier and Type | Method and Description |
|---|---|
void |
EmptyTraversal.addStarts(java.util.Iterator<Traverser<S>> starts) |
void |
EmptyStep.addStarts(java.util.Iterator<Traverser<S>> starts) |
void |
DefaultTraversal.addStarts(java.util.Iterator<Traverser<S>> starts) |
void |
AbstractStep.addStarts(java.util.Iterator<Traverser<S>> starts) |
void |
TraverserSet.sort(java.util.Comparator<Traverser<S>> comparator) |
Copyright © 2013-2015 TinkerPop. All Rights Reserved.