Class/Object

ap.terfor.inequalities

ReduceWithInEqs

Related Docs: object ReduceWithInEqs | package inequalities

Permalink

abstract class ReduceWithInEqs extends AnyRef

Reduce certain terms or formulas drawing information from inequalities that are assumed as facts.

Linear Supertypes
AnyRef, Any
Known Subclasses
ReduceWithEmptyInEqs, ReduceWithInEqsImpl
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReduceWithInEqs
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ReduceWithInEqs()

    Permalink

Abstract Value Members

  1. abstract def addInEqs(furtherInEqs: InEqConj): ReduceWithInEqs

    Permalink

  2. abstract def apply(conj: InEqConj): InEqConj

    Permalink

    Reduce a conjunction of inequalities.

    Reduce a conjunction of inequalities. This means that subsumed inequalities are removed, contradictions are detected, and possibly further equations are inferred.

  3. abstract def apply(conj: NegEquationConj, logger: ComputationLogger): (NegEquationConj, InEqConj)

    Permalink

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway.

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway. This will also turn disequalities into inequalities if possible.

  4. abstract def apply(conj: EquationConj): EquationConj

    Permalink

  5. abstract def lowerBound(t: Term): Option[IdealInt]

    Permalink

    Check whether the known inequalities imply a lower bound of the given term.

  6. abstract def lowerBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

    Permalink

    Check whether the known inequalities imply a lower bound of the given term.

    Check whether the known inequalities imply a lower bound of the given term. Also return assumed inequalities needed to derive the bound.

  7. abstract def passQuantifiers(num: Int): ReduceWithInEqs

    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)

  8. abstract def reduceNoEqualityInfs(conj: InEqConj): InEqConj

    Permalink

    Reduce a conjunction of inequalities without implied equations.

    Reduce a conjunction of inequalities without implied equations. (i.e., conj.equalityInfs.isEmpty)

  9. abstract def upperBound(t: Term): Option[IdealInt]

    Permalink

    Check whether the known inequalities imply an upper bound of the given term.

  10. abstract def upperBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

    Permalink

    Check whether the known inequalities imply an upper bound of the given term.

    Check whether the known inequalities imply an upper bound of the given term. Also return assumed inequalities needed to derive the bound.

Concrete 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 apply(conj: NegEquationConj): (NegEquationConj, InEqConj)

    Permalink

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway.

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway. This will also turn disequalities into inequalities if possible.

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @throws( ... )

  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()

  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

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

    Permalink
    Definition Classes
    AnyRef

  16. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

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

  18. final def wait(arg0: Long): Unit

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

  19. final def wait(): Unit

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

Deprecated Value Members

  1. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from AnyRef

Inherited from Any

Ungrouped