public final class EmptyGraphTraversal<S,E> extends EmptyTraversal<S,E> implements GraphTraversal.Admin<S,E>, GraphTraversal<S,E>
GraphTraversal.Admin<S,E>Traversal.Exceptions| Modifier and Type | Method and Description |
|---|---|
<E2> GraphTraversal.Admin<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. |
EmptyGraphTraversal<S,E> |
clone()
Cloning is used to duplicate the traversal typically in OLAP environments.
|
static <A,B> EmptyGraphTraversal<A,B> |
instance() |
GraphTraversal<S,E> |
iterate()
Iterate all the
Traverser instances in the traversal. |
addStart, addStarts, addStep, applyStrategies, equals, getGraph, getParent, getSideEffects, getSteps, getStrategies, getTraverserGenerator, getTraverserRequirements, hashCode, hasNext, isLocked, next, removeStep, setGraph, setParent, setSideEffects, setStrategiesfinalize, getClass, notify, notifyAll, toString, wait, wait, waitaddStart, addStarts, addStep, applyStrategies, equals, getEndStep, getGraph, getParent, getSideEffects, getStartStep, getSteps, getStrategies, getTraverserGenerator, getTraverserRequirements, isLocked, removeStep, removeStep, reset, setGraph, setParent, setSideEffects, setStrategiesaddE, addE, addInE, addOutE, addV, addV, addV, aggregate, and, as, barrier, barrier, barrier, both, bothE, bothV, branch, branch, by, by, by, by, by, by, by, by, by, by, cap, choose, choose, choose, choose, coalesce, coin, constant, count, count, cyclicPath, dedup, dedup, drop, emit, emit, emit, filter, filter, flatMap, flatMap, fold, fold, from, from, group, group, groupCount, groupCount, groupV3d0, groupV3d0, has, has, has, has, has, has, has, has, has, hasId, hasKey, hasLabel, hasNot, hasValue, id, identity, in, inE, inject, inV, is, is, key, label, limit, limit, local, loops, map, map, mapKeys, mapValues, match, max, max, mean, mean, min, min, not, option, option, optional, or, order, order, otherV, out, outE, outV, pageRank, pageRank, path, peerPressure, profile, program, project, properties, property, property, propertyMap, range, range, repeat, sack, sack, sack, sample, sample, select, select, select, select, select, sideEffect, sideEffect, simplePath, store, subgraph, sum, sum, tail, tail, tail, tail, timeLimit, times, to, to, to, toE, toV, tree, tree, unfold, union, until, until, V, value, valueMap, valueMap, values, where, where, wherepublic static <A,B> EmptyGraphTraversal<A,B> instance()
public GraphTraversal.Admin<S,E> asAdmin()
TraversalTraversal.Admin.public <E2> GraphTraversal.Admin<S,E2> addStep(Step<?,E2> step)
Traversal.AdminStep to the end of the traversal. This method should link the step to its next and previous step accordingly.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> 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.public EmptyGraphTraversal<S,E> clone()
Traversal.Adminclone in interface GraphTraversal.Admin<S,E>clone in interface Traversal.Admin<S,E>clone in class EmptyTraversal<S,E>Copyright © 2013–2016 Apache Software Foundation. All rights reserved.