Packages

c

za.co.absa.commons.graph.GraphImplicits

DAGNodeTraversableOps

implicit final class DAGNodeTraversableOps[Node, M[X] <: Seq[X]] extends AnyVal

Linear Supertypes
AnyVal, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DAGNodeTraversableOps
  2. AnyVal
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DAGNodeTraversableOps(xs: M[Node])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    Any
  2. final def ##(): Int
    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def getClass(): Class[_ <: AnyVal]
    Definition Classes
    AnyVal → Any
  6. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  7. def sortedTopologically[Id](reverse: Boolean = false)(implicit nim: DAGNodeIdMapping[Node, Id], idOrdering: Ordering[Id] = IdOrdering.none[Id], cbf: CanBuildFrom[M[Node], Node, M[Node]]): M[Node]
  8. def sortedTopologicallyBy[Id](selfIdFn: (Node) ⇒ Id, refIdsFn: (Node) ⇒ Traversable[Id], reverse: Boolean = false)(implicit idOrdering: Ordering[Id] = IdOrdering.none[Id], cbf: CanBuildFrom[M[Node], Node, M[Node]]): M[Node]
  9. def toString(): String
    Definition Classes
    Any
  10. val xs: M[Node]

Inherited from AnyVal

Inherited from Any

Ungrouped