Trait

old

CardinalityTheorySim

Related Doc: package old

Permalink

trait CardinalityTheorySim extends CardinalityTheory

Self Type
CardinalityTheorySim with Parsing with SMTTranslation with SubstitutionAnalyzerSim with STMDDBuilderSim
Linear Supertypes
CardinalityTheory, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CardinalityTheorySim
  2. CardinalityTheory
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

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

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

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

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def computeCard(choice: Map[CompInstanceIdent, CompAlternative]): CardMeasure

    Permalink

    compute the cardinality of a substitution choice

    compute the cardinality of a substitution choice

    choice

    the substitution choice

    returns

    the over, under and exact cardinality (if computable)

    Definition Classes
    CardinalityTheory
  7. def computeCardRec(node: ((CardinalityTheorySim.this)#mddFactory)#MDD, choice: Map[CompInstanceIdent, CompAlternative]): CardMeasure

    Permalink

    Recursively compute the cardinality of a mdd node according to a substitution choice which is card(node)=min_{s \in node.kids} (card(s.tr,choice(node))+card(s.son))

    Recursively compute the cardinality of a mdd node according to a substitution choice which is card(node)=min_{s \in node.kids} (card(s.tr,choice(node))+card(s.son))

    node

    mdd node

    choice

    substitution chocie

    returns

    the over, under and exact cardinality (if computable)

    Definition Classes
    CardinalityTheory
  8. val enumVarSafeCardCache: HashMap[PathIdentType, SubstitutionVar]

    Permalink
    Definition Classes
    CardinalityTheory
  9. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    Permalink
    Definition Classes
    Any
  15. def isSafeCard(obj: Int, model: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink

    cardinality theory which returns for a given substitution choice, the status and the propogation and conflicts.

    cardinality theory which returns for a given substitution choice, the status and the propogation and conflicts. The theory try to dispatch on the trace tree a budget corresponding to the cardinality requirement. For cardinality since card(node)=min_{s \in node.kids} (card(s)+card(tr_{node \to s})), then if one path does not fulfill the requirement then the candidate does not fill the requirement. Since the substitution choice is not always complete, an over and under approximations of the budget are computed at each step.

    obj

    cardinality requirement

    model

    subsitution choice

    returns

    the status of the dispatch operation and the conflicts/propagations

    Definition Classes
    CardinalityTheory
  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  21. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from CardinalityTheory

Inherited from AnyRef

Inherited from Any

Ungrouped