DefinitionOrdering

de.uni_luebeck.isp.tessla.tessla_compiler.DefinitionOrdering$

Class for calculating a topological sorting on the assignments inside functions and specifications so they can be translated to imperative code

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

def order(input: Map[Identifier, DefinitionExpression]): Seq[(Identifier, DefinitionExpression)]

Orders a Map Identifier -> Defining expression to a sequence s.t. every variable is assigned before it is used Exceptions exist for identifiers which have last/delay expressions assigned since they may cause recursions

Orders a Map Identifier -> Defining expression to a sequence s.t. every variable is assigned before it is used Exceptions exist for identifiers which have last/delay expressions assigned since they may cause recursions

Attributes

input

The map Identifier -> Defining to be sorted

Returns:

The Identifier -> Defining mappings in an ordered sequence