Class

scalax.collection.GraphTraversalImpl

ReverseStackTraversable

Related Doc: package GraphTraversalImpl

Permalink

final class ReverseStackTraversable[S, T] extends Traversable[T]

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

Attributes
protected
Linear Supertypes
Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, Traversable], TraversableLike[T, Traversable[T]], GenTraversableLike[T, Traversable[T]], Parallelizable[T, ParIterable[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, Traversable[T]], HasNewBuilder[T, Traversable[T]], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
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 EdgeAssoc
  5. by graphParamsToPartition
  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: Seq[S], toT: (S) ⇒ T, dropWhile: Option[(S) ⇒ Boolean] = None, enclosed: Array[Option[S]] = Array[Option[S]](None, None))

    Permalink

Type Members

  1. type Self = Traversable[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to any2stringadd[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  5. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  6. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  7. def ->[B](y: B): ((GraphTraversalImpl.this)#ReverseStackTraversable[S, T], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to ArrowAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method ArrowAssoc in scala.Predef. This conversion will take place only if T is a subclass of Param[Nothing, Nothing] (T <: Param[Nothing, Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  8. def /:[B](z: B)(op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. def :\[B](z: B)(op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  12. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  14. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  15. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  17. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  18. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce

  19. def companion: GenericCompanion[Traversable]

    Permalink
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate

  20. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  21. def copyToArray[B >: T](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  22. def copyToArray[B >: T](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. def copyToBuffer[B >: T](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce

  24. def count(p: (T) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  25. def drop(n: Int): Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  26. def dropWhile(p: (T) ⇒ Boolean): Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  27. def edgeParams: Traversable[EdgeParam]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if T is a subclass of Param[N, E] (T <: Param[N, E]).
    Definition Classes
    Partitions

  28. val elems: Traversable[Param[N, E]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if T is a subclass of Param[N, E] (T <: Param[N, E]).
    Definition Classes
    Partitions

  29. def ensuring(cond: ((GraphTraversalImpl.this)#ReverseStackTraversable[S, T]) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#ReverseStackTraversable[S, T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  30. def ensuring(cond: ((GraphTraversalImpl.this)#ReverseStackTraversable[S, T]) ⇒ Boolean): (GraphTraversalImpl.this)#ReverseStackTraversable[S, T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  31. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#ReverseStackTraversable[S, T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  32. def ensuring(cond: Boolean): (GraphTraversalImpl.this)#ReverseStackTraversable[S, T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Ensuring[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Permalink
    Definition Classes
    AnyRef

  34. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  35. def exists(p: (T) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  36. def filter(p: (T) ⇒ Boolean): Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  37. def filterNot(p: (T) ⇒ Boolean): Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  38. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  39. def find(p: (T) ⇒ Boolean): Option[T]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  40. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  41. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  42. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  43. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  44. def foldRight[B](z: B)(op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  45. def forall(p: (T) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  46. def foreach[U](f: (T) ⇒ U): Unit

    Permalink
    Definition Classes
    ReverseStackTraversable → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
    Annotations
    @inline()

  47. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to StringFormat[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  48. def genericBuilder[B]: Builder[B, Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    AnyRef → Any

  50. def groupBy[K](f: (T) ⇒ K): Map[K, Traversable[T]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  51. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  52. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  53. def head: T

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  54. def headOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  55. def init: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  56. def inits: Iterator[Traversable[T]]

    Permalink
    Definition Classes
    TraversableLike

  57. def isDefined: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param

  58. def isEdge: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  59. def isEmpty: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  60. def isIn: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  61. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  62. def isNode: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  63. def isOut: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  64. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  65. def last: T

    Permalink
    Definition Classes
    ReverseStackTraversable → TraversableLike → GenTraversableLike
    Annotations
    @inline()

  66. def lastOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  67. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  68. def max[B >: T](implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  69. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  70. def min[B >: T](implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  74. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  75. val n1: (GraphTraversalImpl.this)#ReverseStackTraversable[S, T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to EdgeAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

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

    Permalink
    Definition Classes
    AnyRef

  77. def newBuilder: Builder[T, Traversable[T]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  78. def nodeParams: Traversable[NodeParam[N]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if T is a subclass of Param[N, E] (T <: Param[N, E]).
    Definition Classes
    Partitions

  79. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  80. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  81. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  82. def par: ParIterable[T]

    Permalink
    Definition Classes
    Parallelizable

  83. def parCombiner: Combiner[T, ParIterable[T]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  84. def partition(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  85. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if T is a subclass of Param[N, E] (T <: Param[N, E]).
    Definition Classes
    Partitions

  86. def product[B >: T](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def reduceLeft[B >: T](op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce

  89. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  90. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. def reduceRight[B >: T](op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. def repr: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  94. def reverse: Traversable[T]

    Permalink

  95. def reversed: List[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  96. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  97. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  98. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That

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

  99. def seq: Traversable[T]

    Permalink
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  100. val size: Int

    Permalink
    Definition Classes
    ReverseStackTraversable → GenTraversableLike → TraversableOnce → GenTraversableOnce

  101. def slice(from: Int, until: Int): Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  102. lazy val source: Traversable[S]

    Permalink

  103. def span(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  104. def splitAt(n: Int): (Traversable[T], Traversable[T])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  105. def stringPrefix: String

    Permalink
    Definition Classes
    ReverseStackTraversable → TraversableLike → GenTraversableLike

  106. def sum[B >: T](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  108. def tail: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  109. def tails: Iterator[Traversable[T]]

    Permalink
    Definition Classes
    TraversableLike

  110. def take(n: Int): Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  111. def takeWhile(p: (T) ⇒ Boolean): Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  112. def thisCollection: Traversable[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  113. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  114. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def toBuffer[B >: T]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def toCollection(repr: Traversable[T]): Traversable[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  117. def toInParams: Traversable[InParam[N, E]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if T is a subclass of Param[N, E] (T <: Param[N, E]).
    Definition Classes
    Partitions

  118. def toIndexedSeq: IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  119. def toIterable: Iterable[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  120. def toIterator: Iterator[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  121. def toList: List[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. def toOuterEdges: Traversable[E[N]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if T is a subclass of Param[N, E] (T <: Param[N, E]).
    Definition Classes
    Partitions

  124. def toOuterNodes: Traversable[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if T is a subclass of Param[N, E] (T <: Param[N, E]).
    Definition Classes
    Partitions

  125. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to CollectionsHaveToParArray[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T], 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, T]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray

  126. def toSeq: Seq[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  127. def toSet[B >: T]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  128. def toStream: Stream[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  129. def toString(): String

    Permalink
    Definition Classes
    TraversableLike → Any

  130. def toTraversable: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  131. def toVector: Vector[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  132. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  133. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  134. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  135. val value: (GraphTraversalImpl.this)#ReverseStackTraversable[S, T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam

  136. def view(from: Int, until: Int): TraversableView[T, Traversable[T]]

    Permalink
    Definition Classes
    TraversableLike

  137. def view: TraversableView[T, Traversable[T]]

    Permalink
    Definition Classes
    TraversableLike

  138. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  141. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Traversable[T]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

  142. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to EdgeAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  143. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to EdgeAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  144. def →[B](y: B): ((GraphTraversalImpl.this)#ReverseStackTraversable[S, T], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to ArrowAssoc[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] performed by method ArrowAssoc in scala.Predef. This conversion will take place only if T is a subclass of Param[Nothing, Nothing] (T <: Param[Nothing, Nothing]).
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (T) ⇒ Boolean): TraversableOnce[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to MonadOps[T] 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[T]).filter(p)
    Definition Classes
    MonadOps

  2. def flatMap[B](f: (T) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to MonadOps[T] 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[T]).flatMap(f)
    Definition Classes
    MonadOps

  3. def map[B](f: (T) ⇒ B): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to MonadOps[T] 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[T]).map(f)
    Definition Classes
    MonadOps

  4. def stringPrefix: String

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] 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, T]]).stringPrefix
    Definition Classes
    NodeParam

  5. def toString(): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to OuterNode[(GraphTraversalImpl.this)#ReverseStackTraversable[S, T]] 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, T]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

  6. def withFilter(p: (T) ⇒ Boolean): Iterator[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to MonadOps[T] 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[T]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, Traversable]

Inherited from TraversableLike[T, Traversable[T]]

Inherited from GenTraversableLike[T, Traversable[T]]

Inherited from Parallelizable[T, ParIterable[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, Traversable[T]]

Inherited from HasNewBuilder[T, Traversable[T]]

Inherited from AnyRef

Inherited from Any

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

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

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

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

Inherited by implicit conversion graphParamsToPartition from (GraphTraversalImpl.this)#ReverseStackTraversable[S, T] to Partitions[N, E]

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

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

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

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

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

Ungrouped