Search by property

Jump to navigation Jump to search

This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.

Search by property

A list of all pages that have property "Step text" with value "maps the current edges to the the ingoing Vertices.". Since there have been only a few results, also nearby values are displayed.

Showing below up to 26 results starting with #1.

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


    

List of results

  • Gremlin  + (is used to aggregate all the objects at a particular point of traversal into a Collection)
  • Gremlin  + (maps the current edges to both the ingoing and outgoing Vertices.)
  • Gremlin  + (maps the current edges to the the ingoing Vertices.)
  • Gremlin  + (maps the current elements to both the in and outgoing edges.)
  • Gremlin  + (maps the current elements to the the ingoing edges.)
  • Gremlin  + (maps the current elements to the the outgoing edges.)
  • Gremlin  + (maps the current elements to the vertices at the end of the ingoing edges.)
  • Gremlin  + (maps the current elements to the vertices at the boths ends of the edges.)
  • Gremlin  + (maps the current elements to the vertices at the end of the outgoing edges.)
  • Gremlin  + (maps the traversal to the ids of the current elements.)
  • Gremlin  + (maps the traversal to the labels of the current elements.)
  • Gremlin  + (operates on a stream of comparable objects and determines which is the first object according to its natural order in the stream.)
  • Gremlin  + (operates on a stream of comparable objects and determines which is the last object according to its natural order in the stream.)
  • Gremlin  + (operates on a stream of numbers and determines the average of those numbers.)
  • Gremlin  + (operates on a stream of numbers and sums the numbers together to yield a result)
  • Gremlin  + (orders the traversal elements)
  • Gremlin  + (performs some operation on the traverser and passes it to the next step.)
  • Gremlin  + (randomly filters out traversers with the given probability)
  • 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  + (see https://stackoverflow.com/questions/55609832/is-threre-a-document-about-how-gremlin-match-works)
  • 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  + (transforms the current step in a one to many fashion.)
  • Gremlin  + (will return a TraversalExplanation. A travwill 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.traversal is the resultant execution plan.)
  • Gremlin  + (will return all results in a list)
  • Gremlin  + (will return all results in a set and thus, duplicates removed)
  • Gremlin  + (will return all results in a weighted set and thus, duplicates preserved via weighting)
  • Gremlin  + (will return an Optional and thus, is a composite of hasNext()/next())
  • Gremlin  + (will return the next result.next(n) will return the next n results in a list)