public final class EmptyGraphTraversal<S,E> extends EmptyTraversal<S,E> implements GraphTraversal.Admin<S,E>, GraphTraversal<S,E>
Traversal.Admin<S,E>, Traversal.ExceptionsGraphTraversal.Admin<S,E>| Modifier and Type | Method and Description |
|---|---|
<E2> GraphTraversal<S,E2> |
addStep(Step<?,E2> step)
Add a
Step to the end of the traversal. |
GraphTraversal.Admin<S,E> |
asAdmin()
Get access to administrative methods of the traversal via its accompanying
Traversal.Admin. |
static <A,B> EmptyGraphTraversal<A,B> |
instance() |
GraphTraversal<S,E> |
submit(GraphComputer computer)
Submit the traversal to a
GraphComputer for OLAP execution. |
GraphTraversal<S,E> |
withPath() |
addStart, addStarts, addStep, applyStrategies, clone, equals, getSideEffects, getSteps, getStrategies, getTraversalEngine, getTraversalHolder, getTraverserGenerator, hashCode, hasNext, next, removeStep, setSideEffects, setStrategies, setTraversalHolderfinalize, getClass, notify, notifyAll, toString, wait, wait, waitaddStart, addStarts, addStep, applyStrategies, getSideEffects, getSteps, getStrategies, getTraversalEngine, getTraversalHolder, getTraverserGenerator, removeStep, removeStep, reset, reverse, setSideEffects, setStrategies, setTraversalHolderclone, fill, forEachRemaining, iterate, next, toBulkSet, toList, toSet, tryNextaddBothE, addE, addInE, addOutE, aggregate, aggregate, as, back, between, both, bothE, bothV, branch, by, by, by, by, by, by, by, by, cap, cap, choose, choose, coin, count, cyclicPath, dedup, emit, emit, emit, except, except, except, filter, flatMap, fold, fold, group, group, groupCount, groupCount, has, has, has, has, has, has, has, hasNot, id, identity, in, inE, inject, inV, key, label, limit, local, map, match, order, otherV, out, outE, outV, path, profile, properties, propertyMap, range, remove, repeat, retain, retain, retain, sack, sack, sack, sample, select, select, shuffle, sideEffect, simplePath, store, store, subgraph, subgraph, subgraph, subgraph, sum, timeLimit, times, to, toE, toV, tree, tree, unfold, union, until, until, value, valueMap, valueMap, values, where, where, where, withSack, withSack, withSideEffectpublic static <A,B> EmptyGraphTraversal<A,B> instance()
public GraphTraversal.Admin<S,E> asAdmin()
TraversalTraversal.Admin.public <E2> GraphTraversal<S,E2> addStep(Step<?,E2> step)
Traversal.AdminStep to the end of the traversal. This method should automatically re-link the step accordingly (see TraversalHelper.reLinkSteps(com.tinkerpop.gremlin.process.Traversal.Admin<?, ?>)).
If the TraversalStrategies have already been applied, then an IllegalStateException is throw stating the traversal is locked.addStep in interface GraphTraversal.Admin<S,E>addStep in interface Traversal.Admin<S,E>addStep in class EmptyTraversal<S,E>E2 - the output of the stepstep - the step to addpublic GraphTraversal<S,E> withPath()
withPath in interface GraphTraversal<S,E>public GraphTraversal<S,E> submit(GraphComputer computer)
TraversalGraphComputer for OLAP execution.
This method should apply the traversal strategies for TraversalEngine.COMPUTER.
Then register and execute the traversal via TraversalVertexProgram.
Then wrap the ComputerResult in a new Traversal containing a ComputerResultStep.submit in interface GraphTraversal<S,E>submit in interface Traversal<S,E>submit in class EmptyTraversal<S,E>computer - the GraphComputer to execute the traversal onCopyright © 2013-2015 TinkerPop. All Rights Reserved.