IntSetConst

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def :+= (i: Int): Unit

def :-= (i: Int): Unit

def := (v: SortedSet[Int]): Unit

We suppose that the new value is not the same as the actual value.

def < (that: DAGNode): Boolean

def <= (that: DAGNode): Boolean

def <== (i: IntSetInvariant): Unit

Use this to specify that the IntSetVar is the output of the IntSetInvariant

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def > (that: DAGNode): Boolean

def >= (that: DAGNode): Boolean

val ConstValue : SortedSet[Int]

var DefiningInvariant : Invariant

var DeterminingElements : List[PropagationElement]

val DynamicallyListenedElements : PermaFilteredDoublyLinkedList[PropagationElement]

var DynamicallyListenedElementsFromSameComponent : PermaFilteredDoublyLinkedList[PropagationElement]

val DynamicallyListeningElements : PermaFilteredDoublyLinkedList[(PropagationElement, Any)]

var DynamicallyListeningElementsFromSameComponent : PermaFilteredDoublyLinkedList[(PropagationElement, Any)]

var InOneComponent : Boolean

var Index : Int

def InitiateDynamicGraphFromSameComponent (): Unit

var IsBoundary : Boolean

set to true if the PropagationElement is one that can break or make dependency cycles in the dynamic dependency graph managed by the PropagationComponent basically, set to true if the determiningElement is not in the same component and if this PropagationElement belongs to a cycle in the static dependency graph

var LowLink : Int

var OnStack : Boolean

var Position : Int

the position in the topological sort

var StaticallyListenedElements : List[PropagationElement]

var StaticallyListeningElements : List[PropagationElement]

var TouchedValues : List[Int]

The values that have bee impacted since last propagation was performed.

var UniqueID : Int

it gives the unique ID of the PropagationElement.

def asInstanceOf [T0] : T0

def canEqual (arg0: Any): Boolean

def checkInternals (): Unit

This is the debug procedure through which propagation element can redundantly check that the incremental computation they perform through the performPropagation method is correct overriding this method is optional, so an empty body is provided by default

def clone (): AnyRef

def compare (that: DAGNode): Int

def compareTo (that: DAGNode): Int

var component : StrognlyConnexComponent

this refers to the propagationComponent that contains the PropagationElement.

def decrementAndAccumulateFront (acc: List[PropagationElement]): List[PropagationElement]

def decrementSucceedingAndAccumulateFront (acc: List[PropagationElement]): List[PropagationElement]

def deleteValue (v: Int): Unit

def determineBoundary (): Unit

this sets the value of IsBoundary according to the definition of this variable

def dropStaticGraph (): Unit

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def finalize (): Unit

def getClass (): java.lang.Class[_]

def getDAGPrecedingNodes : Iterable[DAGNode]

def getDAGSucceedingNodes : Iterable[DAGNode]

def getDefiningInvariant : Invariant

def getDeterminingElements : Iterable[PropagationElement]

the variable that influence on the dependencies of the proapgation element these are propagated first to constitute the dynamic propagatoin graph

def getDotColor : String

def getDotNode : String

This returns the dot node to display on the DOT output for the node.

def getDynamicallyListenedElements : Iterable[PropagationElement]

def getDynamicallyListeningElements : Iterable[(PropagationElement, Any)]

def getMaxVal : Int

def getMinVal : Int

def getModel : Model

def getPropagationStructure : Model

returns a reference to the propagationStructure where the PropagationElement is registered

def getStaticallyListenedElements : Iterable[PropagationElement]

through this method, the PropagationElement must declare which PropagationElement it is listening to in the static dependency graph.

def getStaticallyListeningElements : Iterable[PropagationElement]

through this method, the PropagationElement must declare which PropagationElement listen to it in the static dependency graph.

def getValue (NewValue: Boolean = false): SortedSet[Int]

def hashCode (): Int

def insertValue (v: Int): Unit

def isInstanceOf [T0] : Boolean

var isScheduled : Boolean

set to true if the PropagationElement is scheduled for propagation, false otherwise.

val model : Model

val name : String

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

def notifyChanged (): Unit

this method s to be called by any method that internally modifies the value of the variable it schedules the variable for propagation, and performs a basic check of the identify of the executing invariant

def performPropagation (): Unit

this is the propagation method that should be overridden by propagation elements.

def productArity : Int

def productElement (arg0: Int): Any

def productIterator : Iterator[Any]

def productPrefix : String

def propagate (): Unit

Performs the propagation, and some bookkeeping around it.

def registerDeterminingElement (p: PropagationElement, i: Any): Unit

must belong to the statically listened elements.

def registerDynamicallyListenedElement (p: PropagationElement, i: Any): KeyForElementRemoval

this registers to the element in the dynbamic propagation graph.

def registerStaticallyListenedElement (p: PropagationElement): Unit

registers an element in the static dependency graph.

def scheduleForPropagation (): Unit

to invoque to force inclusion of the propagation element in the current or next propagation wave.

def setCounterToPrecedingCount (): Boolean

Sets the Position oto the number of element that need to be decremented, not belonging to same connex component for connex component, set it to the number of element that are referenced from othercomponents

def setDefiningInvariant (i: Invariant): Unit

def setValue (v: SortedSet[Int]): Unit

We suppose that the new value is not the same as the actual value.

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

def toString (): String

def unregisterDynamicallyListenedElement (p: KeyForElementRemoval): Unit

unregisters an element in the dynamic propagation graph.

var visited : Boolean

supposed to be false between each pass of the algorithm

var visited2 : Boolean

def wait (): Unit

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

def wait (arg0: Long): Unit

def productElements : Iterator[Any]