apps.optimization

ServiceNetwork

class ServiceNetwork extends ColorDAG

This class is used for optimizing service networks.

Linear Supertypes
ColorDAG, Error, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ServiceNetwork
  2. ColorDAG
  3. Error
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ServiceNetwork(dimensions: Array[Int], maxIn: Int, maxOut: Int, minColors: Int, maxColors: Int, colorDepth: Int, seed: Int, maxUnits: Int = 5, maxCost: Int = 5)

    dimensions

    the dimension (number of nodes) for each stage

    maxIn

    the maximum number of input colors for an internal node

    maxOut

    the maximum number of output colors for an internal node

    minColors

    the minimum number of child colors allowed in the color hierarchy

    maxColors

    the maximum number of child colors allowed in the color hierarchy

    colorDepth

    the maximum depth of the color hierarchy tree

    seed

    the seed for the various random number generators

    maxCost

    the maximum cost for a node's service

Type Members

  1. class DagNode extends AnyRef

    This innner class holds information about a node in the DAG.

  2. class Edge extends AnyRef

    This class is used to connect two nodes.

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. def animateDAG: Unit

    Animate the color DAG.

    Animate the color DAG.

    Definition Classes
    ColorDAG
  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. def checkIO(): Int

    For each node in the DAG, check that (1) all of its "inputs" are color/type compatible with an output from a node from the previous stage, and (2) at least one of its "outputs" is color/type compatible with an input to a node from the next stage.

    For each node in the DAG, check that (1) all of its "inputs" are color/type compatible with an output from a node from the previous stage, and (2) at least one of its "outputs" is color/type compatible with an input to a node from the next stage. Nodes that fails to have all of their inputs satified (check number 1) are thrown out before check if they have at least one useful output. Nodes failing check number 2 will also be thrown out.

    Definition Classes
    ColorDAG
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. val colors: ColorTree

    Definition Classes
    ColorDAG
  9. def connect(): Unit

    Connect all the nodes that are going to be "used" in the DAG by creating an edge between two nodes in adjacent stages that are color/type compatible.

    Connect all the nodes that are going to be "used" in the DAG by creating an edge between two nodes in adjacent stages that are color/type compatible. Also add these edges to the DAG's list of edges.

    Definition Classes
    ColorDAG
  10. val cost: HashMap[Int, Int]

  11. val edges: ListBuffer[Edge]

    Definition Classes
    ColorDAG
  12. final def eq(arg0: AnyRef): Boolean

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

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

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. def flaw(method: String, message: String): Unit

    Show the flaw by printing the error message.

    Show the flaw by printing the error message.

    method

    the method where the error occurred

    message

    the error message

    Definition Classes
    Error
  16. def genNodes(): Unit

    Generate all the unique nodes that will exist in the DAG and assign colors/types to their inputs and outputs.

    Generate all the unique nodes that will exist in the DAG and assign colors/types to their inputs and outputs.

    Definition Classes
    ColorDAG
  17. def genUniqueColor(ioColors: Array[TreeNode]): TreeNode

    Generate and return a unique color for either a node's inputs or outputs.

    Generate and return a unique color for either a node's inputs or outputs.

    ioColors

    the array of existing colors

    Definition Classes
    ColorDAG
  18. final def getClass(): Class[_]

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

    Definition Classes
    AnyRef → Any
  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  21. val nColors: Int

    Definition Classes
    ColorDAG
  22. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  23. val nodes: Array[Array[DagNode]]

    Definition Classes
    ColorDAG
  24. final def notify(): Unit

    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  26. def popInOut(): Unit

    Populate the in and out ListBuffers for each node based on the DAG's list of edges.

    Populate the in and out ListBuffers for each node based on the DAG's list of edges.

    Definition Classes
    ColorDAG
  27. def printColorTree: Unit

    Print the ColorTree used by the DAG for node and edge colors/type and animate its construction.

    Print the ColorTree used by the DAG for node and edge colors/type and animate its construction.

    Definition Classes
    ColorDAG
  28. def printColors: Unit

    Print the in (for inputs) and out (for outputs) colors for each node in the DAG.

    Print the in (for inputs) and out (for outputs) colors for each node in the DAG.

    Definition Classes
    ColorDAG
  29. def printDAG: Unit

    Print the nodes and edges in the color DAG.

    Print the nodes and edges in the color DAG.

    Definition Classes
    ColorDAG
  30. def printInOut: Unit

    Print the in (for inputs) and out (for outputs) node list buffers for each used node in the DAG.

    Print the in (for inputs) and out (for outputs) node list buffers for each used node in the DAG.

    Definition Classes
    ColorDAG
  31. val randCol: Randi

    Definition Classes
    ColorDAG
  32. val randCost: Randi

  33. val randIn: Randi

    Definition Classes
    ColorDAG
  34. val randOut: Randi

    Definition Classes
    ColorDAG
  35. val randUnit: Randi

  36. def setCosts(): Unit

    Set the costs and associated production parameters.

  37. val stages: Int

    Definition Classes
    ColorDAG
  38. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  39. def toString(): String

    Definition Classes
    AnyRef → Any
  40. val unit: HashMap[Int, Int]

  41. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from ColorDAG

Inherited from Error

Inherited from AnyRef

Inherited from Any

Ungrouped