Class

ap.theories.nia

IntervalSet

Related Doc: package nia

Permalink

class IntervalSet extends AnyRef

Main class for interval constraint propagation.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IntervalSet
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IntervalSet(equations: Seq[(Polynomial, BitSet)], oriInEqs: Seq[(Polynomial, BitSet)], negEqs: Seq[(Polynomial, BitSet)], basicBounds: Seq[(LinearCombination, BitSet)])

    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 clone(): AnyRef

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def getAllIntervals: List[(ConstantTerm, Interval, (BitSet, BitSet, BitSet))]

    Permalink
  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  11. def getGaps: List[(ConstantTerm, Interval, BitSet)]

    Permalink
  12. def getInconsistency: Option[(ConstantTerm, Interval, BitSet)]

    Permalink
  13. def getIntervals: List[(ConstantTerm, Interval, (Boolean, Boolean, Boolean), (BitSet, BitSet, BitSet))]

    Permalink
  14. def getLabelledTermInterval(ct: ConstantTerm): (Interval, (BitSet, BitSet, BitSet))

    Permalink

    Get the interval known for a variable.

    Get the interval known for a variable. The second component specifies lower/upper/gap assumption

  15. def getTermInterval(ct: ConstantTerm): Interval

    Permalink
  16. def getTermIntervalOption(ct: ConstantTerm): Option[Interval]

    Permalink
  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  18. val inEqs: IndexedSeq[(Polynomial, BitSet)]

    Permalink
  19. def intWithLabel(lower: (IntervalInt, BitSet), upper: (IntervalInt, BitSet)): (Interval, BitSet)

    Permalink
  20. val intervals: LinkedHashMap[ConstantTerm, (Interval, (Boolean, Boolean, Boolean), (BitSet, BitSet, BitSet))]

    Permalink
  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  22. def lowerLimit(p: Polynomial): (IntervalInt, BitSet)

    Permalink
  23. def lowerLimit(t: CoeffMonomial): (IntervalInt, BitSet)

    Permalink
  24. def lowerLimit(m: Monomial): (IntervalInt, BitSet)

    Permalink

    Lower Limit functions

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

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

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

    Permalink
    Definition Classes
    AnyRef
  28. def propagateGreaterThan(term: CoeffMonomial, ct: ConstantTerm, exp: Int, divMon: Monomial, rhs: Polynomial): (Interval, (BitSet, BitSet, BitSet))

    Permalink

    Propagation functions

  29. def propagateIneq(p: Polynomial, pLabel: BitSet): Unit

    Permalink
  30. def propagateLessThan(term: CoeffMonomial, ct: ConstantTerm, exp: Int, divMon: Monomial, rhs: Polynomial): (Interval, (BitSet, BitSet, BitSet))

    Permalink
  31. def propagateSpecials: Unit

    Permalink

    Propagates equations s.t.

    Propagates equations s.t. f*g = g -- (f != 1) => (g = 0) -- (g != 0) => (f = 1)

    This works on equations only

  32. val symbols: Seq[ConstantTerm]

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

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

    Permalink
    Definition Classes
    IntervalSet → AnyRef → Any
  35. def updateInterval(term: ConstantTerm, interval: Interval, lowerLabel: BitSet, upperLabel: BitSet, gapLabel: BitSet): Unit

    Permalink
  36. def upperLimit(p: Polynomial): (IntervalInt, BitSet)

    Permalink
  37. def upperLimit(t: CoeffMonomial): (IntervalInt, BitSet)

    Permalink
  38. def upperLimit(m: Monomial): (IntervalInt, BitSet)

    Permalink

    Upper Limit functions

  39. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped