Packages

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], IndexedSeqOps[LinearCombination, IndexedSeq, IndexedSeq[LinearCombination]], IndexedSeq[LinearCombination], IndexedSeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], Seq[LinearCombination], SeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], Seq[LinearCombination], Equals, SeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], PartialFunction[Int, LinearCombination], (Int) => LinearCombination, Iterable[LinearCombination], Iterable[LinearCombination], IterableFactoryDefaults[LinearCombination, [x]IndexedSeq[x]], IterableOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], IterableOnceOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], IterableOnce[LinearCombination], SortedWithOrder[InEqConj], Sorted[InEqConj], Formula, TerFor, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InEqConj
  2. IndexedSeq
  3. IndexedSeqOps
  4. IndexedSeq
  5. IndexedSeqOps
  6. Seq
  7. SeqOps
  8. Seq
  9. Equals
  10. SeqOps
  11. PartialFunction
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableFactoryDefaults
  16. IterableOps
  17. IterableOnceOps
  18. IterableOnce
  19. SortedWithOrder
  20. Sorted
  21. Formula
  22. TerFor
  23. AnyRef
  24. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. final def ++:[B >: LinearCombination](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  5. final def +:[B >: LinearCombination](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  6. def --(that: InEqConj): InEqConj
  7. final def :+[B >: LinearCombination](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def :++[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  13. lazy val allGeqZero: IndexedSeq[LinearCombination]

    All stored or inferred inequalities.

  14. lazy val allGeqZeroInfs: IndexedSeq[LinearCombination]

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

  15. def andThen[C](k: PartialFunction[LinearCombination, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  16. def andThen[C](k: (LinearCombination) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  17. def appended[B >: LinearCombination](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  18. def appendedAll[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  19. def apply(i: Int): LinearCombination
    Definition Classes
    InEqConj → SeqOps → Function1
  20. def applyOrElse[A1 <: Int, B1 >: LinearCombination](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  21. def applyPreferredMaxLength: Int
    Attributes
    protected
    Definition Classes
    IndexedSeq
  22. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  23. def canEqual(that: Any): Boolean
    Definition Classes
    IndexedSeq → Seq → Equals
  24. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  25. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  26. final def coll: InEqConj.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  27. def collect[B](pf: PartialFunction[LinearCombination, B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  28. def collectFirst[B](pf: PartialFunction[LinearCombination, B]): Option[B]
    Definition Classes
    IterableOnceOps
  29. def combinations(n: Int): Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    SeqOps
  30. val completeInfs: Boolean
  31. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, LinearCombination]
    Definition Classes
    PartialFunction
  32. def compose[A](g: (A) => Int): (A) => LinearCombination
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  33. final def concat[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  34. lazy val constants: Set[ConstantTerm]
    Definition Classes
    InEqConj → SortedWithOrder → TerFor
  35. def contains[A1 >: LinearCombination](elem: A1): Boolean
    Definition Classes
    SeqOps
  36. def containsSlice[B >: LinearCombination](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  37. def copyToArray[B >: LinearCombination](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  38. def copyToArray[B >: LinearCombination](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  39. def copyToArray[B >: LinearCombination](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  40. def corresponds[B](that: Seq[B])(p: (LinearCombination, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  41. def corresponds[B](that: IterableOnce[B])(p: (LinearCombination, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  42. def count(p: (LinearCombination) => Boolean): Int
    Definition Classes
    IterableOnceOps
  43. def diff[B >: LinearCombination](that: Seq[B]): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  44. def distinct: IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  45. def distinctBy[B](f: (LinearCombination) => B): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  46. def drop(n: Int): IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  47. def dropRight(n: Int): IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps
  48. def dropWhile(p: (LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  49. def elementWise: ElementWiseExtractor[Int, LinearCombination]
    Definition Classes
    PartialFunction
  50. def empty: IndexedSeq[LinearCombination]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  51. def endsWith[B >: LinearCombination](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  52. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  53. val equalityInfs: EquationConj
  54. def equals(that: Any): Boolean
    Definition Classes
    InEqConj → Seq → Equals → AnyRef → Any
  55. def exists(p: (LinearCombination) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  56. def filter(pred: (LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  57. def filterNot(pred: (LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  58. def find(p: (LinearCombination) => Boolean): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  59. def findInEqsWithLeadingTerm(lt: Term, includeInfs: Boolean = false): View[LinearCombination]

    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.

  60. def findLast(p: (LinearCombination) => Boolean): Option[LinearCombination]
    Definition Classes
    SeqOps
  61. def findLowerBound(lc: LinearCombination): Option[IdealInt]

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

  62. def flatMap[B](f: (LinearCombination) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  63. def flatten[B](implicit asIterable: (LinearCombination) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  64. def fold[A1 >: LinearCombination](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  65. def foldLeft[B](z: B)(op: (B, LinearCombination) => B): B
    Definition Classes
    IterableOnceOps
  66. def foldRight[B](z: B)(op: (LinearCombination, B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  67. def forall(p: (LinearCombination) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  68. def foreach[U](f: (LinearCombination) => U): Unit
    Definition Classes
    IterableOnceOps
  69. def fromSpecific(coll: IterableOnce[LinearCombination]): IndexedSeq[LinearCombination]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  70. val geqZero: IndexedSeq[LinearCombination]
  71. val geqZeroBounds: IndexedSeq[LinearCombination]
  72. val geqZeroInfs: IndexedSeq[LinearCombination]
  73. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  74. def groundAtoms: Set[Atom]
    Definition Classes
    InEqConj → Formula
  75. def groupBy[K](f: (LinearCombination) => K): Map[K, IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  76. def groupMap[K, B](key: (LinearCombination) => K)(f: (LinearCombination) => B): Map[K, IndexedSeq[B]]
    Definition Classes
    IterableOps
  77. def groupMapReduce[K, B](key: (LinearCombination) => K)(f: (LinearCombination) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  78. def grouped(size: Int): Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  79. def hashCode(): Int
    Definition Classes
    InEqConj → Seq → AnyRef → Any
  80. def head: LinearCombination
    Definition Classes
    IndexedSeqOps → IterableOps
  81. def headOption: Option[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps
  82. def implies(that: InEqConj): Boolean
  83. def indexOf[B >: LinearCombination](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  84. def indexOf[B >: LinearCombination](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  85. def indexOfSlice[B >: LinearCombination](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  86. def indexOfSlice[B >: LinearCombination](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  87. def indexWhere(p: (LinearCombination) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  88. def indexWhere(p: (LinearCombination) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  89. def indices: Range
    Definition Classes
    SeqOps
  90. def init: IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps
  91. def inits: Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  92. def intersect[B >: LinearCombination](that: Seq[B]): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  93. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  94. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  95. def isFalse: Boolean

    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
    InEqConj → Formula
  96. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  97. def isObviouslySat: Boolean

    Cheap check whether this system of inequalities is satisfiable over integers

  98. def isRationallyFalse(infLimit: Int): Boolean

    Check whether this system of inequalities has rational solutions

  99. def isSortedBy(otherOrder: TermOrder): Boolean
    Definition Classes
    SortedWithOrder → Sorted
  100. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  101. def isTrue: Boolean

    Return true if this formula is obviously always true

    Return true if this formula is obviously always true

    Definition Classes
    InEqConj → Formula
  102. def iterableFactory: SeqFactory[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  103. def iterator: Iterator[LinearCombination]
    Definition Classes
    InEqConj → IndexedSeqOps → IterableOnce
  104. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  105. def last: LinearCombination
    Definition Classes
    IndexedSeqOps → IterableOps
  106. def lastIndexOf[B >: LinearCombination](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  107. def lastIndexOfSlice[B >: LinearCombination](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  108. def lastIndexOfSlice[B >: LinearCombination](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  109. def lastIndexWhere(p: (LinearCombination) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  110. def lastIndexWhere(p: (LinearCombination) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  111. def lastOption: Option[LinearCombination]
    Definition Classes
    IterableOps
  112. def lazyZip[B](that: Iterable[B]): LazyZip2[LinearCombination, B, InEqConj.this.type]
    Definition Classes
    Iterable
  113. def length: Int
    Definition Classes
    InEqConj → SeqOps
  114. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  115. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  116. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  117. def lift: (Int) => Option[LinearCombination]
    Definition Classes
    PartialFunction
  118. def map[B](f: (LinearCombination) => B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  119. def max[B >: LinearCombination](implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  120. def maxBy[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  121. def maxByOption[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  122. def maxOption[B >: LinearCombination](implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  123. def min[B >: LinearCombination](implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  124. def minBy[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  125. def minByOption[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  126. def minOption[B >: LinearCombination](implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  127. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  128. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  129. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  130. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  131. def negate: InEqConj

    Create the negation of at most one equation

  132. def newSpecificBuilder: Builder[LinearCombination, IndexedSeq[LinearCombination]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  133. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  134. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  135. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  136. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  137. def orElse[A1 <: Int, B1 >: LinearCombination](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  138. val order: TermOrder
    Definition Classes
    InEqConj → SortedWithOrder
  139. def padTo[B >: LinearCombination](len: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  140. def partition(p: (LinearCombination) => Boolean): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])
    Definition Classes
    IterableOps
  141. def partitionMap[A1, A2](f: (LinearCombination) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  142. def patch[B >: LinearCombination](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
    Definition Classes
    SeqOps
  143. def permutations: Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    SeqOps
  144. def predicates: Set[Predicate]
    Definition Classes
    InEqConj → SortedWithOrder → TerFor
  145. def prepended[B >: LinearCombination](elem: B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  146. def prependedAll[B >: LinearCombination](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  147. def product[B >: LinearCombination](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  148. def reduce[B >: LinearCombination](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  149. def reduceLeft[B >: LinearCombination](op: (B, LinearCombination) => B): B
    Definition Classes
    IterableOnceOps
  150. def reduceLeftOption[B >: LinearCombination](op: (B, LinearCombination) => B): Option[B]
    Definition Classes
    IterableOnceOps
  151. def reduceOption[B >: LinearCombination](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  152. def reduceRight[B >: LinearCombination](op: (LinearCombination, B) => B): B
    Definition Classes
    IterableOnceOps
  153. def reduceRightOption[B >: LinearCombination](op: (LinearCombination, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  154. val relationString: String
    Attributes
    protected
  155. def remove(that: InEqConj, logger: ComputationLogger): InEqConj
  156. def reverse: IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → SeqOps
  157. def reverseIterator: Iterator[LinearCombination]
    Definition Classes
    IndexedSeqOps → SeqOps
  158. def reversed: Iterable[LinearCombination]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  159. def runWith[U](action: (LinearCombination) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  160. def sameElements[B >: LinearCombination](o: IterableOnce[B]): Boolean
    Definition Classes
    IndexedSeq → SeqOps
  161. def scan[B >: LinearCombination](z: B)(op: (B, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  162. def scanLeft[B](z: B)(op: (B, LinearCombination) => B): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  163. def scanRight[B](z: B)(op: (LinearCombination, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  164. def search[B >: LinearCombination](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  165. def search[B >: LinearCombination](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  166. def segmentLength(p: (LinearCombination) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  167. final def segmentLength(p: (LinearCombination) => Boolean): Int
    Definition Classes
    SeqOps
  168. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  169. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  170. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  171. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  172. def slice(from: Int, until: Int): IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
  173. def sliding(size: Int, step: Int): Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  174. def sliding(size: Int): Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  175. def sortBy(newOrder: TermOrder): InEqConj

    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
    InEqConj → Sorted
  176. def sortBy[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  177. def sortWith(lt: (LinearCombination, LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  178. def sorted[B >: LinearCombination](implicit ord: Ordering[B]): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  179. def span(p: (LinearCombination) => Boolean): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])
    Definition Classes
    IterableOps → IterableOnceOps
  180. def splitAt(n: Int): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])
    Definition Classes
    IterableOps → IterableOnceOps
  181. def startsWith[B >: LinearCombination](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  182. def stepper[S <: Stepper[_]](implicit shape: StepperShape[LinearCombination, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  183. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  184. def sum[B >: LinearCombination](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  185. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  186. def tail: IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps
  187. def tails: Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  188. def take(n: Int): IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  189. def takeRight(n: Int): IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps
  190. def takeWhile(p: (LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  191. def tapEach[U](f: (LinearCombination) => U): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  192. def to[C1](factory: Factory[LinearCombination, C1]): C1
    Definition Classes
    IterableOnceOps
  193. def toArray[B >: LinearCombination](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  194. final def toBuffer[B >: LinearCombination]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  195. final def toIndexedSeq: IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeq → IterableOnceOps
  196. def toList: List[LinearCombination]
    Definition Classes
    IterableOnceOps
  197. def toMap[K, V](implicit ev: <:<[LinearCombination, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  198. final def toSeq: InEqConj.this.type
    Definition Classes
    Seq → IterableOnceOps
  199. def toSet: Set[LinearCombination] { def diff(that: scala.collection.Set[ap.terfor.linearcombination.LinearCombination]): scala.collection.immutable.Set[ap.terfor.linearcombination.LinearCombination] }
  200. def toSet[B >: LinearCombination]: Set[B]
    Definition Classes
    IterableOnceOps
  201. def toString(): String
    Definition Classes
    InEqConj → Seq → Function1 → Iterable → AnyRef → Any
  202. def toVector: Vector[LinearCombination]
    Definition Classes
    IterableOnceOps
  203. def transpose[B](implicit asIterable: (LinearCombination) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    IterableOps
  204. def unapply(a: Int): Option[LinearCombination]
    Definition Classes
    PartialFunction
  205. def unzip[A1, A2](implicit asPair: (LinearCombination) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  206. def unzip3[A1, A2, A3](implicit asTriple: (LinearCombination) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    IterableOps
  207. def updateGeqZero(newGeqZero: Iterator[LinearCombination])(implicit newOrder: TermOrder): InEqConj

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

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

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

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

    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

  212. def updated[B >: LinearCombination](index: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  213. lazy val variables: Set[VariableTerm]
    Definition Classes
    InEqConj → TerFor
  214. def view: IndexedSeqView[LinearCombination]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  215. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  216. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  217. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  218. def withFilter(p: (LinearCombination) => Boolean): WithFilter[LinearCombination, [_]IndexedSeq[_]]
    Definition Classes
    IterableOps
  219. def zip[B](that: IterableOnce[B]): IndexedSeq[(LinearCombination, B)]
    Definition Classes
    IterableOps
  220. def zipAll[A1 >: LinearCombination, B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
    Definition Classes
    IterableOps
  221. def zipWithIndex: IndexedSeq[(LinearCombination, Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, LinearCombination) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: (LinearCombination, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, LinearCombination) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) For sequential collections, prefer foldLeft(z)(seqop). For parallel collections, use ParIterableLike#aggregate.

  4. def companion: IterableFactory[[_]IndexedSeq[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  5. final def copyToBuffer[B >: LinearCombination](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  6. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

  7. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  8. final def prefixLength(p: (LinearCombination) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  9. final def repr: IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  10. def reverseMap[B](f: (LinearCombination) => B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  11. def seq: InEqConj.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  12. final def toIterable: InEqConj.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  13. final def toIterator: Iterator[LinearCombination]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  14. final def toStream: Stream[LinearCombination]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  15. final def toTraversable: Traversable[LinearCombination]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  16. final def union[B >: LinearCombination](that: Seq[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  17. def view(from: Int, until: Int): IndexedSeqView[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from IndexedSeq[LinearCombination]

Inherited from IndexedSeqOps[LinearCombination, IndexedSeq, IndexedSeq[LinearCombination]]

Inherited from IndexedSeq[LinearCombination]

Inherited from IndexedSeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]]

Inherited from Seq[LinearCombination]

Inherited from SeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]]

Inherited from Seq[LinearCombination]

Inherited from Equals

Inherited from SeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]]

Inherited from PartialFunction[Int, LinearCombination]

Inherited from (Int) => LinearCombination

Inherited from Iterable[LinearCombination]

Inherited from Iterable[LinearCombination]

Inherited from IterableFactoryDefaults[LinearCombination, [x]IndexedSeq[x]]

Inherited from IterableOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]]

Inherited from IterableOnceOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]]

Inherited from IterableOnce[LinearCombination]

Inherited from SortedWithOrder[InEqConj]

Inherited from Sorted[InEqConj]

Inherited from Formula

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped