Class/Object

ap.terfor.inequalities

InEqConj

Related Docs: object InEqConj | package inequalities

Permalink

class InEqConj extends Formula with SortedWithOrder[InEqConj] with IndexedSeq[LinearCombination]

Class for storing a conjunction of inequalities that are normalised to the form t >= 0. Together with the actual inequalities, also all inequalities that can be inferred using Fourier-Motzkin elimination steps, as well as all equations that can be inferred using Fourier-Motzkin are stored. This implies that it can always be decided in constant time whether the inequalities have rational solutions.

Linear Supertypes
IndexedSeq[LinearCombination], IndexedSeqLike[LinearCombination, IndexedSeq[LinearCombination]], Seq[LinearCombination], SeqLike[LinearCombination, IndexedSeq[LinearCombination]], GenSeq[LinearCombination], GenSeqLike[LinearCombination, IndexedSeq[LinearCombination]], Iterable[LinearCombination], IterableLike[LinearCombination, IndexedSeq[LinearCombination]], Equals, GenIterable[LinearCombination], GenIterableLike[LinearCombination, IndexedSeq[LinearCombination]], Traversable[LinearCombination], GenTraversable[LinearCombination], GenericTraversableTemplate[LinearCombination, IndexedSeq], TraversableLike[LinearCombination, IndexedSeq[LinearCombination]], GenTraversableLike[LinearCombination, IndexedSeq[LinearCombination]], Parallelizable[LinearCombination, ParSeq[LinearCombination]], TraversableOnce[LinearCombination], GenTraversableOnce[LinearCombination], FilterMonadic[LinearCombination, IndexedSeq[LinearCombination]], HasNewBuilder[LinearCombination, IndexedSeq[ap.terfor.linearcombination.LinearCombination] @scala.annotation.unchecked.uncheckedVariance], PartialFunction[Int, LinearCombination], (Int) ⇒ LinearCombination, SortedWithOrder[InEqConj], Sorted[InEqConj], Formula, TerFor, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. InEqConj
  2. IndexedSeq
  3. IndexedSeqLike
  4. Seq
  5. SeqLike
  6. GenSeq
  7. GenSeqLike
  8. Iterable
  9. IterableLike
  10. Equals
  11. GenIterable
  12. GenIterableLike
  13. Traversable
  14. GenTraversable
  15. GenericTraversableTemplate
  16. TraversableLike
  17. GenTraversableLike
  18. Parallelizable
  19. TraversableOnce
  20. GenTraversableOnce
  21. FilterMonadic
  22. HasNewBuilder
  23. PartialFunction
  24. Function1
  25. SortedWithOrder
  26. Sorted
  27. Formula
  28. TerFor
  29. AnyRef
  30. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = IndexedSeq[LinearCombination]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++[B >: LinearCombination, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: LinearCombination, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  5. def ++:[B >: LinearCombination, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  6. def +:[B >: LinearCombination, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  7. def --(that: InEqConj): InEqConj

    Permalink
  8. def /:[B](z: B)(op: (B, LinearCombination) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :+[B >: LinearCombination, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  10. def :\[B](z: B)(op: (LinearCombination, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  11. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  12. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  15. def aggregate[B](z: ⇒ B)(seqop: (B, LinearCombination) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. lazy val allGeqZero: IndexedSeq[LinearCombination]

    Permalink

    All stored or inferred inequalities.

  17. lazy val allGeqZeroInfs: IndexedSeq[LinearCombination]

    Permalink

    All inferred inequalities, including both Fourier-Motzkin inferences and bounds derived using interval constraint propagation.

  18. def andThen[C](k: (LinearCombination) ⇒ C): PartialFunction[Int, C]

    Permalink
    Definition Classes
    PartialFunction → Function1
  19. def apply(i: Int): LinearCombination

    Permalink
    Definition Classes
    InEqConj → SeqLike → GenSeqLike → Function1
  20. def applyOrElse[A1 <: Int, B1 >: LinearCombination](x: A1, default: (A1) ⇒ B1): B1

    Permalink
    Definition Classes
    PartialFunction
  21. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  22. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  23. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. def collect[B, That](pf: PartialFunction[LinearCombination, B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  25. def collectFirst[B](pf: PartialFunction[LinearCombination, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  26. def combinations(n: Int): Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    SeqLike
  27. def companion: GenericCompanion[IndexedSeq]

    Permalink
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  28. val completeInfs: Boolean

    Permalink
  29. def compose[A](g: (A) ⇒ Int): (A) ⇒ LinearCombination

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  30. lazy val constants: Set[ConstantTerm]

    Permalink
    Definition Classes
    InEqConjSortedWithOrderTerFor
  31. def contains[A1 >: LinearCombination](elem: A1): Boolean

    Permalink
    Definition Classes
    SeqLike
  32. def containsSlice[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike
  33. def copyToArray[B >: LinearCombination](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  34. def copyToArray[B >: LinearCombination](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def copyToArray[B >: LinearCombination](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def copyToBuffer[B >: LinearCombination](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  37. def corresponds[B](that: GenSeq[B])(p: (LinearCombination, B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  38. def count(p: (LinearCombination) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def diff[B >: LinearCombination](that: GenSeq[B]): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  40. def distinct: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  41. def drop(n: Int): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  42. def dropRight(n: Int): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike
  43. def dropWhile(p: (LinearCombination) ⇒ Boolean): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def endsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  45. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  46. val equalityInfs: EquationConj

    Permalink
  47. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    InEqConj → GenSeqLike → Equals → AnyRef → Any
  48. def exists(p: (LinearCombination) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  49. def filter(p: (LinearCombination) ⇒ Boolean): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def filterNot(p: (LinearCombination) ⇒ Boolean): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  52. def find(p: (LinearCombination) ⇒ Boolean): Option[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def findInEqsWithLeadingTerm(lt: Term, includeInfs: Boolean = false): Seq[LinearCombination]

    Permalink

    Find all inequalities starting with a given ConstantTerm or VariableTerm.

    Find all inequalities starting with a given ConstantTerm or VariableTerm. Optionally, the search can also include inferred inequalities.

  54. def findLowerBound(lc: LinearCombination): Option[IdealInt]

    Permalink

    Determine whether a lower bound can be inferred from this conjunction of inequalities for the given linear combination.

    Determine whether a lower bound can be inferred from this conjunction of inequalities for the given linear combination.

  55. def flatMap[B, That](f: (LinearCombination) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  56. def flatten[B](implicit asTraversable: (LinearCombination) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  57. def fold[A1 >: LinearCombination](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def foldLeft[B](z: B)(op: (B, LinearCombination) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def foldRight[B](z: B)(op: (LinearCombination, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  60. def forall(p: (LinearCombination) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def foreach[U](f: (LinearCombination) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  62. def genericBuilder[B]: Builder[B, IndexedSeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  63. val geqZero: IndexedSeq[LinearCombination]

    Permalink
  64. val geqZeroBounds: IndexedSeq[LinearCombination]

    Permalink
  65. val geqZeroInfs: IndexedSeq[LinearCombination]

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

    Permalink
    Definition Classes
    AnyRef → Any
  67. def groundAtoms: Set[Atom]

    Permalink
    Definition Classes
    InEqConjFormula
  68. def groupBy[K](f: (LinearCombination) ⇒ K): Map[K, IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def grouped(size: Int): Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    IterableLike
  70. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  71. def hashCode(): Int

    Permalink
    Definition Classes
    InEqConj → IndexedSeqLike → GenSeqLike → AnyRef → Any
  72. def head: LinearCombination

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  73. def headOption: Option[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def implies(that: InEqConj): Boolean

    Permalink
  75. def indexOf[B >: LinearCombination](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  76. def indexOf[B >: LinearCombination](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  77. def indexOfSlice[B >: LinearCombination](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike
  78. def indexOfSlice[B >: LinearCombination](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  79. def indexWhere(p: (LinearCombination) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  80. def indexWhere(p: (LinearCombination) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  81. def indices: Range

    Permalink
    Definition Classes
    SeqLike
  82. def init: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def inits: Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    TraversableLike
  84. def intersect[B >: LinearCombination](that: GenSeq[B]): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  85. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  86. def isEmpty: Boolean

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  87. def isFalse: Boolean

    Permalink

    The only allowed case of obviously unsatisfiable systems of inequalities is the one of a single inequality -1 >= 0

    The only allowed case of obviously unsatisfiable systems of inequalities is the one of a single inequality -1 >= 0

    Definition Classes
    InEqConjFormula
  88. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  89. def isObviouslySat: Boolean

    Permalink

    Cheap check whether this system of inequalities is satisfiable over integers

  90. def isRationallyFalse(infLimit: Int): Boolean

    Permalink

    Check whether this system of inequalities has rational solutions

  91. def isSortedBy(otherOrder: TermOrder): Boolean

    Permalink
    Definition Classes
    SortedWithOrderSorted
  92. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  93. def isTrue: Boolean

    Permalink

    Return true if this formula is obviously always true

    Return true if this formula is obviously always true

    Definition Classes
    InEqConjFormula
  94. def iterator: Iterator[LinearCombination]

    Permalink
    Definition Classes
    InEqConj → IndexedSeqLike → IterableLike → GenIterableLike
  95. def last: LinearCombination

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def lastIndexOf[B >: LinearCombination](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  97. def lastIndexOf[B >: LinearCombination](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  98. def lastIndexOfSlice[B >: LinearCombination](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike
  99. def lastIndexOfSlice[B >: LinearCombination](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  100. def lastIndexWhere(p: (LinearCombination) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  101. def lastIndexWhere(p: (LinearCombination) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  102. def lastOption: Option[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def length: Int

    Permalink
    Definition Classes
    InEqConj → SeqLike → GenSeqLike
  104. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    SeqLike
  105. def lift: (Int) ⇒ Option[LinearCombination]

    Permalink
    Definition Classes
    PartialFunction
  106. def map[B, That](f: (LinearCombination) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  107. def max[B >: LinearCombination](implicit cmp: Ordering[B]): LinearCombination

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def maxBy[B](f: (LinearCombination) ⇒ B)(implicit cmp: Ordering[B]): LinearCombination

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def min[B >: LinearCombination](implicit cmp: Ordering[B]): LinearCombination

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def minBy[B](f: (LinearCombination) ⇒ B)(implicit cmp: Ordering[B]): LinearCombination

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  115. def negate: InEqConj

    Permalink

    Create the negation of at most one equation

  116. def newBuilder: Builder[LinearCombination, IndexedSeq[LinearCombination]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  117. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  120. def orElse[A1 <: Int, B1 >: LinearCombination](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Permalink
    Definition Classes
    PartialFunction
  121. val order: TermOrder

    Permalink
    Definition Classes
    InEqConjSortedWithOrder
  122. def padTo[B >: LinearCombination, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  123. def par: ParSeq[LinearCombination]

    Permalink
    Definition Classes
    Parallelizable
  124. def parCombiner: Combiner[LinearCombination, ParSeq[LinearCombination]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  125. def partition(p: (LinearCombination) ⇒ Boolean): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def patch[B >: LinearCombination, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  127. def permutations: Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    SeqLike
  128. def predicates: Set[Predicate]

    Permalink
    Definition Classes
    InEqConjSortedWithOrderTerFor
  129. def prefixLength(p: (LinearCombination) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  130. def product[B >: LinearCombination](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduce[A1 >: LinearCombination](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def reduceLeft[B >: LinearCombination](op: (B, LinearCombination) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  133. def reduceLeftOption[B >: LinearCombination](op: (B, LinearCombination) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def reduceOption[A1 >: LinearCombination](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def reduceRight[B >: LinearCombination](op: (LinearCombination, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  136. def reduceRightOption[B >: LinearCombination](op: (LinearCombination, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. val relationString: String

    Permalink
    Attributes
    protected
  138. def remove(that: InEqConj, logger: ComputationLogger): InEqConj

    Permalink
  139. def repr: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  140. def reverse: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  141. def reverseIterator: Iterator[LinearCombination]

    Permalink
    Definition Classes
    SeqLike
  142. def reverseMap[B, That](f: (LinearCombination) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  143. def reversed: List[LinearCombination]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  144. def runWith[U](action: (LinearCombination) ⇒ U): (Int) ⇒ Boolean

    Permalink
    Definition Classes
    PartialFunction
  145. def sameElements[B >: LinearCombination](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  146. def scan[B >: LinearCombination, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  147. def scanLeft[B, That](z: B)(op: (B, LinearCombination) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def scanRight[B, That](z: B)(op: (LinearCombination, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  149. def segmentLength(p: (LinearCombination) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  150. def seq: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  151. def size: Int

    Permalink
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  152. def slice(from: Int, until: Int): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  153. def sliding(size: Int, step: Int): Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    IterableLike
  154. def sliding(size: Int): Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    IterableLike
  155. def sortBy(newOrder: TermOrder): InEqConj

    Permalink

    Re-sort an object with a new TermOrder.

    Re-sort an object with a new TermOrder. It is guaranteed that the result isSortedBy(order)

    Definition Classes
    InEqConjSorted
  156. def sortBy[B](f: (LinearCombination) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike
  157. def sortWith(lt: (LinearCombination, LinearCombination) ⇒ Boolean): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike
  158. def sorted[B >: LinearCombination](implicit ord: Ordering[B]): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike
  159. def span(p: (LinearCombination) ⇒ Boolean): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def splitAt(n: Int): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  161. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  162. def startsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  163. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  164. def sum[B >: LinearCombination](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  166. def tail: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  167. def tails: Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    TraversableLike
  168. def take(n: Int): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  169. def takeRight(n: Int): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike
  170. def takeWhile(p: (LinearCombination) ⇒ Boolean): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  171. def thisCollection: IndexedSeq[LinearCombination]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  172. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, LinearCombination, Col[LinearCombination]]): Col[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  173. def toArray[B >: LinearCombination](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def toBuffer[A1 >: LinearCombination]: Buffer[A1]

    Permalink
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  175. def toCollection(repr: IndexedSeq[LinearCombination]): IndexedSeq[LinearCombination]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  176. def toIndexedSeq: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toIterable: Iterable[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  178. def toIterator: Iterator[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  179. def toList: List[LinearCombination]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def toMap[T, U](implicit ev: <:<[LinearCombination, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toSeq: Seq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  182. def toSet: Set[LinearCombination] { ... /* 2 definitions in type refinement */ }

    Permalink
  183. def toSet[B >: LinearCombination]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toStream: Stream[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  185. def toString(): String

    Permalink
    Definition Classes
    InEqConj → SeqLike → TraversableLike → Function1 → AnyRef → Any
  186. def toTraversable: Traversable[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  187. def toVector: Vector[LinearCombination]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def transpose[B](implicit asTraversable: (LinearCombination) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  189. def union[B >: LinearCombination, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  190. def unzip[A1, A2](implicit asPair: (LinearCombination) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  191. def unzip3[A1, A2, A3](implicit asTriple: (LinearCombination) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  192. def updateGeqZero(newGeqZero: Iterator[LinearCombination])(implicit newOrder: TermOrder): InEqConj

    Permalink

    Update the inequalities of this conjunction; if nothing has changed, inferences are not recomputed

  193. def updateGeqZero(newGeqZero: Iterable[LinearCombination])(implicit newOrder: TermOrder): InEqConj

    Permalink
  194. def updateGeqZero(newGeqZero: Iterable[LinearCombination], logger: ComputationLogger)(implicit newOrder: TermOrder): InEqConj

    Permalink

    Update the inequalities of this conjunction; if nothing has changed, inferences are not recomputed

  195. def updateGeqZeroSubset(newGeqZero: Iterable[LinearCombination])(implicit newOrder: TermOrder): InEqConj

    Permalink
  196. def updateGeqZeroSubset(newGeqZero: Iterable[LinearCombination], logger: ComputationLogger)(implicit newOrder: TermOrder): InEqConj

    Permalink

    Update the inequalities of this conjunction, assuming that the new inequalities for a subset of the old ones.

    Update the inequalities of this conjunction, assuming that the new inequalities for a subset of the old ones. If nothing has changed, inferences are not recomputed.

    Currently, we do not use the subset information in the best possible way

  197. def updated[B >: LinearCombination, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  198. lazy val variables: Set[VariableTerm]

    Permalink
    Definition Classes
    InEqConjTerFor
  199. def view(from: Int, until: Int): SeqView[LinearCombination, IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  200. def view: SeqView[LinearCombination, IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  201. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  204. def withFilter(p: (LinearCombination) ⇒ Boolean): FilterMonadic[LinearCombination, IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  205. def zip[A1 >: LinearCombination, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  206. def zipAll[B, A1 >: LinearCombination, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  207. def zipWithIndex[A1 >: LinearCombination, That](implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

Inherited from IndexedSeq[LinearCombination]

Inherited from IndexedSeqLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Seq[LinearCombination]

Inherited from SeqLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from GenSeq[LinearCombination]

Inherited from GenSeqLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Iterable[LinearCombination]

Inherited from IterableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Equals

Inherited from GenIterable[LinearCombination]

Inherited from GenIterableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Traversable[LinearCombination]

Inherited from GenTraversable[LinearCombination]

Inherited from GenericTraversableTemplate[LinearCombination, IndexedSeq]

Inherited from TraversableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from GenTraversableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Parallelizable[LinearCombination, ParSeq[LinearCombination]]

Inherited from TraversableOnce[LinearCombination]

Inherited from GenTraversableOnce[LinearCombination]

Inherited from FilterMonadic[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from HasNewBuilder[LinearCombination, IndexedSeq[ap.terfor.linearcombination.LinearCombination] @scala.annotation.unchecked.uncheckedVariance]

Inherited from PartialFunction[Int, LinearCombination]

Inherited from (Int) ⇒ LinearCombination

Inherited from SortedWithOrder[InEqConj]

Inherited from Sorted[InEqConj]

Inherited from Formula

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped