SimpleGraphEquationSystem

Instance Constructors

new SimpleGraphEquationSystem(unknowns: Iterable[U], inputUnknowns: Set[U], edgeAction: (Assignment[U, V]) ⇒ (E) ⇒ V, sources: (E) ⇒ Iterable[U], target: (E) ⇒ U, outgoing: (U) ⇒ Iterable[E], ingoing: (U) ⇒ Iterable[E], initial: Assignment[U, V])(implicit arg0: Domain[V])

Abstract Value Members

abstract val bodyWithDependencies: (Assignment[U, V]) ⇒ Assignment[U, (V, Iterable[U])]

Given an assignment rho and unknown u, returns the pair (body(rho)(x), uks).
Given an assignment rho and unknown u, returns the pair (body(rho)(x), uks). uks is a set of unknowns with the property that if rho' differs from rho only for variables which are not in uks, then body(rho)(u)==body(rho')(u).

Definition Classes
EquationSystem
abstract val infl: Relation[U]

The static relation between an unknown x and the unknowns y it influences.
The static relation between an unknown x and the unknowns y it influences. If infl(x) does not contain y, it means that eqs(rho)(y) == eqs(rho')(y), when rho' = rho[x / eqs(rho)(x)].

Definition Classes
FiniteEquationSystem

Concrete Value Members

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
val body: Body[U, V]

Definition Classes
BodyFromEdgeAction
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
implicit val dom: Domain[V]

Definition Classes
GraphEquationSystem
val edgeAction: (Assignment[U, V]) ⇒ (E) ⇒ V

A function which, given an assignment and edge, returns the output value of the edge.
A function which, given an assignment and edge, returns the output value of the edge.

Definition Classes
SimpleGraphEquationSystem → GraphEquationSystem
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
val ingoing: (U) ⇒ Iterable[E]

Maps each unknown to the collection of edges arriving on it.
Maps each unknown to the collection of edges arriving on it.

Definition Classes
SimpleGraphEquationSystem → GraphEquationSystem
val initial: Assignment[U, V]

An initial value for starting the analyzer
An initial value for starting the analyzer

Definition Classes
SimpleGraphEquationSystem → EquationSystem
val inputUnknowns: Set[U]

The unknowns which may be considered the input to this equation system.
The unknowns which may be considered the input to this equation system.

Definition Classes
SimpleGraphEquationSystem → FiniteEquationSystem → EquationSystem
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val outgoing: (U) ⇒ Iterable[E]

Maps each unknown to the collection of edges departing from it.
Maps each unknown to the collection of edges departing from it.

Definition Classes
SimpleGraphEquationSystem → GraphEquationSystem
val sources: (E) ⇒ Iterable[U]

Maps each edge to its sources unknown.
Maps each edge to its sources unknown.

Definition Classes
SimpleGraphEquationSystem → GraphEquationSystem
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val target: (E) ⇒ U

Maps each edge to its target unknown.
Maps each edge to its target unknown.

Definition Classes
SimpleGraphEquationSystem → GraphEquationSystem
def toString(): String

Definition Classes
AnyRef → Any
val unknowns: Iterable[U]

The collection of all unknowns.
The collection of all unknowns.

Definition Classes
SimpleGraphEquationSystem → FiniteEquationSystem
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
def withBaseAssignment(init: PartialFunction[U, V])(implicit magma: Magma[V]): FiniteEquationSystem[U, V]

Definition Classes
WithBaseAssignment
def withBoxes(boxes: BoxAssignment[U, V]): FiniteEquationSystem[U, V]

Definition Classes
WithBoxes
def withLocalizedBoxes(boxes: BoxAssignment[U, V], ordering: Ordering[U]): GraphEquationSystem[U, V, E]

Definition Classes
WithLocalizedBoxes
def withLocalizedWarrowing(widenings: BoxAssignment[U, V], narrowings: BoxAssignment[U, V], ordering: Ordering[U]): FiniteEquationSystem[U, V]

Definition Classes
WithLocalizedBoxes

Related Doc: package GraphEquationSystem

abstract class SimpleGraphEquationSystem[U, V, E] extends GraphEquationSystem[U, V, E] with WithBaseAssignment[U, V] with WithBoxes[U, V] with BodyFromEdgeAction[U, V, E] with WithLocalizedBoxes[U, V, E]

Instance Constructors

new SimpleGraphEquationSystem(unknowns: Iterable[U], inputUnknowns: Set[U], edgeAction: (Assignment[U, V]) ⇒ (E) ⇒ V, sources: (E) ⇒ Iterable[U], target: (E) ⇒ U, outgoing: (U) ⇒ Iterable[E], ingoing: (U) ⇒ Iterable[E], initial: Assignment[U, V])(implicit arg0: Domain[V])

Abstract Value Members

abstract val bodyWithDependencies: (Assignment[U, V]) ⇒ Assignment[U, (V, Iterable[U])]

abstract val infl: Relation[U]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

val body: Body[U, V]

def clone(): AnyRef

implicit val dom: Domain[V]

val edgeAction: (Assignment[U, V]) ⇒ (E) ⇒ V

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

val ingoing: (U) ⇒ Iterable[E]

val initial: Assignment[U, V]

val inputUnknowns: Set[U]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val outgoing: (U) ⇒ Iterable[E]

val sources: (E) ⇒ Iterable[U]

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

val target: (E) ⇒ U

def toString(): String

val unknowns: Iterable[U]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withBaseAssignment(init: PartialFunction[U, V])(implicit magma: Magma[V]): FiniteEquationSystem[U, V]

def withBoxes(boxes: BoxAssignment[U, V]): FiniteEquationSystem[U, V]

def withLocalizedBoxes(boxes: BoxAssignment[U, V], ordering: Ordering[U]): GraphEquationSystem[U, V, E]

def withLocalizedWarrowing(widenings: BoxAssignment[U, V], narrowings: BoxAssignment[U, V], ordering: Ordering[U]): FiniteEquationSystem[U, V]

Inherited from WithLocalizedBoxes[U, V, E]

Inherited from BodyFromEdgeAction[U, V, E]

Inherited from WithBoxes[U, V]

Inherited from WithBaseAssignment[U, V]

Inherited from GraphEquationSystem[U, V, E]

Inherited from FiniteEquationSystem[U, V]

Inherited from EquationSystem[U, V]

Inherited from AnyRef

Inherited from Any

Ungrouped