Package | Description |
---|---|
org.apache.tinkerpop.gremlin.process.traversal.dsl.graph |
Modifier and Type | Interface and Description |
---|---|
static interface |
GraphTraversal.Admin<S,E> |
Modifier and Type | Method and Description |
---|---|
default GraphTraversal<S,Edge> |
GraphTraversal.addE(Direction direction,
String firstVertexKeyOrEdgeLabel,
String edgeLabelOrSecondVertexKey,
Object... propertyKeyValues)
Deprecated.
As of release 3.1.0, replaced by
addE(String) |
default GraphTraversal<S,Edge> |
GraphTraversal.addE(String edgeLabel) |
default GraphTraversal<S,Edge> |
GraphTraversal.addInE(String firstVertexKeyOrEdgeLabel,
String edgeLabelOrSecondVertexKey,
Object... propertyKeyValues)
Deprecated.
As of release 3.1.0, replaced by
addE(String) |
default GraphTraversal<S,Edge> |
GraphTraversal.addOutE(String firstVertexKeyOrEdgeLabel,
String edgeLabelOrSecondVertexKey,
Object... propertyKeyValues)
Deprecated.
As of release 3.1.0, replaced by
addE(String) |
default GraphTraversal<S,Vertex> |
GraphTraversal.addV() |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.addV() |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.GraphTraversalSourceStub.addV() |
default GraphTraversal<S,Vertex> |
GraphTraversal.addV(Object... propertyKeyValues)
Deprecated.
As of release 3.1.0, replaced by
addV() |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.addV(Object... keyValues)
Deprecated.
As of release 3.1.0, replaced by
GraphTraversalSource.addV() |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.GraphTraversalSourceStub.addV(Object... keyValues)
Deprecated.
As of release 3.1.0, replaced by
GraphTraversalSource.GraphTraversalSourceStub.addV() |
default GraphTraversal<S,Vertex> |
GraphTraversal.addV(String vertexLabel) |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.addV(String label) |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.GraphTraversalSourceStub.addV(String label) |
default GraphTraversal<S,E> |
GraphTraversal.aggregate(String sideEffectKey) |
default GraphTraversal<S,E> |
GraphTraversal.and(Traversal<?,?>... andTraversals) |
default GraphTraversal<S,E> |
GraphTraversal.as(String stepLabel,
String... stepLabels) |
default GraphTraversal<S,E> |
GraphTraversal.barrier() |
default GraphTraversal<S,E> |
GraphTraversal.barrier(Consumer<org.apache.tinkerpop.gremlin.process.traversal.traverser.util.TraverserSet<Object>> barrierConsumer) |
default GraphTraversal<S,E> |
GraphTraversal.barrier(int maxBarrierSize) |
default GraphTraversal<S,Vertex> |
GraphTraversal.both(String... edgeLabels)
Map the
Vertex to its adjacent vertices given the edge labels. |
default GraphTraversal<S,Edge> |
GraphTraversal.bothE(String... edgeLabels)
Map the
Vertex to its incident edges given the edge labels. |
default GraphTraversal<S,Vertex> |
GraphTraversal.bothV()
Map the
Edge to its incident vertices. |
default <M,E2> GraphTraversal<S,E2> |
GraphTraversal.branch(Function<Traverser<E>,M> function) |
default <M,E2> GraphTraversal<S,E2> |
GraphTraversal.branch(Traversal<?,M> branchTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.by() |
default <V> GraphTraversal<S,E> |
GraphTraversal.by(Column column,
Comparator<V> objectComparator) |
default GraphTraversal<S,E> |
GraphTraversal.by(Comparator<E> comparator) |
default <V> GraphTraversal<S,E> |
GraphTraversal.by(Function<Element,V> elementFunctionProjection,
Comparator<V> elementFunctionValueComparator) |
default <V> GraphTraversal<S,E> |
GraphTraversal.by(Function<V,Object> functionProjection) |
default GraphTraversal<S,E> |
GraphTraversal.by(Order order) |
default GraphTraversal<S,E> |
GraphTraversal.by(String elementPropertyKey) |
default <V> GraphTraversal<S,E> |
GraphTraversal.by(String elementPropertyProjection,
Comparator<V> propertyValueComparator) |
default GraphTraversal<S,E> |
GraphTraversal.by(T tokenProjection) |
default GraphTraversal<S,E> |
GraphTraversal.by(Traversal<?,?> byTraversal) |
default <V> GraphTraversal<S,E> |
GraphTraversal.by(Traversal<?,?> traversal,
Comparator<V> endComparator) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.cap(String sideEffectKey,
String... sideEffectKeys) |
default <M,E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Function<E,M> choiceFunction) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Predicate<E> choosePredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice) |
default <M,E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,M> choiceTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.coalesce(Traversal<?,E2>... coalesceTraversals) |
default GraphTraversal<S,E> |
GraphTraversal.coin(double probability)
Filter the
E object given a biased coin toss. |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.constant(E2 e)
Map any object to a fixed
E value. |
default GraphTraversal<S,Long> |
GraphTraversal.count()
Map the traversal stream to its reduction as a sum of the
Traverser.bulk() values (i.e. |
default GraphTraversal<S,Long> |
GraphTraversal.count(Scope scope) |
default GraphTraversal<S,E> |
GraphTraversal.cyclicPath()
|
default GraphTraversal<S,E> |
GraphTraversal.dedup(Scope scope,
String... dedupLabels)
Remove all duplicates in the traversal stream up to this point.
|
default GraphTraversal<S,E> |
GraphTraversal.dedup(String... dedupLabels)
Remove all duplicates in the traversal stream up to this point.
|
default GraphTraversal<S,E> |
GraphTraversal.drop() |
GraphTraversal<Edge,Edge> |
GraphTraversalSource.E(Object... edgesIds) |
GraphTraversal<Edge,Edge> |
GraphTraversalSource.GraphTraversalSourceStub.E(Object... edgesIds) |
default GraphTraversal<S,E> |
GraphTraversal.emit() |
default GraphTraversal<S,E> |
GraphTraversal.emit(Predicate<Traverser<E>> emitPredicate) |
default GraphTraversal<S,E> |
GraphTraversal.emit(Traversal<?,?> emitTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.filter(Predicate<Traverser<E>> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.filter(Traversal<?,?> filterTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.flatMap(Function<Traverser<E>,Iterator<E2>> function)
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.flatMap(Traversal<?,E2> flatMapTraversal)
|
default GraphTraversal<S,List<E>> |
GraphTraversal.fold() |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.fold(E2 seed,
BiFunction<E2,E,E2> foldFunction) |
default GraphTraversal<S,E> |
GraphTraversal.from(String fromStepLabel) |
default GraphTraversal<S,E> |
GraphTraversal.from(Traversal<E,Vertex> fromVertex) |
default <K,V> GraphTraversal<S,Map<K,V>> |
GraphTraversal.group() |
default GraphTraversal<S,E> |
GraphTraversal.group(String sideEffectKey) |
default <K> GraphTraversal<S,Map<K,Long>> |
GraphTraversal.groupCount() |
default GraphTraversal<S,E> |
GraphTraversal.groupCount(String sideEffectKey) |
default <K,V> GraphTraversal<S,Map<K,V>> |
GraphTraversal.groupV3d0()
Deprecated.
As of release 3.1.0, replaced by
group() |
default GraphTraversal<S,E> |
GraphTraversal.groupV3d0(String sideEffectKey)
Deprecated.
As of release 3.1.0, replaced by
group(String) . |
default GraphTraversal<S,E> |
GraphTraversal.has(String propertyKey) |
default GraphTraversal<S,E> |
GraphTraversal.has(String propertyKey,
Object value) |
default GraphTraversal<S,E> |
GraphTraversal.has(String propertyKey,
P<?> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.has(String label,
String propertyKey,
Object value) |
default GraphTraversal<S,E> |
GraphTraversal.has(String label,
String propertyKey,
P<?> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.has(String propertyKey,
Traversal<?,?> propertyTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.has(T accessor,
Object value) |
default GraphTraversal<S,E> |
GraphTraversal.has(T accessor,
P<?> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.has(T accessor,
Traversal<?,?> propertyTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.hasId(Object... ids) |
default GraphTraversal<S,E> |
GraphTraversal.hasKey(String... keys) |
default GraphTraversal<S,E> |
GraphTraversal.hasLabel(String... labels) |
default GraphTraversal<S,E> |
GraphTraversal.hasNot(String propertyKey) |
default GraphTraversal<S,E> |
GraphTraversal.hasValue(Object... values) |
default GraphTraversal<S,Object> |
GraphTraversal.id()
Map the
Element to its Element.id() . |
default GraphTraversal<S,E> |
GraphTraversal.identity()
Map the
E object to itself. |
default GraphTraversal<S,Vertex> |
GraphTraversal.in(String... edgeLabels)
Map the
Vertex to its incoming adjacent vertices given the edge labels. |
default GraphTraversal<S,Edge> |
GraphTraversal.inE(String... edgeLabels)
Map the
Vertex to its incoming incident edges given the edge labels. |
default GraphTraversal<S,E> |
GraphTraversal.inject(E... injections) |
<S> GraphTraversal<S,S> |
GraphTraversalSource.inject(S... starts) |
<S> GraphTraversal<S,S> |
GraphTraversalSource.GraphTraversalSourceStub.inject(S... starts) |
default GraphTraversal<S,Vertex> |
GraphTraversal.inV()
|
default GraphTraversal<S,E> |
GraphTraversal.is(Object value)
Filter the
E object if it is not P.eq(V) to the provided value. |
default GraphTraversal<S,E> |
GraphTraversal.is(P<E> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.iterate() |
default GraphTraversal<S,E> |
GraphTraversal.Admin.iterate() |
default GraphTraversal<S,String> |
GraphTraversal.key()
Map the
Property to its Property.key() . |
default GraphTraversal<S,String> |
GraphTraversal.label()
Map the
Element to its Element.label() . |
default GraphTraversal<S,E> |
GraphTraversal.limit(long limit) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.limit(Scope scope,
long limit) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.local(Traversal<?,E2> localTraversal) |
default GraphTraversal<S,Integer> |
GraphTraversal.loops() |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.map(Function<Traverser<E>,E2> function)
Map a traverser referencing an object of type
E to an object of type E2 . |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.map(Traversal<?,E2> mapTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.mapKeys()
Deprecated.
As of release 3.1.0, replaced by
select(Column) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.mapValues()
Deprecated.
As of release 3.1.0, replaced by
select(Column) |
default <E2> GraphTraversal<S,Map<String,E2>> |
GraphTraversal.match(Traversal<?,?>... matchTraversals)
|
default <E2 extends Number> |
GraphTraversal.max() |
default <E2 extends Number> |
GraphTraversal.max(Scope scope) |
default <E2 extends Number> |
GraphTraversal.mean() |
default <E2 extends Number> |
GraphTraversal.mean(Scope scope) |
default <E2 extends Number> |
GraphTraversal.min() |
default <E2 extends Number> |
GraphTraversal.min(Scope scope) |
default GraphTraversal<S,E> |
GraphTraversal.not(Traversal<?,?> notTraversal) |
default <M,E2> GraphTraversal<S,E> |
GraphTraversal.option(M pickToken,
Traversal<E,E2> traversalOption) |
default <E2> GraphTraversal<S,E> |
GraphTraversal.option(Traversal<E,E2> traversalOption) |
default GraphTraversal<S,E> |
GraphTraversal.or(Traversal<?,?>... orTraversals) |
default GraphTraversal<S,E> |
GraphTraversal.order()
Order all the objects in the traversal up to this point and then emit them one-by-one in their ordered sequence.
|
default GraphTraversal<S,E> |
GraphTraversal.order(Scope scope)
Order either the
Scope.local object (e.g. |
default GraphTraversal<S,Vertex> |
GraphTraversal.otherV()
Map the
Edge to the incident vertex that was not just traversed from in the path history. |
default GraphTraversal<S,Vertex> |
GraphTraversal.out(String... edgeLabels)
Map the
Vertex to its outgoing adjacent vertices given the edge labels. |
default GraphTraversal<S,Edge> |
GraphTraversal.outE(String... edgeLabels)
Map the
Vertex to its outgoing incident edges given the edge labels. |
default GraphTraversal<S,Vertex> |
GraphTraversal.outV()
|
default GraphTraversal<S,Path> |
GraphTraversal.path()
|
default GraphTraversal<S,E> |
GraphTraversal.profile() |
default <E2> GraphTraversal<S,? extends Property<E2>> |
GraphTraversal.properties(String... propertyKeys)
Map the
Element to its associated properties given the provide property keys. |
default GraphTraversal<S,E> |
GraphTraversal.property(Object key,
Object value,
Object... keyValues)
Sets the key and value of a
Property . |
default GraphTraversal<S,E> |
GraphTraversal.property(VertexProperty.Cardinality cardinality,
Object key,
Object value,
Object... keyValues)
Sets a
Property value and related meta properties if supplied, if supported by the Graph
and if the Element is a VertexProperty . |
default <E2> GraphTraversal<S,Map<String,E2>> |
GraphTraversal.propertyMap(String... propertyKeys)
|
default GraphTraversal<S,E> |
GraphTraversal.range(long low,
long high) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.range(Scope scope,
long low,
long high) |
default GraphTraversal<S,E> |
GraphTraversal.repeat(Traversal<?,E> repeatTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.sack()
Map the
Traverser to its Traverser.sack() value. |
default <V,U> GraphTraversal<S,E> |
GraphTraversal.sack(BiFunction<V,U,V> sackOperator) |
default <V,U> GraphTraversal<S,E> |
GraphTraversal.sack(BiFunction<V,U,V> sackOperator,
String elementPropertyKey)
Deprecated.
As of release 3.1.0, replaced by
sack(BiFunction) with by(String) . |
default GraphTraversal<S,E> |
GraphTraversal.sample(int amountToSample) |
default GraphTraversal<S,E> |
GraphTraversal.sample(Scope scope,
int amountToSample) |
default <E2> GraphTraversal<S,Collection<E2>> |
GraphTraversal.select(Column column) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.select(Pop pop,
String selectKey) |
default <E2> GraphTraversal<S,Map<String,E2>> |
GraphTraversal.select(Pop pop,
String selectKey1,
String selectKey2,
String... otherSelectKeys)
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.select(String selectKey) |
default <E2> GraphTraversal<S,Map<String,E2>> |
GraphTraversal.select(String selectKey1,
String selectKey2,
String... otherSelectKeys)
|
default GraphTraversal<S,E> |
GraphTraversal.sideEffect(Consumer<Traverser<E>> consumer) |
default GraphTraversal<S,E> |
GraphTraversal.sideEffect(Traversal<?,?> sideEffectTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.simplePath()
|
default GraphTraversal<S,E> |
GraphTraversal.store(String sideEffectKey) |
default GraphTraversal<S,Edge> |
GraphTraversal.subgraph(String sideEffectKey) |
default <E2 extends Number> |
GraphTraversal.sum()
Map the traversal stream to its reduction as a sum of the
Traverser.get() values multiplied by their Traverser.bulk() (i.e. |
default <E2 extends Number> |
GraphTraversal.sum(Scope scope) |
default GraphTraversal<S,E> |
GraphTraversal.tail() |
default GraphTraversal<S,E> |
GraphTraversal.tail(long limit) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.tail(Scope scope) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.tail(Scope scope,
long limit) |
default GraphTraversal<S,E> |
GraphTraversal.timeLimit(long timeLimit)
Once the first
Traverser hits this step, a count down is started. |
default GraphTraversal<S,E> |
GraphTraversal.times(int maxLoops) |
default GraphTraversal<S,Vertex> |
GraphTraversal.to(Direction direction,
String... edgeLabels)
Map the
Vertex to its adjacent vertices given a direction and edge labels. |
default GraphTraversal<S,E> |
GraphTraversal.to(String toStepLabel) |
default GraphTraversal<S,E> |
GraphTraversal.to(Traversal<E,Vertex> toVertex) |
default GraphTraversal<S,Edge> |
GraphTraversal.toE(Direction direction,
String... edgeLabels)
Map the
Vertex to its incident edges given the direction and edge labels. |
default GraphTraversal<S,Vertex> |
GraphTraversal.toV(Direction direction)
Map the
Edge to its incident vertices given the direction. |
default GraphTraversal<S,org.apache.tinkerpop.gremlin.process.traversal.step.util.Tree> |
GraphTraversal.tree() |
default GraphTraversal<S,E> |
GraphTraversal.tree(String sideEffectKey) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.unfold() |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.union(Traversal<?,E2>... unionTraversals) |
default GraphTraversal<S,E> |
GraphTraversal.until(Predicate<Traverser<E>> untilPredicate) |
default GraphTraversal<S,E> |
GraphTraversal.until(Traversal<?,?> untilTraversal) |
default GraphTraversal<S,Vertex> |
GraphTraversal.V(Object... vertexIdsOrElements) |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.V(Object... vertexIds) |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.GraphTraversalSourceStub.V(Object... vertexIds) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.value()
Map the
Property to its Property.value() . |
default <E2> GraphTraversal<S,Map<String,E2>> |
GraphTraversal.valueMap(boolean includeTokens,
String... propertyKeys)
|
default <E2> GraphTraversal<S,Map<String,E2>> |
GraphTraversal.valueMap(String... propertyKeys)
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.values(String... propertyKeys)
Map the
Element to the values of the associated properties given the provide property keys. |
default GraphTraversal<S,E> |
GraphTraversal.where(P<String> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.where(String startKey,
P<String> predicate) |
default GraphTraversal<S,E> |
GraphTraversal.where(Traversal<?,?> whereTraversal) |
Copyright © 2013–2016 Apache Software Foundation. All rights reserved.