public interface ElementTraversal<A extends Element>
| Modifier and Type | Method and Description |
|---|---|
default GraphTraversal<A,Vertex> |
addBothE(java.lang.String edgeLabel,
java.lang.String stepLabel,
java.lang.Object... propertyKeyValues) |
default GraphTraversal<A,Vertex> |
addE(Direction direction,
java.lang.String edgeLabel,
java.lang.String stepLabel,
java.lang.Object... propertyKeyValues) |
default GraphTraversal<A,Vertex> |
addInE(java.lang.String edgeLabel,
java.lang.String setLabel,
java.lang.Object... propertyKeyValues) |
default GraphTraversal<A,Vertex> |
addOutE(java.lang.String edgeLabel,
java.lang.String stepLabel,
java.lang.Object... propertyKeyValues) |
default GraphTraversal<A,A> |
aggregate() |
default GraphTraversal<A,A> |
aggregate(java.lang.String sideEffectKey) |
default GraphTraversal<A,A> |
as(java.lang.String label) |
default <E2> GraphTraversal<A,E2> |
back(java.lang.String stepLabel) |
default GraphTraversal<A,A> |
between(java.lang.String key,
java.lang.Comparable startValue,
java.lang.Comparable endValue) |
default GraphTraversal<A,Vertex> |
both(java.lang.String... edgeLabels) |
default GraphTraversal<A,Edge> |
bothE(java.lang.String... edgeLabels) |
default GraphTraversal<A,Vertex> |
bothV() |
default GraphTraversal<A,A> |
branch(java.util.function.Function<Traverser<A>,java.util.Collection<java.lang.String>> function) |
default <E2> GraphTraversal<A,E2> |
cap() |
default <E2> GraphTraversal<A,E2> |
cap(java.lang.String sideEffectKey) |
default <E2,M> GraphTraversal<A,E2> |
choose(java.util.function.Function<A,M> mapFunction,
java.util.Map<M,Traversal<?,E2>> choices) |
default <E2> GraphTraversal<A,E2> |
choose(java.util.function.Predicate<A> choosePredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice) |
default GraphTraversal<A,A> |
coin(double probability) |
default GraphTraversal<A,java.lang.Long> |
count() |
default GraphTraversal<A,A> |
cyclicPath() |
default GraphTraversal<A,A> |
dedup() |
default GraphTraversal<A,A> |
emit() |
default GraphTraversal<A,A> |
emit(java.util.function.Predicate<Traverser<A>> emitPredicate) |
default GraphTraversal<A,A> |
emit(Traversal<?,?> emitTraversal) |
default GraphTraversal<A,A> |
except(java.util.Collection<A> exceptionCollection) |
default GraphTraversal<A,A> |
except(java.lang.Object exceptionObject) |
default GraphTraversal<A,A> |
except(java.lang.String sideEffectKey) |
default GraphTraversal<A,A> |
filter(java.util.function.Predicate<Traverser<A>> predicate) |
default <E2> GraphTraversal<A,E2> |
flatMap(java.util.function.Function<Traverser<A>,java.util.Iterator<E2>> function) |
default GraphTraversal<A,java.util.List<A>> |
fold() |
default <E2> GraphTraversal<A,E2> |
fold(E2 seed,
java.util.function.BiFunction<E2,A,E2> foldFunction) |
default GraphTraversal<A,A> |
group() |
default GraphTraversal<A,A> |
group(java.lang.String sideEffectKey) |
default GraphTraversal<A,A> |
groupCount() |
default GraphTraversal<A,A> |
groupCount(java.lang.String sideEffectKey) |
default GraphTraversal<A,A> |
has(java.lang.String key) |
default GraphTraversal<A,A> |
has(java.lang.String key,
java.util.function.BiPredicate predicate,
java.lang.Object value) |
default GraphTraversal<A,A> |
has(java.lang.String key,
java.lang.Object value) |
default GraphTraversal<A,A> |
has(java.lang.String label,
java.lang.String key,
java.util.function.BiPredicate predicate,
java.lang.Object value) |
default GraphTraversal<A,A> |
has(java.lang.String label,
java.lang.String key,
java.lang.Object value) |
default GraphTraversal<A,A> |
has(T accessor,
java.util.function.BiPredicate predicate,
java.lang.Object value) |
default GraphTraversal<A,A> |
has(T accessor,
java.lang.Object value) |
default GraphTraversal<A,A> |
hasNot(java.lang.String key) |
default GraphTraversal<A,A> |
identity() |
default GraphTraversal<A,Vertex> |
in(java.lang.String... edgeLabels) |
default GraphTraversal<A,Edge> |
inE(java.lang.String... edgeLabels) |
default GraphTraversal<A,A> |
inject(java.lang.Object... injections) |
default GraphTraversal<A,Vertex> |
inV() |
default GraphTraversal<A,A> |
limit(long limit) |
default <E2> GraphTraversal<A,E2> |
local(Traversal<?,E2> localTraversal) |
default <E2> GraphTraversal<A,E2> |
map(java.util.function.Function<Traverser<A>,E2> function) |
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> |
match(java.lang.String startLabel,
Traversal... traversals) |
default GraphTraversal<A,A> |
order() |
default GraphTraversal<A,Vertex> |
otherV() |
default GraphTraversal<A,Vertex> |
out(java.lang.String... edgeLabels) |
default GraphTraversal<A,Edge> |
outE(java.lang.String... edgeLabels) |
default GraphTraversal<A,Vertex> |
outV() |
default GraphTraversal<A,Path> |
path() |
default GraphTraversal<A,A> |
profile() |
default <E2> GraphTraversal<A,? extends Property<E2>> |
properties(java.lang.String... propertyKeys) |
default GraphTraversal<A,A> |
range(long low,
long high) |
default GraphTraversal<A,A> |
repeat(Traversal<?,A> traversal) |
default GraphTraversal<A,A> |
retain(java.util.Collection<A> retainCollection) |
default GraphTraversal<A,A> |
retain(java.lang.Object retainObject) |
default GraphTraversal<A,A> |
retain(java.lang.String sideEffectKey) |
default <E2> GraphTraversal<A,E2> |
sack() |
default <V> GraphTraversal<A,A> |
sack(java.util.function.BiFunction<V,A,V> sackFunction) |
default <V> GraphTraversal<A,A> |
sack(java.util.function.BinaryOperator<V> sackOperator,
java.lang.String elementPropertyKey) |
default GraphTraversal<A,A> |
sample(int amountToSample) |
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> |
select(java.lang.String... stepLabels) |
default <E2> GraphTraversal<A,E2> |
select(java.lang.String stepLabel) |
default GraphTraversal<A,A> |
shuffle() |
default GraphTraversal<A,A> |
sideEffect(java.util.function.Consumer<Traverser<A>> consumer) |
default GraphTraversal<A,A> |
simplePath() |
default GraphTraversal<A,A> |
start() |
default GraphTraversal<A,A> |
store() |
default GraphTraversal<A,A> |
store(java.lang.String sideEffectKey) |
default GraphTraversal<A,A> |
subgraph(java.util.function.Predicate<Edge> includeEdge) |
default GraphTraversal<A,A> |
subgraph(java.util.Set<java.lang.Object> edgeIdHolder,
java.util.Map<java.lang.Object,Vertex> vertexMap,
java.util.function.Predicate<Edge> includeEdge) |
default GraphTraversal<A,A> |
subgraph(java.lang.String sideEffectKey,
java.util.function.Predicate<Edge> includeEdge) |
default GraphTraversal<A,A> |
subgraph(java.lang.String sideEffectKey,
java.util.Set<java.lang.Object> edgeIdHolder,
java.util.Map<java.lang.Object,Vertex> vertexMap,
java.util.function.Predicate<Edge> includeEdge) |
default GraphTraversal<A,A> |
submit(GraphComputer graphComputer) |
default GraphTraversal<A,java.lang.Double> |
sum() |
default GraphTraversal<A,A> |
timeLimit(long timeLimit) |
default GraphTraversal<A,A> |
times(int maxLoops) |
default GraphTraversal<A,Vertex> |
to(Direction direction,
java.lang.String... edgeLabels) |
default GraphTraversal<A,Edge> |
toE(Direction direction,
java.lang.String... edgeLabels) |
default GraphTraversal<A,Vertex> |
toV(Direction direction) |
default GraphTraversal<A,A> |
tree() |
default GraphTraversal<A,A> |
tree(java.lang.String sideEffectKey) |
default GraphTraversal<A,A> |
unfold() |
default <E2> GraphTraversal<A,E2> |
union(Traversal<?,E2>... traversals) |
default GraphTraversal<A,A> |
until(java.util.function.Predicate<Traverser<A>> untilPredicate) |
default GraphTraversal<A,A> |
until(Traversal<?,?> untilTraversal) |
default <E2> GraphTraversal<A,E2> |
values(java.lang.String... propertyKeys) |
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> |
where(java.lang.String firstKey,
java.util.function.BiPredicate predicate,
java.lang.String secondKey) |
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> |
where(java.lang.String firstKey,
java.lang.String secondKey,
java.util.function.BiPredicate predicate) |
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> |
where(Traversal constraint) |
default GraphTraversal<A,A> |
withPath() |
default <B> GraphTraversal<A,A> |
withSack(java.util.function.Supplier<B> initialValue) |
default <B> GraphTraversal<A,A> |
withSack(java.util.function.Supplier<B> initialValue,
java.util.function.UnaryOperator<B> splitOperator) |
default GraphTraversal<A,A> |
withSideEffect(java.lang.String key,
java.util.function.Supplier supplier) |
default GraphTraversal<A,A> start()
default GraphTraversal<A,java.lang.Long> count()
default GraphTraversal<A,java.lang.Double> sum()
default GraphTraversal<A,A> submit(GraphComputer graphComputer)
default <E2> GraphTraversal<A,E2> map(java.util.function.Function<Traverser<A>,E2> function)
default <E2> GraphTraversal<A,E2> flatMap(java.util.function.Function<Traverser<A>,java.util.Iterator<E2>> function)
default GraphTraversal<A,A> identity()
default GraphTraversal<A,Vertex> to(Direction direction, java.lang.String... edgeLabels)
default GraphTraversal<A,Vertex> out(java.lang.String... edgeLabels)
default GraphTraversal<A,Vertex> in(java.lang.String... edgeLabels)
default GraphTraversal<A,Vertex> both(java.lang.String... edgeLabels)
default GraphTraversal<A,Edge> toE(Direction direction, java.lang.String... edgeLabels)
default GraphTraversal<A,Edge> outE(java.lang.String... edgeLabels)
default GraphTraversal<A,Edge> inE(java.lang.String... edgeLabels)
default GraphTraversal<A,Edge> bothE(java.lang.String... edgeLabels)
default GraphTraversal<A,Vertex> toV(Direction direction)
default GraphTraversal<A,Vertex> inV()
default GraphTraversal<A,Vertex> outV()
default GraphTraversal<A,Vertex> bothV()
default GraphTraversal<A,Vertex> otherV()
default GraphTraversal<A,A> order()
default GraphTraversal<A,A> shuffle()
default <E2> GraphTraversal<A,? extends Property<E2>> properties(java.lang.String... propertyKeys)
default <E2> GraphTraversal<A,E2> values(java.lang.String... propertyKeys)
default GraphTraversal<A,Path> path()
default <E2> GraphTraversal<A,E2> back(java.lang.String stepLabel)
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> match(java.lang.String startLabel, Traversal... traversals)
default <E2> GraphTraversal<A,E2> sack()
default <E2> GraphTraversal<A,E2> select(java.lang.String stepLabel)
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> select(java.lang.String... stepLabels)
default GraphTraversal<A,A> unfold()
default GraphTraversal<A,java.util.List<A>> fold()
default <E2> GraphTraversal<A,E2> fold(E2 seed, java.util.function.BiFunction<E2,A,E2> foldFunction)
default <E2> GraphTraversal<A,E2> local(Traversal<?,E2> localTraversal)
default GraphTraversal<A,A> filter(java.util.function.Predicate<Traverser<A>> predicate)
default GraphTraversal<A,A> inject(java.lang.Object... injections)
default GraphTraversal<A,A> dedup()
default GraphTraversal<A,A> except(java.lang.String sideEffectKey)
default GraphTraversal<A,A> except(java.lang.Object exceptionObject)
default GraphTraversal<A,A> except(java.util.Collection<A> exceptionCollection)
default GraphTraversal<A,A> has(java.lang.String key)
default GraphTraversal<A,A> has(java.lang.String key, java.lang.Object value)
default GraphTraversal<A,A> has(T accessor, java.lang.Object value)
default GraphTraversal<A,A> has(java.lang.String key, java.util.function.BiPredicate predicate, java.lang.Object value)
default GraphTraversal<A,A> has(T accessor, java.util.function.BiPredicate predicate, java.lang.Object value)
default GraphTraversal<A,A> has(java.lang.String label, java.lang.String key, java.lang.Object value)
default GraphTraversal<A,A> has(java.lang.String label, java.lang.String key, java.util.function.BiPredicate predicate, java.lang.Object value)
default GraphTraversal<A,A> hasNot(java.lang.String key)
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> where(java.lang.String firstKey, java.lang.String secondKey, java.util.function.BiPredicate predicate)
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> where(java.lang.String firstKey, java.util.function.BiPredicate predicate, java.lang.String secondKey)
default <E2> GraphTraversal<A,java.util.Map<java.lang.String,E2>> where(Traversal constraint)
default GraphTraversal<A,A> between(java.lang.String key, java.lang.Comparable startValue, java.lang.Comparable endValue)
default GraphTraversal<A,A> coin(double probability)
default GraphTraversal<A,A> range(long low, long high)
default GraphTraversal<A,A> limit(long limit)
default GraphTraversal<A,A> retain(java.lang.String sideEffectKey)
default GraphTraversal<A,A> retain(java.lang.Object retainObject)
default GraphTraversal<A,A> retain(java.util.Collection<A> retainCollection)
default GraphTraversal<A,A> simplePath()
default GraphTraversal<A,A> cyclicPath()
default GraphTraversal<A,A> sample(int amountToSample)
default GraphTraversal<A,A> sideEffect(java.util.function.Consumer<Traverser<A>> consumer)
default <E2> GraphTraversal<A,E2> cap(java.lang.String sideEffectKey)
default <E2> GraphTraversal<A,E2> cap()
default GraphTraversal<A,A> subgraph(java.lang.String sideEffectKey, java.util.Set<java.lang.Object> edgeIdHolder, java.util.Map<java.lang.Object,Vertex> vertexMap, java.util.function.Predicate<Edge> includeEdge)
default GraphTraversal<A,A> subgraph(java.util.Set<java.lang.Object> edgeIdHolder, java.util.Map<java.lang.Object,Vertex> vertexMap, java.util.function.Predicate<Edge> includeEdge)
default GraphTraversal<A,A> subgraph(java.lang.String sideEffectKey, java.util.function.Predicate<Edge> includeEdge)
default GraphTraversal<A,A> subgraph(java.util.function.Predicate<Edge> includeEdge)
default GraphTraversal<A,A> aggregate(java.lang.String sideEffectKey)
default GraphTraversal<A,A> aggregate()
default GraphTraversal<A,A> group(java.lang.String sideEffectKey)
default GraphTraversal<A,A> group()
default GraphTraversal<A,A> groupCount(java.lang.String sideEffectKey)
default GraphTraversal<A,A> groupCount()
default GraphTraversal<A,Vertex> addE(Direction direction, java.lang.String edgeLabel, java.lang.String stepLabel, java.lang.Object... propertyKeyValues)
default GraphTraversal<A,Vertex> addInE(java.lang.String edgeLabel, java.lang.String setLabel, java.lang.Object... propertyKeyValues)
default GraphTraversal<A,Vertex> addOutE(java.lang.String edgeLabel, java.lang.String stepLabel, java.lang.Object... propertyKeyValues)
default GraphTraversal<A,Vertex> addBothE(java.lang.String edgeLabel, java.lang.String stepLabel, java.lang.Object... propertyKeyValues)
default GraphTraversal<A,A> timeLimit(long timeLimit)
default GraphTraversal<A,A> tree(java.lang.String sideEffectKey)
default GraphTraversal<A,A> tree()
default <V> GraphTraversal<A,A> sack(java.util.function.BiFunction<V,A,V> sackFunction)
default <V> GraphTraversal<A,A> sack(java.util.function.BinaryOperator<V> sackOperator, java.lang.String elementPropertyKey)
default GraphTraversal<A,A> store(java.lang.String sideEffectKey)
default GraphTraversal<A,A> store()
default GraphTraversal<A,A> branch(java.util.function.Function<Traverser<A>,java.util.Collection<java.lang.String>> function)
default <E2> GraphTraversal<A,E2> choose(java.util.function.Predicate<A> choosePredicate, Traversal<?,E2> trueChoice, Traversal<?,E2> falseChoice)
default <E2,M> GraphTraversal<A,E2> choose(java.util.function.Function<A,M> mapFunction, java.util.Map<M,Traversal<?,E2>> choices)
default <E2> GraphTraversal<A,E2> union(Traversal<?,E2>... traversals)
default GraphTraversal<A,A> repeat(Traversal<?,A> traversal)
default GraphTraversal<A,A> emit(java.util.function.Predicate<Traverser<A>> emitPredicate)
default GraphTraversal<A,A> emit(Traversal<?,?> emitTraversal)
default GraphTraversal<A,A> emit()
default GraphTraversal<A,A> until(java.util.function.Predicate<Traverser<A>> untilPredicate)
default GraphTraversal<A,A> until(Traversal<?,?> untilTraversal)
default GraphTraversal<A,A> times(int maxLoops)
default GraphTraversal<A,A> as(java.lang.String label)
default GraphTraversal<A,A> profile()
default GraphTraversal<A,A> withSideEffect(java.lang.String key, java.util.function.Supplier supplier)
default <B> GraphTraversal<A,A> withSack(java.util.function.Supplier<B> initialValue, java.util.function.UnaryOperator<B> splitOperator)
default <B> GraphTraversal<A,A> withSack(java.util.function.Supplier<B> initialValue)
default GraphTraversal<A,A> withPath()
Copyright © 2013-2015 TinkerPop. All Rights Reserved.