Packages

c

scalax.collection.GraphTraversal

AbstractTopologicalOrder

sealed abstract class AbstractTopologicalOrder[+A, +T] extends AbstractTraversable[T]

Topologically ordered nodes or layers of a topological order of a graph or of an isolated graph component.

A

one of NodeT, N

T

one of A or (Int, Iterable[A])

Linear Supertypes
AbstractTraversable[T], 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
Known Subclasses
LayeredTopologicalOrder, TopologicalOrder
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AbstractTopologicalOrder
  2. AbstractTraversable
  3. Traversable
  4. GenTraversable
  5. GenericTraversableTemplate
  6. TraversableLike
  7. GenTraversableLike
  8. Parallelizable
  9. TraversableOnce
  10. GenTraversableOnce
  11. FilterMonadic
  12. HasNewBuilder
  13. AnyRef
  14. 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

Type Members

  1. type Self = Traversable[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    GenericTraversableTemplate
  2. abstract def layerOrdering: GraphTraversal.NodeOrdering
  3. abstract val layers: Layers
    Attributes
    protected
  4. abstract def toA: (NodeT) ⇒ A
    Attributes
    protected
  5. abstract def toLayered: LayeredTopologicalOrder[A]

    Creates a new flavor of this TopologicalOrder or LayeredTopologicalOrder that is traversable for its inner nodes zipped with their layers.

  6. abstract def withLayerOrdering(newOrdering: GraphTraversal.NodeOrdering): AbstractTopologicalOrder[A, T]

    Creates a new flavor of this TopologicalOrder or LayeredTopologicalOrder with nodes ordered by newOrdering within the layers.

    Creates a new flavor of this TopologicalOrder or LayeredTopologicalOrder with nodes ordered by newOrdering within the layers. A layer ordering is also useful to ensure a stable topological order over graph instances.

Concrete 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 AbstractTopologicalOrder[A, T] to any2stringadd[AbstractTopologicalOrder[A, 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
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (AbstractTopologicalOrder[A, T], B)
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to ArrowAssoc[AbstractTopologicalOrder[A, 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
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (T, 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, T) ⇒ 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[T, B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  18. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  19. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  20. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  24. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def drop(n: Int): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def dropWhile(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def edgeParams: Traversable[EdgeParam]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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]]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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: (AbstractTopologicalOrder[A, T]) ⇒ Boolean, msg: ⇒ Any): AbstractTopologicalOrder[A, T]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to Ensuring[AbstractTopologicalOrder[A, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. def ensuring(cond: (AbstractTopologicalOrder[A, T]) ⇒ Boolean): AbstractTopologicalOrder[A, T]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to Ensuring[AbstractTopologicalOrder[A, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. def ensuring(cond: Boolean, msg: ⇒ Any): AbstractTopologicalOrder[A, T]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to Ensuring[AbstractTopologicalOrder[A, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. def ensuring(cond: Boolean): AbstractTopologicalOrder[A, T]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to Ensuring[AbstractTopologicalOrder[A, T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. def equals(other: Any): Boolean
    Definition Classes
    AbstractTopologicalOrder → AnyRef → Any
  35. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  36. def filter(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def filterNot(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  39. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  40. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  41. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[B]
    Definition Classes
    GenericTraversableTemplate
  42. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  46. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to StringFormat[AbstractTopologicalOrder[A, T]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  47. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  48. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  49. def groupBy[K](f: (T) ⇒ K): Map[K, Traversable[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  51. def hashCode(): Int
    Definition Classes
    AbstractTopologicalOrder → AnyRef → Any
  52. def head: T
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def headOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def init: Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def inits: Iterator[Traversable[T]]
    Definition Classes
    TraversableLike
  56. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  57. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  58. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  59. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  60. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  61. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  62. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  63. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  64. def last: T
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  67. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. val n1: AbstractTopologicalOrder[A, T]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to EdgeAssoc[AbstractTopologicalOrder[A, T]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  75. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  76. def newBuilder: Builder[T, Traversable[T]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  77. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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
  78. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  80. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  81. def nrOfLayers: Int

    The number of layers of this topological order.

  82. def ordered(nodes: IndexedSeq[NodeT]): IndexedSeq[NodeT]
    Attributes
    protected
  83. def par: ParIterable[T]
    Definition Classes
    Parallelizable
  84. def parCombiner: Combiner[T, ParIterable[T]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  85. def partition(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  86. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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
  87. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  90. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def repr: Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def reversed: List[T]
    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
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], 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.

  99. def seq: Traversable[T]
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  100. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  102. def slice(from: Int, until: Int): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def span(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def splitAt(n: Int): (Traversable[T], Traversable[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def stringPrefix: String
    Definition Classes
    AbstractTopologicalOrder → TraversableLike → GenTraversableLike
  106. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  108. def tail: Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def tails: Iterator[Traversable[T]]
    Definition Classes
    TraversableLike
  110. def take(n: Int): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def takeWhile(p: (T) ⇒ Boolean): Traversable[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  112. def thisCollection: Traversable[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  113. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  114. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def toCollection(repr: Traversable[T]): Traversable[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  117. def toInParams: Traversable[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def toIterable: Iterable[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def toIterator: Iterator[T]
    Definition Classes
    TraversableLike → GenTraversableOnce
  121. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def toOuterEdges: Traversable[E[N]]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to CollectionsHaveToParArray[AbstractTopologicalOrder[A, T], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (AbstractTopologicalOrder[A, T]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  126. def toSeq: Seq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def toSet[B >: T]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def toStream: Stream[T]
    Definition Classes
    TraversableLike → GenTraversableOnce
  129. def toString(): String
    Definition Classes
    TraversableLike → Any
  130. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  131. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def transpose[B](implicit asTraversable: (T) ⇒ 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.

  133. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  134. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  135. val value: AbstractTopologicalOrder[A, T]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, T]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  136. def view(from: Int, until: Int): TraversableView[T, Traversable[T]]
    Definition Classes
    TraversableLike
  137. def view: TraversableView[T, Traversable[T]]
    Definition Classes
    TraversableLike
  138. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  139. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  140. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  141. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Traversable[T]]
    Definition Classes
    TraversableLike → FilterMonadic
  142. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to EdgeAssoc[AbstractTopologicalOrder[A, T]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  143. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to EdgeAssoc[AbstractTopologicalOrder[A, T]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  144. def →[B](y: B): (AbstractTopologicalOrder[A, T], B)
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to ArrowAssoc[AbstractTopologicalOrder[A, 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]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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:
    (abstractTopologicalOrder: MonadOps[T]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (T) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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:
    (abstractTopologicalOrder: MonadOps[T]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: (T) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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:
    (abstractTopologicalOrder: MonadOps[T]).map(f)
    Definition Classes
    MonadOps
  4. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, 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:
    (abstractTopologicalOrder: OuterNode[AbstractTopologicalOrder[A, T]]).stringPrefix
    Definition Classes
    NodeParam
  5. def toString(): String
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, 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:
    (abstractTopologicalOrder: OuterNode[AbstractTopologicalOrder[A, T]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  6. def withFilter(p: (T) ⇒ Boolean): Iterator[T]
    Implicit
    This member is added by an implicit conversion from AbstractTopologicalOrder[A, 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:
    (abstractTopologicalOrder: MonadOps[T]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from AbstractTraversable[T]

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 AbstractTopologicalOrder[A, T] to OuterNode[AbstractTopologicalOrder[A, T]]

Inherited by implicit conversion CollectionsHaveToParArray from AbstractTopologicalOrder[A, T] to CollectionsHaveToParArray[AbstractTopologicalOrder[A, T], T]

Inherited by implicit conversion MonadOps from AbstractTopologicalOrder[A, T] to MonadOps[T]

Inherited by implicit conversion EdgeAssoc from AbstractTopologicalOrder[A, T] to EdgeAssoc[AbstractTopologicalOrder[A, T]]

Inherited by implicit conversion graphParamsToPartition from AbstractTopologicalOrder[A, T] to Partitions[N, E]

Inherited by implicit conversion any2stringadd from AbstractTopologicalOrder[A, T] to any2stringadd[AbstractTopologicalOrder[A, T]]

Inherited by implicit conversion StringFormat from AbstractTopologicalOrder[A, T] to StringFormat[AbstractTopologicalOrder[A, T]]

Inherited by implicit conversion Ensuring from AbstractTopologicalOrder[A, T] to Ensuring[AbstractTopologicalOrder[A, T]]

Inherited by implicit conversion ArrowAssoc from AbstractTopologicalOrder[A, T] to ArrowAssoc[AbstractTopologicalOrder[A, T]]

Inherited by implicit conversion alternateImplicit from AbstractTopologicalOrder[A, T] to ForceImplicitAmbiguity

Ungrouped