root
API
Generated with
root/org.eso.ias/org.eso.ias.cdb/org.eso.ias.cdb.topology/DasuTopology

DasuTopology

org.eso.ias.cdb.topology.DasuTopology
class DasuTopology(asces: List[AsceTopology], val id: String, val outputId: String) extends OutputProducer

The topology to forward IASIOs to ASCEs.

Objects of this class contains all information to move IASIOs (either coming from outside or produced by ACSEs) to ASCEs of the DASU and to the outside.

The topology is composed of trees of nodes. Each IASIO in input is the root of a tree i.e. the topology contains as many trees as IASIOs in input.

Each node of a tree can be a IASIO or a ASCE. A node is connected to another if:

  • an IASIO is the input of a ASCE
  • the output of a ASCE is the input of another ASCE

The inputs to the DASU are calculated from the inputs of the ASCEs running into the DASU.

The topology provides information to the DASU on how and when move IASIOs from the input to the ASCEs and from there to the outside.

The Topology is immutable.

Value parameters

asces

the ASCEs contained in the DASU

id

the identifier of the DASU

outputId

the output generated by the DASU

Attributes

Constructor

build a topology from the passed inputs and ASCEs

Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Type members

Classlikes

class Node(val id: String, val nodeType: NType, val neighbors: List[Node])

The immutable node of the graph.

The immutable node of the graph.

The identifier of the node is the ID of the IASIO either coming from plugins, other DASUs or produced by ASCEs running in this DASU.

The nodes constitute the trees of the topology

Value parameters

id

the identifier of the node

neighbors

the connected nodes

nodeType

the type of the node

Attributes

Constructor

build a node with the passed id, type and connected nodes

Supertypes
class Object
trait Matchable
class Any
object NodeType extends Enumeration

The type of the nodes of the tree

The type of the nodes of the tree

Attributes

Supertypes
class Enumeration
trait Serializable
class Object
trait Matchable
class Any
Self type
NodeType.type

Value members

Constructors

def this(dId: String, outId: String, asceDaos: List[AsceDao])

Auxiliary constructor

Auxiliary constructor

Value parameters

asceDaos

the list of ASCE DAOs running in the DASU

dId

the identifier of the DASU

outId

the identifier of the IASIO produced by the DASU

Attributes

Concrete methods

def asceProducingOutput(outputId: String): Option[String]

Return the ID of the ASCE whose output has the passed ID.

Return the ID of the ASCE whose output has the passed ID.

Value parameters

outputId

The id of the of the output

Attributes

Returns

the ID, if any, of the ASCE that produces the passed output ID

def buildLevels(): List[Set[String]]

Build the levels of ASCE to move IASIOs from one ASCE to another till the last one.

Build the levels of ASCE to move IASIOs from one ASCE to another till the last one.

Flow of IASIOs (coming from outside or generated from ASCEs running in this DASU) goes from level 0 to the last level. ASCEs at level 0 are those that depends only on output coming from outside. ASCEs at level 1 are those whose inputs come from outside or from the ASCEs in previous level) and so on.

In general ASCE at level l are those who require inputs coming from outside or generated in one of the levels [0,l-1]

Attributes

Returns

an array of identifiers of ASCEs

def cloneReplaceTree(rootNode: Node, lastNode: Node, replace: Node): Node

Clone the passed linearized tree by replace the last node with the given node.

Clone the passed linearized tree by replace the last node with the given node.

This method clones the tree whose root is rootNode till it finds lastNode. In the cloned tree lastNode is not included but replaced by the replace node.

For example, having a tree like A->B->C->D and calling this method with rootNode = A lastNode=C replace=X returns A->B->X

Value parameters

lastNode

the last node (exclusive) to copy in the cloned tree

replace

the node to replace lastNode in the cloned tree

rootNode

the root of the linearized tree to clone

Attributes

Returns

a cloned tree of rootNode where lastNode is replaced by the replace node

def isACyclic: Boolean

Check the a-cyclicity of the graph by delegating to the CyclesFinder

Check the a-cyclicity of the graph by delegating to the CyclesFinder

Attributes

def isLinearTree(node: Node): Boolean

Check if the passed tree is linear i.e. if all its nodes have at most one neighbor

Check if the passed tree is linear i.e. if all its nodes have at most one neighbor

Value parameters

node

the root of the tree to check for linearity

Attributes

Returns

true if the tree is linear

def linearizeTree(root: Node, node: Node, trees: List[Node]): List[Node]

Linearize a tree producing many trees with only one child.

Linearize a tree producing many trees with only one child.

This method transform one tree where nodes have 1-to-many neighbohrs in many trees where each node has one neighbor.

For example a tree like this, where A has 2 neighbors B and D A->B->C ->D is transformed in 2 trees: A->B->C and A->D

Value parameters

node

the accumulator i.e. the node currently checked for linearity

root

the root node of the tree

Attributes

def linearizeTrees(trees: Set[Node]): List[Node]

Normalizes the passed trees

Normalizes the passed trees

Value parameters

trees

the trees to normalize

Attributes

Returns

A set of linearized trees where each node has at most one neighbor

def printTree(node: Node): String

Create a string describing a tree

Create a string describing a tree

Value parameters

node

the root of the tree

Attributes

Returns

a String describing the tree with the passed node as root

override def toString: String

Builds a human readable string describing the topology

Builds a human readable string describing the topology

Attributes

Definition Classes
Any

Concrete fields

val asceIds: Set[String]

The Ids of the ASCEs running in the DASU

The Ids of the ASCEs running in the DASU

Attributes

val asceOutputs: Set[String]

The output produced by all ASCEs

The output produced by all ASCEs

One of The ASCE must produce the output of the DASU

Attributes

val asceTopology: Map[String, AsceTopology]

The map associating each ASCE ID to its topology

The map associating each ASCE ID to its topology

Attributes

val ascesOfInput: Map[String, Set[String]]

The IDs of the ASCEs that require an input.

The IDs of the ASCEs that require an input.

Note the this map also includes the IDs of the IASIOs produced by ASCEs in the topology that are in input to other ASCEs running in this DASU

The key is the ID of the input; the value is the list of the ACSE that require that input

Attributes

override val id: String

The ID of the producer i.e. the ID of an ASCE or a DASU

The ID of the producer i.e. the ID of an ASCE or a DASU

Attributes

override val inputsIds: Set[String]

The inputs of the DASU

The inputs of the DASU

The inputs of the DASU are all the inputs of the ASCEs running in the DASU that come from IASIO queue of the BSDB (i.e. not produced by the ASCEs running in the DASU).

Attributes

val inputsOfAsce: Map[String, Set[String]]

The IDs of the inputs of each ASCE

The IDs of the inputs of each ASCE

The key is the ID of the ASCE; the value is the set of the IDs of the inputs of the ASCE

Attributes

val levels: List[Set[String]]

The levels used to propagate inputs inside the DASU. The string in the levels(i) are the identifiers of the ASCEs belonging to that level.

The levels used to propagate inputs inside the DASU. The string in the levels(i) are the identifiers of the ASCEs belonging to that level.

In general, the ASCEs belonging to level l are those who require inputs coming from outside (IASIO queues) or generated by ASCEs belonging to the levels [0,l-1]

IASIOs from outside (i.e. red from the IASIO queues) are the inputs of ASCEs at level 0; the same IASIOs plus those generated by ASCEs at level 0 goes ASCEs at level 1 and so on.

Attributes

val linearizedTrees: List[Node]

A linearized version of the nodes in the topology:

A linearized version of the nodes in the topology:

The trees in linearizedTrees represents the same graph as in trees but where each tree has at most one neighbor.

It is a different representation of the trees but it is often easier to reason in terms of linear graphs (like lists) instead of nodes with many neighbors.

Attributes

val maxDepth: Int

The max depth of the trees in the topology

The max depth of the trees in the topology

This is the maximal number of ASCEs to activate to produce the output of the DASU.

Attributes

val minDepth: Int

The min depth of the trees in the topology

The min depth of the trees in the topology

This is the minimal number of ASCEs to activate to produce the output of the DASU.

Attributes

override val outputId: String

The ID of the output

The ID of the output

Attributes

val trees: Set[Node]
Generated with