Semantic search
Jump to navigation
Jump to search
Step | name | kind | reference | javadoc | text | test | level |
---|---|---|---|---|---|---|---|
Gremlin | cap | barrier | cap-step | cap-java.lang.String-java.lang.String...- | Iterates the traversal up to the itself and emits the side-effect referenced by the key. If multiple keys are supplied then the side-effects are emitted as a Map. | 3 | |
Gremlin | choose | branch | choose-step | choose-java.util.function.Function-,choose-java.util.function.Predicate-org.apache.tinkerpop.gremlin.process.traversal.Traversal- | routes the current traverser to a particular traversal branch option. With choose(), it is possible to implement if/then/else-semantics as well as more complicated selections. | 2 | |
Gremlin | coalesce | flatMap | coalesce-step | The coalesce()-step evaluates the provided traversals in order and returns the first traversal that emits at least one element. | 2 | ||
Gremlin | coin | filter | coin-step | coin-double- | randomly filters out traversers with the given probability | 2 | |
Gremlin | count | reducing barrier | count-step | count-- | counts the total number of represented traversers in the streams (i.e. the bulk count). | 3 | |
Gremlin | emit | modulator | emit-step | emit-- | is not an actual step, but is instead a step modulator for repeat() (find more documentation on the emit() there). | 2 | |
Gremlin | explain | terminal | terminal-steps | will return a TraversalExplanation. A traversal explanation details how the traversal (prior to explain()) will be compiled given the registered traversal strategies. A TraversalExplanation has a toString() representation with 3-columns. The first column is the traversal strategy being applied. The second column is the traversal strategy category: [D]ecoration, [O]ptimization, [P]rovider optimization, [F]inalization, and [V]erification. Finally, the third column is the state of the traversal post strategy application. The final traversal is the resultant execution plan. | 2 | ||
Gremlin | fill | terminal | terminal-steps | fill(collection) will put all results in the provided collection and return the collection when complete. | 2 | ||
Gremlin | filter | general | general-steps | Continues processing based on the given filter condition. | 2 | ||
Gremlin | flatMap | general | general-steps | transforms the current step in a one to many fashion. | 2 | ||
Gremlin | fold | reducing barrier | fold-step | There are situations when the traversal stream needs a "barrier" to aggregate all the objects and emit a computation that is a function of the aggregate. The fold()-step (map) is one particular instance of this. Please see unfold()-step for the inverse functionality. | 3 | ||
Gremlin | has | filter | has-step | has-java.lang.String- | filters vertices, edges, and vertex properties based on their properties. This step has quite a few variations. | 2 | |
Gremlin | hasNext | terminal | terminal-steps | determines whether there are available results | 2 | ||
Gremlin | id | map | id-step | maps the traversal to the ids of the current elements. | 2 | ||
Gremlin | in | flatMap | maps the current elements to the vertices at the end of the ingoing edges. | 2 | |||
Gremlin | inE | flatMap | maps the current elements to the the ingoing edges. | 2 | |||
Gremlin | inV | flatMap | maps the current edges to the the ingoing Vertices. | 2 | |||
Gremlin | is | filter | is-step | is-org.apache.tinkerpop.gremlin.process.traversal.P- | filters elements that fullfill the given predicate. Variant: Filters elements that are equal to the given Object. | 2 | |
Gremlin | iterate | terminal | terminal-steps | Iterates the traversal presumably for the generation of side-effects. See https://stackoverflow.com/questions/47403296/iterate-step-is-used-in-the-end-of-the-command-when-creating-nodes-and-edges-t | 2 | ||
Gremlin | label | map | label-step | maps the traversal to the labels of the current elements. | 2 |