Class/Object

ap.terfor.conjunctions

ReduceWithConjunction

Related Docs: object ReduceWithConjunction | package conjunctions

Permalink

class ReduceWithConjunction extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ReduceWithConjunction
  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 apply(conj: ArithConj): ArithConj

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

    Permalink
  6. def apply(conjs: NegatedConjunctions): NegatedConjunctions

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

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

    Permalink
  9. final def asInstanceOf[T0]: T0

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    Any
  17. def lowerBound(t: Term, withAssumptionInEqs: Boolean): Option[(IdealInt, Seq[InEqConj])]

    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. If withAssumptionInEqs is set, also return the assumed inequalities needed for the bound.

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

    Permalink

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  23. def passQuantifiers(num: Int): ReduceWithConjunction

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

    Permalink
    Definition Classes
    AnyRef
  25. def tentativeReduce(conj: Conjunction): Conjunction

    Permalink

    Check whether conj can be simplified with the help of assumed knowledge/facts.

    Check whether conj can be simplified with the help of assumed knowledge/facts. If yes, conj will be fully reduced, otherwise conj will be returned unchanged.

  26. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  27. def upperBound(t: Term, withAssumptionInEqs: Boolean): Option[(IdealInt, Seq[InEqConj])]

    Permalink

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

    Check whether the known inequalities imply a upper bound of the given term. If withAssumptionInEqs is set, also return the assumed inequalities needed for the bound.

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

    Permalink

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

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

  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( ... )
  33. lazy val withoutFacts: ReduceWithConjunction

    Permalink

    A reducer corresponding to this one, but without assuming any facts known a priori.

Inherited from AnyRef

Inherited from Any

Ungrouped