52
U

Property:Step text

From BITPlan Wiki
Jump to: navigation, search
Property
edit
name  text
label  text
type  Special:Types/Text
index  4
sortPos  
primary key  false
mandatory  false
namespace  
size  
uploadable  false
default  
inputType  
allowedValues  
documentation  the description according to the Apache Tinkerpop documentation
values from  
showInGrid  
isLink  false
allow nulls?  
topic  Concept:Step
Text

This is a Property with type Special:Types/Text

Pages using the property "Step text"

Showing 25 pages using this property.

View (previous 25 | next 25) (20 | 50 | 100 | 250 | 500)

G
Gremlin +is used to add properties to the elements of the graph  +
Gremlin +operates on a stream of comparable objects and determines which is the first object according to its natural order in the stream.  +
Gremlin +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.  +
Gremlin +filters vertices, edges, and vertex properties based on their properties. This step has quite a few variations.  +
Gremlin +will return all results in a set and thus, duplicates removed  +
Gremlin +maps the current elements to the the outgoing edges.  +
Gremlin +determines whether there are available results  +
Gremlin +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.  +
Gremlin +is used to add vertices to the graph  +
Gremlin +Splits the traverser  +
Gremlin +operates on a stream of comparable objects and determines which is the last object according to its natural order in the stream.  +
Gremlin +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  +
Gremlin +will return all results in a weighted set and thus, duplicates preserved via weighting  +
Gremlin +maps the current elements to the vertices at the end of the ingoing edges.  +
Gremlin +ensures that all provided traversals yield a result  +
Gremlin +see https://stackoverflow.com/questions/55609832/is-threre-a-document-about-how-gremlin-match-works  +
Gremlin +is used to aggregate all the objects at a particular point of traversal into a Collection  +
Gremlin +The coalesce()-step evaluates the provided traversals in order and returns the first traversal that emits at least one element.  +
Gremlin +operates on a stream of numbers and determines the average of those numbers.  +
Gremlin +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.  +
Gremlin +will return an Optional and thus, is a composite of hasNext()/next()  +
Gremlin +maps the current elements to the vertices at the boths ends of the edges.  +
Gremlin +ensures that at least one of the provided traversals yield a result.  +
Gremlin +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  +
Gremlin +maps the current edges to both the ingoing and outgoing Vertices.  +