GremlinScala

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def addE(label: StepLabel[Vertex])(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

   

5. def addE(label: String)(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

   

6. def addV(label: String): GremlinScala[Vertex, Labels]

   

7. def addV(): GremlinScala[Vertex, Labels]

   

8. def aggregate(sideEffectKey: String): GremlinScala[End, Labels]

   

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

   

10. def as(stepLabel: StepLabel[End])(implicit p: Prepend[Labels, ::[End, HNil]]): GremlinScala[End, Out]

    

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

    

12. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

13. def barrier(consumer: Consumer[TraverserSet[AnyRef]]): GremlinScala[End, Labels]

    

14. def barrier(consumer: (TraverserSet[End]) ⇒ Unit): GremlinScala[End, Labels]

    

15. def barrier(maxBarrierSize: Int): GremlinScala[End, Labels]

    

16. def barrier(): GremlinScala[End, Labels]

    

17. def both(labels: String*)(implicit ev: <:<[End, Vertex]): GremlinScala[Vertex, Labels]

    

18. def both()(implicit ev: <:<[End, Vertex]): GremlinScala[Vertex, Labels]

    

19. def bothE(labels: String*)(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

    

20. def bothE()(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

    

21. def bothV()(implicit ev: <:<[End, Edge]): GremlinScala[Vertex, Labels]

    

22. def branch[BranchOn, NewEnd](on: (GremlinScala[End, _]) ⇒ GremlinScala[BranchOn, _], options: BranchOption[End, NewEnd]*): GremlinScala[NewEnd, Labels]

    

    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

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

    

24. def by(byTraversal: Traversal[_, _]): GremlinScala[End, Labels]

    

25. def by(lessThan: (End, End) ⇒ Boolean): GremlinScala[End, Labels]

    

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

    

27. def by(elementPropertyKey: String): GremlinScala[End, Labels]

    

28. def by(tokenProjection: T): GremlinScala[End, Labels]

    

29. def by[A <: AnyRef](funProjection: (End) ⇒ A, comparator: Comparator[A] = Order.incr)(implicit ev: <:<[End, Element]): GremlinScala[End, Labels]

    

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

    

31. def by(comparator: Comparator[End]): GremlinScala[End, Labels]

    

32. def by(): GremlinScala[End, Labels]

    

33. def cap[A](stepLabel: StepLabel[A]): GremlinScala[A, Labels]

    

34. def cap(sideEffectKey: String, sideEffectKeys: String*): GremlinScala[End, Labels]

    

35. def choose[BranchOn, NewEnd](on: (GremlinScala[End, _]) ⇒ GremlinScala[BranchOn, _], options: BranchOption[End, NewEnd]*): GremlinScala[NewEnd, Labels]

    

    traverser will pick first option that has a matching pickToken *

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

    

    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

37. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. def coalesce[A](coalesceTraversals: (GremlinScala[End, HNil]) ⇒ GremlinScala[A, _]*): GremlinScala[A, Labels]

    

39. def coin(probability: Double): GremlinScala[End, Labels]

    

40. def collect[A](pf: PartialFunction[End, A]): GremlinScala[A, Labels]

    

41. def constant[A](value: A): GremlinScala[A, Labels]

    

42. def count(scope: Scope): GremlinScala[Long, HNil]

    

43. def count(): GremlinScala[Long, HNil]

    

44. def cyclicPath(): GremlinScala[End, Labels]

    

45. def dedup(scope: Scope, dedupLabels: String*): GremlinScala[End, Labels]

    

46. def dedup(dedupLabels: String*): GremlinScala[End, Labels]

    

47. def drop(): GremlinScala[End, Labels]

    

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

    

49. def emit(): GremlinScala[End, Labels]

    

50. def emitWithTraverser(predicate: (Traverser[End]) ⇒ Boolean): GremlinScala[End, Labels]

    

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

    

    Definition Classes

    AnyRef

52. def exists(): Boolean

    

53. def explain(): TraversalExplanation

    

54. def filter(predicate: (GremlinScala[End, _]) ⇒ GremlinScala[_, _]): GremlinScala[End, Labels]

    

    Existing users please note: since 3.2.4.8 the filter step changed it's signature and now takes a traversal: filter(predicate: GremlinScala[End, _] ⇒ GremlinScala[_, _]).

    Existing users please note: since 3.2.4.8 the filter step changed it's signature and now takes a traversal: filter(predicate: GremlinScala[End, _] ⇒ GremlinScala[_, _]). The old filter(predicate: End ⇒ Boolean) is now called filterOnEnd, in case you still need it. This change might affect your for comprehensions. The reasoning for the change is that it's discouraged to use lambdas (see http://tinkerpop.apache.org/docs/current/reference/#a-note-on-lambdas). Instead we are now creating anonymous traversals, which can be optimised by the driver, sent over the wire as gremlin binary for remote execution etc.

    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

55. def filterOnEnd(predicate: (End) ⇒ Boolean): GremlinScala[End, Labels]

    

56. def filterWithTraverser(predicate: (Traverser[End]) ⇒ Boolean): GremlinScala[End, Labels]

    

57. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

58. def flatMap[A](fun: (End) ⇒ GremlinScala[A, _]): GremlinScala[A, Labels]

    

59. def flatMapWithTraverser[A](fun: (Traverser[End]) ⇒ GremlinScala[A, _]): GremlinScala[A, Labels]

    

60. def fold(): GremlinScala[List[End], HNil]

    

61. def foldLeft[Z](z: Z)(op: (Z, End) ⇒ Z): GremlinScala[Z, HNil]

    

62. def from(label: StepLabel[Vertex]): GremlinScala[End, Labels]

    

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

    

    Definition Classes

    AnyRef → Any

64. def group(sideEffectKey: String): GremlinScala[End, Labels]

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

81. def hasId(id: AnyRef, ids: AnyRef*)(implicit ev: <:<[End, Element]): GremlinScala[End, Labels]

    

82. def hasKey(key: Key[_], keys: Key[_]*): GremlinScala[End, Labels]

    

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

    

84. def hasLabel(label: String, labels: String*)(implicit ev: <:<[End, Element]): GremlinScala[End, Labels]

    

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

    

86. def hasNot[A](key: Key[A], value: A): GremlinScala[End, Labels]

    

87. def hasNot[A](keyValue: KeyValue[A]): GremlinScala[End, Labels]

    

88. def hasNot(key: Key[_]): GremlinScala[End, Labels]

    

89. def hasValue(value: String, values: String*): GremlinScala[End, Labels]

    

90. def head(): End

    

91. def headOption(): Option[End]

    

92. def id(): GremlinScala[AnyRef, Labels]

    

93. def identity(): GremlinScala[End, Labels]

    

94. def in(labels: String*)(implicit ev: <:<[End, Vertex]): GremlinScala[Vertex, Labels]

    

95. def in()(implicit ev: <:<[End, Vertex]): GremlinScala[Vertex, Labels]

    

96. def inE(labels: String*)(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

    

97. def inE()(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

    

98. def inV()(implicit ev: <:<[End, Edge]): GremlinScala[Vertex, Labels]

    

99. def inject(injections: End*): GremlinScala[End, Labels]

    

100. def is(predicate: P[End]): GremlinScala[End, Labels]

     

101. def is(value: AnyRef): GremlinScala[End, Labels]

     

102. final def isInstanceOf[T0]: Boolean

     

     Definition Classes

     Any

103. def iterate(): GremlinScala[End, Labels]

     

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

     

105. def label(): GremlinScala[String, Labels]

     

106. def limit(scope: Scope, limit: Long): GremlinScala[End, Labels]

     

107. def limit(limit: Long): GremlinScala[End, Labels]

     

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

     

109. def loops(): GremlinScala[Integer, HNil]

     

110. def map[A](fun: (End) ⇒ A): GremlinScala[A, Labels]

     

111. def mapWithTraverser[A](fun: (Traverser[End]) ⇒ A): GremlinScala[A, Labels]

     

112. def match[A](traversals: Traversal[End, _]*): GremlinScala[Map[String, A], Labels]

     

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

     

114. def max[N <: Number]()(implicit toNumber: (End) ⇒ N): GremlinScala[N, HNil]

     

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

     

116. def mean[N <: Number]()(implicit toNumber: (End) ⇒ N): GremlinScala[Double, HNil]

     

117. def min[N <: Number](scope: Scope)(implicit toNumber: (End) ⇒ N): GremlinScala[N, HNil]

     

118. def min[N <: Number]()(implicit toNumber: (End) ⇒ N): GremlinScala[N, HNil]

     

119. final def ne(arg0: AnyRef): Boolean

     

     Definition Classes

     AnyRef

120. def not(notTraversal: (GremlinScala[End, HNil]) ⇒ GremlinScala[_, _]): GremlinScala[End, Labels]

     

121. def notExists(): Boolean

     

122. final def notify(): Unit

     

     Definition Classes

     AnyRef

123. final def notifyAll(): Unit

     

     Definition Classes

     AnyRef

124. def optional(optionalTraversal: (GremlinScala[End, HNil]) ⇒ GremlinScala[End, _]): GremlinScala[End, Labels]

     

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

     

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

     

127. def order(scope: Scope): GremlinScala[End, Labels]

     

128. def order(comparator: Order): GremlinScala[End, Labels]

     

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

     

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

     

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

     

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

     

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

     

134. def otherV()(implicit ev: <:<[End, Edge]): GremlinScala[Vertex, Labels]

     

135. def out(labels: String*)(implicit ev: <:<[End, Vertex]): GremlinScala[Vertex, Labels]

     

136. def out()(implicit ev: <:<[End, Vertex]): GremlinScala[Vertex, Labels]

     

137. def outE(labels: String*)(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

     

138. def outE()(implicit ev: <:<[End, Vertex]): GremlinScala[Edge, Labels]

     

139. def outV()(implicit ev: <:<[End, Edge]): GremlinScala[Vertex, Labels]

     

140. def path(): GremlinScala[Path, Labels]

     

141. def profile(sideEffectKey: String): GremlinScala[End, Labels]

     

142. def project[A](projectKey: String, otherProjectKeys: String*): GremlinScala[Map[String, A], Labels]

     

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

     

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

     

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

     

146. def range(scope: Scope, low: Long, high: Long): GremlinScala[End, Labels]

     

147. def range(low: Long, high: Long): GremlinScala[End, Labels]

     

148. def repeat(repeatTraversal: (GremlinScala[End, HNil]) ⇒ GremlinScala[End, _]): GremlinScala[End, Labels]

     

149. def sack[SackType](func: (SackType, End) ⇒ SackType): GremlinScala[End, Labels]

     

     Modify the sack with the current End type.

     Modify the sack with the current End type. TODO: carry SackType as class type parameter (both ScalaGraph and GremlinScala) [SideEffect]

150. def sack[SackType](): GremlinScala[SackType, Labels]

     

     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): GremlinScala[End, Labels]

     

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

     

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

     

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

     

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

     

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

     

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]): GremlinScala[ValueTuples, Labels]

     

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

     

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

     

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

     

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

     

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

     

163. def start[A]: GremlinScala[A, HNil]

     

     Attributes

     protected

164. def store(sideEffectKey: String)(implicit ev: <:<[End, Element]): GremlinScala[End, Labels]

     

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

     

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

     

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

     

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

     

     Definition Classes

     AnyRef

169. def tail(scope: Scope, limit: Long): GremlinScala[End, Labels]

     

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

     

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

     

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

     

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

     

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

     

175. def to(label: StepLabel[Vertex]): GremlinScala[End, Labels]

     

176. def to(direction: Direction, edgeLabels: String*): GremlinScala[Vertex, Labels]

     

177. def toBuffer(): Buffer[End]

     

178. def toJavaList[A](i: Iterable[A]): List[A]

     

     Attributes

     protected

179. def toList(): List[End]

     

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

     

181. def toSet(): Set[End]

     

182. def toStream(): Stream[End]

     

183. val traversal: GraphTraversal[_, End]

     

184. def tree(sideEffectKey: String): GremlinScala[End, Labels]

     

185. def tree(): GremlinScala[Tree[_], Labels]

     

186. def unfold[A](): GremlinScala[A, Labels]

     

187. def union[A](unionTraversals: (GremlinScala[End, HNil]) ⇒ GremlinScala[A, _]*): GremlinScala[A, Labels]

     

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

     

189. def untilWithTraverser(predicate: (Traverser[End]) ⇒ Boolean): GremlinScala[End, Labels]

     

190. def value[A](key: String)(implicit ev: <:<[End, Element]): GremlinScala[A, Labels]

     

191. def value[A](key: Key[A])(implicit ev: <:<[End, Element]): GremlinScala[A, Labels]

     

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

     

193. def valueOption[A](key: String)(implicit ev: <:<[End, Element]): GremlinScala[Option[A], Labels]

     

194. def valueOption[A](key: Key[A])(implicit ev: <:<[End, Element]): GremlinScala[Option[A], Labels]

     

195. def values[A](key: String*)(implicit ev: <:<[End, Element]): GremlinScala[A, Labels]

     

196. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

197. final def wait(arg0: Long, arg1: Int): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

198. final def wait(arg0: Long): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

199. def where(whereTraversal: (GremlinScala[End, HNil]) ⇒ GremlinScala[_, _]): GremlinScala[End, Labels]

     

200. def where(startKey: String, predicate: P[String]): GremlinScala[End, Labels]

     

201. def where(predicate: P[String]): GremlinScala[End, Labels]

     

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

     

     used in scala for comprehensions