Packages

c

ap.terfor.linearcombination

LinearCombination0

final class LinearCombination0 extends LinearCombination

Constant linear combinations

Linear Supertypes
LinearCombination, 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
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinearCombination0
  2. LinearCombination
  3. IndexedSeq
  4. IndexedSeqOps
  5. IndexedSeq
  6. IndexedSeqOps
  7. Seq
  8. SeqOps
  9. Seq
  10. Equals
  11. SeqOps
  12. PartialFunction
  13. Function1
  14. Iterable
  15. Iterable
  16. IterableFactoryDefaults
  17. IterableOps
  18. IterableOnceOps
  19. IterableOnce
  20. SortedWithOrder
  21. Sorted
  22. Term
  23. TerFor
  24. AnyRef
  25. 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. 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.

    Definition Classes
    LinearCombination
  4. 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

    Definition Classes
    LinearCombination0 → LinearCombination
  5. 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

    Definition Classes
    LinearCombination0 → LinearCombination
  6. final def ++[B >: (IdealInt, Term)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. final def ++:[B >: (IdealInt, Term)](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  8. final def +:[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. 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

    Definition Classes
    LinearCombination0 → LinearCombination
  10. def /(denom: IdealInt): LinearCombination

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

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

    Definition Classes
    LinearCombination0 → LinearCombination
  11. final def :+[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  12. final def :++[B >: (IdealInt, Term)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  13. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  15. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  17. def andThen[C](k: PartialFunction[(IdealInt, Term), C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  18. def andThen[C](k: ((IdealInt, Term)) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  19. def appended[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  20. def appendedAll[B >: (IdealInt, Term)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  21. def apply(i: Int): (IdealInt, Term)
    Definition Classes
    LinearCombination → SeqOps → Function1
  22. def applyOrElse[A1 <: Int, B1 >: (IdealInt, Term)](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  23. def applyPreferredMaxLength: Int
    Attributes
    protected
    Definition Classes
    IndexedSeq
  24. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  25. def assertCtor: Boolean
    Attributes
    protected
    Definition Classes
    LinearCombination
  26. def canEqual(that: Any): Boolean
    Definition Classes
    IndexedSeq → Seq → Equals
  27. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  28. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  29. def coeffIterator: Iterator[IdealInt]

    Iterator over all coefficients of the linear combination

    Iterator over all coefficients of the linear combination

    Definition Classes
    LinearCombination0 → LinearCombination
  30. final def coll: LinearCombination0.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  31. def collect[B](pf: PartialFunction[(IdealInt, Term), B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  32. def collectFirst[B](pf: PartialFunction[(IdealInt, Term), B]): Option[B]
    Definition Classes
    IterableOnceOps
  33. def combinations(n: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    SeqOps
  34. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, (IdealInt, Term)]
    Definition Classes
    PartialFunction
  35. def compose[A](g: (A) => Int): (A) => (IdealInt, Term)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  36. final def concat[B >: (IdealInt, Term)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  37. val constant: IdealInt

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

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

    Definition Classes
    LinearCombination0 → LinearCombination
  38. 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.

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

    Definition Classes
    LinearCombination
  39. def constants: Set[ConstantTerm]
    Definition Classes
    LinearCombination0 → LinearCombination → SortedWithOrder → TerFor
  40. def constantsIterator: Iterator[ConstantTerm]
    Definition Classes
    LinearCombination0 → LinearCombination
  41. def contains[A1 >: (IdealInt, Term)](elem: A1): Boolean
    Definition Classes
    SeqOps
  42. def containsSlice[B >: (IdealInt, Term)](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  43. def copyToArray[B >: (IdealInt, Term)](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  44. def copyToArray[B >: (IdealInt, Term)](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  45. def copyToArray[B >: (IdealInt, Term)](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  46. def corresponds[B](that: Seq[B])(p: ((IdealInt, Term), B) => Boolean): Boolean
    Definition Classes
    SeqOps
  47. def corresponds[B](that: IterableOnce[B])(p: ((IdealInt, Term), B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  48. def count(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    IterableOnceOps
  49. def diff[B >: (IdealInt, Term)](that: Seq[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  50. def distinct: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  51. def distinctBy[B](f: ((IdealInt, Term)) => B): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  52. def drop(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  53. def dropRight(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps
  54. def dropWhile(p: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  55. def elementWise: ElementWiseExtractor[Int, (IdealInt, Term)]
    Definition Classes
    PartialFunction
  56. def empty: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  57. def endsWith[B >: (IdealInt, Term)](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  58. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  59. def equals(that: Any): Boolean
    Definition Classes
    LinearCombination0 → Seq → Equals → AnyRef → Any
  60. def exists(p: ((IdealInt, Term)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  61. def filter(pred: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  62. def filterNot(pred: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  63. def filterPairs(f: (IdealInt, Term) => Boolean): LinearCombination
    Definition Classes
    LinearCombination0 → LinearCombination
  64. def find(p: ((IdealInt, Term)) => Boolean): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  65. def findLast(p: ((IdealInt, Term)) => Boolean): Option[(IdealInt, Term)]
    Definition Classes
    SeqOps
  66. def flatMap[B](f: ((IdealInt, Term)) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  67. def flatten[B](implicit asIterable: ((IdealInt, Term)) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  68. def fold[A1 >: (IdealInt, Term)](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  69. def foldLeft[B](z: B)(op: (B, (IdealInt, Term)) => B): B
    Definition Classes
    IterableOnceOps
  70. def foldRight[B](z: B)(op: ((IdealInt, Term), B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  71. def forall(p: ((IdealInt, Term)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  72. def foreach[U](f: ((IdealInt, Term)) => U): Unit
    Definition Classes
    IterableOnceOps
  73. def fromSpecific(coll: IterableOnce[(IdealInt, Term)]): IndexedSeq[(IdealInt, Term)]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  74. 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

    Definition Classes
    LinearCombination0 → LinearCombination
  75. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  76. def getCoeff(i: Int): IdealInt

    Method to access the coefficients of the linear combination

    Method to access the coefficients of the linear combination

    Definition Classes
    LinearCombination0 → LinearCombination
  77. def getPair(i: Int): (IdealInt, Term)
    Definition Classes
    LinearCombination0 → LinearCombination
  78. def getTerm(i: Int): Term

    Method to access the terms of the linear combination

    Method to access the terms of the linear combination

    Definition Classes
    LinearCombination0 → LinearCombination
  79. def groupBy[K](f: ((IdealInt, Term)) => K): Map[K, IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  80. def groupMap[K, B](key: ((IdealInt, Term)) => K)(f: ((IdealInt, Term)) => B): Map[K, IndexedSeq[B]]
    Definition Classes
    IterableOps
  81. def groupMapReduce[K, B](key: ((IdealInt, Term)) => K)(f: ((IdealInt, Term)) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  82. def grouped(size: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  83. def hashCode(): Int
    Definition Classes
    LinearCombination0 → Seq → AnyRef → Any
  84. def head: (IdealInt, Term)
    Definition Classes
    IndexedSeqOps → IterableOps
  85. def headOption: Option[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps
  86. def indexOf[B >: (IdealInt, Term)](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  87. def indexOf[B >: (IdealInt, Term)](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  88. def indexOfSlice[B >: (IdealInt, Term)](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  89. def indexOfSlice[B >: (IdealInt, Term)](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  90. def indexWhere(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  91. def indexWhere(p: ((IdealInt, Term)) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  92. def indices: Range
    Definition Classes
    SeqOps
  93. def init: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps
  94. def inits: Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  95. def intersect[B >: (IdealInt, Term)](that: Seq[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  96. 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).

    Definition Classes
    LinearCombination0 → LinearCombination
  97. def isConstant: Boolean

    Return whether this linear combination is an integer constant

    Return whether this linear combination is an integer constant

    Definition Classes
    LinearCombination0 → LinearCombination
  98. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  99. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  100. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  101. def isNonZero: Boolean

    Return whether the value of this linear combination is never zero

    Return whether the value of this linear combination is never zero

    Definition Classes
    LinearCombination0 → LinearCombination
  102. def isPositive: Boolean

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

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

    Definition Classes
    LinearCombination
  103. 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.

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

    Definition Classes
    LinearCombination0 → LinearCombination
  104. def isSortedBy(otherOrder: TermOrder): Boolean
    Definition Classes
    SortedWithOrder → Sorted
  105. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  106. val isZero: Boolean

    Return whether the value of this linear combination is constantly zero

    Return whether the value of this linear combination is constantly zero

    Definition Classes
    LinearCombination0 → LinearCombination
  107. def iterableFactory: SeqFactory[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  108. def iterator: Iterator[(IdealInt, Term)]
    Definition Classes
    LinearCombination → IndexedSeqOps → IterableOnce
  109. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  110. def last: (IdealInt, Term)
    Definition Classes
    IndexedSeqOps → IterableOps
  111. def lastCoeff: IdealInt
    Definition Classes
    LinearCombination
  112. def lastIndexOf[B >: (IdealInt, Term)](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  113. def lastIndexOfSlice[B >: (IdealInt, Term)](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  114. def lastIndexOfSlice[B >: (IdealInt, Term)](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  115. def lastIndexWhere(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  116. def lastIndexWhere(p: ((IdealInt, Term)) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  117. def lastOption: Option[(IdealInt, Term)]
    Definition Classes
    IterableOps
  118. def lastTerm: OneTerm
    Definition Classes
    LinearCombination0 → LinearCombination
  119. def lazyPairSeq: IndexedSeq[(IdealInt, Term)]
    Attributes
    protected
    Definition Classes
    LinearCombination
  120. def lazyZip[B](that: Iterable[B]): LazyZip2[(IdealInt, Term), B, LinearCombination0.this.type]
    Definition Classes
    Iterable
  121. def lcSize: Int
    Definition Classes
    LinearCombination0 → LinearCombination
  122. def leadingCoeff: IdealInt

    The leading coefficient of this linear combination

    The leading coefficient of this linear combination

    Definition Classes
    LinearCombination0 → LinearCombination
  123. def leadingTerm: Term

    The leading monomial of this linear combination

    The leading monomial of this linear combination

    Definition Classes
    LinearCombination0 → LinearCombination
  124. def length: Int
    Definition Classes
    LinearCombination → SeqOps
  125. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  126. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  127. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  128. def lift: (Int) => Option[(IdealInt, Term)]
    Definition Classes
    PartialFunction
  129. def makePositive: LinearCombination
    Definition Classes
    LinearCombination
  130. 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.

    Definition Classes
    LinearCombination
  131. 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)

    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)

    Definition Classes
    LinearCombination
  132. def map[B](f: ((IdealInt, Term)) => B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  133. def max[B >: (IdealInt, Term)](implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  134. def maxBy[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  135. def maxByOption[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  136. def maxOption[B >: (IdealInt, Term)](implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  137. def min[B >: (IdealInt, Term)](implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  138. def minBy[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): (IdealInt, Term)
    Definition Classes
    IterableOnceOps
  139. def minByOption[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  140. def minOption[B >: (IdealInt, Term)](implicit ord: Ordering[B]): Option[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  141. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  142. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  143. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  144. 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.

    Definition Classes
    LinearCombination
  145. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  146. def newSpecificBuilder: Builder[(IdealInt, Term), IndexedSeq[(IdealInt, Term)]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  147. def nonConstCoeffGcd: IdealInt

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

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

    Definition Classes
    LinearCombination0 → LinearCombination
  148. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  149. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  150. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  151. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  152. def orElse[A1 <: Int, B1 >: (IdealInt, Term)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  153. val order: TermOrder
    Definition Classes
    LinearCombination → SortedWithOrder
  154. def padTo[B >: (IdealInt, Term)](len: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  155. def pairIterator: Iterator[(IdealInt, Term)]
    Definition Classes
    LinearCombination0 → LinearCombination
  156. lazy val pairSeq: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    LinearCombination0 → LinearCombination
  157. def partition(p: ((IdealInt, Term)) => Boolean): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])
    Definition Classes
    IterableOps
  158. def partitionMap[A1, A2](f: ((IdealInt, Term)) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  159. def patch[B >: (IdealInt, Term)](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
    Definition Classes
    SeqOps
  160. def permutations: Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    SeqOps
  161. def predicates: Set[Predicate]
    Definition Classes
    Term → TerFor
  162. def prepended[B >: (IdealInt, Term)](elem: B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  163. def prependedAll[B >: (IdealInt, Term)](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  164. def product[B >: (IdealInt, Term)](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  165. def reduce[B >: (IdealInt, Term)](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  166. def reduceLeft[B >: (IdealInt, Term)](op: (B, (IdealInt, Term)) => B): B
    Definition Classes
    IterableOnceOps
  167. def reduceLeftOption[B >: (IdealInt, Term)](op: (B, (IdealInt, Term)) => B): Option[B]
    Definition Classes
    IterableOnceOps
  168. def reduceOption[B >: (IdealInt, Term)](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  169. def reduceRight[B >: (IdealInt, Term)](op: ((IdealInt, Term), B) => B): B
    Definition Classes
    IterableOnceOps
  170. def reduceRightOption[B >: (IdealInt, Term)](op: ((IdealInt, Term), B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  171. 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.

    Definition Classes
    LinearCombination
  172. def reverse: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → SeqOps
  173. def reverseIterator: Iterator[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → SeqOps
  174. def reversed: Iterable[(IdealInt, Term)]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  175. def runWith[U](action: ((IdealInt, Term)) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  176. def sameElements[B >: (IdealInt, Term)](o: IterableOnce[B]): Boolean
    Definition Classes
    IndexedSeq → SeqOps
  177. 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).

    Definition Classes
    LinearCombination0 → LinearCombination
  178. def scale(coeff: IdealInt): LinearCombination

    Multiply all coefficients of this linear combination by a constant

    Multiply all coefficients of this linear combination by a constant

    Definition Classes
    LinearCombination0 → LinearCombination
  179. def scaleAndAdd(coeff: IdealInt, const: IdealInt): LinearCombination

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

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

    Definition Classes
    LinearCombination0 → LinearCombination
  180. def scan[B >: (IdealInt, Term)](z: B)(op: (B, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  181. def scanLeft[B](z: B)(op: (B, (IdealInt, Term)) => B): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  182. def scanRight[B](z: B)(op: ((IdealInt, Term), B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  183. def search[B >: (IdealInt, Term)](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  184. def search[B >: (IdealInt, Term)](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  185. def segmentLength(p: ((IdealInt, Term)) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  186. final def segmentLength(p: ((IdealInt, Term)) => Boolean): Int
    Definition Classes
    SeqOps
  187. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  188. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  189. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  190. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  191. def slice(from: Int, until: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
  192. def sliding(size: Int, step: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  193. def sliding(size: Int): Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  194. def sortBy(newOrder: 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
    LinearCombination0 → Sorted
  195. def sortBy[B](f: ((IdealInt, Term)) => B)(implicit ord: Ordering[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  196. def sortWith(lt: ((IdealInt, Term), (IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  197. def sorted[B >: (IdealInt, Term)](implicit ord: Ordering[B]): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    SeqOps
  198. def span(p: ((IdealInt, Term)) => Boolean): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])
    Definition Classes
    IterableOps → IterableOnceOps
  199. def splitAt(n: Int): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])
    Definition Classes
    IterableOps → IterableOnceOps
  200. def startsWith[B >: (IdealInt, Term)](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  201. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(IdealInt, Term), S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  202. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  203. def sum[B >: (IdealInt, Term)](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  204. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  205. def tail: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps
  206. def tails: Iterator[IndexedSeq[(IdealInt, Term)]]
    Definition Classes
    IterableOps
  207. def take(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  208. def takeRight(n: Int): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → IterableOps
  209. def takeWhile(p: ((IdealInt, Term)) => Boolean): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  210. def tapEach[U](f: ((IdealInt, Term)) => U): IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IterableOps → IterableOnceOps
  211. def termIterator: Iterator[Term]

    Iterator over all terms of the linear combination

    Iterator over all terms of the linear combination

    Definition Classes
    LinearCombination0 → LinearCombination
  212. lazy val termSeq: IndexedSeq[Term]
    Definition Classes
    LinearCombination
  213. def to[C1](factory: Factory[(IdealInt, Term), C1]): C1
    Definition Classes
    IterableOnceOps
  214. def toArray[B >: (IdealInt, Term)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  215. final def toBuffer[B >: (IdealInt, Term)]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  216. final def toIndexedSeq: IndexedSeq[(IdealInt, Term)]
    Definition Classes
    IndexedSeq → IterableOnceOps
  217. def toList: List[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  218. def toMap[K, V](implicit ev: <:<[(IdealInt, Term), (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  219. final def toSeq: LinearCombination0.this.type
    Definition Classes
    Seq → IterableOnceOps
  220. def toSet[B >: (IdealInt, Term)]: Set[B]
    Definition Classes
    IterableOnceOps
  221. def toString(): String
    Definition Classes
    LinearCombination → Seq → Function1 → Iterable → AnyRef → Any
  222. def toVector: Vector[(IdealInt, Term)]
    Definition Classes
    IterableOnceOps
  223. def transpose[B](implicit asIterable: ((IdealInt, Term)) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    IterableOps
  224. def unapply(a: Int): Option[(IdealInt, Term)]
    Definition Classes
    PartialFunction
  225. def unary_-: LinearCombination

    The negation of a linear combination

    The negation of a linear combination

    Definition Classes
    LinearCombination0 → LinearCombination
  226. def unzip[A1, A2](implicit asPair: ((IdealInt, Term)) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  227. def unzip3[A1, A2, A3](implicit asTriple: ((IdealInt, Term)) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    IterableOps
  228. def updated[B >: (IdealInt, Term)](index: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  229. def variables: Set[VariableTerm]
    Definition Classes
    LinearCombination0 → LinearCombination → TerFor
  230. def variablesIterator: Iterator[VariableTerm]
    Definition Classes
    LinearCombination0 → LinearCombination
  231. def view: IndexedSeqView[(IdealInt, Term)]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  232. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  233. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  234. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  235. def withFilter(p: ((IdealInt, Term)) => Boolean): WithFilter[(IdealInt, Term), [_]IndexedSeq[_]]
    Definition Classes
    IterableOps
  236. def zip[B](that: IterableOnce[B]): IndexedSeq[((IdealInt, Term), B)]
    Definition Classes
    IterableOps
  237. def zipAll[A1 >: (IdealInt, Term), B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
    Definition Classes
    IterableOps
  238. 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: LinearCombination0.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  12. final def toIterable: LinearCombination0.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 LinearCombination

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