Property:Step text

From BITPlan Wiki
Jump to navigation Jump to search
Property
edit
name  text
label  text
type  Special:Types/Text→Special:Types/Text
index  4
sortPos  
primaryKey  false
mandatory  false
namespace  
size  
uploadable  false
defaultValue  
inputType  
allowedValues  
documentation  the description according to the Apache Tinkerpop documentation
values_from  
externalFormatterURI  
showInGrid  
isLink  false
nullable  
topic  Concept:Step→Concept:Step

Text This is a Property with type Special:Types/Text

Showing 52 pages using this property.
G
transforms the current step element to a new element (which may be empty). see also https://stackoverflow.com/questions/51015636/in-gremlin-how-does-map-really-work  +
is used for looping over a traversal given some break predicate  +
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.  +
will return an Optional and thus, is a composite of hasNext()/next()  +
maps the current edges to both the ingoing and outgoing Vertices.  +
maps the current elements to the the ingoing edges.  +
maps the current elements to the vertices at the end of the outgoing edges.  +
The outV step maps the current edges to the outgoing Vertices.  +
is not an actual step, but instead is a "step-modulator" similar to as() and option(). If a step is able to accept traversals, functions, comparators, etc. then by() is the means by which they are added. The general pattern is step().by()…by(). Some steps can only accept one by() while others can take an arbitrary amount.  +
operates on a stream of numbers and sums the numbers together to yield a result  +
maps the current elements to the vertices at the end of the ingoing edges.  +
ensures that at least one of the provided traversals yield a result.  +
is not an actual step, but is instead a step modulator for [[#repeat Step|repeat()]] (find more documentation on the emit() there).  +
maps the current edges to the the ingoing Vertices.  +
can only be used with remote traversals to Gremlin Server or RGPs. It starts a promise to execute a function on the current Traversal that will be completed in the future.  +
filters the current object based on either the object itself (Scope.local) or the path history of the object (Scope.global) (filter). This step is typically used in conjunction with either [[#match Step]] or [[#select Step|select()-step]], but can be used in isolation.  +
is used to add vertices to the graph  +
Splits the traverser  +
maps the traversal to the labels of the current elements.  +
is used to add properties to the elements of the graph  +
will return all results in a list  +
is not a real step, but a "step modulator" similar to by() and option(). With as(), it is possible to provide a label to the step that can later be accessed by steps and data structures that make use of such labels — e.g., select(), match(), and path  +
filters elements that fullfill the given predicate. Variant: Filters elements that are equal to the given Object.  +
maps the current elements to the vertices at the boths ends of the edges.  +
counts the total number of represented traversers in the streams (i.e. the bulk count).  +
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.  +
is used to add edges to the graph  +
Continues processing based on the given filter condition.  +
operates on a stream of comparable objects and determines which is the last object according to its natural order in the stream.  +
The coalesce()-step evaluates the provided traversals in order and returns the first traversal that emits at least one element.  +
will return all results in a set and thus, duplicates removed  +
An option to a [[#branch Step|branch()]] or [[#choose Step|choose()]]  +
ensures that all provided traversals yield a result  +
maps the current elements to the the outgoing edges.  +
maps the current elements to both the in and outgoing edges.  +
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  +
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.  +
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.  +
orders the traversal elements  +
fill(collection) will put all results in the provided collection and return the collection when complete.  +
operates on a stream of numbers and determines the average of those numbers.  +
performs some operation on the traverser and passes it to the next step.  +
will return all results in a weighted set and thus, duplicates preserved via weighting  +
randomly filters out traversers with the given probability  +
operates on a stream of comparable objects and determines which is the first object according to its natural order in the stream.  +
will return the next result.next(n) will return the next n results in a list  +
filters vertices, edges, and vertex properties based on their properties. This step has quite a few variations.  +
transforms the current step in a one to many fashion.  +
maps the traversal to the ids of the current elements.  +
is used to aggregate all the objects at a particular point of traversal into a Collection  +
see https://stackoverflow.com/questions/55609832/is-threre-a-document-about-how-gremlin-match-works  +
determines whether there are available results  +