Packages

sealed abstract class LinearCombination extends Term with SortedWithOrder[LinearCombination] with IndexedSeq[(IdealInt, Term)]

Class for representing linear combinations of terms. Objects can be considered as finite mappings from terms to integers (i.e., to the coefficients). The terms are stored in an array that is sorted in descending order according to a TermOrder.

Linear Supertypes
IndexedSeq[(IdealInt, Term)], IndexedSeqOps[(IdealInt, Term), IndexedSeq, IndexedSeq[(IdealInt, Term)]], IndexedSeq[(IdealInt, Term)], IndexedSeqOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]], Seq[(IdealInt, Term)], SeqOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]], Seq[(IdealInt, Term)], Equals, SeqOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]], PartialFunction[Int, (IdealInt, Term)], (Int) => (IdealInt, Term), Iterable[(IdealInt, Term)], Iterable[(IdealInt, Term)], IterableFactoryDefaults[(IdealInt, Term), [x]IndexedSeq[x]], IterableOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]], IterableOnceOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]], IterableOnce[(IdealInt, Term)], SortedWithOrder[LinearCombination], Sorted[LinearCombination], Term, TerFor, AnyRef, Any
Known Subclasses
ArrayLinearCombination, LinearCombination0, LinearCombination1, LinearCombination2
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinearCombination
  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. Term
  22. TerFor
  23. AnyRef
  24. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def +(that: IdealInt): LinearCombination

    Add an integer literal to a LinearCombination.

    Add an integer literal to a LinearCombination. The result is sorted with the same TermOrder as this

  2. abstract def +(that: LinearCombination)(implicit newOrder: TermOrder): LinearCombination

    Addition of two linear combinations.

    Addition of two linear combinations. The result is sorted with the same TermOrder as this

  3. abstract def -(that: LinearCombination)(implicit newOrder: TermOrder): LinearCombination

    Subtraction of two linear combinations.

    Subtraction of two linear combinations. The result is sorted with the same TermOrder as this

  4. abstract def /(denom: IdealInt): LinearCombination

    Divide all coefficients of this linear combination by a constant, rounding downwards

  5. abstract def coeffIterator: Iterator[IdealInt]

    Iterator over all coefficients of the linear combination

  6. abstract def constant: IdealInt

    The constant term of this linear combination (zero if there is no constant term)

  7. abstract def constants: Set[ConstantTerm]
    Definition Classes
    LinearCombination → SortedWithOrder → TerFor
  8. abstract def constantsIterator: Iterator[ConstantTerm]
  9. abstract def filterPairs(f: (IdealInt, Term) => Boolean): LinearCombination
  10. abstract def get(t: Term): IdealInt

    Determine the coefficient of a certain term in this linear combination, or zero if the term does not occur.

    Determine the coefficient of a certain term in this linear combination, or zero if the term does not occur. This is done by binary search

  11. abstract def getCoeff(i: Int): IdealInt

    Method to access the coefficients of the linear combination

  12. abstract def getPair(i: Int): (IdealInt, Term)
  13. abstract def getTerm(i: Int): Term

    Method to access the terms of the linear combination

  14. abstract def inverseNonConstantTerms(that: LinearCombination): Boolean

    Return whether the this and that agree on the non-constant terms, but with inverted sign.

    Return whether the this and that agree on the non-constant terms, but with inverted sign. I.e., whether the sum of this and that is some integer constant d (this + that = d).

  15. abstract def isConstant: Boolean

    Return whether this linear combination is an integer constant

  16. abstract def isNonZero: Boolean

    Return whether the value of this linear combination is never zero

  17. abstract def isZero: Boolean

    Return whether the value of this linear combination is constantly zero

  18. abstract def lastTerm: Term
  19. abstract def lcSize: Int
  20. abstract def leadingCoeff: IdealInt

    The leading coefficient of this linear combination

  21. abstract def leadingTerm: Term

    The leading monomial of this linear combination

  22. abstract def nonConstCoeffGcd: IdealInt

    The gcd of the coefficients of non-constant terms in the linear combination

  23. abstract def pairSeq: IndexedSeq[(IdealInt, Term)]
  24. abstract def sameNonConstantTerms(that: LinearCombination): Boolean

    Return whether the this and that agree on the non-constant terms.

    Return whether the this and that agree on the non-constant terms. I.e., whether the difference between this and that is only some integer constant d (this = that + d).

  25. abstract def scale(coeff: IdealInt): LinearCombination

    Multiply all coefficients of this linear combination by a constant

  26. abstract def scaleAndAdd(coeff: IdealInt, const: IdealInt): LinearCombination

    Multiply all coefficients of this linear combination by a constant, and add some constant term

  27. abstract def sortBy(order: TermOrder): LinearCombination

    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
    Sorted
  28. abstract def termIterator: Iterator[Term]

    Iterator over all terms of the linear combination

  29. abstract def unary_-: LinearCombination

    The negation of a linear combination

  30. abstract def variables: Set[VariableTerm]
    Definition Classes
    LinearCombination → TerFor
  31. abstract def variablesIterator: Iterator[VariableTerm]

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def *(that: LinearCombination): LinearCombination

    Multiple two linear combinations.

    Multiple two linear combinations. One of the arguments has to be constant, otherwise the method will raise an IllegalArgumentException.

  4. final def ++[B >: (IdealInt, Term)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. final def ++:[B >: (IdealInt, Term)](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  6. final def +:[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. final def :+[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def :++[B >: (IdealInt, Term)](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. def andThen[C](k: PartialFunction[(IdealInt, Term), C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  14. def andThen[C](k: ((IdealInt, Term)) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  15. def appended[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  16. def appendedAll[B >: (IdealInt, Term)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  17. def apply(i: Int): (IdealInt, Term)
    Definition Classes
    LinearCombination → SeqOps → Function1
  18. def applyOrElse[A1 <: Int, B1 >: (IdealInt, Term)](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  19. def applyPreferredMaxLength: Int
    Attributes
    protected
    Definition Classes
    IndexedSeq
  20. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  21. def assertCtor: Boolean
    Attributes
    protected
  22. def canEqual(that: Any): Boolean
    Definition Classes
    IndexedSeq → Seq → Equals
  23. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  24. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  25. final def coll: LinearCombination.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  26. def collect[B](pf: PartialFunction[(IdealInt, Term), B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  27. def collectFirst[B](pf: PartialFunction[(IdealInt, Term), B]): Option[B]
    Definition Classes
    IterableOnceOps
  28. def combinations(n: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    SeqOps
  29. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, (IdealInt, Term)]
    Definition Classes
    PartialFunction
  30. def compose[A](g: (A) => Int): (A) => (IdealInt, Term)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. final def concat[B >: (IdealInt, Term)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  32. def constantDiff(that: LinearCombination): Option[IdealInt]

    Return Some(d) if the difference between this and that is only an integer constant d (this = that + d), and None otherwise.

  33. def contains[A1 >: (IdealInt, Term)](elem: A1): Boolean
    Definition Classes
    SeqOps
  34. def containsSlice[B >: (IdealInt, Term)](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  35. def copyToArray[B >: (IdealInt, Term)](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  36. def copyToArray[B >: (IdealInt, Term)](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  37. def copyToArray[B >: (IdealInt, Term)](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  38. def corresponds[B](that: Seq[B])(p: ((IdealInt, Term), B) => Boolean): Boolean
    Definition Classes
    SeqOps
  39. def corresponds[B](that: IterableOnce[B])(p: ((IdealInt, Term), B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  40. def count(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    IterableOnceOps
  41. def diff[B >: (IdealInt, Term)](that: Seq[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  42. def distinct: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  43. def distinctBy[B](f: ((IdealInt, Term)) => B): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  44. def drop(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  45. def dropRight(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps
  46. def dropWhile(p: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  47. def elementWise: ElementWiseExtractor[Int, (IdealInt, Term)]
    Definition Classes
    PartialFunction
  48. def empty: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  49. def endsWith[B >: (IdealInt, Term)](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  50. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  51. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  52. def exists(p: ((IdealInt, Term)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  53. def filter(pred: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  54. def filterNot(pred: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  55. def find(p: ((IdealInt, Term)) => Boolean): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  56. def findLast(p: ((IdealInt, Term)) => Boolean): Option[(IdealInt, Term)]
    Definition Classes
    SeqOps
  57. def flatMap[B](f: ((IdealInt, Term)) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  58. def flatten[B](implicit asIterable: ((IdealInt, Term)) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  59. def fold[A1 >: (IdealInt, Term)](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  60. def foldLeft[B](z: B)(op: (B, (IdealInt, Term)) => B): B
    Definition Classes
    IterableOnceOps
  61. def foldRight[B](z: B)(op: ((IdealInt, Term), B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  62. def forall(p: ((IdealInt, Term)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  63. def foreach[U](f: ((IdealInt, Term)) => U): Unit
    Definition Classes
    IterableOnceOps
  64. def fromSpecific(coll: IterableOnce[(IdealInt, Term)]): IndexedSeq[(IdealInt, Term)]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  65. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  66. def groupBy[K](f: ((IdealInt, Term)) => K): Map[K, IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  67. def groupMap[K, B](key: ((IdealInt, Term)) => K)(f: ((IdealInt, Term)) => B): Map[K, IndexedSeq[B]]
    Definition Classes
    IterableOps
  68. def groupMapReduce[K, B](key: ((IdealInt, Term)) => K)(f: ((IdealInt, Term)) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  69. def grouped(size: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  70. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  71. def head: (IdealInt, Term)
    Definition Classes
    IndexedSeqOps → IterableOps
  72. def headOption: Option[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps
  73. def indexOf[B >: (IdealInt, Term)](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  74. def indexOf[B >: (IdealInt, Term)](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  75. def indexOfSlice[B >: (IdealInt, Term)](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  76. def indexOfSlice[B >: (IdealInt, Term)](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  77. def indexWhere(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  78. def indexWhere(p: ((IdealInt, Term)) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  79. def indices: Range
    Definition Classes
    SeqOps
  80. def init: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps
  81. def inits: Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  82. def intersect[B >: (IdealInt, Term)](that: Seq[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  83. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  84. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  85. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  86. def isPositive: Boolean

    A linear combination is called positive if it is not constantly zero and if the leading coefficient is positive

  87. def isPrimitive: Boolean

    A linear combination is called primitive if it is not constantly zero and if the coefficients of non-constant terms are coprime.

  88. def isSortedBy(otherOrder: TermOrder): Boolean
    Definition Classes
    SortedWithOrder → Sorted
  89. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  90. def iterableFactory: SeqFactory[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  91. def iterator: Iterator[(IdealInt, Term)]
    Definition Classes
    LinearCombination → IndexedSeqOps → IterableOnce
  92. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  93. def last: (IdealInt, Term)
    Definition Classes
    IndexedSeqOps → IterableOps
  94. def lastCoeff: IdealInt
  95. def lastIndexOf[B >: (IdealInt, Term)](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  96. def lastIndexOfSlice[B >: (IdealInt, Term)](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  97. def lastIndexOfSlice[B >: (IdealInt, Term)](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  98. def lastIndexWhere(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  99. def lastIndexWhere(p: ((IdealInt, Term)) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  100. def lastOption: Option[(IdealInt, Term)]
    Definition Classes
    IterableOps
  101. def lazyPairSeq: IndexedSeq[(IdealInt, Term)]
    Attributes
    protected
  102. def lazyZip[B](that: Iterable[B]): LazyZip2[(IdealInt, Term), B, LinearCombination.this.type]
    Definition Classes
    Iterable
  103. def length: Int
    Definition Classes
    LinearCombination → SeqOps
  104. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  105. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  106. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  107. def lift: (Int) => Option[(IdealInt, Term)]
    Definition Classes
    PartialFunction
  108. def makePositive: LinearCombination
  109. def makePrimitive: LinearCombination

    Divide the linear combination by nonConstCoeffGcd such that it becomes primitive (isPrimitive).

    Divide the linear combination by nonConstCoeffGcd such that it becomes primitive (isPrimitive). If isNonZero, the constant term will be rounded downwards.

  110. def makePrimitiveAndPositive: LinearCombination

    Divide the linear combination by nonConstCoeffGcd such that it becomes primitive (isPrimitive), and possibly change the sign so that the linear combination becomes positive (isPositive)

  111. def map[B](f: ((IdealInt, Term)) => B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  112. def max[B >: (IdealInt, Term)](implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  113. def maxBy[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  114. def maxByOption[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  115. def maxOption[B >: (IdealInt, Term)](implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  116. def min[B >: (IdealInt, Term)](implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  117. def minBy[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  118. def minByOption[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  119. def minOption[B >: (IdealInt, Term)](implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  120. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  121. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  122. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  123. def moduloLeadingCoeff: LinearCombination

    Reduce all coefficients but the coefficient of the leading term of this with IdealInt.reduceAbs(this.leadingCoeff) and return the remainder.

    Reduce all coefficients but the coefficient of the leading term of this with IdealInt.reduceAbs(this.leadingCoeff) and return the remainder. This is used for simplifying divisibility constraints.

  124. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  125. def newSpecificBuilder: Builder[(IdealInt, Term), IndexedSeq[(IdealInt, Term)]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  126. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  127. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  128. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  129. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  130. def orElse[A1 <: Int, B1 >: (IdealInt, Term)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  131. val order: TermOrder
    Definition Classes
    LinearCombination → SortedWithOrder
  132. def padTo[B >: (IdealInt, Term)](len: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  133. def pairIterator: Iterator[(IdealInt, Term)]
  134. def partition(p: ((IdealInt, Term)) => Boolean): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])
    Definition Classes
    IterableOps
  135. def partitionMap[A1, A2](f: ((IdealInt, Term)) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  136. def patch[B >: (IdealInt, Term)](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
    Definition Classes
    SeqOps
  137. def permutations: Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    SeqOps
  138. def predicates: Set[Predicate]
    Definition Classes
    Term → TerFor
  139. def prepended[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  140. def prependedAll[B >: (IdealInt, Term)](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  141. def product[B >: (IdealInt, Term)](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  142. def reduce[B >: (IdealInt, Term)](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  143. def reduceLeft[B >: (IdealInt, Term)](op: (B, (IdealInt, Term)) => B): B
    Definition Classes
    IterableOnceOps
  144. def reduceLeftOption[B >: (IdealInt, Term)](op: (B, (IdealInt, Term)) => B): Option[B]
    Definition Classes
    IterableOnceOps
  145. def reduceOption[B >: (IdealInt, Term)](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  146. def reduceRight[B >: (IdealInt, Term)](op: ((IdealInt, Term), B) => B): B
    Definition Classes
    IterableOnceOps
  147. def reduceRightOption[B >: (IdealInt, Term)](op: ((IdealInt, Term), B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  148. def reduceWithLeadingCoeff: LinearCombination

    Reduce all coefficients of this with IdealInt.reduceAbs(this.leadingCoeff) and return the quotient.

    Reduce all coefficients of this with IdealInt.reduceAbs(this.leadingCoeff) and return the quotient. This is used for column operations when solving systems of linear equations.

  149. def reverse: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → SeqOps
  150. def reverseIterator: Iterator[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → SeqOps
  151. def reversed: Iterable[(IdealInt, Term)]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  152. def runWith[U](action: ((IdealInt, Term)) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  153. def sameElements[B >: (IdealInt, Term)](o: IterableOnce[B]): Boolean
    Definition Classes
    IndexedSeq → SeqOps
  154. def scan[B >: (IdealInt, Term)](z: B)(op: (B, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  155. def scanLeft[B](z: B)(op: (B, (IdealInt, Term)) => B): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  156. def scanRight[B](z: B)(op: ((IdealInt, Term), B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  157. def search[B >: (IdealInt, Term)](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  158. def search[B >: (IdealInt, Term)](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  159. def segmentLength(p: ((IdealInt, Term)) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  160. final def segmentLength(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    SeqOps
  161. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  162. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  163. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  164. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  165. def slice(from: Int, until: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
  166. def sliding(size: Int, step: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  167. def sliding(size: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  168. def sortBy[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  169. def sortWith(lt: ((IdealInt, Term), (IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  170. def sorted[B >: (IdealInt, Term)](implicit ord: Ordering[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  171. def span(p: ((IdealInt, Term)) => Boolean): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])
    Definition Classes
    IterableOps → IterableOnceOps
  172. def splitAt(n: Int): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])
    Definition Classes
    IterableOps → IterableOnceOps
  173. def startsWith[B >: (IdealInt, Term)](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  174. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(IdealInt, Term), S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  175. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  176. def sum[B >: (IdealInt, Term)](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  177. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  178. def tail: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps
  179. def tails: Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  180. def take(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  181. def takeRight(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps
  182. def takeWhile(p: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  183. def tapEach[U](f: ((IdealInt, Term)) => U): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  184. lazy val termSeq: IndexedSeq[Term]
  185. def to[C1](factory: Factory[(IdealInt, Term), C1]): C1
    Definition Classes
    IterableOnceOps
  186. def toArray[B >: (IdealInt, Term)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  187. final def toBuffer[B >: (IdealInt, Term)]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  188. final def toIndexedSeq: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeq → IterableOnceOps
  189. def toList: List[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  190. def toMap[K, V](implicit ev: <:<[(IdealInt, Term), (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  191. final def toSeq: LinearCombination.this.type
    Definition Classes
    Seq → IterableOnceOps
  192. def toSet[B >: (IdealInt, Term)]: Set[B]
    Definition Classes
    IterableOnceOps
  193. def toString(): String
    Definition Classes
    LinearCombination → Seq → Function1 → Iterable → AnyRef → Any
  194. def toVector: Vector[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  195. def transpose[B](implicit asIterable: ((IdealInt, Term)) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    IterableOps
  196. def unapply(a: Int): Option[(IdealInt, Term)]
    Definition Classes
    PartialFunction
  197. def unzip[A1, A2](implicit asPair: ((IdealInt, Term)) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  198. def unzip3[A1, A2, A3](implicit asTriple: ((IdealInt, Term)) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    IterableOps
  199. def updated[B >: (IdealInt, Term)](index: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  200. def view: IndexedSeqView[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  201. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  202. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  203. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  204. def withFilter(p: ((IdealInt, Term)) => Boolean): WithFilter[(IdealInt, Term), [_]IndexedSeq[_]]
    Definition Classes
    IterableOps
  205. def zip[B](that: IterableOnce[B]): IndexedSeq[((IdealInt, Term), B)]
    Definition Classes
    IterableOps
  206. def zipAll[A1 >: (IdealInt, Term), B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
    Definition Classes
    IterableOps
  207. def zipWithIndex: IndexedSeq[((IdealInt, Term), Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, (IdealInt, Term)) => 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: ((IdealInt, Term), 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, (IdealInt, Term)) => 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 >: (IdealInt, Term)](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: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  9. final def repr: IndexedSeq[(IdealInt, Term)]
    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: ((IdealInt, Term)) => 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: LinearCombination.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  12. final def toIterable: LinearCombination.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[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

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

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

  15. final def toTraversable: Traversable[(IdealInt, Term)]
    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 >: (IdealInt, Term)](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[(IdealInt, Term)]
    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[(IdealInt, Term)]

Inherited from IndexedSeqOps[(IdealInt, Term), IndexedSeq, IndexedSeq[(IdealInt, Term)]]

Inherited from IndexedSeq[(IdealInt, Term)]

Inherited from IndexedSeqOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]]

Inherited from Seq[(IdealInt, Term)]

Inherited from SeqOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]]

Inherited from Seq[(IdealInt, Term)]

Inherited from Equals

Inherited from SeqOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]]

Inherited from PartialFunction[Int, (IdealInt, Term)]

Inherited from (Int) => (IdealInt, Term)

Inherited from Iterable[(IdealInt, Term)]

Inherited from Iterable[(IdealInt, Term)]

Inherited from IterableFactoryDefaults[(IdealInt, Term), [x]IndexedSeq[x]]

Inherited from IterableOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]]

Inherited from IterableOnceOps[(IdealInt, Term), [_]IndexedSeq[_], IndexedSeq[(IdealInt, Term)]]

Inherited from IterableOnce[(IdealInt, Term)]

Inherited from SortedWithOrder[LinearCombination]

Inherited from Sorted[LinearCombination]

Inherited from Term

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped