Class

scalax.collection.GraphTraversal

AbstractTopologicalOrder

Related Doc: package GraphTraversal

Permalink

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
Type Hierarchy Learn more about scaladoc diagrams
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]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

  2. abstract def layerOrdering: GraphTraversal.NodeOrdering

    Permalink

  3. abstract val layers: Layers

    Permalink
    Attributes
    protected

  4. abstract def toA: (NodeT) ⇒ A

    Permalink
    Attributes
    protected

  5. abstract def toLayered: LayeredTopologicalOrder[A]

    Permalink

    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]

    Permalink

    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

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

    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): (AbstractTopologicalOrder[A, T], B)

    Permalink
    Implicit information
    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

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

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    AnyRef

  34. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    AbstractTopologicalOrder → 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 formatted(fmtstr: String): String

    Permalink
    Implicit information
    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]]

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  50. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  51. def hashCode(): Int

    Permalink
    Definition Classes
    AbstractTopologicalOrder → AnyRef → Any

  52. def head: T

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  53. def headOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  54. def init: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

  56. def isDefined: Boolean

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  59. def isIn: Boolean

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    Any

  61. def isNode: Boolean

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  64. def last: T

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  65. def lastOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  74. val n1: AbstractTopologicalOrder[A, T]

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

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

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  79. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  80. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  81. def nrOfLayers: Int

    Permalink

    The number of layers of this topological order.

  82. def ordered(nodes: IndexedSeq[NodeT]): IndexedSeq[NodeT]

    Permalink
    Attributes
    protected

  83. def par: ParIterable[T]

    Permalink
    Definition Classes
    Parallelizable

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  94. def repr: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  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. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  104. def stringPrefix: String

    Permalink
    Definition Classes
    AbstractTopologicalOrder → TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    AnyRef

  107. def tail: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  111. def thisCollection: Traversable[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

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

    Permalink
    Implicit information
    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

  117. def toIndexedSeq: IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def toIterable: Iterable[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  119. def toIterator: Iterator[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  120. def toList: List[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Implicit information
    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

  123. def toOuterNodes: Traversable[N]

    Permalink
    Implicit information
    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 toParArray: ParArray[T]

    Permalink
    Implicit information
    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

  125. def toSeq: Seq[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  127. def toStream: Stream[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  128. def toString(): String

    Permalink
    Definition Classes
    TraversableLike → Any

  129. def toTraversable: Traversable[T]

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

  130. def toVector: Vector[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

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

    Permalink
    Definition Classes
    GenericTraversableTemplate

  134. val value: AbstractTopologicalOrder[A, T]

    Permalink
    Implicit information
    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

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

    Permalink
    Definition Classes
    TraversableLike

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

    Permalink
    Definition Classes
    TraversableLike

  137. final def wait(): Unit

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

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

    Permalink
    Implicit information
    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()

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

    Permalink
    Implicit information
    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 →[B](y: B): (AbstractTopologicalOrder[A, T], B)

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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

    Permalink
    Implicit information
    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]

    Permalink
    Implicit information
    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