Class/Object

ap.terfor.equations

ReduceWithEqs

Related Docs: object ReduceWithEqs | package equations

Permalink

class ReduceWithEqs extends AnyRef

Reduce a term (currently: a linear combination) by rewriting with equations. The equations have to be given in form of a mapping from atomic terms (constants or variables) to linear combinations

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ReduceWithEqs
  2. AnyRef
  3. 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. def addEquations(furtherEqs: Map[Term, LinearCombination]): ReduceWithEqs

    Permalink
  5. def apply(conj: PredConj, logger: ComputationLogger): PredConj

    Permalink
  6. def apply(conj: PredConj): PredConj

    Permalink
  7. def apply(conj: InEqConj, logger: ComputationLogger): InEqConj

    Permalink
  8. def apply(conj: InEqConj): InEqConj

    Permalink
  9. def apply(conj: NegEquationConj, logger: ComputationLogger): NegEquationConj

    Permalink
  10. def apply(conj: NegEquationConj): NegEquationConj

    Permalink
  11. def apply(conj: EquationConj): EquationConj

    Permalink
  12. def apply(lc: LinearCombination, terms: Buffer[(IdealInt, LinearCombination)]): LinearCombination

    Permalink
  13. def apply(lc: LinearCombination): LinearCombination

    Permalink
  14. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. final def eq(arg0: AnyRef): Boolean

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  21. def isEmpty: Boolean

    Permalink
  22. final def isInstanceOf[T0]: Boolean

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

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

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

    Permalink
    Definition Classes
    AnyRef
  26. def passQuantifiers(num: Int): ReduceWithEqs

    Permalink

    Create a ReduceWithEqs that can be used underneath num binders.

    Create a ReduceWithEqs that can be used underneath num binders. The conversion of de Brujin-variables is done on the fly, which should give a good performance when the resulting ReduceWithEqs is not applied too often (TODO: caching)

  27. def pseudoReduce(lc: LinearCombination): LinearCombination

    Permalink

    Same as apply(lc:LinearCombination), but also multiply <cocde>lc with integers in case this allows to eliminate the leading term (pseudo-division). It is ensured that the resulting LinearCombination has a positive leading coefficient

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

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped