Packages

object DAG

Generated based on Dependency.DAG

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

Type Members

  1. final case class CycleDetected[ComparableNode](arg1: ComparableNode, arg2: ComparableNode) extends Product with Serializable
  2. final case class DAG[ComparableNode](arg1: Dict[ComparableNode, Set[ComparableNode]]) extends AnyVal with Product with Serializable

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def backwardTopologicalOrdering[ComparableNode]: (DAG[ComparableNode]) ⇒ List[List[ComparableNode]]
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. def collectForwardReachableNodes[ComparableNode](firstNode: ComparableNode): (DAG[ComparableNode]) ⇒ Set[ComparableNode]
  8. implicit def comparableOrdering[ComparableNode]: Ordering[ComparableNode]
  9. def deleteNode[ComparableNode](comparableNode: ComparableNode): (DAG[ComparableNode]) ⇒ DAG[ComparableNode]
  10. def empty[ComparableNode]: DAG[ComparableNode]
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. def forwardTopologicalOrdering[ComparableNode](dag: DAG[ComparableNode]): List[List[ComparableNode]]
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. def incomingEdges[ComparableNode](toNode: ComparableNode): (DAG[ComparableNode]) ⇒ Set[ComparableNode]
  18. def insertEdge[ComparableNode](from: ComparableNode)(to: ComparableNode): (DAG[ComparableNode]) ⇒ Result[CycleDetected[ComparableNode], DAG[ComparableNode]]
  19. def insertNode[ComparableNode](fromNode: ComparableNode)(toNodes: Set[ComparableNode]): (DAG[ComparableNode]) ⇒ Result[CycleDetected[ComparableNode], DAG[ComparableNode]]
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. def outgoingEdges[ComparableNode](fromNode: ComparableNode): (DAG[ComparableNode]) ⇒ Set[ComparableNode]
  25. def removeEdge[ComparableNode](from: ComparableNode)(to: ComparableNode): (DAG[ComparableNode]) ⇒ DAG[ComparableNode]
  26. def removeIncomingEdges[ComparableNode](comparableNode: ComparableNode)(dag: DAG[ComparableNode]): DAG[ComparableNode]
  27. def removeNode[ComparableNode](comparableNode: ComparableNode): (DAG[ComparableNode]) ⇒ DAG[ComparableNode]
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. def toList[ComparableNode]: (DAG[ComparableNode]) ⇒ List[(ComparableNode, Set[ComparableNode])]
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped