Class/Object

ap.terfor.inequalities

IntervalProp

Related Docs: object IntervalProp | package inequalities

Permalink

class IntervalProp extends AnyRef

Interval constraint propagation (ICP) for linear inequalities.

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

Instance Constructors

  1. new IntervalProp(geqZero: IndexedSeq[LinearCombination], logger: ComputationLogger, order: TermOrder)

    Permalink

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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def boundsAsInequalities(order: TermOrder): IndexedSeq[LinearCombination]

    Permalink

    Represent all lower and upper bounds as inequalities, sorted in descending order.

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def derivedNewBounds: Boolean

    Permalink

    Could any bounds be derived that were not already known from the input?

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  13. def impliedEquations(order: TermOrder): IndexedSeq[LinearCombination]

    Permalink

    Extract equalities that are implied by the derived lower and upper bounds, sorted in descending order.

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. def lowerBounds: Map[Term, IdealInt]

    Permalink

    All derived lower bounds of VariableTerm and ConstantTerm.

    All derived lower bounds of VariableTerm and ConstantTerm.

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  21. def updatedBoundsAsInequalities(order: TermOrder): IndexedSeq[LinearCombination]

    Permalink

    Represent lower and upper bounds that were not already present in the input as inequalities, sorted in descending order.

  22. def upperBounds: Map[Term, IdealInt]

    Permalink

    All derived upper bounds of VariableTerm and ConstantTerm.

    All derived upper bounds of VariableTerm and ConstantTerm.

  23. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped