Class/Object

ap.terfor.preds

Atom

Related Docs: object Atom | package preds

Permalink

class Atom extends Formula with SortedWithOrder[Atom] with IndexedSeq[LinearCombination]

Linear Supertypes
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, SortedWithOrder[Atom], Sorted[Atom], Formula, TerFor, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Atom
  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. Formula
  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[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 /:[B](z: B)(op: (B, LinearCombination) ⇒ B): B

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  9. def :\[B](z: B)(op: (LinearCombination, B) ⇒ B): B

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, LinearCombination) ⇒ B, combop: (B, B) ⇒ B): B

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def elements: Iterator[LinearCombination]

    Permalink
  41. def endsWith[B](that: GenSeq[B]): Boolean

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

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

    Permalink
    Definition Classes
    Atom → GenSeqLike → Equals → AnyRef → Any
  44. def exists(p: (LinearCombination) ⇒ Boolean): Boolean

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  55. def foreach[U](f: (LinearCombination) ⇒ U): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  58. lazy val groundAtoms: Set[Atom]

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

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

    Permalink
    Definition Classes
    IterableLike
  61. def hasDefiniteSize: Boolean

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

    Permalink
    Definition Classes
    Atom → IndexedSeqLike → GenSeqLike → AnyRef → Any
  63. def head: LinearCombination

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSeqLike
  71. def indices: Range

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

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

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

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

    Permalink

    Return true if this formula is obviously always false

    Return true if this formula is obviously always false

    Definition Classes
    AtomFormula
  78. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    SortedWithOrderSorted
  80. final def isTraversableAgain: Boolean

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

    Permalink

    Return true if this formula is obviously always true

    Return true if this formula is obviously always true

    Definition Classes
    AtomFormula
  82. def iterator: Iterator[LinearCombination]

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def length: Int

    Permalink
    Definition Classes
    Atom → SeqLike → GenSeqLike
  92. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    SeqLike
  93. def lift: (Int) ⇒ Option[LinearCombination]

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  103. def newBuilder: Builder[LinearCombination, IndexedSeq[LinearCombination]]

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

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

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

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

    Permalink
    Definition Classes
    PartialFunction
  108. val order: TermOrder

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  113. 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
  114. def permutations: Iterator[IndexedSeq[LinearCombination]]

    Permalink
    Definition Classes
    SeqLike
  115. val pred: Predicate

    Permalink
  116. val predicates: Set[Predicate]

    Permalink
    Definition Classes
    AtomSortedWithOrderTerFor
  117. def prefixLength(p: (LinearCombination) ⇒ Boolean): Int

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduce[A1 >: LinearCombination](op: (A1, A1) ⇒ A1): A1

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def repr: IndexedSeq[LinearCombination]

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  134. 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.

  135. def segmentLength(p: (LinearCombination) ⇒ Boolean, from: Int): Int

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike
  141. def sortBy(newOrder: TermOrder): Atom

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSeqLike
  149. def stringPrefix: String

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toSeq: Seq[LinearCombination]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  168. def toSet[B >: LinearCombination]: Set[B]

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

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

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

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

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

  174. def unificationConditions(that: Atom, order: TermOrder): Iterator[LinearCombination]

    Permalink
  175. def unify(that: Atom, order: TermOrder): EquationConj

    Permalink

    Derive equations that describe under which condition this atom describes the same location as that atom (basically, all the argument term have to have the same values)

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

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  179. def updateArgs(newArgs: Iterable[LinearCombination])(implicit order: TermOrder): Atom

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  189. 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
  190. def zipWithIndex[A1 >: LinearCombination, That](implicit bf: CanBuildFrom[IndexedSeq[LinearCombination], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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 SortedWithOrder[Atom]

Inherited from Sorted[Atom]

Inherited from Formula

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped