Class

namespace.dsl

FlowDepGraph

Related Doc: package dsl

Permalink

class FlowDepGraph extends DepGraphE

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

Instance Constructors

  1. new FlowDepGraph(comp: ComponentDeclaration)

    Permalink

Type Members

  1. type A = Either[BoolIdent, FlowIdent]

    Permalink

    Node data type.

    Node data type.

    Definition Classes
    FlowDepGraphDepGraphE
  2. case class Node(data: A) extends Product with Serializable

    Permalink

    Class representing a node in a graph, labeled with an instance of class A.

    Class representing a node in a graph, labeled with an instance of class A.

    Definition Classes
    DepGraphE

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def allFlowsInOrder: Iterator[FlowIdent]

    Permalink

    Iterates on all flow identifiers used in the component in order, be type values or local flows.

  5. def allIdentsInOrder: Iterator[Either[BoolIdent, FlowIdent]]

    Permalink

    Iterates on all identifiers used in the component in topological order, be they events, type values or local flows.

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def check: List[NamespaceException]

    Permalink

    This method detects cyclic dependencies and returns exceptions, if no exceptions are triggered, the graph is topologically sorted.

  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def compCallsInOrder: Iterator[CompCallFlowDefinition]

    Permalink

    Iterates in the calls to sub components in topological order.

  10. def compDefsInOrder: Iterator[FlowDefinition]

    Permalink

    Iterates on all flow definitions found in the component.

  11. def compFlowsInOrder: Iterator[BasicFlowIdent]

    Permalink

    Iterates on all basic flow identifiers defined in the component (excludes type values).

  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  17. final def inOrder: Iterator[Node]

    Permalink

    Iterator on the nodes of the graph (in topological order if root is defined).

    Iterator on the nodes of the graph (in topological order if root is defined).

    Definition Classes
    DepGraphE
  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  19. final def iterator: Iterator[Node]

    Permalink

    Iterator on the nodes of the graph (in arbitrary order).

    Iterator on the nodes of the graph (in arbitrary order).

    Definition Classes
    DepGraphE
  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final var nodes: ArrayStack[Node]

    Permalink

    Nodes of the graph.

    Nodes of the graph.

    Definition Classes
    DepGraphE
  22. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  24. final var root: Option[Node]

    Permalink

    Root node of the topological ordering of the graph

    Root node of the topological ordering of the graph

    Definition Classes
    DepGraphE
  25. final def sccs: List[List[Node]]

    Permalink

    Computes the connected components of the graph using the recursive Tarjan algorithm.

    Computes the connected components of the graph using the recursive Tarjan algorithm. The method returns a list of list of nodes representing the strongly connected components of the graph. If each scc has only one node in it, then the graph is acyclic.

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

    Permalink
    Definition Classes
    AnyRef
  27. final def toDot(filename: String, withOrderEdges: Boolean, nodeLabelFun: Option[(A) ⇒ String], edgeLabelFun: Option[(A, A) ⇒ String]): Unit

    Permalink

    Prints a dot representation of the graph using printing functions for nodes and edges provided as arguments

    Prints a dot representation of the graph using printing functions for nodes and edges provided as arguments

    Definition Classes
    DepGraphE
  28. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  29. final def topsort(): Iterator[Node]

    Permalink

    Recursive DFS topological sorting algorithm.

    Recursive DFS topological sorting algorithm.

    In this order, a node comes after all its predecessors.

    The graph must be acyclic otherwise the algorithm will compute a wrong ordering.

    After sucessfull execution, the nodes of the graph can be traversed in topological order using the inOrder method.

    Definition Classes
    DepGraphE
  30. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit

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

Inherited from DepGraphE

Inherited from AnyRef

Inherited from Any

Ungrouped