Class/Object

ap.terfor.equations

EquationConj

Related Docs: object EquationConj | package equations

Permalink

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], IndexedSeqLike[LinearCombination, IndexedSeq[LinearCombination]], Seq[LinearCombination], SeqLike[LinearCombination, IndexedSeq[LinearCombination]], GenSeq[LinearCombination], GenSeqLike[LinearCombination, IndexedSeq[LinearCombination]], Iterable[LinearCombination], IterableLike[LinearCombination, IndexedSeq[LinearCombination]], Equals, GenIterable[LinearCombination], GenIterableLike[LinearCombination, IndexedSeq[LinearCombination]], Traversable[LinearCombination], GenTraversable[LinearCombination], GenericTraversableTemplate[LinearCombination, IndexedSeq], TraversableLike[LinearCombination, IndexedSeq[LinearCombination]], GenTraversableLike[LinearCombination, IndexedSeq[LinearCombination]], Parallelizable[LinearCombination, ParSeq[LinearCombination]], TraversableOnce[LinearCombination], GenTraversableOnce[LinearCombination], FilterMonadic[LinearCombination, IndexedSeq[LinearCombination]], HasNewBuilder[LinearCombination, IndexedSeq[ap.terfor.linearcombination.LinearCombination] @scala.annotation.unchecked.uncheckedVariance], PartialFunction[Int, LinearCombination], (Int) ⇒ LinearCombination, Formula, TerFor, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EquationConj
  2. SortedWithOrder
  3. Sorted
  4. EquationSet
  5. IndexedSeq
  6. IndexedSeqLike
  7. Seq
  8. SeqLike
  9. GenSeq
  10. GenSeqLike
  11. Iterable
  12. IterableLike
  13. Equals
  14. GenIterable
  15. GenIterableLike
  16. Traversable
  17. GenTraversable
  18. GenericTraversableTemplate
  19. TraversableLike
  20. GenTraversableLike
  21. Parallelizable
  22. TraversableOnce
  23. GenTraversableOnce
  24. FilterMonadic
  25. HasNewBuilder
  26. PartialFunction
  27. Function1
  28. Formula
  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[LinearCombination]

    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 ++[B >: LinearCombination, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

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

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

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  7. def --(that: EquationConj): EquationConj

    Permalink
  8. def /:[B](z: B)(op: (B, LinearCombination) ⇒ B): B

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  10. def :\[B](z: B)(op: (LinearCombination, 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, LinearCombination) ⇒ B, combop: (B, B) ⇒ B): B

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

    Permalink
    Definition Classes
    PartialFunction → Function1
  17. def apply(i: Int): LinearCombination

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

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

    Permalink
    Definition Classes
    Any
  20. def canEqual(that: Any): Boolean

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  23. def collectFirst[B](pf: PartialFunction[LinearCombination, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  24. def combinations(n: Int): Iterator[IndexedSeq[LinearCombination]]

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

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

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  27. lazy val constants: Set[ConstantTerm]

    Permalink
    Definition Classes
    EquationSetTerFor
  28. def contains(lc: LinearCombination): Boolean

    Permalink
    Definition Classes
    EquationSet
  29. def contains[A1 >: LinearCombination](elem: A1): Boolean

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  38. def distinct: IndexedSeq[LinearCombination]

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

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

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

    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
    EquationConjEquationSet → GenSeqLike → Equals → AnyRef → Any
  45. def exists(p: (LinearCombination) ⇒ Boolean): Boolean

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

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

    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: (LinearCombination) ⇒ Boolean): Option[LinearCombination]

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def foreach[U](f: (LinearCombination) ⇒ 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 groundAtoms: Set[Atom]

    Permalink
    Definition Classes
    EquationSetFormula
  60. def groupBy[K](f: (LinearCombination) ⇒ K): Map[K, IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  61. def grouped(size: Int): Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    IterableLike
  62. def hasDefiniteSize: Boolean

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

    Permalink
    Definition Classes
    EquationConjEquationSet → IndexedSeqLike → GenSeqLike → AnyRef → Any
  64. def head: LinearCombination

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  65. def headOption: Option[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def implies(that: EquationSet): Boolean

    Permalink
    Definition Classes
    EquationSet
  67. def indexOf[B >: LinearCombination](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  68. def indexOf[B >: LinearCombination](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  69. def indexOfSlice[B >: LinearCombination](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike
  70. def indexOfSlice[B >: LinearCombination](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  71. def indexWhere(p: (LinearCombination) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  72. def indexWhere(p: (LinearCombination) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  73. def indices: Range

    Permalink
    Definition Classes
    SeqLike
  74. def init: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def inits: Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    TraversableLike
  76. def intersect[B >: LinearCombination](that: GenSeq[B]): IndexedSeq[LinearCombination]

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

    Permalink
    Definition Classes
    GenSeqLike
  78. def isEmpty: Boolean

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  79. def isFalse: Boolean

    Permalink

    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
    EquationConjFormula
  80. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  81. def isSortedBy(otherOrder: TermOrder): Boolean

    Permalink
    Definition Classes
    SortedWithOrderSorted
  82. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  83. def isTrue: Boolean

    Permalink

    Return true if this formula is obviously always true

    Return true if this formula is obviously always true

    Definition Classes
    EquationConjFormula
  84. def iterator: Iterator[LinearCombination]

    Permalink
    Definition Classes
    EquationSet → IndexedSeqLike → IterableLike → GenIterableLike
  85. def last: LinearCombination

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def lastIndexOf[B >: LinearCombination](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  87. def lastIndexOf[B >: LinearCombination](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  88. def lastIndexOfSlice[B >: LinearCombination](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike
  89. def lastIndexOfSlice[B >: LinearCombination](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  90. def lastIndexWhere(p: (LinearCombination) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  91. def lastIndexWhere(p: (LinearCombination) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  92. def lastOption: Option[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  93. lazy val leadingTermSet: Set[Term]

    Permalink
    Definition Classes
    EquationSet
  94. def length: Int

    Permalink
    Definition Classes
    EquationSet → SeqLike → GenSeqLike
  95. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    SeqLike
  96. val lhss: Array[LinearCombination]

    Permalink
    Attributes
    protected
    Definition Classes
    EquationSet
  97. def lift: (Int) ⇒ Option[LinearCombination]

    Permalink
    Definition Classes
    PartialFunction
  98. def map[B, That](f: (LinearCombination) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  99. def max[B >: LinearCombination](implicit cmp: Ordering[B]): LinearCombination

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def maxBy[B](f: (LinearCombination) ⇒ B)(implicit cmp: Ordering[B]): LinearCombination

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def min[B >: LinearCombination](implicit cmp: Ordering[B]): LinearCombination

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def minBy[B](f: (LinearCombination) ⇒ B)(implicit cmp: Ordering[B]): LinearCombination

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  107. def negate: NegEquationConj

    Permalink

    Create the negation of at most one equation

  108. def newBuilder: Builder[LinearCombination, IndexedSeq[LinearCombination]]

    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 >: LinearCombination](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Permalink
    Definition Classes
    PartialFunction
  113. val order: TermOrder

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  115. def par: ParSeq[LinearCombination]

    Permalink
    Definition Classes
    Parallelizable
  116. def parCombiner: Combiner[LinearCombination, ParSeq[LinearCombination]]

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

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  119. def permutations: Iterator[IndexedSeq[LinearCombination]]

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

    Permalink
    Definition Classes
    EquationSetTerFor
  121. def prefixLength(p: (LinearCombination) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  122. def product[B >: LinearCombination](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def pseudoReduce(reducer: ReduceWithEqs, newOrder: TermOrder): EquationConj

    Permalink
  124. def reduce[A1 >: LinearCombination](op: (A1, A1) ⇒ A1): A1

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. val relationString: String

    Permalink
    Attributes
    protected
    Definition Classes
    EquationConjEquationSet
  131. def repr: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def reverse: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  133. def reverseIterator: Iterator[LinearCombination]

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  135. def reversed: List[LinearCombination]

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  138. def scan[B >: LinearCombination, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  140. def scanRight[B, That](z: B)(op: (LinearCombination, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], 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: (LinearCombination) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  142. def seq: IndexedSeq[LinearCombination]

    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[LinearCombination]

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

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

    Permalink
    Definition Classes
    IterableLike
  147. def sortBy(newOrder: TermOrder): EquationConj

    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
    EquationConjSorted
  148. def sortBy[B](f: (LinearCombination) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike
  149. def sortWith(lt: (LinearCombination, LinearCombination) ⇒ Boolean): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike
  150. def sorted[B >: LinearCombination](implicit ord: Ordering[B]): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike
  151. def span(p: (LinearCombination) ⇒ Boolean): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def splitAt(n: Int): (IndexedSeq[LinearCombination], IndexedSeq[LinearCombination])

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

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

    Permalink
    Definition Classes
    GenSeqLike
  155. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  156. def sum[B >: LinearCombination](implicit num: Numeric[B]): B

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

    Permalink
    Definition Classes
    AnyRef
  158. def tail: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  159. def tails: Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    TraversableLike
  160. def take(n: Int): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  161. def takeRight(n: Int): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike
  162. def takeWhile(p: (LinearCombination) ⇒ Boolean): IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  163. def thisCollection: IndexedSeq[LinearCombination]

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toBuffer[A1 >: LinearCombination]: Buffer[A1]

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  168. def toIndexedSeq: IndexedSeq[LinearCombination]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toIterable: Iterable[LinearCombination]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  170. def toIterator: Iterator[LinearCombination]

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. lazy val toMap: Map[Term, LinearCombination]

    Permalink
  174. def toSeq: Seq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  175. def toSet: Set[LinearCombination] { ... /* 2 definitions in type refinement */ }

    Permalink
    Definition Classes
    EquationSet
  176. def toSet[B >: LinearCombination]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toStream: Stream[LinearCombination]

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

    Permalink
    Definition Classes
    EquationSet → SeqLike → TraversableLike → Function1 → AnyRef → Any
  179. def toTraversable: Traversable[LinearCombination]

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def transpose[B](implicit asTraversable: (LinearCombination) ⇒ 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.

  182. def union[B >: LinearCombination, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  185. def updateEqs(newEqs: Seq[LinearCombination])(implicit newOrder: TermOrder): EquationConj

    Permalink

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

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

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

    Permalink

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

  187. def updated[B >: LinearCombination, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  188. lazy val variables: Set[VariableTerm]

    Permalink
    Definition Classes
    EquationSetTerFor
  189. def view(from: Int, until: Int): SeqView[LinearCombination, IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  190. def view: SeqView[LinearCombination, IndexedSeq[LinearCombination]]

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

Inherited from SortedWithOrder[EquationConj]

Inherited from Sorted[EquationConj]

Inherited from EquationSet

Inherited from IndexedSeq[LinearCombination]

Inherited from IndexedSeqLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Seq[LinearCombination]

Inherited from SeqLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from GenSeq[LinearCombination]

Inherited from GenSeqLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Iterable[LinearCombination]

Inherited from IterableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Equals

Inherited from GenIterable[LinearCombination]

Inherited from GenIterableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Traversable[LinearCombination]

Inherited from GenTraversable[LinearCombination]

Inherited from GenericTraversableTemplate[LinearCombination, IndexedSeq]

Inherited from TraversableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from GenTraversableLike[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from Parallelizable[LinearCombination, ParSeq[LinearCombination]]

Inherited from TraversableOnce[LinearCombination]

Inherited from GenTraversableOnce[LinearCombination]

Inherited from FilterMonadic[LinearCombination, IndexedSeq[LinearCombination]]

Inherited from HasNewBuilder[LinearCombination, IndexedSeq[ap.terfor.linearcombination.LinearCombination] @scala.annotation.unchecked.uncheckedVariance]

Inherited from PartialFunction[Int, LinearCombination]

Inherited from (Int) ⇒ LinearCombination

Inherited from Formula

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped