Class/Object

ap.terfor.substitutions

PseudoConstantSubst

Related Docs: object PseudoConstantSubst | package substitutions

Permalink

class PseudoConstantSubst extends PseudoDivSubstitution

Replace a constant with an arbitrary term

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PseudoConstantSubst
  2. PseudoDivSubstitution
  3. Substitution
  4. Sorted
  5. Function1
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new PseudoConstantSubst(coeff: IdealInt, constant: ConstantTerm, replacement: Term, order: TermOrder)

    Permalink

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. def andThen[A](g: (TerFor) ⇒ A): (TerFor) ⇒ A

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def apply(lc: LinearCombination): LinearCombination

    Permalink
    Definition Classes
    PseudoDivSubstitutionSubstitution
  6. def apply(t: Term): Term

    Permalink

    Application to terms is not supported, because it would not be possible to do pseudo-division

    Application to terms is not supported, because it would not be possible to do pseudo-division

    Definition Classes
    PseudoDivSubstitutionSubstitution
  7. def apply(conj: PredConj): PredConj

    Permalink
    Definition Classes
    Substitution
  8. def apply(a: Atom): Atom

    Permalink
    Definition Classes
    Substitution
  9. def apply(conjs: NegatedConjunctions): NegatedConjunctions

    Permalink
    Definition Classes
    Substitution
  10. def apply(conj: Conjunction): Conjunction

    Permalink
    Definition Classes
    Substitution
  11. def apply(conj: ArithConj): ArithConj

    Permalink
    Definition Classes
    Substitution
  12. def apply(conj: InEqConj): InEqConj

    Permalink
    Definition Classes
    Substitution
  13. def apply(negConj: NegEquationConj): NegEquationConj

    Permalink
    Definition Classes
    Substitution
  14. def apply(conj: EquationConj): EquationConj

    Permalink
    Definition Classes
    Substitution
  15. def apply(f: Formula): Formula

    Permalink
    Definition Classes
    Substitution
  16. final def apply(t: TerFor): TerFor

    Permalink
    Definition Classes
    Substitution → Function1
  17. def applyToConstant(c: ConstantTerm): (IdealInt, Term)

    Permalink
    Attributes
    protected[ap.terfor.substitutions]
    Definition Classes
    PseudoConstantSubstPseudoDivSubstitution
  18. def applyToVariable(v: VariableTerm): (IdealInt, Term)

    Permalink

    The subclasses can specify both the coefficient of the variable or constant that is supposed to be replaced and the actual replacement.

    The subclasses can specify both the coefficient of the variable or constant that is supposed to be replaced and the actual replacement. I.e., for applyToVariable(v)==(n, t) the described substitution is n * v |-> t

    Attributes
    protected[ap.terfor.substitutions]
    Definition Classes
    PseudoConstantSubstPseudoDivSubstitution
  19. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. def compose[A](g: (A) ⇒ TerFor): (A) ⇒ TerFor

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  22. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    Permalink
    Definition Classes
    Any
  28. final def isSortedBy(otherOrder: TermOrder): Boolean

    Permalink

    Compare the order of this Substitution with a given order.

    Compare the order of this Substitution with a given order. We use equality here, because the behaviour would be quite confusing with the relation isSubOrderOf (remember that the substitution has to cope with arbitrary terms/formulas that are sorted by the order)

    Definition Classes
    SubstitutionSorted
  29. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  32. val order: TermOrder

    Permalink

    The term order that is used for the resulting terms or formulas.

    The term order that is used for the resulting terms or formulas. We require that a substitution is only applied to terms/formulas that are already sorted according to this order

    Attributes
    protected[ap.terfor.substitutions]
    Definition Classes
    PseudoConstantSubstSubstitution
  33. def passQuantifiers(num: Int): Substitution

    Permalink

    Substitution that is to be used underneath num quantifiers.

    Substitution that is to be used underneath num quantifiers. Because we use De Bruijn indexes, passing quantifiers shifts the variables in a substitution

    Attributes
    protected[ap.terfor.substitutions]
    Definition Classes
    PseudoConstantSubstSubstitution
  34. def pseudoApply(lc: LinearCombination): LinearCombination

    Permalink

    Some kinds of substitutions can only be applied when pseudo-reduction is allowed to be performed.

    Some kinds of substitutions can only be applied when pseudo-reduction is allowed to be performed. Implementations of the following method are allowed to multiply lc with arbitrary positive integers to achieve this.

    Attributes
    protected[ap.terfor.substitutions]
    Definition Classes
    PseudoDivSubstitutionSubstitution
  35. def sortBy(newOrder: TermOrder): PseudoConstantSubst

    Permalink

    Re-sort an object with a new TermOrder.

    Re-sort an object with a new TermOrder. It is guaranteed that the result isSortedBy(order)

    Definition Classes
    PseudoConstantSubstSorted
  36. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink
    Definition Classes
    PseudoConstantSubst → Function1 → AnyRef → Any
  38. final def wait(): Unit

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

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

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

Inherited from PseudoDivSubstitution

Inherited from Substitution

Inherited from Sorted[Substitution]

Inherited from (TerFor) ⇒ TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped