| Modifier and Type | Field and Description |
|---|---|
Supplier<? extends Traversal<Vertex,Edge>> |
MessageScope.Local.incidentTraversal |
| Modifier and Type | Method and Description |
|---|---|
Traversal<Vertex,Edge> |
MessageScope.Local.ReverseTraversalSupplier.get() |
Traversal<Vertex,Edge> |
Computer.getEdges() |
Traversal<Vertex,Vertex> |
Computer.getVertices() |
| Modifier and Type | Method and Description |
|---|---|
Supplier<? extends Traversal<Vertex,Edge>> |
MessageScope.Local.getIncidentTraversal() |
| Modifier and Type | Method and Description |
|---|---|
static IllegalArgumentException |
GraphComputer.Exceptions.edgeFilterAccessesAdjacentVertices(Traversal<Vertex,Edge> edgeFilter) |
Computer |
Computer.edges(Traversal<Vertex,Edge> edgeFilter) |
GraphComputer |
GraphComputer.edges(Traversal<Vertex,Edge> edgeFilter)
Add a filter that will limit which edges of the vertices are loaded from the graph source.
|
void |
GraphFilter.setEdgeFilter(Traversal<Vertex,Edge> edgeFilter)
Set the filter for selecting edges from the source graph.
|
void |
GraphFilter.setVertexFilter(Traversal<Vertex,Vertex> vertexFilter)
Set the filter for selecting vertices from the source graph.
|
static IllegalArgumentException |
GraphComputer.Exceptions.vertexFilterAccessesIncidentEdges(Traversal<Vertex,Vertex> vertexFilter) |
Computer |
Computer.vertices(Traversal<Vertex,Vertex> vertexFilter) |
GraphComputer |
GraphComputer.vertices(Traversal<Vertex,Vertex> vertexFilter)
Add a filter that will limit which vertices are loaded from the graph source.
|
| Modifier and Type | Method and Description |
|---|---|
static <M> MessageScope.Local<M> |
MessageScope.Local.of(Supplier<? extends Traversal<Vertex,Edge>> incidentTraversal) |
static <M> MessageScope.Local<M> |
MessageScope.Local.of(Supplier<? extends Traversal<Vertex,Edge>> incidentTraversal,
BiFunction<M,Edge,M> edgeFunction) |
| Modifier and Type | Method and Description |
|---|---|
ShortestPathVertexProgram.Builder |
ShortestPathVertexProgram.Builder.distanceTraversal(Traversal<Edge,Number> distanceTraversal) |
ShortestPathVertexProgram.Builder |
ShortestPathVertexProgram.Builder.edgeTraversal(Traversal<Vertex,Edge> edgeTraversal) |
ShortestPathVertexProgram.Builder |
ShortestPathVertexProgram.Builder.source(Traversal<Vertex,?> sourceVertexFilter) |
ShortestPathVertexProgram.Builder |
ShortestPathVertexProgram.Builder.target(Traversal<Vertex,?> targetVertexFilter) |
| Modifier and Type | Class and Description |
|---|---|
class |
HaltedTraversersCountTraversal |
| Modifier and Type | Method and Description |
|---|---|
VertexProgramStrategy.Builder |
VertexProgramStrategy.Builder.edges(Traversal<Vertex,Edge> edges) |
VertexProgramStrategy.Builder |
VertexProgramStrategy.Builder.vertices(Traversal<Vertex,Vertex> vertices) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
RemoteTraversal<S,E>
A
RemoteTraversal is returned from RemoteConnection.submitAsync(Bytecode). |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractRemoteTraversal<S,E>
This is a stub implementation for
RemoteTraversal and requires that the AbstractRemoteTraversal.nextTraverser() method
is implemented from Traversal.Admin. |
class |
EmbeddedRemoteTraversal<S,E>
Generated by the
EmbeddedRemoteConnection to help simulate a remote traversal execution within the same JVM. |
| Constructor and Description |
|---|
EmbeddedRemoteTraversal(Traversal<S,E> t) |
| Modifier and Type | Method and Description |
|---|---|
CompletableFuture<Traversal<?,E>> |
RemoteStep.promise()
Submits the traversal asynchronously to a "remote" using
RemoteConnection.submitAsync(Bytecode). |
| Modifier and Type | Interface and Description |
|---|---|
static interface |
Traversal.Admin<S,E> |
| Modifier and Type | Method and Description |
|---|---|
default <A,B> Traversal<A,B> |
Traversal.iterate()
Iterate all the
Traverser instances in the traversal. |
default Traversal<S,E> |
Traversal.none()
Filter all traversers in the traversal.
|
default Traversal<S,TraversalMetrics> |
Traversal.profile()
Profile the traversal.
|
| Modifier and Type | Method and Description |
|---|---|
default <T> CompletableFuture<T> |
Traversal.promise(Function<Traversal<S,E>,T> traversalFunction)
Starts a promise to execute a function on the current
Traversal that will be completed in the future. |
| Modifier and Type | Interface and Description |
|---|---|
interface |
GraphTraversal<S,E> |
static interface |
GraphTraversal.Admin<S,E> |
| Modifier and Type | Class and Description |
|---|---|
class |
DefaultGraphTraversal<S,E> |
| Modifier and Type | Method and Description |
|---|---|
GraphTraversal<Edge,Edge> |
GraphTraversalSource.addE(Traversal<?,String> edgeLabelTraversal)
Spawns a
GraphTraversal by adding a edge with a label as specified by the provided Traversal. |
default GraphTraversal<S,Edge> |
GraphTraversal.addE(Traversal<?,String> edgeLabelTraversal)
|
static <A> GraphTraversal<A,Edge> |
__.addE(Traversal<?,String> edgeLabelTraversal) |
GraphTraversal<Vertex,Vertex> |
GraphTraversalSource.addV(Traversal<?,String> vertexLabelTraversal)
Spawns a
GraphTraversal by adding a vertex with the label as determined by a Traversal. |
default GraphTraversal<S,Vertex> |
GraphTraversal.addV(Traversal<?,String> vertexLabelTraversal)
|
static <A> GraphTraversal<A,Vertex> |
__.addV(Traversal<?,String> vertexLabelTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.and(Traversal<?,?>... andTraversals)
Ensures that all of the provided traversals yield a result.
|
static <A> GraphTraversal<A,A> |
__.and(Traversal<?,?>... andTraversals) |
static <A,M,B> GraphTraversal<A,B> |
__.branch(Traversal<?,M> traversalFunction) |
default <M,E2> GraphTraversal<S,E2> |
GraphTraversal.branch(Traversal<?,M> branchTraversal)
Split the
Traverser to all the specified traversals. |
default GraphTraversal<S,E> |
GraphTraversal.by(Traversal<?,?> traversal)
The
by() can be applied to a number of different step to alter their behaviors. |
default <V> GraphTraversal<S,E> |
GraphTraversal.by(Traversal<?,?> traversal,
Comparator<V> comparator)
The
by() can be applied to a number of different step to alter their behaviors. |
static <A,B> GraphTraversal<A,B> |
__.choose(Predicate<A> choosePredicate,
Traversal<?,B> trueChoice) |
static <A,B> GraphTraversal<A,B> |
__.choose(Predicate<A> choosePredicate,
Traversal<?,B> trueChoice,
Traversal<?,B> falseChoice) |
static <A,B> GraphTraversal<A,B> |
__.choose(Predicate<A> choosePredicate,
Traversal<?,B> trueChoice,
Traversal<?,B> falseChoice) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Predicate<E> choosePredicate,
Traversal<?,E2> trueChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then
like semantics within a traversal.
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Predicate<E> choosePredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
like semantics within a traversal.
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Predicate<E> choosePredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
like semantics within a traversal.
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
Traversal<?,E2> trueChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then
like semantics within a traversal.
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
Traversal<?,E2> trueChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then
like semantics within a traversal.
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
like semantics within a traversal.
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
like semantics within a traversal.
|
default <E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
Traversal<?,E2> trueChoice,
Traversal<?,E2> falseChoice)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
like semantics within a traversal.
|
static <A,M,B> GraphTraversal<A,B> |
__.choose(Traversal<?,M> traversalFunction) |
default <M,E2> GraphTraversal<S,E2> |
GraphTraversal.choose(Traversal<?,M> choiceTraversal)
Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
like semantics within a traversal.
|
static <A,M,B> GraphTraversal<A,B> |
__.choose(Traversal<?,M> traversalPredicate,
Traversal<?,B> trueChoice) |
static <A,M,B> GraphTraversal<A,B> |
__.choose(Traversal<?,M> traversalPredicate,
Traversal<?,B> trueChoice) |
static <A,M,B> GraphTraversal<A,B> |
__.choose(Traversal<?,M> traversalPredicate,
Traversal<?,B> trueChoice,
Traversal<?,B> falseChoice) |
static <A,M,B> GraphTraversal<A,B> |
__.choose(Traversal<?,M> traversalPredicate,
Traversal<?,B> trueChoice,
Traversal<?,B> falseChoice) |
static <A,M,B> GraphTraversal<A,B> |
__.choose(Traversal<?,M> traversalPredicate,
Traversal<?,B> trueChoice,
Traversal<?,B> falseChoice) |
static <A,B> GraphTraversal<A,B> |
__.coalesce(Traversal<?,B>... traversals) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.coalesce(Traversal<?,E2>... coalesceTraversals)
Evaluates the provided traversals and returns the result of the first traversal to emit at least one object.
|
default GraphTraversal<S,E> |
GraphTraversal.emit(Traversal<?,?> emitTraversal)
Emit is used in conjunction with
GraphTraversal.repeat(Traversal) to determine what objects get emit from the loop. |
static <A> GraphTraversal<A,A> |
__.emit(Traversal<?,?> emitTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.filter(Traversal<?,?> filterTraversal)
Map the
Traverser to either true or false, where false will not pass the
traverser to the next step. |
static <A> GraphTraversal<A,A> |
__.filter(Traversal<?,?> filterTraversal) |
static <A,B> GraphTraversal<A,B> |
__.flatMap(Traversal<?,B> flatMapTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.flatMap(Traversal<?,E2> flatMapTraversal)
|
default GraphTraversal<S,E> |
GraphTraversal.from(Traversal<?,Vertex> fromVertex)
When used as a modifier to
GraphTraversal.addE(String) this method specifies the traversal to use for selecting the
outgoing vertex of the newly added Edge. |
default GraphTraversal<S,E> |
GraphTraversal.has(String propertyKey,
Traversal<?,?> propertyTraversal)
Filters vertices, edges and vertex properties based on their properties.
|
static <A> GraphTraversal<A,A> |
__.has(String propertyKey,
Traversal<?,?> propertyTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.has(T accessor,
Traversal<?,?> propertyTraversal)
Filters vertices, edges and vertex properties based on their properties.
|
static <A> GraphTraversal<A,A> |
__.has(T accessor,
Traversal<?,?> propertyTraversal) |
static <A,B> GraphTraversal<A,B> |
__.local(Traversal<?,B> localTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.local(Traversal<?,E2> localTraversal)
Provides a execute a specified traversal on a single element within a stream.
|
static <A,B> GraphTraversal<A,B> |
__.map(Traversal<?,B> mapTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.map(Traversal<?,E2> mapTraversal)
|
static <A,B> GraphTraversal<A,Map<String,B>> |
__.match(Traversal<?,?>... matchTraversals) |
default <E2> GraphTraversal<S,Map<String,E2>> |
GraphTraversal.match(Traversal<?,?>... matchTraversals)
|
default GraphTraversal<S,E> |
GraphTraversal.not(Traversal<?,?> notTraversal)
Removes objects from the traversal stream when the traversal provided as an argument does not return any objects.
|
static <A> GraphTraversal<A,A> |
__.not(Traversal<?,?> notTraversal) |
default <M,E2> GraphTraversal<S,E> |
GraphTraversal.option(M pickToken,
Traversal<?,E2> traversalOption)
This step modifies
GraphTraversal.choose(Function) to specifies the available choices that might be executed. |
default <E2> GraphTraversal<S,E> |
GraphTraversal.option(Traversal<?,E2> traversalOption)
This step modifies
GraphTraversal.choose(Function) to specifies the available choices that might be executed. |
static <A> GraphTraversal<A,A> |
__.optional(Traversal<?,A> optionalTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.optional(Traversal<?,E2> optionalTraversal)
Returns the result of the specified traversal if it yields a result, otherwise it returns the calling element.
|
default GraphTraversal<S,E> |
GraphTraversal.or(Traversal<?,?>... orTraversals)
Ensures that at least one of the provided traversals yield a result.
|
static <A> GraphTraversal<A,A> |
__.or(Traversal<?,?>... orTraversals) |
static <A> GraphTraversal<A,A> |
__.repeat(String loopName,
Traversal<?,A> traversal) |
default GraphTraversal<S,E> |
GraphTraversal.repeat(String loopName,
Traversal<?,E> repeatTraversal)
This step is used for looping over a traversal given some break predicate and with a specified loop name.
|
static <A> GraphTraversal<A,A> |
__.repeat(Traversal<?,A> traversal) |
default GraphTraversal<S,E> |
GraphTraversal.repeat(Traversal<?,E> repeatTraversal)
This step is used for looping over a traversal given some break predicate.
|
static <A,B> GraphTraversal<A,B> |
__.select(Pop pop,
Traversal<A,B> keyTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.select(Pop pop,
Traversal<S,E2> keyTraversal)
|
static <A,B> GraphTraversal<A,B> |
__.select(Traversal<A,B> keyTraversal) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.select(Traversal<S,E2> keyTraversal)
Map the
Traverser to the object specified by the key returned by the keyTraversal. |
default GraphTraversal<S,E> |
GraphTraversal.sideEffect(Traversal<?,?> sideEffectTraversal)
Perform some operation on the
Traverser and pass it to the next step unmodified. |
static <A> GraphTraversal<A,A> |
__.sideEffect(Traversal<?,?> sideEffectTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.to(Traversal<?,Vertex> toVertex)
When used as a modifier to
GraphTraversal.addE(String) this method specifies the traversal to use for selecting the
incoming vertex of the newly added Edge. |
static <A,B> GraphTraversal<A,B> |
__.union(Traversal<?,B>... traversals) |
default <E2> GraphTraversal<S,E2> |
GraphTraversal.union(Traversal<?,E2>... unionTraversals)
Merges the results of an arbitrary number of traversals.
|
default GraphTraversal<S,E> |
GraphTraversal.until(Traversal<?,?> untilTraversal)
Modifies a
GraphTraversal.repeat(Traversal) to determine when the loop should exit. |
static <A> GraphTraversal<A,A> |
__.until(Traversal<?,?> untilTraversal) |
default GraphTraversal<S,E> |
GraphTraversal.where(Traversal<?,?> whereTraversal)
Filters the current object based on the object itself or the path history.
|
static <A> GraphTraversal<A,A> |
__.where(Traversal<?,?> whereTraversal) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractLambdaTraversal<S,E> |
class |
ColumnTraversal |
class |
ConstantTraversal<S,E> |
class |
ElementValueTraversal<V>
More efficiently extracts a value from an
Element or Map to avoid strategy application costs. |
class |
IdentityTraversal<S> |
class |
LoopTraversal<S> |
class |
PredicateTraversal<S> |
class |
TokenTraversal<S extends Element,E> |
class |
TrueTraversal<S> |
| Modifier and Type | Method and Description |
|---|---|
static <A,B,C extends Traversal<A,B>> |
RepeatStep.addEmitToTraversal(C traversal,
Traversal.Admin<B,?> emitPredicate) |
static <A,B,C extends Traversal<A,B>> |
RepeatStep.addRepeatToTraversal(C traversal,
String loopName,
Traversal.Admin<B,B> repeatTraversal) |
static <A,B,C extends Traversal<A,B>> |
RepeatStep.addRepeatToTraversal(C traversal,
Traversal.Admin<B,B> repeatTraversal) |
static <A,B,C extends Traversal<A,B>> |
RepeatStep.addUntilToTraversal(C traversal,
Traversal.Admin<B,?> untilPredicate) |
| Modifier and Type | Method and Description |
|---|---|
List<Traversal<S,Object>> |
DedupGlobalStep.getLocalChildren() |
| Constructor and Description |
|---|
AndStep(Traversal.Admin traversal,
Traversal<S,?>... traversals) |
ConnectiveStep(Traversal.Admin traversal,
Traversal<S,?>... traversals) |
NotStep(Traversal.Admin traversal,
Traversal<S,?> notTraversal) |
OrStep(Traversal.Admin traversal,
Traversal<S,?>... traversals) |
TraversalFilterStep(Traversal.Admin traversal,
Traversal<S,?> filterTraversal) |
WhereTraversalStep(Traversal.Admin traversal,
Traversal<?,?> whereTraversal) |
| Constructor and Description |
|---|
AddEdgeStartStep(Traversal.Admin traversal,
Traversal<?,String> edgeLabelTraversal) |
AddVertexStartStep(Traversal.Admin traversal,
Traversal<?,String> vertexLabelTraversal) |
MatchStep(Traversal.Admin traversal,
ConnectiveStep.Connective connective,
Traversal... matchTraversals) |
TraversalFlatMapStep(Traversal.Admin traversal,
Traversal<S,E> flatMapTraversal) |
TraversalMapStep(Traversal.Admin traversal,
Traversal<S,E> mapTraversal) |
TraversalSelectStep(Traversal.Admin traversal,
Pop pop,
Traversal<S,E> keyTraversal) |
| Constructor and Description |
|---|
TraversalSideEffectStep(Traversal.Admin traversal,
Traversal<S,?> sideEffectTraversal) |
| Modifier and Type | Method and Description |
|---|---|
Traversal<Edge,?> |
SubgraphStrategy.getEdgeCriterion() |
Traversal<Vertex,?> |
SubgraphStrategy.getVertexCriterion() |
Traversal<VertexProperty,?> |
SubgraphStrategy.getVertexPropertyCriterion() |
| Modifier and Type | Method and Description |
|---|---|
SubgraphStrategy.Builder |
SubgraphStrategy.Builder.edges(Traversal<Edge,?> edgePredicate)
The traversal predicate that defines the edges to include in the subgraph.
|
SubgraphStrategy.Builder |
SubgraphStrategy.Builder.vertexProperties(Traversal<VertexProperty,?> vertexPropertyPredicate)
The traversal predicate that defines the vertex properties to include in the subgraph.
|
SubgraphStrategy.Builder |
SubgraphStrategy.Builder.vertices(Traversal<Vertex,?> vertexPredicate)
The traversal predicate that defines the vertices to include in the subgraph.
|
| Modifier and Type | Method and Description |
|---|---|
Traversal |
VerificationException.getTraversal() |
| Constructor and Description |
|---|
VerificationException(String message,
Traversal traversal) |
| Modifier and Type | Class and Description |
|---|---|
class |
DefaultTraversal<S,E> |
class |
EmptyTraversal<S,E> |
class |
ScriptTraversal<S,E>
ScriptTraversal encapsulates a
ScriptEngine and a script which is compiled into a Traversal at Admin#applyStrategies(). |
| Modifier and Type | Method and Description |
|---|---|
Traversal<S,E> |
TraversableLambda.getTraversal() |
Copyright © 2013–2020 Apache Software Foundation. All rights reserved.