Packages

c

scalax.collection.GraphTraversalImpl

ReverseStackTraversable

final class ReverseStackTraversable[S <: NodeElement] extends Traversable[(GraphTraversalImpl.this)#NodeT]

Efficient reverse foreach overcoming ArrayStack's deficiency not to overwrite reverseIterator.

Attributes
protected
Linear Supertypes
Traversable[(GraphTraversalImpl.this)#NodeT], GenTraversable[(GraphTraversalImpl.this)#NodeT], GenericTraversableTemplate[(GraphTraversalImpl.this)#NodeT, Traversable], TraversableLike[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]], GenTraversableLike[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]], Parallelizable[(GraphTraversalImpl.this)#NodeT, ParIterable[(GraphTraversalImpl.this)#NodeT]], TraversableOnce[(GraphTraversalImpl.this)#NodeT], GenTraversableOnce[(GraphTraversalImpl.this)#NodeT], FilterMonadic[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]], HasNewBuilder[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReverseStackTraversable
  2. Traversable
  3. GenTraversable
  4. GenericTraversableTemplate
  5. TraversableLike
  6. GenTraversableLike
  7. Parallelizable
  8. TraversableOnce
  9. GenTraversableOnce
  10. FilterMonadic
  11. HasNewBuilder
  12. AnyRef
  13. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  10. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ReverseStackTraversable(s: IndexedSeq[S], takeWhile: Option[(S) ⇒ Boolean] = None, enclosed: Array[Option[S]] = Array[Option[S]](None, None))

Type Members

  1. type Self = Traversable[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to any2stringadd[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: (GraphTraversalImpl.this)#NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (GraphTraversalImpl.this)#NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (GraphTraversalImpl.this)#NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): ((GraphTraversalImpl.this)#ReverseStackTraversable[S], B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to ArrowAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: ((GraphTraversalImpl.this)#NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  16. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  17. def collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#NodeT, B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  18. def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  19. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  20. def copyToArray[B >: (GraphTraversalImpl.this)#NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: (GraphTraversalImpl.this)#NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: (GraphTraversalImpl.this)#NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToBuffer[B >: (GraphTraversalImpl.this)#NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  24. def count(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def drop(n: Int): Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def dropWhile(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def ensuring(cond: ((GraphTraversalImpl.this)#ReverseStackTraversable[S]) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#ReverseStackTraversable[S]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  28. def ensuring(cond: ((GraphTraversalImpl.this)#ReverseStackTraversable[S]) ⇒ Boolean): (GraphTraversalImpl.this)#ReverseStackTraversable[S]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  29. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#ReverseStackTraversable[S]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. def ensuring(cond: Boolean): (GraphTraversalImpl.this)#ReverseStackTraversable[S]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  32. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  33. def exists(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  34. def filter(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  35. def filterNot(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  37. def find(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Option[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  38. def flatMap[B, That](f: ((GraphTraversalImpl.this)#NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  39. def flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#NodeT) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  40. def fold[A1 >: (GraphTraversalImpl.this)#NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def forall(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  44. def foreach[U](f: ((GraphTraversalImpl.this)#NodeT) ⇒ U): Unit
    Definition Classes
    ReverseStackTraversable → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
    Annotations
    @inline()
  45. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to StringFormat[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  46. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  47. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  48. def groupBy[K](f: ((GraphTraversalImpl.this)#NodeT) ⇒ K): Map[K, Traversable[(GraphTraversalImpl.this)#NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  50. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  51. def head: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def headOption: Option[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def init: Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def inits: Iterator[Traversable[(GraphTraversalImpl.this)#NodeT]]
    Definition Classes
    TraversableLike
  55. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  56. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  57. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  58. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  59. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  60. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  61. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  62. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  63. def last: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    ReverseStackTraversable → TraversableLike → GenTraversableLike
    Annotations
    @inline()
  64. def lastOption: Option[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def map[B, That](f: ((GraphTraversalImpl.this)#NodeT) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  66. def max[B >: (GraphTraversalImpl.this)#NodeT](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def maxBy[B](f: ((GraphTraversalImpl.this)#NodeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def min[B >: (GraphTraversalImpl.this)#NodeT](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def minBy[B](f: ((GraphTraversalImpl.this)#NodeT) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. val n1: (GraphTraversalImpl.this)#ReverseStackTraversable[S]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to EdgeAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  74. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  75. def newBuilder: Builder[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  76. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  78. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  79. def par: ParIterable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    Parallelizable
  80. def parCombiner: Combiner[(GraphTraversalImpl.this)#NodeT, ParIterable[(GraphTraversalImpl.this)#NodeT]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  81. def partition(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#NodeT], Traversable[(GraphTraversalImpl.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def product[B >: (GraphTraversalImpl.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def reduce[A1 >: (GraphTraversalImpl.this)#NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def reduceLeft[B >: (GraphTraversalImpl.this)#NodeT](op: (B, (GraphTraversalImpl.this)#NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  85. def reduceLeftOption[B >: (GraphTraversalImpl.this)#NodeT](op: (B, (GraphTraversalImpl.this)#NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def reduceOption[A1 >: (GraphTraversalImpl.this)#NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def reduceRight[B >: (GraphTraversalImpl.this)#NodeT](op: ((GraphTraversalImpl.this)#NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def reduceRightOption[B >: (GraphTraversalImpl.this)#NodeT](op: ((GraphTraversalImpl.this)#NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def repr: Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  90. def reverse: Traversable[(GraphTraversalImpl.this)#NodeT]
  91. def reversed: List[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  92. def scan[B >: (GraphTraversalImpl.this)#NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  93. def scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#NodeT) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  95. def seq: Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  96. val size: Int
    Definition Classes
    ReverseStackTraversable → GenTraversableLike → TraversableOnce → GenTraversableOnce
  97. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  98. def slice(from: Int, until: Int): Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def span(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#NodeT], Traversable[(GraphTraversalImpl.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def splitAt(n: Int): (Traversable[(GraphTraversalImpl.this)#NodeT], Traversable[(GraphTraversalImpl.this)#NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def stringPrefix: String
    Definition Classes
    ReverseStackTraversable → TraversableLike → GenTraversableLike
  102. def sum[B >: (GraphTraversalImpl.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  104. def tail: Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def tails: Iterator[Traversable[(GraphTraversalImpl.this)#NodeT]]
    Definition Classes
    TraversableLike
  106. def take(n: Int): Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def takeWhile(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def thisCollection: Traversable[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  109. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#NodeT, Col[(GraphTraversalImpl.this)#NodeT]]): Col[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  110. def toArray[B >: (GraphTraversalImpl.this)#NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def toBuffer[B >: (GraphTraversalImpl.this)#NodeT]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def toCollection(repr: Traversable[(GraphTraversalImpl.this)#NodeT]): Traversable[(GraphTraversalImpl.this)#NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  113. def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def toIterable: Iterable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def toIterator: Iterator[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableOnce
  116. def toList: List[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to CollectionsHaveToParArray[(GraphTraversalImpl.this)#ReverseStackTraversable[S], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#ReverseStackTraversable[S]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  119. def toSeq: Seq[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def toSet[B >: (GraphTraversalImpl.this)#NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def toStream: Stream[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → GenTraversableOnce
  122. def toString(): String
    Definition Classes
    TraversableLike → Any
  123. def toTraversable: Traversable[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  124. def toVector: Vector[(GraphTraversalImpl.this)#NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def transpose[B](implicit asTraversable: ((GraphTraversalImpl.this)#NodeT) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  126. def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#NodeT) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  127. def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#NodeT) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  128. val value: (GraphTraversalImpl.this)#ReverseStackTraversable[S]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  129. def view(from: Int, until: Int): TraversableView[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]
    Definition Classes
    TraversableLike
  130. def view: TraversableView[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]
    Definition Classes
    TraversableLike
  131. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  132. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  133. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  134. def withFilter(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  135. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to EdgeAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  136. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to EdgeAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  137. def →[B](y: B): ((GraphTraversalImpl.this)#ReverseStackTraversable[S], B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to ArrowAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): TraversableOnce[(GraphTraversalImpl.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to MonadOps[(GraphTraversalImpl.this)#NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (reverseStackTraversable: MonadOps[(GraphTraversalImpl.this)#NodeT]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: ((GraphTraversalImpl.this)#NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to MonadOps[(GraphTraversalImpl.this)#NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (reverseStackTraversable: MonadOps[(GraphTraversalImpl.this)#NodeT]).flatMap(f)
    Definition Classes
    MonadOps
  3. def flatten: Iterator[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (reverseStackTraversable: FlattenOps[N]).flatten
    Definition Classes
    FlattenOps
  4. def map[B](f: ((GraphTraversalImpl.this)#NodeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to MonadOps[(GraphTraversalImpl.this)#NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (reverseStackTraversable: MonadOps[(GraphTraversalImpl.this)#NodeT]).map(f)
    Definition Classes
    MonadOps
  5. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (reverseStackTraversable: OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]).stringPrefix
    Definition Classes
    NodeParam
  6. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (reverseStackTraversable: OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  7. def withFilter(p: ((GraphTraversalImpl.this)#NodeT) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to MonadOps[(GraphTraversalImpl.this)#NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (reverseStackTraversable: MonadOps[(GraphTraversalImpl.this)#NodeT]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from Traversable[(GraphTraversalImpl.this)#NodeT]

Inherited from GenTraversable[(GraphTraversalImpl.this)#NodeT]

Inherited from GenericTraversableTemplate[(GraphTraversalImpl.this)#NodeT, Traversable]

Inherited from TraversableLike[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]

Inherited from GenTraversableLike[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]

Inherited from Parallelizable[(GraphTraversalImpl.this)#NodeT, ParIterable[(GraphTraversalImpl.this)#NodeT]]

Inherited from TraversableOnce[(GraphTraversalImpl.this)#NodeT]

Inherited from GenTraversableOnce[(GraphTraversalImpl.this)#NodeT]

Inherited from FilterMonadic[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]

Inherited from HasNewBuilder[(GraphTraversalImpl.this)#NodeT, Traversable[(GraphTraversalImpl.this)#NodeT]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]

Inherited by implicit conversion CollectionsHaveToParArray from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to CollectionsHaveToParArray[(GraphTraversalImpl.this)#ReverseStackTraversable[S], T]

Inherited by implicit conversion MonadOps from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to MonadOps[(GraphTraversalImpl.this)#NodeT]

Inherited by implicit conversion flattenTraversableOnce from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to FlattenOps[N]

Inherited by implicit conversion EdgeAssoc from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to EdgeAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]

Inherited by implicit conversion any2stringadd from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to any2stringadd[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]

Inherited by implicit conversion StringFormat from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to StringFormat[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]

Inherited by implicit conversion Ensuring from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]

Inherited by implicit conversion ArrowAssoc from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to ArrowAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S]]

Inherited by implicit conversion alternateImplicit from (GraphTraversalImpl.this)#ReverseStackTraversable[S] to ForceImplicitAmbiguity

Ungrouped