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[Vertex])(implicit ev: <:<[End, Vertex]): Aux[Edge, Labels]

    Permalink
  6. def addE(label: String)(implicit ev: <:<[End, Vertex]): 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(sideEffectKey: String): 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 cap[A](stepLabel: StepLabel[A]): Aux[A, Labels]

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

    Permalink
  26. 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

  27. 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

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

    Permalink
    Definition Classes
    GremlinScala → AnyRef
  29. 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

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

    Permalink

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

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

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

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

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

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

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

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

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

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

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

    Permalink

    removes elements/properties from the graph

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

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

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

    Permalink
  44. final def eq(arg0: AnyRef): Boolean

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

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

    Permalink
  47. def explain(): TraversalExplanation

    Permalink
  48. 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

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

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

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

    Permalink
  52. def finalize(): Unit

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

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

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

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

    Permalink
  57. 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

  58. 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

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

    Permalink
    Definition Classes
    AnyRef → Any
  60. 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

  61. 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

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

    Permalink

    Organize objects in the stream into a Map.

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

    Permalink
  64. 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
  85. def hasValue(value: String, values: String*): Aux[End, Labels]

    Permalink
  86. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  87. 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

  88. def headOption(): Option[End]

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

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

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

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

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

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

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

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

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

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

    Permalink
  99. final def isInstanceOf[T0]: Boolean

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

    Permalink

    execute pipeline - applies all side effects

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

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

    Permalink

    alias for toList, because typing kills

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

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

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

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

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

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

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

    Permalink
  110. def match[A](traversals: Traversal[End, _]*): Aux[Map[String, A], Labels]

    Permalink
  111. 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

  112. def max[N <: Number](scope: Scope)(implicit toNumber: (End) ⇒ N): Aux[N, HNil]

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

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

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

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

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

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

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

    Permalink
  120. def notExists(): Boolean

    Permalink
  121. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  123. 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

  124. 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().

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

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

    Permalink

    n.b.

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

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

    Permalink

    n.b.

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

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

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

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

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

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

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

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

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

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

    Permalink

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

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

    Permalink

    track every step in the traversal

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

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

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

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

    Permalink
  142. 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

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

    Permalink

    set the property to the given value

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

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

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

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

    Permalink

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

    repeats the provided anonymous traversal which starts at the current End best combined with times or until step e.g. gs.V(1).repeat(_.out).times(2)

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

    Permalink

    sack with by modulator

  149. 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]

  150. 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)

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

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

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

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

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

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

    Permalink
  157. 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)

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

    Permalink
  159. 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

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

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

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

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

    Permalink
    Attributes
    protected
  164. def store(sideEffectKey: String)(implicit ev: <:<[End, Element]): Aux[End, Labels]

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

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

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

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

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

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

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

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

    Permalink
  173. def timeLimit(limit: FiniteDuration): Aux[End, Labels]

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

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

    Permalink
  176. 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

  177. 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

  178. def toBuffer(): Buffer[End]

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

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

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

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

    Permalink
  183. def toString(): String

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

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

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

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

    Permalink
  188. def union[A](unionTraversals: (Aux[End, HNil]) ⇒ GremlinScala[A]*): Aux[A, Labels]

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

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

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

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

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

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

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

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

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

    Permalink
  198. final def wait(): Unit

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

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

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

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

    Permalink

    predicate refers to a step label

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

    Permalink

    predicate refers to a step label

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

    Permalink

    predicate refers to a step label

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

    Permalink

    predicate refers to a step label

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

    Permalink

    used in scala for comprehensions

Deprecated Value Members

  1. 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

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. def by[A <: AnyRef](funProjection: (End) ⇒ A, comparator: Comparator[A] = Order.incr): 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): 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(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

  10. 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

  11. 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(...))

  12. 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(...))

  13. 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(...))

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

    Permalink
    Annotations
    @deprecated
    Deprecated

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

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

    Permalink
    Annotations
    @deprecated
    Deprecated

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

  16. 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(...))

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

    Permalink
    Annotations
    @deprecated
    Deprecated

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

  18. 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(...))

  19. 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(...))

Inherited from AnyRef

Inherited from Any

Ungrouped