public interface GraphTraversal<S,E> extends Traversal<S,E>
| Modifier and Type | Interface and Description |
|---|---|
static interface |
GraphTraversal.Admin<S,E> |
Traversal.Exceptions| Modifier and Type | Method and Description |
|---|---|
default GraphTraversal<S,Edge> |
addE(Direction direction,
String edgeLabel,
Iterator<Vertex> otherVertices,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addE(Direction direction,
String edgeLabel,
String stepLabel,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addE(Direction direction,
String edgeLabel,
Vertex otherVertex,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addInE(String edgeLabel,
Iterator<Vertex> otherVertices,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addInE(String edgeLabel,
String stepLabel,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addInE(String edgeLabel,
Vertex otherVertex,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addOutE(String edgeLabel,
Iterator<Vertex> otherVertices,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addOutE(String edgeLabel,
String stepLabel,
Object... propertyKeyValues) |
default GraphTraversal<S,Edge> |
addOutE(String edgeLabel,
Vertex otherVertex,
Object... propertyKeyValues) |
default GraphTraversal<S,Vertex> |
addV(Object... keyValues) |
default GraphTraversal<S,E> |
aggregate(String sideEffectKey) |
default GraphTraversal<S,E> |
and(Traversal<?,?>... andTraversals) |
default GraphTraversal<S,E> |
as(String stepLabel) |
default GraphTraversal.Admin<S,E> |
asAdmin()
Get access to administrative methods of the traversal via its accompanying
Traversal.Admin. |
default <E2> GraphTraversal<S,E2> |
back(String stepLabel) |
default GraphTraversal<S,E> |
barrier() |
default GraphTraversal<S,Vertex> |
both(String... edgeLabels) |
default GraphTraversal<S,Edge> |
bothE(String... edgeLabels) |
default GraphTraversal<S,Vertex> |
bothV() |
default <M,E2> GraphTraversal<S,E2> |
branch(Function<Traverser<E>,M> function) |
default <M,E2> GraphTraversal<S,E2> |
branch(Traversal<?,M> branchTraversal) |
default GraphTraversal<S,E> |
by() |
default GraphTraversal<S,E> |
by(Comparator<E> comparator) |
default <V> GraphTraversal<S,E> |
by(Function<Element,V> elementFunctionProjection,
Comparator<V> elementFunctionValueComparator) |
default <V> GraphTraversal<S,E> |
by(Function<V,Object> functionProjection) |
default GraphTraversal<S,E> |
by(Order order) |
default GraphTraversal<S,E> |
by(String elementPropertyKey) |
default <V> GraphTraversal<S,E> |
by(String elementPropertyProjection,
Comparator<V> propertyValueComparator) |
default GraphTraversal<S,E> |
by(T tokenProjection) |
default GraphTraversal<S,E> |
by(Traversal<?,?> byTraversal) |
default <V> GraphTraversal<S,E> |
by(Traversal<?,?> traversal,
Comparator<V> endComparator) |
default <E2> GraphTraversal<S,E2> |
cap(String... sideEffectKeys) |
default <M,E2> GraphTraversal<S,E2> |
choose(Function<E,M> choiceFunction) |
default <E2> GraphTraversal<S,E2> |
choose(Predicate<E> choosePredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice) |
default <E2> GraphTraversal<S,E2> |
choose(Traversal<?,?> traversalPredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice) |
default <M,E2> GraphTraversal<S,E2> |
choose(Traversal<?,M> choiceTraversal) |
default <E2> GraphTraversal<S,E2> |
coalesce(Traversal<?,E2>... coalesceTraversals) |
default GraphTraversal<S,E> |
coin(double probability) |
default GraphTraversal<S,Long> |
count() |
default GraphTraversal<S,Long> |
count(Scope scope) |
default GraphTraversal<S,E> |
cyclicPath() |
default GraphTraversal<S,E> |
dedup() |
default GraphTraversal<S,E> |
dedup(Scope scope) |
default GraphTraversal<S,E> |
drop() |
default GraphTraversal<S,E> |
emit() |
default GraphTraversal<S,E> |
emit(Predicate<Traverser<E>> emitPredicate) |
default GraphTraversal<S,E> |
emit(Traversal<?,?> emitTraversal) |
default GraphTraversal<S,E> |
except(Collection<E> exceptCollection) |
default GraphTraversal<S,E> |
except(E exceptObject) |
default GraphTraversal<S,E> |
except(String sideEffectKeyOrPathLabel) |
default GraphTraversal<S,E> |
filter(Predicate<Traverser<E>> predicate) |
default <E2> GraphTraversal<S,E2> |
flatMap(Function<Traverser<E>,Iterator<E2>> function) |
default GraphTraversal<S,List<E>> |
fold() |
default <E2> GraphTraversal<S,E2> |
fold(E2 seed,
BiFunction<E2,E,E2> foldFunction) |
default <K,R> GraphTraversal<S,Map<K,R>> |
group() |
default GraphTraversal<S,E> |
group(String sideEffectKey) |
default <E2> GraphTraversal<S,Map<E2,Long>> |
groupCount() |
default GraphTraversal<S,E> |
groupCount(String sideEffectKey) |
default GraphTraversal<S,E> |
has(String key) |
default GraphTraversal<S,E> |
has(String key,
BiPredicate predicate,
Object value) |
default GraphTraversal<S,E> |
has(String key,
Object value) |
default GraphTraversal<S,E> |
has(String label,
String key,
BiPredicate predicate,
Object value) |
default GraphTraversal<S,E> |
has(String label,
String key,
Object value) |
default GraphTraversal<S,E> |
has(T accessor,
BiPredicate predicate,
Object value) |
default GraphTraversal<S,E> |
has(T accessor,
Object value) |
default GraphTraversal<S,E> |
has(Traversal<?,?> hasNextTraversal) |
default GraphTraversal<S,E> |
hasId(Object... ids) |
default GraphTraversal<S,E> |
hasKey(String... keys) |
default GraphTraversal<S,E> |
hasLabel(String... labels) |
default GraphTraversal<S,E> |
hasNot(String key) |
default GraphTraversal<S,E> |
hasNot(Traversal<?,?> hasNotNextTraversal) |
default GraphTraversal<S,E> |
hasValue(Object... values) |
default GraphTraversal<S,Object> |
id() |
default GraphTraversal<S,E> |
identity() |
default GraphTraversal<S,Vertex> |
in(String... edgeLabels) |
default GraphTraversal<S,Edge> |
inE(String... edgeLabels) |
default GraphTraversal<S,E> |
inject(E... injections) |
default GraphTraversal<S,Vertex> |
inV() |
default GraphTraversal<S,E> |
is(BiPredicate predicate,
Object value) |
default GraphTraversal<S,E> |
is(Object value) |
default GraphTraversal<S,E> |
iterate()
Iterate all the
Traverser instances in the traversal. |
default GraphTraversal<S,String> |
key() |
default GraphTraversal<S,String> |
label() |
default GraphTraversal<S,E> |
limit(long limit) |
default GraphTraversal<S,E> |
limit(Scope scope,
long limit) |
default <E2> GraphTraversal<S,E2> |
local(Traversal<?,E2> localTraversal) |
default <E2> GraphTraversal<S,E2> |
map(Function<Traverser<E>,E2> function) |
default <E2> GraphTraversal<S,Map<String,E2>> |
match(String startLabel,
Traversal... traversals) |
default <E2 extends Number> |
max() |
default <E2 extends Number> |
max(Scope scope) |
default GraphTraversal<S,Double> |
mean() |
default GraphTraversal<S,Double> |
mean(Scope scope) |
default <E2 extends Number> |
min() |
default <E2 extends Number> |
min(Scope scope) |
default <M,E2> GraphTraversal<S,E> |
option(M pickToken,
Traversal<E,E2> traversalOption) |
default <E2> GraphTraversal<S,E> |
option(Traversal<E,E2> traversalOption) |
default GraphTraversal<S,E> |
or(Traversal<?,?>... orTraversals) |
default GraphTraversal<S,E> |
order() |
default GraphTraversal<S,E> |
order(Scope scope) |
default GraphTraversal<S,Vertex> |
otherV() |
default GraphTraversal<S,Vertex> |
out(String... edgeLabels) |
default GraphTraversal<S,Edge> |
outE(String... edgeLabels) |
default GraphTraversal<S,Vertex> |
outV() |
default GraphTraversal<S,Path> |
path() |
default GraphTraversal<S,E> |
profile() |
default <E2> GraphTraversal<S,? extends Property<E2>> |
properties(String... propertyKeys) |
default GraphTraversal<S,E> |
property(String key,
Object value,
Object... keyValues) |
default GraphTraversal<S,E> |
property(VertexProperty.Cardinality cardinality,
String key,
Object value,
Object... keyValues) |
default <E2> GraphTraversal<S,Map<String,E2>> |
propertyMap(String... propertyKeys) |
default GraphTraversal<S,E> |
range(long low,
long high) |
default GraphTraversal<S,E> |
range(Scope scope,
long low,
long high) |
default GraphTraversal<S,E> |
repeat(Traversal<?,E> repeatTraversal) |
default GraphTraversal<S,E> |
retain(Collection<E> retainCollection) |
default GraphTraversal<S,E> |
retain(E retainObject) |
default GraphTraversal<S,E> |
retain(String sideEffectKeyOrPathLabel) |
default <E2> GraphTraversal<S,E2> |
sack() |
default <V> GraphTraversal<S,E> |
sack(BiFunction<V,E,V> sackFunction) |
default <V> GraphTraversal<S,E> |
sack(BinaryOperator<V> sackOperator,
String elementPropertyKey) |
default GraphTraversal<S,E> |
sample(int amountToSample) |
default GraphTraversal<S,E> |
sample(Scope scope,
int amountToSample) |
default <E2> GraphTraversal<S,Map<String,E2>> |
select(String... stepLabels) |
default <E2> GraphTraversal<S,E2> |
select(String stepLabel) |
default GraphTraversal<S,E> |
sideEffect(Consumer<Traverser<E>> consumer) |
default GraphTraversal<S,E> |
simplePath() |
default GraphTraversal<S,E> |
store(String sideEffectKey) |
default GraphTraversal<S,Edge> |
subgraph(String sideEffectKey) |
default GraphTraversal<S,Double> |
sum() |
default GraphTraversal<S,Double> |
sum(Scope scope) |
default GraphTraversal<S,E> |
timeLimit(long timeLimit) |
default GraphTraversal<S,E> |
times(int maxLoops) |
default GraphTraversal<S,Vertex> |
to(Direction direction,
String... edgeLabels) |
default GraphTraversal<S,Edge> |
toE(Direction direction,
String... edgeLabels) |
default GraphTraversal<S,Vertex> |
toV(Direction direction) |
default GraphTraversal<S,Tree> |
tree() |
default GraphTraversal<S,E> |
tree(String sideEffectKey) |
default <E2> GraphTraversal<S,E2> |
unfold() |
default <E2> GraphTraversal<S,E2> |
union(Traversal<?,E2>... unionTraversals) |
default GraphTraversal<S,E> |
until(Predicate<Traverser<E>> untilPredicate) |
default GraphTraversal<S,E> |
until(Traversal<?,?> untilTraversal) |
default <E2> GraphTraversal<S,E2> |
value() |
default <E2> GraphTraversal<S,Map<String,E2>> |
valueMap(boolean includeTokens,
String... propertyKeys) |
default <E2> GraphTraversal<S,Map<String,E2>> |
valueMap(String... propertyKeys) |
default <E2> GraphTraversal<S,E2> |
values(String... propertyKeys) |
default <E2> GraphTraversal<S,Map<String,E2>> |
where(String firstKey,
BiPredicate predicate,
String secondKey) |
default <E2> GraphTraversal<S,Map<String,E2>> |
where(String firstKey,
String secondKey,
BiPredicate predicate) |
default <E2> GraphTraversal<S,Map<String,E2>> |
where(Traversal constraint) |
default GraphTraversal<S,E> |
withPath() |
default <A> GraphTraversal<S,E> |
withSack(A initialValue) |
default <A> GraphTraversal<S,E> |
withSack(A initialValue,
UnaryOperator<A> splitOperator) |
default <A> GraphTraversal<S,E> |
withSack(Supplier<A> initialValue) |
default <A> GraphTraversal<S,E> |
withSack(Supplier<A> initialValue,
UnaryOperator<A> splitOperator) |
default GraphTraversal<S,E> |
withSideEffect(String key,
Supplier supplier) |
fill, forEachRemaining, forEachRemaining, next, toBulkSet, toList, toSet, tryNextdefault GraphTraversal.Admin<S,E> asAdmin()
TraversalTraversal.Admin.default <E2> GraphTraversal<S,E2> map(Function<Traverser<E>,E2> function)
default GraphTraversal<S,Object> id()
default GraphTraversal<S,String> label()
default GraphTraversal<S,E> identity()
default GraphTraversal<S,Vertex> to(Direction direction, String... edgeLabels)
default GraphTraversal<S,Vertex> out(String... edgeLabels)
default GraphTraversal<S,Vertex> in(String... edgeLabels)
default GraphTraversal<S,Vertex> both(String... edgeLabels)
default GraphTraversal<S,Edge> toE(Direction direction, String... edgeLabels)
default GraphTraversal<S,Edge> outE(String... edgeLabels)
default GraphTraversal<S,Edge> inE(String... edgeLabels)
default GraphTraversal<S,Edge> bothE(String... edgeLabels)
default GraphTraversal<S,Vertex> toV(Direction direction)
default GraphTraversal<S,Vertex> inV()
default GraphTraversal<S,Vertex> outV()
default GraphTraversal<S,Vertex> bothV()
default GraphTraversal<S,Vertex> otherV()
default GraphTraversal<S,E> order()
default GraphTraversal<S,E> order(Scope scope)
default <E2> GraphTraversal<S,? extends Property<E2>> properties(String... propertyKeys)
default <E2> GraphTraversal<S,E2> values(String... propertyKeys)
default <E2> GraphTraversal<S,Map<String,E2>> propertyMap(String... propertyKeys)
default <E2> GraphTraversal<S,Map<String,E2>> valueMap(String... propertyKeys)
default <E2> GraphTraversal<S,Map<String,E2>> valueMap(boolean includeTokens, String... propertyKeys)
default GraphTraversal<S,String> key()
default <E2> GraphTraversal<S,E2> value()
default GraphTraversal<S,Path> path()
default <E2> GraphTraversal<S,E2> back(String stepLabel)
default <E2> GraphTraversal<S,Map<String,E2>> match(String startLabel, Traversal... traversals)
default <E2> GraphTraversal<S,E2> sack()
default <E2> GraphTraversal<S,Map<String,E2>> select(String... stepLabels)
default <E2> GraphTraversal<S,E2> select(String stepLabel)
default <E2> GraphTraversal<S,E2> unfold()
default GraphTraversal<S,List<E>> fold()
default <E2> GraphTraversal<S,E2> fold(E2 seed, BiFunction<E2,E,E2> foldFunction)
default GraphTraversal<S,Long> count()
default GraphTraversal<S,Long> count(Scope scope)
default GraphTraversal<S,Double> sum()
default GraphTraversal<S,Double> sum(Scope scope)
default <E2 extends Number> GraphTraversal<S,E2> max()
default <E2 extends Number> GraphTraversal<S,E2> max(Scope scope)
default <E2 extends Number> GraphTraversal<S,E2> min()
default <E2 extends Number> GraphTraversal<S,E2> min(Scope scope)
default GraphTraversal<S,Double> mean()
default GraphTraversal<S,Double> mean(Scope scope)
default <K,R> GraphTraversal<S,Map<K,R>> group()
default <E2> GraphTraversal<S,Map<E2,Long>> groupCount()
default GraphTraversal<S,Tree> tree()
default GraphTraversal<S,Vertex> addV(Object... keyValues)
default GraphTraversal<S,Edge> addE(Direction direction, String edgeLabel, String stepLabel, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addE(Direction direction, String edgeLabel, Vertex otherVertex, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addE(Direction direction, String edgeLabel, Iterator<Vertex> otherVertices, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addInE(String edgeLabel, String stepLabel, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addInE(String edgeLabel, Vertex otherVertex, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addInE(String edgeLabel, Iterator<Vertex> otherVertices, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addOutE(String edgeLabel, String stepLabel, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addOutE(String edgeLabel, Vertex otherVertex, Object... propertyKeyValues)
default GraphTraversal<S,Edge> addOutE(String edgeLabel, Iterator<Vertex> otherVertices, Object... propertyKeyValues)
default GraphTraversal<S,E> or(Traversal<?,?>... orTraversals)
default GraphTraversal<S,E> and(Traversal<?,?>... andTraversals)
default GraphTraversal<S,E> inject(E... injections)
default GraphTraversal<S,E> dedup()
default GraphTraversal<S,E> dedup(Scope scope)
default GraphTraversal<S,E> except(String sideEffectKeyOrPathLabel)
default GraphTraversal<S,E> except(E exceptObject)
default GraphTraversal<S,E> except(Collection<E> exceptCollection)
default <E2> GraphTraversal<S,Map<String,E2>> where(String firstKey, String secondKey, BiPredicate predicate)
default <E2> GraphTraversal<S,Map<String,E2>> where(String firstKey, BiPredicate predicate, String secondKey)
default <E2> GraphTraversal<S,Map<String,E2>> where(Traversal constraint)
default GraphTraversal<S,E> has(Traversal<?,?> hasNextTraversal)
default GraphTraversal<S,E> hasNot(Traversal<?,?> hasNotNextTraversal)
default GraphTraversal<S,E> has(String key)
default GraphTraversal<S,E> has(String key, Object value)
default GraphTraversal<S,E> has(T accessor, Object value)
default GraphTraversal<S,E> has(String key, BiPredicate predicate, Object value)
default GraphTraversal<S,E> has(T accessor, BiPredicate predicate, Object value)
default GraphTraversal<S,E> has(String label, String key, BiPredicate predicate, Object value)
default GraphTraversal<S,E> hasNot(String key)
default GraphTraversal<S,E> hasLabel(String... labels)
default GraphTraversal<S,E> hasId(Object... ids)
default GraphTraversal<S,E> hasKey(String... keys)
default GraphTraversal<S,E> hasValue(Object... values)
default GraphTraversal<S,E> is(Object value)
default GraphTraversal<S,E> is(BiPredicate predicate, Object value)
default GraphTraversal<S,E> coin(double probability)
default GraphTraversal<S,E> range(long low, long high)
default GraphTraversal<S,E> range(Scope scope, long low, long high)
default GraphTraversal<S,E> limit(long limit)
default GraphTraversal<S,E> limit(Scope scope, long limit)
default GraphTraversal<S,E> retain(String sideEffectKeyOrPathLabel)
default GraphTraversal<S,E> retain(E retainObject)
default GraphTraversal<S,E> retain(Collection<E> retainCollection)
default GraphTraversal<S,E> simplePath()
default GraphTraversal<S,E> cyclicPath()
default GraphTraversal<S,E> sample(int amountToSample)
default GraphTraversal<S,E> sample(Scope scope, int amountToSample)
default GraphTraversal<S,E> drop()
default <E2> GraphTraversal<S,E2> cap(String... sideEffectKeys)
default GraphTraversal<S,Edge> subgraph(String sideEffectKey)
default GraphTraversal<S,E> aggregate(String sideEffectKey)
default GraphTraversal<S,E> group(String sideEffectKey)
default GraphTraversal<S,E> groupCount(String sideEffectKey)
default GraphTraversal<S,E> timeLimit(long timeLimit)
default GraphTraversal<S,E> tree(String sideEffectKey)
default <V> GraphTraversal<S,E> sack(BiFunction<V,E,V> sackFunction)
default <V> GraphTraversal<S,E> sack(BinaryOperator<V> sackOperator, String elementPropertyKey)
default GraphTraversal<S,E> store(String sideEffectKey)
default GraphTraversal<S,E> profile()
default GraphTraversal<S,E> property(VertexProperty.Cardinality cardinality, String key, Object value, Object... keyValues)
default <M,E2> GraphTraversal<S,E2> branch(Traversal<?,M> branchTraversal)
default <M,E2> GraphTraversal<S,E2> branch(Function<Traverser<E>,M> function)
default <M,E2> GraphTraversal<S,E2> choose(Traversal<?,M> choiceTraversal)
default <E2> GraphTraversal<S,E2> choose(Traversal<?,?> traversalPredicate, Traversal<?,E2> trueChoice, Traversal<?,E2> falseChoice)
default <M,E2> GraphTraversal<S,E2> choose(Function<E,M> choiceFunction)
default <E2> GraphTraversal<S,E2> choose(Predicate<E> choosePredicate, Traversal<?,E2> trueChoice, Traversal<?,E2> falseChoice)
default <E2> GraphTraversal<S,E2> union(Traversal<?,E2>... unionTraversals)
default <E2> GraphTraversal<S,E2> coalesce(Traversal<?,E2>... coalesceTraversals)
default GraphTraversal<S,E> repeat(Traversal<?,E> repeatTraversal)
default GraphTraversal<S,E> emit(Traversal<?,?> emitTraversal)
default GraphTraversal<S,E> emit()
default GraphTraversal<S,E> until(Traversal<?,?> untilTraversal)
default GraphTraversal<S,E> times(int maxLoops)
default <E2> GraphTraversal<S,E2> local(Traversal<?,E2> localTraversal)
default GraphTraversal<S,E> withSideEffect(String key, Supplier supplier)
default <A> GraphTraversal<S,E> withSack(Supplier<A> initialValue, UnaryOperator<A> splitOperator)
default <A> GraphTraversal<S,E> withSack(Supplier<A> initialValue)
default <A> GraphTraversal<S,E> withSack(A initialValue, UnaryOperator<A> splitOperator)
default <A> GraphTraversal<S,E> withSack(A initialValue)
default GraphTraversal<S,E> withPath()
default GraphTraversal<S,E> as(String stepLabel)
default GraphTraversal<S,E> barrier()
default GraphTraversal<S,E> by()
default <V> GraphTraversal<S,E> by(Function<V,Object> functionProjection)
default GraphTraversal<S,E> by(T tokenProjection)
default GraphTraversal<S,E> by(String elementPropertyKey)
default GraphTraversal<S,E> by(Traversal<?,?> byTraversal)
default GraphTraversal<S,E> by(Order order)
default GraphTraversal<S,E> by(Comparator<E> comparator)
default <V> GraphTraversal<S,E> by(Function<Element,V> elementFunctionProjection, Comparator<V> elementFunctionValueComparator)
default <V> GraphTraversal<S,E> by(String elementPropertyProjection, Comparator<V> propertyValueComparator)
default <V> GraphTraversal<S,E> by(Traversal<?,?> traversal, Comparator<V> endComparator)
default <M,E2> GraphTraversal<S,E> option(M pickToken, Traversal<E,E2> traversalOption)
default <E2> GraphTraversal<S,E> option(Traversal<E,E2> traversalOption)
default GraphTraversal<S,E> iterate()
TraversalTraverser instances in the traversal.
What is returned is the empty traversal.
It is assumed that what is desired from the computation is are the sideEffects yielded by the traversal.Copyright © 2013–2015 Apache Software Foundation. All rights reserved.