Class

ap.terfor.linearcombination

LinearCombination0

Related Doc: package linearcombination

Permalink

final class LinearCombination0 extends LinearCombination

Constant linear combinations

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

Type Members

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

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

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

    Permalink
    Definition Classes
    TraversableLike

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def *(that: LinearCombination): LinearCombination

    Permalink

    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

    Permalink

    Addition of two linear combinations.

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

    Definition Classes
    LinearCombination0LinearCombination
  5. def +(that: IdealInt): LinearCombination

    Permalink

    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
    LinearCombination0LinearCombination
  6. def ++[B >: (IdealInt, Term), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

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

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

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  10. def -(that: LinearCombination)(implicit newOrder: TermOrder): LinearCombination

    Permalink

    Subtraction of two linear combinations.

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

    Definition Classes
    LinearCombination0LinearCombination
  11. def /(denom: IdealInt): LinearCombination

    Permalink

    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
    LinearCombination0LinearCombination
  12. def /:[B](z: B)(op: (B, (IdealInt, Term)) ⇒ B): B

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  14. def :\[B](z: B)(op: ((IdealInt, Term), B) ⇒ B): B

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce
  19. def aggregate[B](z: ⇒ B)(seqop: (B, (IdealInt, Term)) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def andThen[C](k: ((IdealInt, Term)) ⇒ C): PartialFunction[Int, C]

    Permalink
    Definition Classes
    PartialFunction → Function1
  21. def apply(i: Int): (IdealInt, Term)

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

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

    Permalink
    Definition Classes
    Any
  24. def assertCtor: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    LinearCombination
  25. def canEqual(that: Any): Boolean

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. def coeffIterator: Iterator[IdealInt]

    Permalink

    Iterator over all coefficients of the linear combination

    Iterator over all coefficients of the linear combination

    Definition Classes
    LinearCombination0LinearCombination
  28. def collect[B, That](pf: PartialFunction[(IdealInt, Term), B])(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  29. def collectFirst[B](pf: PartialFunction[(IdealInt, Term), B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  30. def combinations(n: Int): Iterator[IndexedSeq[(IdealInt, Term)]]

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

    Permalink
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  32. def compose[A](g: (A) ⇒ Int): (A) ⇒ (IdealInt, Term)

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  33. val constant: IdealInt

    Permalink

    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
    LinearCombination0LinearCombination
  34. def constantDiff(that: LinearCombination): Option[IdealInt]

    Permalink

    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
  35. def constants: Set[ConstantTerm]

    Permalink
  36. def constantsIterator: Iterator[ConstantTerm]

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  37. def contains[A1 >: (IdealInt, Term)](elem: A1): Boolean

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def copyToArray[B >: (IdealInt, Term)](xs: Array[B]): Unit

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def copyToBuffer[B >: (IdealInt, Term)](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  43. def corresponds[B](that: GenSeq[B])(p: ((IdealInt, Term), B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  44. def count(p: ((IdealInt, Term)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def diff[B >: (IdealInt, Term)](that: GenSeq[B]): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  46. def distinct: IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  47. def drop(n: Int): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  48. def dropRight(n: Int): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    IterableLike
  49. def dropWhile(p: ((IdealInt, Term)) ⇒ Boolean): IndexedSeq[(IdealInt, Term)]

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

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

    Permalink
    Definition Classes
    AnyRef
  52. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    LinearCombination0 → GenSeqLike → Equals → AnyRef → Any
  53. def exists(p: ((IdealInt, Term)) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. def filter(p: ((IdealInt, Term)) ⇒ Boolean): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def filterNot(p: ((IdealInt, Term)) ⇒ Boolean): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def filterPairs(f: (IdealInt, Term) ⇒ Boolean): LinearCombination

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  57. def finalize(): Unit

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def flatMap[B, That](f: ((IdealInt, Term)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  60. def flatten[B](implicit asTraversable: ((IdealInt, Term)) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  61. def fold[A1 >: (IdealInt, Term)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def foldLeft[B](z: B)(op: (B, (IdealInt, Term)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def foldRight[B](z: B)(op: ((IdealInt, Term), B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  64. def forall(p: ((IdealInt, Term)) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  65. def foreach[U](f: ((IdealInt, Term)) ⇒ U): Unit

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  67. def get(t: Term): IdealInt

    Permalink

    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
    LinearCombination0LinearCombination
  68. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  69. def getCoeff(i: Int): IdealInt

    Permalink

    Method to access the coefficients of the linear combination

    Method to access the coefficients of the linear combination

    Definition Classes
    LinearCombination0LinearCombination
  70. def getPair(i: Int): (IdealInt, Term)

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  71. def getTerm(i: Int): Term

    Permalink

    Method to access the terms of the linear combination

    Method to access the terms of the linear combination

    Definition Classes
    LinearCombination0LinearCombination
  72. def groupBy[K](f: ((IdealInt, Term)) ⇒ K): Map[K, IndexedSeq[(IdealInt, Term)]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def grouped(size: Int): Iterator[IndexedSeq[(IdealInt, Term)]]

    Permalink
    Definition Classes
    IterableLike
  74. def hasDefiniteSize: Boolean

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

    Permalink
    Definition Classes
    LinearCombination0 → IndexedSeqLike → GenSeqLike → AnyRef → Any
  76. def head: (IdealInt, Term)

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  77. def headOption: Option[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def indexOf[B >: (IdealInt, Term)](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  79. def indexOf[B >: (IdealInt, Term)](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  80. def indexOfSlice[B >: (IdealInt, Term)](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike
  81. def indexOfSlice[B >: (IdealInt, Term)](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  82. def indexWhere(p: ((IdealInt, Term)) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  83. def indexWhere(p: ((IdealInt, Term)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  84. def indices: Range

    Permalink
    Definition Classes
    SeqLike
  85. def init: IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def inits: Iterator[IndexedSeq[(IdealInt, Term)]]

    Permalink
    Definition Classes
    TraversableLike
  87. def intersect[B >: (IdealInt, Term)](that: GenSeq[B]): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  88. def inverseNonConstantTerms(that: LinearCombination): Boolean

    Permalink

    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
    LinearCombination0LinearCombination
  89. def isConstant: Boolean

    Permalink

    Return whether this linear combination is an integer constant

    Return whether this linear combination is an integer constant

    Definition Classes
    LinearCombination0LinearCombination
  90. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  91. def isEmpty: Boolean

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  92. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  93. def isNonZero: Boolean

    Permalink

    Return whether the value of this linear combination is never zero

    Return whether the value of this linear combination is never zero

    Definition Classes
    LinearCombination0LinearCombination
  94. def isPositive: Boolean

    Permalink

    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
  95. def isPrimitive: Boolean

    Permalink

    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
    LinearCombination0LinearCombination
  96. def isSortedBy(otherOrder: TermOrder): Boolean

    Permalink
    Definition Classes
    SortedWithOrderSorted
  97. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  98. val isZero: Boolean

    Permalink

    Return whether the value of this linear combination is constantly zero

    Return whether the value of this linear combination is constantly zero

    Definition Classes
    LinearCombination0LinearCombination
  99. def iterator: Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    LinearCombination → IndexedSeqLike → IterableLike → GenIterableLike
  100. def last: (IdealInt, Term)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def lastCoeff: IdealInt

    Permalink
    Definition Classes
    LinearCombination
  102. def lastIndexOf[B >: (IdealInt, Term)](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  103. def lastIndexOf[B >: (IdealInt, Term)](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  104. def lastIndexOfSlice[B >: (IdealInt, Term)](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike
  105. def lastIndexOfSlice[B >: (IdealInt, Term)](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  106. def lastIndexWhere(p: ((IdealInt, Term)) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  107. def lastIndexWhere(p: ((IdealInt, Term)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  108. def lastOption: Option[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def lastTerm: OneTerm.type

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  110. def lazyPairSeq: IndexedSeq[(IdealInt, Term)]

    Permalink
    Attributes
    protected
    Definition Classes
    LinearCombination
  111. def lcSize: Int

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  112. def leadingCoeff: IdealInt

    Permalink

    The leading coefficient of this linear combination

    The leading coefficient of this linear combination

    Definition Classes
    LinearCombination0LinearCombination
  113. def leadingTerm: Term

    Permalink

    The leading monomial of this linear combination

    The leading monomial of this linear combination

    Definition Classes
    LinearCombination0LinearCombination
  114. def length: Int

    Permalink
    Definition Classes
    LinearCombination → SeqLike → GenSeqLike
  115. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    SeqLike
  116. def lift: (Int) ⇒ Option[(IdealInt, Term)]

    Permalink
    Definition Classes
    PartialFunction
  117. def makePositive: LinearCombination

    Permalink
    Definition Classes
    LinearCombination
  118. def makePrimitive: LinearCombination

    Permalink

    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
  119. def makePrimitiveAndPositive: LinearCombination

    Permalink

    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
  120. def map[B, That](f: ((IdealInt, Term)) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  121. def max[B >: (IdealInt, Term)](implicit cmp: Ordering[B]): (IdealInt, Term)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def maxBy[B](f: ((IdealInt, Term)) ⇒ B)(implicit cmp: Ordering[B]): (IdealInt, Term)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def min[B >: (IdealInt, Term)](implicit cmp: Ordering[B]): (IdealInt, Term)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. def minBy[B](f: ((IdealInt, Term)) ⇒ B)(implicit cmp: Ordering[B]): (IdealInt, Term)

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def moduloLeadingCoeff: LinearCombination

    Permalink

    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
  129. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  130. def newBuilder: Builder[(IdealInt, Term), IndexedSeq[(IdealInt, Term)]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  131. def nonConstCoeffGcd: IdealInt

    Permalink

    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
    LinearCombination0LinearCombination
  132. def nonEmpty: Boolean

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

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

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

    Permalink
    Definition Classes
    PartialFunction
  136. val order: TermOrder

    Permalink
    Definition Classes
    LinearCombinationSortedWithOrder
  137. def padTo[B >: (IdealInt, Term), That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  138. def pairIterator: Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  139. lazy val pairSeq: IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  140. def par: ParSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    Parallelizable
  141. def parCombiner: Combiner[(IdealInt, Term), ParSeq[(IdealInt, Term)]]

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

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  144. def permutations: Iterator[IndexedSeq[(IdealInt, Term)]]

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

    Permalink
    Definition Classes
    TermTerFor
  146. def prefixLength(p: ((IdealInt, Term)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  147. def product[B >: (IdealInt, Term)](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def reduce[A1 >: (IdealInt, Term)](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def reduceLeft[B >: (IdealInt, Term)](op: (B, (IdealInt, Term)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  150. def reduceLeftOption[B >: (IdealInt, Term)](op: (B, (IdealInt, Term)) ⇒ B): Option[B]

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def reduceRight[B >: (IdealInt, Term)](op: ((IdealInt, Term), B) ⇒ B): B

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def reduceWithLeadingCoeff: LinearCombination

    Permalink

    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
  155. def repr: IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  156. def reverse: IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  157. def reverseIterator: Iterator[(IdealInt, Term)]

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  159. def reversed: List[(IdealInt, Term)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  160. def runWith[U](action: ((IdealInt, Term)) ⇒ U): (Int) ⇒ Boolean

    Permalink
    Definition Classes
    PartialFunction
  161. def sameElements[B >: (IdealInt, Term)](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  162. def sameNonConstantTerms(that: LinearCombination): Boolean

    Permalink

    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
    LinearCombination0LinearCombination
  163. def scale(coeff: IdealInt): LinearCombination

    Permalink

    Multiply all coefficients of this linear combination by a constant

    Multiply all coefficients of this linear combination by a constant

    Definition Classes
    LinearCombination0LinearCombination
  164. def scaleAndAdd(coeff: IdealInt, const: IdealInt): LinearCombination

    Permalink

    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
    LinearCombination0LinearCombination
  165. def scan[B >: (IdealInt, Term), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  168. def segmentLength(p: ((IdealInt, Term)) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  169. def seq: IndexedSeq[(IdealInt, Term)]

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

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

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

    Permalink
    Definition Classes
    IterableLike
  173. def sliding(size: Int): Iterator[IndexedSeq[(IdealInt, Term)]]

    Permalink
    Definition Classes
    IterableLike
  174. def sortBy(newOrder: TermOrder): LinearCombination

    Permalink

    Re-sort an object with a new TermOrder.

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

    Definition Classes
    LinearCombination0Sorted
  175. def sortBy[B](f: ((IdealInt, Term)) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike
  176. def sortWith(lt: ((IdealInt, Term), (IdealInt, Term)) ⇒ Boolean): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike
  177. def sorted[B >: (IdealInt, Term)](implicit ord: Ordering[B]): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike
  178. def span(p: ((IdealInt, Term)) ⇒ Boolean): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  179. def splitAt(n: Int): (IndexedSeq[(IdealInt, Term)], IndexedSeq[(IdealInt, Term)])

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

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

    Permalink
    Definition Classes
    GenSeqLike
  182. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  183. def sum[B >: (IdealInt, Term)](implicit num: Numeric[B]): B

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

    Permalink
    Definition Classes
    AnyRef
  185. def tail: IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  186. def tails: Iterator[IndexedSeq[(IdealInt, Term)]]

    Permalink
    Definition Classes
    TraversableLike
  187. def take(n: Int): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  188. def takeRight(n: Int): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    IterableLike
  189. def takeWhile(p: ((IdealInt, Term)) ⇒ Boolean): IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  190. def termIterator: Iterator[Term]

    Permalink

    Iterator over all terms of the linear combination

    Iterator over all terms of the linear combination

    Definition Classes
    LinearCombination0LinearCombination
  191. lazy val termSeq: IndexedSeq[Term]

    Permalink
    Definition Classes
    LinearCombination
  192. def thisCollection: IndexedSeq[(IdealInt, Term)]

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  194. def toArray[B >: (IdealInt, Term)](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  195. def toBuffer[A1 >: (IdealInt, Term)]: Buffer[A1]

    Permalink
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  196. def toCollection(repr: IndexedSeq[(IdealInt, Term)]): IndexedSeq[(IdealInt, Term)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  197. def toIndexedSeq: IndexedSeq[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  198. def toIterable: Iterable[(IdealInt, Term)]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  199. def toIterator: Iterator[(IdealInt, Term)]

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  202. def toSeq: Seq[(IdealInt, Term)]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  203. def toSet[B >: (IdealInt, Term)]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  204. def toStream: Stream[(IdealInt, Term)]

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

    Permalink
    Definition Classes
    LinearCombination → SeqLike → TraversableLike → Function1 → AnyRef → Any
  206. def toTraversable: Traversable[(IdealInt, Term)]

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  208. def transpose[B](implicit asTraversable: ((IdealInt, Term)) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  209. def unary_-: LinearCombination

    Permalink

    The negation of a linear combination

    The negation of a linear combination

    Definition Classes
    LinearCombination0LinearCombination
  210. def union[B >: (IdealInt, Term), That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  213. def updated[B >: (IdealInt, Term), That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  214. def variables: Set[VariableTerm]

    Permalink
    Definition Classes
    LinearCombination0LinearCombinationTerFor
  215. def variablesIterator: Iterator[VariableTerm]

    Permalink
    Definition Classes
    LinearCombination0LinearCombination
  216. def view(from: Int, until: Int): SeqView[(IdealInt, Term), IndexedSeq[(IdealInt, Term)]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  217. def view: SeqView[(IdealInt, Term), IndexedSeq[(IdealInt, Term)]]

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

Inherited from LinearCombination

Inherited from IndexedSeq[(IdealInt, Term)]

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

Inherited from Seq[(IdealInt, Term)]

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

Inherited from GenSeq[(IdealInt, Term)]

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

Inherited from Iterable[(IdealInt, Term)]

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

Inherited from Equals

Inherited from GenIterable[(IdealInt, Term)]

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

Inherited from Traversable[(IdealInt, Term)]

Inherited from GenTraversable[(IdealInt, Term)]

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

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

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

Inherited from Parallelizable[(IdealInt, Term), ParSeq[(IdealInt, Term)]]

Inherited from TraversableOnce[(IdealInt, Term)]

Inherited from GenTraversableOnce[(IdealInt, Term)]

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

Inherited from HasNewBuilder[(IdealInt, Term), IndexedSeq[(ap.basetypes.IdealInt, ap.terfor.Term)] @scala.annotation.unchecked.uncheckedVariance]

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

Inherited from (Int) ⇒ (IdealInt, Term)

Inherited from Sorted[LinearCombination]

Inherited from Term

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped