Class

ap.terfor.inequalities

ReduceWithEmptyInEqs

Related Doc: package inequalities

Permalink

class ReduceWithEmptyInEqs extends ReduceWithInEqs

The implementation for the trivial case that there are no inequalities (this is realised as an own class for performance reasons)

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

Instance Constructors

  1. new ReduceWithEmptyInEqs(order: TermOrder)

    Permalink
    Attributes
    protected[ap.terfor.inequalities]

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 addInEqs(furtherInEqs: InEqConj): ReduceWithInEqs

    Permalink
    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

  5. 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.

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

  6. 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.

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

  7. def apply(conj: EquationConj): EquationConj

    Permalink
    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

  8. 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.

    Definition Classes
    ReduceWithInEqs

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  10. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()

  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    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.

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

  17. 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.

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

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

    Permalink
    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

  21. 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)

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

  22. 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)

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

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

    Permalink
    Definition Classes
    AnyRef

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    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.

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

  26. 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.

    Definition Classes
    ReduceWithEmptyInEqs → ReduceWithInEqs

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

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

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

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

  29. 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 ReduceWithInEqs

Inherited from AnyRef

Inherited from Any

Ungrouped