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
scope  
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→Step

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

Showing 20 pages using this property.
G
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.  +