Class/Object

gremlin.scala

GremlinScala

Related Docs: object GremlinScala | package scala

Permalink

class GremlinScala[End] extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GremlinScala
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GremlinScala(traversal: GraphTraversal[_, End])

    Permalink

Type Members

  1. abstract type Labels <: HList

    Permalink

    labels applied to this traversal using as step

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def V(vertexIdsOrElements: Any*)(implicit ev: <:<[End, Vertex]): Aux[Vertex, Labels]

    Permalink
  5. def addE(label: StepLabel[Edge], properties: KeyValue[_]*): Aux[Edge, Labels]

    Permalink
  6. def addE(label: String, properties: KeyValue[_]*): Aux[Edge, Labels]

    Permalink

    may be used together with from / to, see TraversalSpec for examples

  7. def addV(label: String): Aux[Vertex, Labels]

    Permalink
  8. def addV(): Aux[Vertex, Labels]

    Permalink
  9. def aggregate(stepLabel: StepLabel[Set[End]]): Aux[End, Labels]

    Permalink
  10. def and(traversals: (Aux[End, HNil]) ⇒ GremlinScala[_]*): Aux[End, Labels]

    Permalink
  11. def as(stepLabel: StepLabel[End])(implicit p: Prepend[Labels, ::[End, HNil]]): Aux[End, Out]

    Permalink

    labels the current step and preserves the type - see select step

  12. def as(name: String, moreNames: String*)(implicit p: Prepend[Labels, ::[End, HNil]]): Aux[End, Out]

    Permalink

    labels the current step and preserves the type - see select step

  13. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  14. def barrier(consumer: Consumer[TraverserSet[AnyRef]]): Aux[End, Labels]

    Permalink
  15. def barrier(consumer: (TraverserSet[End]) ⇒ Unit): Aux[End, Labels]

    Permalink
  16. def barrier(maxBarrierSize: Int): Aux[End, Labels]

    Permalink
  17. def barrier(): Aux[End, Labels]

    Permalink
  18. def both(labels: String*)(implicit ev: <:<[End, Vertex]): Aux[Vertex, Labels]

    Permalink
  19. def both()(implicit ev: <:<[End, Vertex]): Aux[Vertex, Labels]

    Permalink
  20. def bothE(labels: String*)(implicit ev: <:<[End, Vertex]): Aux[Edge, Labels]

    Permalink
  21. def bothE()(implicit ev: <:<[End, Vertex]): Aux[Edge, Labels]

    Permalink
  22. def bothV()(implicit ev: <:<[End, Edge]): Aux[Vertex, Labels]

    Permalink
  23. def branch[BranchOn, NewEnd](on: (GremlinScala[End]) ⇒ GremlinScala[BranchOn], options: BranchOption[End, NewEnd]*): Aux[NewEnd, Labels]

    Permalink

    note that the traverser will go down all traversals in options if the pickToken matches if you need if/then/else semantic, use choose instead

  24. def bytecode: Bytecode

    Permalink
  25. def cap[A](stepLabel: StepLabel[A]): Aux[A, Labels]

    Permalink
  26. def cap(sideEffectKey: String, sideEffectKeys: String*): Aux[End, Labels]

    Permalink
  27. def choose[BranchOn, NewEnd](on: (GremlinScala[End]) ⇒ GremlinScala[BranchOn], options: BranchOption[End, NewEnd]*): Aux[NewEnd, Labels]

    Permalink

    traverser will pick first option that has a matching pickToken

  28. def choose[NewEnd](predicate: (GremlinScala[End]) ⇒ GremlinScala[_], onTrue: (Aux[End, HNil]) ⇒ GremlinScala[NewEnd], onFalse: (Aux[End, HNil]) ⇒ GremlinScala[NewEnd]): Aux[NewEnd, Labels]

    Permalink

    special case of choose step if there's only two options - basically an if/else condition for traversals

    special case of choose step if there's only two options - basically an if/else condition for traversals

    you might think that predicate should be GremlinScala[End] => GremlinScala[Boolean], but that's not how tp3 works: e.g. .value(Age).is(30) returns 30, not true

  29. def clone(): Aux[End, Labels]

    Permalink
    Definition Classes
    GremlinScala → AnyRef
  30. def coalesce[A](coalesceTraversals: (Aux[End, HNil]) ⇒ GremlinScala[A]*): Aux[A, Labels]

    Permalink

    evaluates the provided traversals in order and returns the first traversal that emits at least one element useful e.g.

    evaluates the provided traversals in order and returns the first traversal that emits at least one element useful e.g. for if/elseif/else semantics

  31. def coin(probability: Double): Aux[End, Labels]

    Permalink

    keeps element on a probabilistic base - probability range: 0.0 (keep none) - 1.0 - keep all

  32. def collect[A](pf: PartialFunction[End, A]): Aux[A, Labels]

    Permalink
  33. def constant[A](value: A): Aux[A, Labels]

    Permalink
  34. def count(scope: Scope): Aux[Long, HNil]

    Permalink
  35. def count(): Aux[Long, HNil]

    Permalink
  36. def cyclicPath(): Aux[End, Labels]

    Permalink
  37. def dedup(scope: Scope, dedupLabels: String*): Aux[End, Labels]

    Permalink
  38. def dedup(dedupLabels: String*): Aux[End, Labels]

    Permalink
  39. def dedup(by: By[_]): Aux[End, Labels]

    Permalink
  40. def dedup(): Aux[End, Labels]

    Permalink
  41. def drop(): Aux[End, Labels]

    Permalink

    removes elements/properties from the graph

  42. def elementMap(implicit ev: <:<[End, Element]): Aux[Map[AnyRef, AnyRef], Labels]

    Permalink

    Map the Element to a Map of the property values key'd according to their Property#key.

    Map the Element to a Map of the property values key'd according to their Property#key. This step will retrieve all property values. For vertices, the Map will be returned with the assumption of single property values along with T#id and T#label. Prefer #valueMap(String...) if multi-property processing is required. For edges, keys will include additional related edge structure of Direction#IN and Direction#OUT which themselves are Map instances of the particular Vertex represented by T#id and T#label.

  43. def elementMap(keys: String*)(implicit ev: <:<[End, Element]): Aux[Map[AnyRef, AnyRef], Labels]

    Permalink

    Map the Element to a Map of the property values key'd according to their Property#key.

    Map the Element to a Map of the property values key'd according to their Property#key. For vertices, the Map will be returned with the assumption of single property values along with T#id and T#label. Prefer #valueMap(String...) if multi-property processing is required. For edges, keys will include additional related edge structure of Direction#IN and Direction#OUT which themselves are Map instances of the particular Vertex represented by T#id and T#label.

  44. def emit(emitTraversal: (Aux[End, HNil]) ⇒ GremlinScala[_]): Aux[End, Labels]

    Permalink

    modulator for repeat step - emit if emitTraversal has at least one result

  45. def emit(): Aux[End, Labels]

    Permalink

    modulator for repeat step - emit everything on the way

  46. def emitWithTraverser(predicate: (Traverser[End]) ⇒ Boolean): Aux[End, Labels]

    Permalink

    modulator for repeat step - emit depending on predicate

  47. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  48. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  49. def exists(): Boolean

    Permalink
  50. def explain(): TraversalExplanation

    Permalink
  51. def filter(predicate: (GremlinScala[End]) ⇒ GremlinScala[_]): Aux[End, Labels]

    Permalink

    You might think that predicate should be GremlinScala[End] => GremlinScala[Boolean], but that's not how tp3 works: e.g.

    You might think that predicate should be GremlinScala[End] => GremlinScala[Boolean], but that's not how tp3 works: e.g. .value(Age).is(30) returns 30, not true

  52. def filterNot(predicate: (GremlinScala[End]) ⇒ GremlinScala[_]): Aux[End, Labels]

    Permalink
  53. def filterOnEnd(predicate: (End) ⇒ Boolean): Aux[End, Labels]

    Permalink
  54. def filterWithTraverser(predicate: (Traverser[End]) ⇒ Boolean): Aux[End, Labels]

    Permalink
  55. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  56. def flatMap[A](fun: (End) ⇒ GremlinScala[A]): Aux[A, Labels]

    Permalink
  57. def flatMapWithTraverser[A](fun: (Traverser[End]) ⇒ GremlinScala[A]): Aux[A, Labels]

    Permalink
  58. def fold(): Aux[List[End], HNil]

    Permalink
  59. def foldLeft[Z](z: Z)(op: (Z, End) ⇒ Z): Aux[Z, HNil]

    Permalink
  60. def from(fromTraversal: (GremlinScala[Vertex]) ⇒ GremlinScala[Vertex]): Aux[End, Labels]

    Permalink

    modulator, use in conjunction with simplePath(), cyclicPath(), path(), and addE() TODO: make this a standalone modulator like By that may only be used with the above mentioned steps note: when using with addE, it only selects the first vertex! http://tinkerpop.apache.org/docs/current/reference/#from-step https://groups.google.com/forum/#!topic/gremlin-users/3YgKMKB4iNs

  61. def from(label: StepLabel[Vertex]): Aux[End, Labels]

    Permalink

    modulator, use in conjunction with simplePath(), cyclicPath(), path(), and addE() http://tinkerpop.apache.org/docs/current/reference/#from-step

  62. def from(vertex: Vertex): Aux[End, Labels]

    Permalink

    modulator, use in conjunction with addE http://tinkerpop.apache.org/docs/current/reference/#from-step

  63. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  64. def getSideEffect[A](sideEffectKey: String): A

    Permalink
  65. def group[ModulatedKeys, ModulatedValues](keysBy: By[ModulatedKeys], valuesBy: By[ModulatedValues]): Aux[Map[ModulatedKeys, Collection[ModulatedValues]], Labels]

    Permalink

    Organize objects in the stream into a Map, group keys and values with a modulator

  66. def group[Modulated](keysBy: By[Modulated]): Aux[Map[Modulated, Collection[End]], Labels]

    Permalink

    Organize objects in the stream into a Map, group keys with a modulator

  67. def group[A]()(implicit arg0: DefaultsToAny[A]): Aux[Map[String, A], Labels]

    Permalink

    Organize objects in the stream into a Map.

  68. def groupCount[Modulated](by: By[Modulated]): Aux[Map[Modulated, Long], Labels]

    Permalink
  69. def groupCount(sideEffectKey: String): Aux[End, Labels]

    Permalink

    note that groupCount is a side effect step, other than the 'count' step..

    note that groupCount is a side effect step, other than the 'count' step.. https://groups.google.com/forum/#!topic/gremlin-users/5wXSizpqRxw

  70. def groupCount(): Aux[Map[End, Long], Labels]

    Permalink
  71. def has[A](label: String, key: Key[A], predicate: P[A])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  72. def has[A](label: String, key: Key[A], value: A)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  73. def has[A, B](key: Key[A], propertyTraversal: (Aux[A, HNil]) ⇒ GremlinScala[B])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  74. def has[A](accessor: T, predicate: P[A])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  75. def has(accessor: T, value: Any)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  76. def has[A](key: Key[A], predicate: P[A])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  77. def has[A](p: (Key[A], A))(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  78. def has[A](keyValue: KeyValue[A])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  79. def has[A](key: Key[A], value: A)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  80. def has(key: Key[_])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  81. def hasId(predicate: P[AnyRef])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  82. def hasId(ids: AnyRef*)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  83. def hasKey(key: Key[_], keys: Key[_]*): Aux[End, Labels]

    Permalink
  84. def hasLabel[CC <: Product]()(implicit arg0: scala.reflect.api.JavaUniverse.WeakTypeTag[CC], ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  85. def hasLabel(label: String, labels: String*)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  86. def hasNot[A](key: Key[A], predicate: P[A])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  87. def hasNot[A](key: Key[A], value: A): Aux[End, Labels]

    Permalink
  88. def hasNot[A](keyValue: KeyValue[A]): Aux[End, Labels]

    Permalink
  89. def hasNot(key: Key[_]): Aux[End, Labels]

    Permalink
  90. def hasValue[A](value: A, values: AnyRef*): Aux[End, Labels]

    Permalink
  91. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  92. def head(): End

    Permalink

    unsafe! this will throw a runtime exception if there is no element.

    unsafe! this will throw a runtime exception if there is no element. better use headOption

  93. def headOption(): Option[End]

    Permalink
  94. def id(): Aux[AnyRef, Labels]

    Permalink
  95. def identity(): Aux[End, Labels]

    Permalink
  96. def in(labels: String*)(implicit ev: <:<[End, Vertex]): Aux[Vertex, Labels]

    Permalink
  97. def in()(implicit ev: <:<[End, Vertex]): Aux[Vertex, Labels]

    Permalink
  98. def inE(labels: String*)(implicit ev: <:<[End, Vertex]): Aux[Edge, Labels]

    Permalink
  99. def inE()(implicit ev: <:<[End, Vertex]): Aux[Edge, Labels]

    Permalink
  100. def inV()(implicit ev: <:<[End, Edge]): Aux[Vertex, Labels]

    Permalink
  101. def inject(injections: End*): Aux[End, Labels]

    Permalink
  102. def is(predicate: P[End]): Aux[End, Labels]

    Permalink
  103. def is(value: AnyRef): Aux[End, Labels]

    Permalink
  104. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  105. def iterate(): Aux[End, Labels]

    Permalink

    execute pipeline - applies all side effects

  106. def key()(implicit ev: <:<[End, Element]): Aux[String, Labels]

    Permalink
  107. def l(): List[End]

    Permalink

    alias for toList, because typing kills

  108. def label(): Aux[String, Labels]

    Permalink
  109. def limit(scope: Scope, max: Long): Aux[End, Labels]

    Permalink
  110. def limit(max: Long): Aux[End, Labels]

    Permalink
  111. def local[A](localTraversal: (Aux[End, HNil]) ⇒ GremlinScala[A])(implicit ev: <:<[End, Element]): Aux[A, Labels]

    Permalink
  112. def loops(): Aux[Integer, HNil]

    Permalink
  113. def map[A](fun: (End) ⇒ A): Aux[A, Labels]

    Permalink
  114. def mapWithTraverser[A](fun: (Traverser[End]) ⇒ A): Aux[A, Labels]

    Permalink
  115. def match[A](traversals: (Aux[End, HNil]) ⇒ GremlinScala[_]*): Aux[Map[String, A], Labels]

    Permalink
  116. def math(expression: String, bys: By[_]*): Aux[Double, Labels]

    Permalink

    generic maths based on strings, see http://tinkerpop.apache.org/docs/3.3.1/reference/#math-step

  117. def max[C <: Comparable[_]](scope: Scope)(implicit toComparable: (End) ⇒ C): Aux[C, HNil]

    Permalink
  118. def max[C <: Comparable[_]]()(implicit toComparable: (End) ⇒ C): Aux[C, HNil]

    Permalink
  119. def mean[N <: Number](scope: Scope)(implicit toNumber: (End) ⇒ N): Aux[Double, HNil]

    Permalink
  120. def mean[N <: Number]()(implicit toNumber: (End) ⇒ N): Aux[Double, HNil]

    Permalink
  121. def min[C <: Comparable[_]](scope: Scope)(implicit toComparable: (End) ⇒ C): Aux[C, HNil]

    Permalink
  122. def min[C <: Comparable[_]]()(implicit toComparable: (End) ⇒ C): Aux[C, HNil]

    Permalink
  123. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  124. def not(notTraversal: (Aux[End, HNil]) ⇒ GremlinScala[_]): Aux[End, Labels]

    Permalink
  125. def notExists(): Boolean

    Permalink
  126. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  127. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  128. def optional[A](optionalTraversal: (Aux[End, HNil]) ⇒ GremlinScala[A], default: A): GremlinScala[A] { type Labels = GremlinScala.this.Labels }

    Permalink

    returns the result of the specified traversal if it yields a result else it returns the provided default value

    returns the result of the specified traversal if it yields a result else it returns the provided default value

    note: uses coalesce internally, which is a flatMap step, which affects as and traverser behaviour

  129. def optional(optionalTraversal: (Aux[End, HNil]) ⇒ GremlinScala[End]): Aux[End, Labels]

    Permalink

    returns the result of the specified traversal if it yields a result else it returns the calling element, i.e.

    returns the result of the specified traversal if it yields a result else it returns the calling element, i.e. the identity().

  130. def or(traversals: (Aux[End, HNil]) ⇒ GremlinScala[_]*): Aux[End, Labels]

    Permalink
  131. def order(scope: Scope, orderBys: OrderBy[_]*): Aux[End, Labels]

    Permalink

    n.b.

    n.b. By can be used in place of OrderBy

  132. def order(orderBys: OrderBy[_]*): Aux[End, Labels]

    Permalink

    n.b.

    n.b. By can be used in place of OrderBy

  133. def order(scope: Scope): Aux[End, Labels]

    Permalink
  134. def order(): Aux[End, Labels]

    Permalink
  135. def otherV()(implicit ev: <:<[End, Edge]): Aux[Vertex, Labels]

    Permalink
  136. def out(labels: String*)(implicit ev: <:<[End, Vertex]): Aux[Vertex, Labels]

    Permalink
  137. def out()(implicit ev: <:<[End, Vertex]): Aux[Vertex, Labels]

    Permalink
  138. def outE(labels: String*)(implicit ev: <:<[End, Vertex]): Aux[Edge, Labels]

    Permalink
  139. def outE()(implicit ev: <:<[End, Vertex]): Aux[Edge, Labels]

    Permalink
  140. def outV()(implicit ev: <:<[End, Edge]): Aux[Vertex, Labels]

    Permalink
  141. def path(bys: By[_]*): Aux[Path, Labels]

    Permalink

    track every step in the traversal, modulate elements in round robin fashion

  142. def path(): Aux[Path, Labels]

    Permalink

    track every step in the traversal

  143. def profile(sideEffectKey: String): Aux[End, Labels]

    Permalink
  144. def project[H <: Product](builder: (ProjectionBuilder[Nil.type]) ⇒ ProjectionBuilder[H]): GremlinScala[H]

    Permalink
  145. def project[A](projectKey: String, otherProjectKeys: String*): Aux[Map[String, A], Labels]

    Permalink
  146. def promise(): Future[List[End]]

    Permalink

    convenience step for majority use case for promise

  147. def promise[NewEnd](onComplete: (Aux[End, Labels]) ⇒ NewEnd): Future[NewEnd]

    Permalink

    run pipeline asynchronously note: only supported by RemoteGraphs (see withRemote)

  148. def properties(keys: String*)(implicit ev: <:<[End, Element]): Aux[Property[Any], Labels]

    Permalink
  149. def property[A](key: Key[A])(value: (GremlinScala[End]) ⇒ GremlinScala[A])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink

    set the property to the value determined by the given traversal

  150. def property[A](key: Key[A], value: A)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink

    set the property to the given value

  151. def property[A](keyValue: KeyValue[A])(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink

    set the property to the given value

  152. def propertyMap(keys: String*)(implicit ev: <:<[End, Element]): Aux[Map[String, Any], Labels]

    Permalink
  153. def range(scope: Scope, low: Long, high: Long): Aux[End, Labels]

    Permalink
  154. def range(low: Long, high: Long): Aux[End, Labels]

    Permalink
  155. def repeat[NewEnd >: End](repeatTraversal: (Aux[End, HNil]) ⇒ GremlinScala[NewEnd]): Aux[NewEnd, Labels]

    Permalink

    repeats the provided anonymous traversal which starts at the current End combine with times or until step, e.g.

    repeats the provided anonymous traversal which starts at the current End combine with times or until step, e.g. gs.V(1).repeat(_.out).times(2) Note: has to end on the same type (or a supertype of) the current End, otherwise we couldn't reapply it multiple times.

  156. def sack[SackType, Modulated](func: (SackType, Modulated) ⇒ SackType, by: By[Modulated]): Aux[End, Labels]

    Permalink

    sack with by modulator

  157. def sack[SackType](func: (SackType, End) ⇒ SackType): Aux[End, Labels]

    Permalink

    Modify the sack with the current End type.

    Modify the sack with the current End type. [SideEffect]

  158. def sack[SackType](): Aux[SackType, Labels]

    Permalink

    Take value out of the sack.

    Take value out of the sack. TODO: carry SackType as class type parameter (both ScalaGraph and GremlinScala)

  159. def sample(scope: Scope, amount: Int): Aux[End, Labels]

    Permalink
  160. def sample(amount: Int): Aux[End, Labels]

    Permalink
  161. def select(pop: Pop, selectKey1: String, selectKey2: String, otherSelectKeys: String*): Aux[Map[String, Any], Labels]

    Permalink
  162. def select(selectKey1: String, selectKey2: String, otherSelectKeys: String*): Aux[Map[String, Any], Labels]

    Permalink
  163. def select[A](pop: Pop, selectKey: String)(implicit arg0: DefaultsToAny[A]): Aux[A, Labels]

    Permalink
  164. def select[A](selectKey: String)(implicit arg0: DefaultsToAny[A]): Aux[A, Labels]

    Permalink
  165. def select[StepLabelsAsTuple <: Product, StepLabels <: HList, H0, T0 <: HList, LabelNames <: HList, TupleWithValue, Values <: HList, Z, ValueTuples](stepLabelsTuple: StepLabelsAsTuple)(implicit toHList: Aux[StepLabelsAsTuple, StepLabels], hasOne: Aux[StepLabels, H0, T0], hasTwo: IsHCons[T0], stepLabelToString: Aux[GetLabelName.type, StepLabels, LabelNames], trav: Aux[LabelNames, List, String], folder: Aux[StepLabels, (HNil, Map[String, Any]), combineLabelWithValue.type, (Values, Z)], tupler: shapeless.ops.hlist.Tupler.Aux[Values, ValueTuples]): Aux[ValueTuples, Labels]

    Permalink

    Select values from the traversal based on some given StepLabels (must be a tuple of StepLabel)

    Select values from the traversal based on some given StepLabels (must be a tuple of StepLabel)

    Lot's of type level magic here to make this work... * takes a tuple (with least two elements) whose elements are all StepLabel[_] * converts it to an HList * get's the actual values from the Tinkerpop3 java select as a Map[String, Any] * uses the types from the StepLabels to get the values from the Map (using a type level fold)

  166. def select[A](stepLabel: StepLabel[A]): Aux[A, Labels]

    Permalink
  167. def select[LabelsTuple]()(implicit tupler: shapeless.ops.hlist.Tupler.Aux[Labels, LabelsTuple]): Aux[LabelsTuple, Labels]

    Permalink

    select all labelled steps - see as step and SelectSpec

  168. def selectKeys[K](implicit columnType: Aux[End, K, _]): GremlinScala[K]

    Permalink
  169. def selectValues[V](implicit columnType: Aux[End, _, V]): GremlinScala[V]

    Permalink
  170. def sideEffect(fun: (End) ⇒ Any): Aux[End, Labels]

    Permalink
  171. def sideEffectWithTraverser(fun: (Traverser[End]) ⇒ Any): Aux[End, Labels]

    Permalink
  172. def simplePath(): Aux[End, Labels]

    Permalink
  173. def start[A]: Aux[A, HNil]

    Permalink
    Attributes
    protected
  174. def store(stepLabel: StepLabel[Set[End]]): Aux[End, Labels]

    Permalink
  175. def subgraph(stepLabel: StepLabel[Graph])(implicit ev: <:<[End, Edge]): Aux[Edge, Labels]

    Permalink
  176. def sum[N <: Number](scope: Scope)(implicit toNumber: (End) ⇒ N): Aux[N, HNil]

    Permalink
  177. def sum[N <: Number]()(implicit toNumber: (End) ⇒ N): Aux[N, HNil]

    Permalink
  178. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  179. def tail(scope: Scope, limit: Long): Aux[End, Labels]

    Permalink
  180. def tail(limit: Long): Aux[End, Labels]

    Permalink
  181. def tail(): Aux[End, Labels]

    Permalink
  182. def timeLimit(millis: Long)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
  183. def timeLimit(maxTime: FiniteDuration): Aux[End, Labels]

    Permalink
  184. def times(maxLoops: Int): Aux[End, Labels]

    Permalink
  185. def to(direction: Direction, edgeLabels: String*): Aux[Vertex, Labels]

    Permalink
  186. def to(toTraversal: (GremlinScala[Vertex]) ⇒ GremlinScala[Vertex]): Aux[End, Labels]

    Permalink

    modulator, use in conjunction with simplePath(), cyclicPath(), path(), and addE() TODO: make this a standalone modulator like By that may only be used with the above mentioned steps note: when using with addE, it only selects the first vertex! http://tinkerpop.apache.org/docs/current/reference/#from-step https://groups.google.com/forum/#!topic/gremlin-users/3YgKMKB4iNs

  187. def to(label: StepLabel[Vertex]): Aux[End, Labels]

    Permalink

    modulator, use in conjunction with simplePath(), cyclicPath(), path(), and addE() http://tinkerpop.apache.org/docs/current/reference/#from-step

  188. def to(vertex: Vertex): Aux[End, Labels]

    Permalink

    modulator, use in conjunction with addE http://tinkerpop.apache.org/docs/current/reference/#to-step

  189. def toBuffer(): Buffer[End]

    Permalink
  190. def toIterator(): Iterator[End]

    Permalink
  191. def toJIterator(): Iterator[End]

    Permalink
  192. def toList(): List[End]

    Permalink
  193. def toMap[A, B](implicit ev: <:<[End, (A, B)]): Map[A, B]

    Permalink
  194. def toSet(): Set[End]

    Permalink
  195. def toStream(): Stream[End]

    Permalink
  196. def toString(): String

    Permalink
    Definition Classes
    GremlinScala → AnyRef → Any
  197. val traversal: GraphTraversal[_, End]

    Permalink
  198. def tree(sideEffectKey: String): Aux[End, Labels]

    Permalink
  199. def tree(): GremlinScala[Tree[_]] { type Labels = GremlinScala.this.Labels }

    Permalink
  200. def unfold[A](): Aux[A, Labels]

    Permalink
  201. def union[EndsHList <: HList, EndsTuple](unionTraversals: (UnionTraversals[End, HNil]) ⇒ UnionTraversals[End, EndsHList])(implicit tupler: shapeless.ops.hlist.Tupler.Aux[EndsHList, EndsTuple]): Aux[EndsTuple, Labels]

    Permalink

    merges of the results of an arbitrary number of traversals.

    merges of the results of an arbitrary number of traversals. supports heterogeneous queries, e.g. for the following query: g.V(1).union(_.join(_.outE).join(_.out)) the result type is derived as GremlinScala[(JList[Edge], JList[Vertex])]

  202. def unionFlat[A](unionTraversals: (Aux[End, HNil]) ⇒ GremlinScala[A]*): Aux[A, Labels]

    Permalink

    merges of the results of an arbitrary number of traversals into a flat structure (i.e.

    merges of the results of an arbitrary number of traversals into a flat structure (i.e. no folds).

  203. def until(untilTraversal: (Aux[End, HNil]) ⇒ GremlinScala[_]): Aux[End, Labels]

    Permalink
  204. def untilWithTraverser(predicate: (Traverser[End]) ⇒ Boolean): Aux[End, Labels]

    Permalink
  205. def value[A](key: String)(implicit ev: <:<[End, Element]): Aux[A, Labels]

    Permalink
  206. def value[A](key: Key[A])(implicit ev: <:<[End, Element]): Aux[A, Labels]

    Permalink
  207. def valueMap(keys: String*)(implicit ev: <:<[End, Element]): Aux[Map[AnyRef, AnyRef], Labels]

    Permalink
  208. def valueMap(implicit ev: <:<[End, Element]): Aux[Map[AnyRef, AnyRef], Labels]

    Permalink
  209. def valueOption[A](key: String)(implicit ev: <:<[End, Element]): Aux[Option[A], Labels]

    Permalink
  210. def valueOption[A](key: Key[A])(implicit ev: <:<[End, Element]): Aux[Option[A], Labels]

    Permalink
  211. def values[A](key: String*)(implicit ev: <:<[End, Element]): Aux[A, Labels]

    Permalink
  212. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  213. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  214. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  215. def where(whereTraversal: (Aux[End, HNil]) ⇒ GremlinScala[_]): Aux[End, Labels]

    Permalink
  216. def where(startKey: String, predicate: P[String], by: By[_]): Aux[End, Labels]

    Permalink

    predicate refers to a step label

  217. def where(startKey: String, predicate: P[String]): Aux[End, Labels]

    Permalink

    predicate refers to a step label

  218. def where(predicate: P[String], by: By[_]): Aux[End, Labels]

    Permalink

    predicate refers to a step label

  219. def where(predicate: P[String]): Aux[End, Labels]

    Permalink

    predicate refers to a step label

  220. def withFilter(predicate: (GremlinScala[End]) ⇒ GremlinScala[_]): Aux[End, Labels]

    Permalink

    used in scala for comprehensions

Deprecated Value Members

  1. def aggregate(sideEffectKey: String): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.3.3.16) use aggregate(StepLabel) for more type safety

  2. def by[A](byTraversal: Traversal[_, A], comparator: Comparator[A]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  3. def by(byTraversal: Traversal[_, _]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  4. def by(lessThan: (End, End) ⇒ Boolean): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  5. def by[A](elementPropertyKey: String, comparator: Comparator[A]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  6. def by(elementPropertyKey: String): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  7. def by(tokenProjection: T): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  8. def by[A <: AnyRef](funProjection: (End) ⇒ A, comparator: Comparator[A] = Order.asc): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  9. def by[A <: AnyRef](funProjection: (End) ⇒ A): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  10. def by(comparator: Comparator[End]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  11. def by(): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) don't use step by itself, most steps now accept a By instance as an argument

  12. def group[A <: AnyRef](byTraversal: (End) ⇒ A): Aux[Map[A, BulkSet[End]], Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use group(by(...))

  13. def groupBy[A <: AnyRef, B](byFun: (End) ⇒ A, valueFun: (End) ⇒ B): Aux[Map[A, Iterable[B]], Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use group(by(...))

  14. def groupBy[A <: AnyRef](byFun: (End) ⇒ A): Aux[Map[A, Collection[End]], Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use group(by(...))

  15. def order(scope: Scope, comparator: Order = Order.asc): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use order(by(...))

  16. def order(comparator: Order): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use order(by(Order))

  17. def orderBy(elementPropertyKey: String, comparator: Order)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use order(by(...))

  18. def orderBy(elementPropertyKey: String)(implicit ev: <:<[End, Element]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use order(by(...))

  19. def orderBy[A <: AnyRef](by: (End) ⇒ A, comparator: Comparator[A]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use order(by(...))

  20. def orderBy[A <: AnyRef](by: (End) ⇒ A)(implicit arg0: Ordering[A]): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.0.0.1) use order(by(...))

  21. def store(sideEffectKey: String): Aux[End, Labels]

    Permalink
    Annotations
    @deprecated
    Deprecated

    (Since version 3.3.3.16) use store(StepLabel) for more type safety

Inherited from AnyRef

Inherited from Any

Ungrouped