Class/Object

ap.terfor.linearcombination

LinearCombination

Related Docs: object LinearCombination | package linearcombination

Permalink

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)], 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
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinearCombination
  2. IndexedSeq
  3. IndexedSeqLike
  4. Seq
  5. SeqLike
  6. GenSeq
  7. GenSeqLike
  8. Iterable
  9. IterableLike
  10. Equals
  11. GenIterable
  12. GenIterableLike
  13. Traversable
  14. GenTraversable
  15. GenericTraversableTemplate
  16. TraversableLike
  17. GenTraversableLike
  18. Parallelizable
  19. TraversableOnce
  20. GenTraversableOnce
  21. FilterMonadic
  22. HasNewBuilder
  23. PartialFunction
  24. Function1
  25. SortedWithOrder
  26. Sorted
  27. Term
  28. TerFor
  29. AnyRef
  30. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

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

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

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract 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

  2. abstract 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

  3. abstract 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

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

    Permalink

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

  5. abstract def coeffIterator: Iterator[IdealInt]

    Permalink

    Iterator over all coefficients of the linear combination

  6. abstract def constant: IdealInt

    Permalink

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

  7. abstract def constants: Set[ConstantTerm]

    Permalink
    Definition Classes
    LinearCombinationSortedWithOrderTerFor
  8. abstract def constantsIterator: Iterator[ConstantTerm]

    Permalink
  9. abstract def filterPairs(f: (IdealInt, Term) ⇒ Boolean): LinearCombination

    Permalink
  10. abstract 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

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

    Permalink

    Method to access the coefficients of the linear combination

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

    Permalink
  13. abstract def getTerm(i: Int): Term

    Permalink

    Method to access the terms of the linear combination

  14. abstract 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).

  15. abstract def isConstant: Boolean

    Permalink

    Return whether this linear combination is an integer constant

  16. abstract def isNonZero: Boolean

    Permalink

    Return whether the value of this linear combination is never zero

  17. abstract def isZero: Boolean

    Permalink

    Return whether the value of this linear combination is constantly zero

  18. abstract def lastTerm: Term

    Permalink
  19. abstract def lcSize: Int

    Permalink
  20. abstract def leadingCoeff: IdealInt

    Permalink

    The leading coefficient of this linear combination

  21. abstract def leadingTerm: Term

    Permalink

    The leading monomial of this linear combination

  22. abstract def nonConstCoeffGcd: IdealInt

    Permalink

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

  23. abstract def pairSeq: IndexedSeq[(IdealInt, Term)]

    Permalink
  24. abstract 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).

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

    Permalink

    Multiply all coefficients of this linear combination by a constant

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

    Permalink

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

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

    Permalink

    Iterator over all terms of the linear combination

  29. abstract def unary_-: LinearCombination

    Permalink

    The negation of a linear combination

  30. abstract def variables: Set[VariableTerm]

    Permalink
    Definition Classes
    LinearCombinationTerFor
  31. abstract def variablesIterator: Iterator[VariableTerm]

    Permalink

Concrete 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.

  4. def ++[B >: (IdealInt, Term), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    Any
  20. def assertCtor: Boolean

    Permalink
    Attributes
    protected
  21. def canEqual(that: Any): Boolean

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

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

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

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

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

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

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. 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.

  29. def contains[A1 >: (IdealInt, Term)](elem: A1): Boolean

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  58. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  59. def groupBy[K](f: ((IdealInt, Term)) ⇒ K): Map[K, IndexedSeq[(IdealInt, Term)]]

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

    Permalink
    Definition Classes
    IterableLike
  61. def hasDefiniteSize: Boolean

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSeqLike
  71. def indices: Range

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

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

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

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

    Permalink
    Definition Classes
    GenSeqLike
  76. def isEmpty: Boolean

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

    Permalink
    Definition Classes
    Any
  78. def isPositive: Boolean

    Permalink

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

  79. 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.

  80. def isSortedBy(otherOrder: TermOrder): Boolean

    Permalink
    Definition Classes
    SortedWithOrderSorted
  81. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  82. def iterator: Iterator[(IdealInt, Term)]

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

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

    Permalink
  85. def lastIndexOf[B >: (IdealInt, Term)](elem: B, end: Int): Int

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected
  93. def length: Int

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

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

    Permalink
    Definition Classes
    PartialFunction
  96. def makePositive: LinearCombination

    Permalink
  97. 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.

  98. 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)

  99. def map[B, That](f: ((IdealInt, Term)) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], B, That]): That

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    PartialFunction
  113. val order: TermOrder

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

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

    Permalink
  116. def par: ParSeq[(IdealInt, Term)]

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  119. 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
  120. def permutations: Iterator[IndexedSeq[(IdealInt, Term)]]

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. 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 supposed to be used for column operations when solving systems of linear equations.

  131. def repr: IndexedSeq[(IdealInt, Term)]

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  138. 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
  139. 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
  140. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSeqLike
  154. def stringPrefix: String

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  162. lazy val termSeq: IndexedSeq[Term]

    Permalink
  163. def thisCollection: IndexedSeq[(IdealInt, Term)]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. 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.

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

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

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

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  184. def view(from: Int, until: Int): SeqView[(IdealInt, Term), IndexedSeq[(IdealInt, Term)]]

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  190. 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
  191. 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
  192. def zipWithIndex[A1 >: (IdealInt, Term), That](implicit bf: CanBuildFrom[IndexedSeq[(IdealInt, Term)], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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