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

   

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

   

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

   

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

   

8. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

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

   

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

    

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

    

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

    

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

    

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

    

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

    

16. def branch(fun: (End) ⇒ Iterable[String]): GremlinScala[End, Labels]

    

17. def branchWithTraverser(fun: (Traverser[End]) ⇒ Iterable[String]): GremlinScala[End, Labels]

    

18. def by(order: Order): GremlinScala[End, Labels]

    

19. def by(byTraversal: Traversal[_, _], order: Order): GremlinScala[End, Labels]

    

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

    

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

    

22. def by(elementPropertyKey: String, order: Order): GremlinScala[End, Labels]

    

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

    

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

    

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

    

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

    

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

    

28. def byP[A](elementPropertyKey: String, lessThan: (A, A) ⇒ Boolean): GremlinScala[End, Labels]

    

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

    

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

    

31. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

    Definition Classes

    AnyRef

44. def exists(): Boolean

    

45. def filter(p: (End) ⇒ Boolean): GremlinScala[End, Labels]

    

46. def filterNot(p: (End) ⇒ Boolean): GremlinScala[End, Labels]

    

47. def filterWithTraverser(p: (Traverser[End]) ⇒ Boolean): GremlinScala[End, Labels]

    

48. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

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

    

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

    

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

    

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

    

    Definition Classes

    AnyRef → Any

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

74. def hasNot[A](key: KeyValue[A]): GremlinScala[End, Labels]

    

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

    

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

    

77. def head(): End

    

78. def headOption(): Option[End]

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

89. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

    

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

     

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

     

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

     

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

     

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

     

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

     

     Definition Classes

     AnyRef

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

     

107. def notExists(): Boolean

     

108. final def notify(): Unit

     

     Definition Classes

     AnyRef

109. final def notifyAll(): Unit

     

     Definition Classes

     AnyRef

110. def option[A, M](pickToken: M, optionTraversal: (GremlinScala[End, HNil]) ⇒ GremlinScala[A, _]): GremlinScala[End, Labels]

     

111. def option[A](optionTraversal: (GremlinScala[End, HNil]) ⇒ GremlinScala[A, _]): GremlinScala[End, Labels]

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

128. def profile(): GremlinScala[End, Labels]

     

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

     

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

     

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

     

132. def range(low: Int, high: Int): GremlinScala[End, Labels]

     

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

     

134. def sack[A](): GremlinScala[A, Labels]

     

135. def sample(scope: Scope, amount: Int): GremlinScala[End, Labels]

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

     Attributes

     protected

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

     

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

     

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

     

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

     

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

     

     Definition Classes

     AnyRef

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

     

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

     

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

     

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

     

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

     

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

     

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

     

     Attributes

     protected

160. def toList(): List[End]

     

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

     

162. def toSet(): Set[End]

     

163. def toStream(): Stream[End]

     

164. val traversal: GraphTraversal[_, End]

     

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

     

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

     

167. def union(traversals: GremlinScala[End, _]*): GremlinScala[End, Labels]

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

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

     

176. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

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

     

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