Class

ap.terfor.linearcombination

LCBlender

Related Doc: package linearcombination

Permalink

class LCBlender extends PeekIterator[(IdealInt, Term)]

Class for mixing together a number of LinearCombinations that are sorted by the same TermOrder (namely by order)

Linear Supertypes
PeekIterator[(IdealInt, Term)], Iterator[(IdealInt, Term)], TraversableOnce[(IdealInt, Term)], GenTraversableOnce[(IdealInt, Term)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LCBlender
  2. PeekIterator
  3. Iterator
  4. TraversableOnce
  5. GenTraversableOnce
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LCBlender(order: TermOrder)

    Permalink

Type Members

  1. class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]

    Permalink
    Definition Classes
    Iterator

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 >: (IdealInt, Term)](that: ⇒ GenTraversableOnce[B]): Iterator[B]

    Permalink
    Definition Classes
    Iterator
  4. def ++=(lcs: Iterable[(IdealInt, LinearCombination)]): Unit

    Permalink
  5. def +=(coeff1: IdealInt, lc1: LinearCombination, coeff2: IdealInt, lc2: LinearCombination): Unit

    Permalink
  6. def +=(coeff: IdealInt, lc: LinearCombination): Unit

    Permalink
  7. def /:[B](z: B)(op: (B, (IdealInt, Term)) ⇒ B): B

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  15. def buffered: BufferedIterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. def collect[B](pf: PartialFunction[(IdealInt, Term), B]): Iterator[B]

    Permalink
    Definition Classes
    Iterator
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.

  18. def collectFirst[B](pf: PartialFunction[(IdealInt, Term), B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  19. def contains(elem: Any): Boolean

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

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

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

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

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

    Permalink
    Definition Classes
    Iterator
  25. def count(p: ((IdealInt, Term)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def drop(n: Int): Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  27. def dropAll: Unit

    Permalink
    Definition Classes
    PeekIterator
  28. def dropWhile(p: ((IdealInt, Term)) ⇒ Boolean): Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  29. def duplicate: (Iterator[(IdealInt, Term)], Iterator[(IdealInt, Term)])

    Permalink
    Definition Classes
    Iterator
  30. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  31. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  32. def exists(p: ((IdealInt, Term)) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  33. def filter(p: ((IdealInt, Term)) ⇒ Boolean): Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  34. def filterNot(p: ((IdealInt, Term)) ⇒ Boolean): Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  35. def finalize(): Unit

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

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  37. def flatMap[B](f: ((IdealInt, Term)) ⇒ GenTraversableOnce[B]): Iterator[B]

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

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

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

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

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

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  43. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  44. def grouped[B >: (IdealInt, Term)](size: Int): GroupedIterator[B]

    Permalink
    Definition Classes
    Iterator
  45. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  46. def hasNext: Boolean

    Permalink
    Definition Classes
    LCBlender → Iterator
  47. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  48. def indexOf[B >: (IdealInt, Term)](elem: B): Int

    Permalink
    Definition Classes
    Iterator
  49. def indexWhere(p: ((IdealInt, Term)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    Iterator
  50. def isEmpty: Boolean

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  51. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  52. def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    Iterator → GenTraversableOnce
  53. def length: Int

    Permalink
    Definition Classes
    Iterator
  54. def map[B](f: ((IdealInt, Term)) ⇒ B): Iterator[B]

    Permalink
    Definition Classes
    Iterator
  55. def max[B >: (IdealInt, Term)](implicit cmp: Ordering[B]): (IdealInt, Term)

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  63. def next(): (IdealInt, Term)

    Permalink
    Definition Classes
    LCBlender → Iterator
  64. def nonEmpty: Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  67. def padTo[A1 >: (IdealInt, Term)](len: Int, elem: A1): Iterator[A1]

    Permalink
    Definition Classes
    Iterator
  68. def partition(p: ((IdealInt, Term)) ⇒ Boolean): (Iterator[(IdealInt, Term)], Iterator[(IdealInt, Term)])

    Permalink
    Definition Classes
    Iterator
  69. def patch[B >: (IdealInt, Term)](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]

    Permalink
    Definition Classes
    Iterator
  70. def peekNext: (IdealInt, Term)

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def result: LinearCombination

    Permalink
  79. def reversed: List[(IdealInt, Term)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  80. def sameElements(that: Iterator[_]): Boolean

    Permalink
    Definition Classes
    Iterator
  81. def scanLeft[B](z: B)(op: (B, (IdealInt, Term)) ⇒ B): Iterator[B]

    Permalink
    Definition Classes
    Iterator
  82. def scanRight[B](z: B)(op: ((IdealInt, Term), B) ⇒ B): Iterator[B]

    Permalink
    Definition Classes
    Iterator
  83. def seq: Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  84. def size: Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def slice(from: Int, until: Int): Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  86. def sliding[B >: (IdealInt, Term)](size: Int, step: Int): GroupedIterator[B]

    Permalink
    Definition Classes
    Iterator
  87. def span(p: ((IdealInt, Term)) ⇒ Boolean): (Iterator[(IdealInt, Term)], Iterator[(IdealInt, Term)])

    Permalink
    Definition Classes
    Iterator
  88. def sum[B >: (IdealInt, Term)](implicit num: Numeric[B]): B

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

    Permalink
    Definition Classes
    AnyRef
  90. def take(n: Int): Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  91. def takeWhile(p: ((IdealInt, Term)) ⇒ Boolean): Iterator[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator
  92. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (IdealInt, Term), Col[(IdealInt, Term)]]): Col[(IdealInt, Term)]

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def toIndexedSeq: IndexedSeq[(IdealInt, Term)]

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

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

    Permalink
    Definition Classes
    Iterator → GenTraversableOnce
  98. def toList: List[(IdealInt, Term)]

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

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

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

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

    Permalink
    Definition Classes
    Iterator → GenTraversableOnce
  103. def toString(): String

    Permalink
    Definition Classes
    Iterator → AnyRef → Any
  104. def toTraversable: Traversable[(IdealInt, Term)]

    Permalink
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  105. def toVector: Vector[(IdealInt, Term)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. final def wait(): Unit

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

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

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

    Permalink
    Definition Classes
    Iterator
  110. def zip[B](that: Iterator[B]): Iterator[((IdealInt, Term), B)]

    Permalink
    Definition Classes
    Iterator
  111. def zipAll[B, A1 >: (IdealInt, Term), B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]

    Permalink
    Definition Classes
    Iterator
  112. def zipWithIndex: Iterator[((IdealInt, Term), Int)]

    Permalink
    Definition Classes
    Iterator

Inherited from PeekIterator[(IdealInt, Term)]

Inherited from Iterator[(IdealInt, Term)]

Inherited from TraversableOnce[(IdealInt, Term)]

Inherited from GenTraversableOnce[(IdealInt, Term)]

Inherited from AnyRef

Inherited from Any

Ungrouped