Packages

class EquationConj extends EquationSet with SortedWithOrder[EquationConj]

The class for representing conjunctions of equations, i.e., of systems of equations. Systems of equations are always implicitly canonised and reduced by means of row operations, i.e., it is ensured that the leading terms of two equations are always distinct, and that no equation can be made smaller in the used TermOrder by adding multiples of other equations. This is not a complete method for deciding the satisfiability of a system, it is also necessary to perform column operations. Column operations are not applied implicitly, however.

Linear Supertypes
SortedWithOrder[EquationConj], Sorted[EquationConj], EquationSet, IndexedSeq[LinearCombination], IndexedSeqOps[LinearCombination, IndexedSeq, IndexedSeq[LinearCombination]], IndexedSeq[LinearCombination], IndexedSeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], Seq[LinearCombination], SeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], Seq[LinearCombination], Equals, SeqOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], PartialFunction[Int, LinearCombination], (Int) => LinearCombination, Iterable[LinearCombination], Iterable[LinearCombination], IterableFactoryDefaults[LinearCombination, [x]IndexedSeq[x]], IterableOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], IterableOnceOps[LinearCombination, [_]IndexedSeq[_], IndexedSeq[LinearCombination]], IterableOnce[LinearCombination], Formula, TerFor, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EquationConj
  2. SortedWithOrder
  3. Sorted
  4. EquationSet
  5. IndexedSeq
  6. IndexedSeqOps
  7. IndexedSeq
  8. IndexedSeqOps
  9. Seq
  10. SeqOps
  11. Seq
  12. Equals
  13. SeqOps
  14. PartialFunction
  15. Function1
  16. Iterable
  17. Iterable
  18. IterableFactoryDefaults
  19. IterableOps
  20. IterableOnceOps
  21. IterableOnce
  22. Formula
  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. final def ++[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. final def ++:[B >: LinearCombination](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  5. final def +:[B >: LinearCombination](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  6. def --(that: EquationConj): EquationConj
  7. final def :+[B >: LinearCombination](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def :++[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  13. def andThen[C](k: PartialFunction[LinearCombination, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  14. def andThen[C](k: (LinearCombination) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  15. def appended[B >: LinearCombination](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  16. def appendedAll[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  17. def apply(i: Int): LinearCombination
    Definition Classes
    EquationSet → SeqOps → Function1
  18. def applyOrElse[A1 <: Int, B1 >: LinearCombination](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  19. def applyPreferredMaxLength: Int
    Attributes
    protected
    Definition Classes
    IndexedSeq
  20. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  21. def canEqual(that: Any): Boolean
    Definition Classes
    IndexedSeq → Seq → Equals
  22. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  23. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  24. final def coll: EquationConj.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  25. def collect[B](pf: PartialFunction[LinearCombination, B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  26. def collectFirst[B](pf: PartialFunction[LinearCombination, B]): Option[B]
    Definition Classes
    IterableOnceOps
  27. def combinations(n: Int): Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    SeqOps
  28. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, LinearCombination]
    Definition Classes
    PartialFunction
  29. def compose[A](g: (A) => Int): (A) => LinearCombination
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  30. final def concat[B >: LinearCombination](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  31. lazy val constants: Set[ConstantTerm]
    Definition Classes
    EquationSet → TerFor
  32. def contains(lc: LinearCombination): Boolean
    Definition Classes
    EquationSet
  33. def contains[A1 >: LinearCombination](elem: A1): Boolean
    Definition Classes
    SeqOps
  34. def containsSlice[B >: LinearCombination](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  35. def copyToArray[B >: LinearCombination](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  36. def copyToArray[B >: LinearCombination](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  37. def copyToArray[B >: LinearCombination](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  38. def corresponds[B](that: Seq[B])(p: (LinearCombination, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  39. def corresponds[B](that: IterableOnce[B])(p: (LinearCombination, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  40. def count(p: (LinearCombination) => Boolean): Int
    Definition Classes
    IterableOnceOps
  41. def diff[B >: LinearCombination](that: Seq[B]): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  42. def distinct: IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  43. def distinctBy[B](f: (LinearCombination) => B): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  44. def drop(n: Int): IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  45. def dropRight(n: Int): IndexedSeq[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps
  46. def dropWhile(p: (LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  47. def elementWise: ElementWiseExtractor[Int, LinearCombination]
    Definition Classes
    PartialFunction
  48. def empty: IndexedSeq[LinearCombination]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  49. def endsWith[B >: LinearCombination](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  50. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  51. def equals(that: Any): Boolean
    Definition Classes
    EquationConj → EquationSet → Seq → Equals → AnyRef → Any
  52. def exists(p: (LinearCombination) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  53. def filter(pred: (LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  54. def filterNot(pred: (LinearCombination) => Boolean): IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps → IterableOnceOps
  55. def find(p: (LinearCombination) => Boolean): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  56. def findLast(p: (LinearCombination) => Boolean): Option[LinearCombination]
    Definition Classes
    SeqOps
  57. def flatMap[B](f: (LinearCombination) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  58. def flatten[B](implicit asIterable: (LinearCombination) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  59. def fold[A1 >: LinearCombination](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  60. def foldLeft[B](z: B)(op: (B, LinearCombination) => B): B
    Definition Classes
    IterableOnceOps
  61. def foldRight[B](z: B)(op: (LinearCombination, B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  62. def forall(p: (LinearCombination) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  63. def foreach[U](f: (LinearCombination) => U): Unit
    Definition Classes
    IterableOnceOps
  64. def fromSpecific(coll: IterableOnce[LinearCombination]): IndexedSeq[LinearCombination]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  65. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  66. def groundAtoms: Set[Atom]
    Definition Classes
    EquationSet → Formula
  67. def groupBy[K](f: (LinearCombination) => K): Map[K, IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  68. def groupMap[K, B](key: (LinearCombination) => K)(f: (LinearCombination) => B): Map[K, IndexedSeq[B]]
    Definition Classes
    IterableOps
  69. def groupMapReduce[K, B](key: (LinearCombination) => K)(f: (LinearCombination) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  70. def grouped(size: Int): Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  71. def hashCode(): Int
    Definition Classes
    EquationConj → EquationSet → Seq → AnyRef → Any
  72. def head: LinearCombination
    Definition Classes
    IndexedSeqOps → IterableOps
  73. def headOption: Option[LinearCombination]
    Definition Classes
    IndexedSeqOps → IterableOps
  74. def implies(that: EquationSet): Boolean
    Definition Classes
    EquationSet
  75. def indexOf[B >: LinearCombination](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  76. def indexOf[B >: LinearCombination](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  77. def indexOfSlice[B >: LinearCombination](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  78. def indexOfSlice[B >: LinearCombination](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  79. def indexWhere(p: (LinearCombination) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  80. def indexWhere(p: (LinearCombination) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  81. def indices: Range
    Definition Classes
    SeqOps
  82. def init: IndexedSeq[LinearCombination]
    Definition Classes
    IterableOps
  83. def inits: Iterator[IndexedSeq[LinearCombination]]
    Definition Classes
    IterableOps
  84. def intersect[B >: LinearCombination](that: Seq[B]): IndexedSeq[LinearCombination]
    Definition Classes
    SeqOps
  85. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  86. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  87. def isFalse: Boolean

    The only allowed case of obviously unsatisfiable systems of equations is the one of a single equation that has a non-zero literal lhs

    The only allowed case of obviously unsatisfiable systems of equations is the one of a single equation that has a non-zero literal lhs

    Definition Classes
    EquationConj → Formula
  88. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  89. def isSortedBy(otherOrder: TermOrder): Boolean
    Definition Classes
    SortedWithOrder → Sorted
  90. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  91. def isTrue: Boolean

    Return true if this formula is obviously always true

    Return true if this formula is obviously always true

    Definition Classes
    EquationConj → Formula
  92. def iterableFactory: SeqFactory[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  93. def iterator: Iterator[LinearCombination]
    Definition Classes
    EquationSet → IndexedSeqOps → IterableOnce
  94. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  95. def last: LinearCombination
    Definition Classes
    IndexedSeqOps → IterableOps
  96. def lastIndexOf[B >: LinearCombination](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  97. def lastIndexOfSlice[B >: LinearCombination](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  98. def lastIndexOfSlice[B >: LinearCombination](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  99. def lastIndexWhere(p: (LinearCombination) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  100. def lastIndexWhere(p: (LinearCombination) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  101. def lastOption: Option[LinearCombination]
    Definition Classes
    IterableOps
  102. def lazyZip[B](that: Iterable[B]): LazyZip2[LinearCombination, B, EquationConj.this.type]
    Definition Classes
    Iterable
  103. lazy val leadingTermSet: Set[Term]
    Definition Classes
    EquationSet
  104. def length: Int
    Definition Classes
    EquationSet → SeqOps
  105. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  106. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  107. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  108. val lhss: Array[LinearCombination]
    Attributes
    protected
    Definition Classes
    EquationSet
  109. def lift: (Int) => Option[LinearCombination]
    Definition Classes
    PartialFunction
  110. def map[B](f: (LinearCombination) => B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  111. def max[B >: LinearCombination](implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  112. def maxBy[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  113. def maxByOption[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  114. def maxOption[B >: LinearCombination](implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  115. def min[B >: LinearCombination](implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  116. def minBy[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): LinearCombination
    Definition Classes
    IterableOnceOps
  117. def minByOption[B](f: (LinearCombination) => B)(implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  118. def minOption[B >: LinearCombination](implicit ord: Ordering[B]): Option[LinearCombination]
    Definition Classes
    IterableOnceOps
  119. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  120. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  121. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  122. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  123. def negate: NegEquationConj

    Create the negation of at most one equation

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

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

    Update the equations of this conjunction; if nothing has changed, this is returned

  201. def updateEqsSubset(newEqs: Seq[LinearCombination])(implicit newOrder: TermOrder): EquationConj

    Update the equations of this conjunction under the assumption that the new equations form a subset of the old equations

  202. def updated[B >: LinearCombination](index: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  203. lazy val variables: Set[VariableTerm]
    Definition Classes
    EquationSet → TerFor
  204. def view: IndexedSeqView[LinearCombination]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  205. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  206. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  207. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  208. def withFilter(p: (LinearCombination) => Boolean): WithFilter[LinearCombination, [_]IndexedSeq[_]]
    Definition Classes
    IterableOps
  209. def zip[B](that: IterableOnce[B]): IndexedSeq[(LinearCombination, B)]
    Definition Classes
    IterableOps
  210. def zipAll[A1 >: LinearCombination, B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
    Definition Classes
    IterableOps
  211. def zipWithIndex: IndexedSeq[(LinearCombination, Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

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

    (Since version 2.13.0) Use foldLeft instead of /:

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

    (Since version 2.13.0) Use foldRight instead of :\

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

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

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

    (Since version 2.13.0) Use iterableFactory instead

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

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

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

    (Since version 9)

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

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

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

    (Since version 2.13.0) Use segmentLength instead of prefixLength

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    (Since version 2.13.0) Use concat instead

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

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

Inherited from SortedWithOrder[EquationConj]

Inherited from Sorted[EquationConj]

Inherited from EquationSet

Inherited from IndexedSeq[LinearCombination]

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

Inherited from IndexedSeq[LinearCombination]

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

Inherited from Seq[LinearCombination]

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

Inherited from Seq[LinearCombination]

Inherited from Equals

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

Inherited from PartialFunction[Int, LinearCombination]

Inherited from (Int) => LinearCombination

Inherited from Iterable[LinearCombination]

Inherited from Iterable[LinearCombination]

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

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

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

Inherited from IterableOnce[LinearCombination]

Inherited from Formula

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped