Object/Class

ap.terfor.inequalities

InEqConj

Related Docs: class InEqConj | package inequalities

Permalink

object InEqConj

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InEqConj
  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. val AC: AC_INEQUALITIES.type

    Permalink
  5. val FALSE: InEqConj

    Permalink
  6. val INF_STOP_THRESHOLD: Int

    Permalink
  7. val INF_THROTTLE_THRESHOLD: Int

    Permalink

    When computing the inferences for a given set of inequalities, throttle the number of inferences that are stored for each leading term as soon as INEQ_INFS_THRESHOLD has been reached, which is then restricted to THROTTLED_INF_NUM.

    When computing the inferences for a given set of inequalities, throttle the number of inferences that are stored for each leading term as soon as INEQ_INFS_THRESHOLD has been reached, which is then restricted to THROTTLED_INF_NUM. Once the hard limit INF_STOP_THRESHOLD is reached for a particular leading term, generation of inferences for that term is stopped altogether.

  8. val THROTTLED_INF_NUM: Int

    Permalink
  9. val TRUE: InEqConj

    Permalink
  10. object UNSATISFIABLE_INEQ_EXCEPTION extends Exception

    Permalink
  11. def apply(lhs: LinearCombination, order: TermOrder): InEqConj

    Permalink
  12. def apply(lhss: Iterable[LinearCombination], order: TermOrder): InEqConj

    Permalink

    Create an inequality conjunction from an arbitrary set of geq-zero-inequalities (left-hand sides).

  13. def apply(lhss: Iterator[LinearCombination], order: TermOrder): InEqConj

    Permalink
  14. def apply(lhss: Iterator[LinearCombination], logger: ComputationLogger, order: TermOrder): InEqConj

    Permalink

    Create an inequality conjunction from an arbitrary set of geq-zero-inequalities (left-hand sides).

  15. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. def conj(conjs: Iterable[InEqConj], order: TermOrder): InEqConj

    Permalink

    Compute the conjunction of a number of inequality conjunctions.

  18. def conj(conjs: Iterator[InEqConj], order: TermOrder): InEqConj

    Permalink
  19. def conj(conjs: Iterator[InEqConj], logger: ComputationLogger, order: TermOrder): InEqConj

    Permalink

    Compute the conjunction of a number of inequality conjunctions.

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  22. def exactShadow(t: Term, inEqs: Seq[LinearCombination], logger: ComputationLogger, order: TermOrder): (Seq[LinearCombination], Seq[LinearCombination])

    Permalink

    Perform Fourier-Motzkin elimination on one particular symbol t.

    Perform Fourier-Motzkin elimination on one particular symbol t. The result is the collection of eliminated inequalities, and the collection of remaining inequalities (including inferences from the removed inequalities). If an unsatisfiable inequality is derived, the exception UNSATISFIABLE_INEQ_EXCEPTION is thrown.

  23. def finalize(): Unit

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  30. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped