scala.tools.nsc.PhaseAssembly

DependencyGraph

class DependencyGraph extends AnyRef

Aux datastructure for solving the constraint system The depency graph container with helper methods for node and edge creation

Source
PhaseAssembly.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. DependencyGraph
  2. AnyRef
  3. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DependencyGraph()

Type Members

  1. class Edge extends AnyRef

    Simple edge with to and from refs

  2. class Node extends AnyRef

    Simple node with name and object ref for the phase object, also sets of in and out going dependencies

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

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

  8. def collapseHardLinksAndLevels(node: Node, lvl: Int): Unit

  9. def compilerPhaseList(): List[SubComponent]

  10. val edges: HashSet[Edge]

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

  14. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any

  15. def getNodeByPhase(name: String): Node

  16. def getNodeByPhase(phs: SubComponent): Node

  17. def hardConnectNodes(frm: Node, to: Node): Unit

  18. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  21. val nodes: HashMap[String, Node]

  22. final def notify(): Unit

    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  24. def removeDanglingNodes(): Unit

    Remove all nodes in the given graph, that have no phase object Make sure to clean up all edges when removing the node object Inform with warnings, if an external phase has a dependency on something that is dropped.

  25. def softConnectNodes(frm: Node, to: Node): Unit

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

    Definition Classes
    AnyRef

  27. def toString(): String

    Definition Classes
    AnyRef → Any

  28. def validateAndEnforceHardlinks(): Unit

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any