Packages

implicit class MixtureBuilderSymTrans[A] extends MixtureComponentSeq[SymmetricProposalGeneratorWithTransition[A]]

Linear Supertypes
MixtureComponentSeq[SymmetricProposalGeneratorWithTransition[A]], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])], SeqOps[(Double, SymmetricProposalGeneratorWithTransition[A]), Seq, Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])], Equals, SeqOps[(Double, SymmetricProposalGeneratorWithTransition[A]), [_]Seq[_], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]], PartialFunction[Int, (Double, SymmetricProposalGeneratorWithTransition[A])], (Int) => (Double, SymmetricProposalGeneratorWithTransition[A]), Iterable[(Double, SymmetricProposalGeneratorWithTransition[A])], Iterable[(Double, SymmetricProposalGeneratorWithTransition[A])], IterableFactoryDefaults[(Double, SymmetricProposalGeneratorWithTransition[A]), [x]Seq[x]], IterableOps[(Double, SymmetricProposalGeneratorWithTransition[A]), [_]Seq[_], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]], IterableOnceOps[(Double, SymmetricProposalGeneratorWithTransition[A]), [_]Seq[_], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]], IterableOnce[(Double, SymmetricProposalGeneratorWithTransition[A])], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MixtureBuilderSymTrans
  2. MixtureComponentSeq
  3. Seq
  4. SeqOps
  5. Seq
  6. Equals
  7. SeqOps
  8. PartialFunction
  9. Function1
  10. Iterable
  11. Iterable
  12. IterableFactoryDefaults
  13. IterableOps
  14. IterableOnceOps
  15. IterableOnce
  16. AnyRef
  17. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new MixtureBuilderSymTrans(components: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def *(f: Double): MixtureBuilderSymTrans[A]
  4. def *:(f: Double): MixtureBuilderSymTrans[A]
  5. def +(other: MixtureBuilder[A]): Seq[(Double, ProposalGenerator[A])]
  6. def +(other: MixtureBuilderTrans[A]): Seq[(Double, ProposalGeneratorWithTransition[A])]
  7. def +(other: MixtureBuilderSym[A]): Seq[(Double, SymmetricProposalGenerator[A])]
  8. def +(other: MixtureBuilderSymTrans[A]): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
  9. final def ++[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](suffix: IterableOnce[B]): Seq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  10. final def ++:[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](prefix: IterableOnce[B]): Seq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  11. final def +:[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B): Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  12. final def :+[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B): Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  13. final def :++[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](suffix: IterableOnce[B]): Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  14. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  16. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  17. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  18. def andThen[C](k: PartialFunction[(Double, SymmetricProposalGeneratorWithTransition[A]), C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  19. def andThen[C](k: ((Double, SymmetricProposalGeneratorWithTransition[A])) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  20. def appended[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B): Seq[B]
    Definition Classes
    SeqOps
  21. def appendedAll[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](suffix: IterableOnce[B]): Seq[B]
    Definition Classes
    SeqOps
  22. def apply(idx: Int): (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    MixtureComponentSeq → SeqOps → Function1
  23. def applyOrElse[A1 <: Int, B1 >: (Double, SymmetricProposalGeneratorWithTransition[A])](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  24. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  25. def canEqual(that: Any): Boolean
    Definition Classes
    Seq → Equals
  26. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  27. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  28. final def coll: MixtureBuilderSymTrans.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  29. def collect[B](pf: PartialFunction[(Double, SymmetricProposalGeneratorWithTransition[A]), B]): Seq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  30. def collectFirst[B](pf: PartialFunction[(Double, SymmetricProposalGeneratorWithTransition[A]), B]): Option[B]
    Definition Classes
    IterableOnceOps
  31. def combinations(n: Int): Iterator[Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    SeqOps
  32. val components: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    MixtureBuilderSymTrans → MixtureComponentSeq
  33. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, (Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    PartialFunction
  34. def compose[A](g: (A) => Int): (A) => (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  35. final def concat[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](suffix: IterableOnce[B]): Seq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  36. def contains[A1 >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: A1): Boolean
    Definition Classes
    SeqOps
  37. def containsSlice[B](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  38. def copyToArray[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  39. def copyToArray[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  40. def copyToArray[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  41. def corresponds[B](that: Seq[B])(p: ((Double, SymmetricProposalGeneratorWithTransition[A]), B) => Boolean): Boolean
    Definition Classes
    SeqOps
  42. def corresponds[B](that: IterableOnce[B])(p: ((Double, SymmetricProposalGeneratorWithTransition[A]), B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  43. def count(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Int
    Definition Classes
    IterableOnceOps
  44. def diff[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Seq[B]): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  45. def distinct: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  46. def distinctBy[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  47. def drop(n: Int): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  48. def dropRight(n: Int): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
  49. def dropWhile(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  50. def elementWise: ElementWiseExtractor[Int, (Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    PartialFunction
  51. def empty: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  52. def endsWith[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  53. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  54. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  55. def exists(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  56. def filter(pred: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  57. def filterNot(pred: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  58. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  59. def find(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  60. def findLast(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  61. def flatMap[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => IterableOnce[B]): Seq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  62. def flatten[B](implicit asIterable: ((Double, SymmetricProposalGeneratorWithTransition[A])) => IterableOnce[B]): Seq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  63. def fold[A1 >: (Double, SymmetricProposalGeneratorWithTransition[A])](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  64. def foldLeft[B](z: B)(op: (B, (Double, SymmetricProposalGeneratorWithTransition[A])) => B): B
    Definition Classes
    IterableOnceOps
  65. def foldRight[B](z: B)(op: ((Double, SymmetricProposalGeneratorWithTransition[A]), B) => B): B
    Definition Classes
    IterableOnceOps
  66. def forall(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  67. def foreach[U](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => U): Unit
    Definition Classes
    IterableOnceOps
  68. def fromSpecific(coll: IterableOnce[(Double, SymmetricProposalGeneratorWithTransition[A])]): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  69. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  70. def groupBy[K](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => K): Map[K, Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    IterableOps
  71. def groupMap[K, B](key: ((Double, SymmetricProposalGeneratorWithTransition[A])) => K)(f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B): Map[K, Seq[B]]
    Definition Classes
    IterableOps
  72. def groupMapReduce[K, B](key: ((Double, SymmetricProposalGeneratorWithTransition[A])) => K)(f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  73. def grouped(size: Int): Iterator[Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    IterableOps
  74. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  75. def head: (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    IterableOps
  76. def headOption: Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
  77. def indexOf[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
  78. def indexOf[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  79. def indexOfSlice[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
  80. def indexOfSlice[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  81. def indexWhere(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
  82. def indexWhere(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  83. def indices: Range
    Definition Classes
    SeqOps
  84. def init: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
  85. def inits: Iterator[Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    IterableOps
  86. def intersect[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Seq[B]): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  87. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  88. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  89. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  90. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  91. def iterableFactory: SeqFactory[Seq]
    Definition Classes
    Seq → Seq → Iterable → Iterable → IterableOps
  92. def iterator: Iterator[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    MixtureComponentSeq → IterableOnce
  93. def knownSize: Int
    Definition Classes
    IterableOnce
  94. def last: (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    IterableOps
  95. def lastIndexOf[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  96. def lastIndexOfSlice[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
  97. def lastIndexOfSlice[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  98. def lastIndexWhere(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
  99. def lastIndexWhere(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  100. def lastOption: Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
  101. def lazyZip[B](that: Iterable[B]): LazyZip2[(Double, SymmetricProposalGeneratorWithTransition[A]), B, MixtureBuilderSymTrans.this.type]
    Definition Classes
    Iterable
  102. def length: Int
    Definition Classes
    MixtureComponentSeq → SeqOps
  103. def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps
  104. def lengthCompare(len: Int): Int
    Definition Classes
    SeqOps
  105. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  106. def lift: (Int) => Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    PartialFunction
  107. def map[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B): Seq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  108. def max[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit ord: Ordering[B]): (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    IterableOnceOps
  109. def maxBy[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B)(implicit cmp: Ordering[B]): (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    IterableOnceOps
  110. def maxByOption[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B)(implicit cmp: Ordering[B]): Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  111. def maxOption[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit ord: Ordering[B]): Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  112. def min[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit ord: Ordering[B]): (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    IterableOnceOps
  113. def minBy[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B)(implicit cmp: Ordering[B]): (Double, SymmetricProposalGeneratorWithTransition[A])
    Definition Classes
    IterableOnceOps
  114. def minByOption[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B)(implicit cmp: Ordering[B]): Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  115. def minOption[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit ord: Ordering[B]): Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  116. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  117. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  118. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  119. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  120. def newSpecificBuilder: Builder[(Double, SymmetricProposalGeneratorWithTransition[A]), Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  121. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  122. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  123. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  124. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  125. def orElse[A1 <: Int, B1 >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  126. def padTo[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](len: Int, elem: B): Seq[B]
    Definition Classes
    SeqOps
  127. def partition(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): (Seq[(Double, SymmetricProposalGeneratorWithTransition[A])], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])])
    Definition Classes
    IterableOps
  128. def partitionMap[A1, A2](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Either[A1, A2]): (Seq[A1], Seq[A2])
    Definition Classes
    IterableOps
  129. def patch[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](from: Int, other: IterableOnce[B], replaced: Int): Seq[B]
    Definition Classes
    SeqOps
  130. def permutations: Iterator[Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    SeqOps
  131. def prepended[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B): Seq[B]
    Definition Classes
    SeqOps
  132. def prependedAll[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](prefix: IterableOnce[B]): Seq[B]
    Definition Classes
    SeqOps
  133. def product[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  134. def reduce[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  135. def reduceLeft[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](op: (B, (Double, SymmetricProposalGeneratorWithTransition[A])) => B): B
    Definition Classes
    IterableOnceOps
  136. def reduceLeftOption[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](op: (B, (Double, SymmetricProposalGeneratorWithTransition[A])) => B): Option[B]
    Definition Classes
    IterableOnceOps
  137. def reduceOption[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  138. def reduceRight[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](op: ((Double, SymmetricProposalGeneratorWithTransition[A]), B) => B): B
    Definition Classes
    IterableOnceOps
  139. def reduceRightOption[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](op: ((Double, SymmetricProposalGeneratorWithTransition[A]), B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  140. def reverse: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  141. def reverseIterator: Iterator[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  142. def reversed: Iterable[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  143. def runWith[U](action: ((Double, SymmetricProposalGeneratorWithTransition[A])) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  144. def sameElements[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  145. def scan[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](z: B)(op: (B, B) => B): Seq[B]
    Definition Classes
    IterableOps
  146. def scanLeft[B](z: B)(op: (B, (Double, SymmetricProposalGeneratorWithTransition[A])) => B): Seq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  147. def scanRight[B](z: B)(op: ((Double, SymmetricProposalGeneratorWithTransition[A]), B) => B): Seq[B]
    Definition Classes
    IterableOps
  148. def search[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    SeqOps
  149. def search[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    SeqOps
  150. def segmentLength(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  151. final def segmentLength(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Int
    Definition Classes
    SeqOps
  152. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  153. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  154. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  155. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  156. def slice(from: Int, until: Int): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  157. def sliding(size: Int, step: Int): Iterator[Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    IterableOps
  158. def sliding(size: Int): Iterator[Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    IterableOps
  159. def sortBy[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B)(implicit ord: Ordering[B]): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  160. def sortWith(lt: ((Double, SymmetricProposalGeneratorWithTransition[A]), (Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  161. def sorted[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit ord: Ordering[B]): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps
  162. def span(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): (Seq[(Double, SymmetricProposalGeneratorWithTransition[A])], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])])
    Definition Classes
    IterableOps → IterableOnceOps
  163. def splitAt(n: Int): (Seq[(Double, SymmetricProposalGeneratorWithTransition[A])], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])])
    Definition Classes
    IterableOps → IterableOnceOps
  164. def startsWith[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  165. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(Double, SymmetricProposalGeneratorWithTransition[A]), S]): S
    Definition Classes
    IterableOnce
  166. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Seq → Iterable
  167. def sum[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  168. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  169. def tail: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
  170. def tails: Iterator[Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]
    Definition Classes
    IterableOps
  171. def take(n: Int): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  172. def takeRight(n: Int): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
  173. def takeWhile(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  174. def tapEach[U](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => U): Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps → IterableOnceOps
  175. def to[C1](factory: Factory[(Double, SymmetricProposalGeneratorWithTransition[A]), C1]): C1
    Definition Classes
    IterableOnceOps
  176. def toArray[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  177. final def toBuffer[B >: (Double, SymmetricProposalGeneratorWithTransition[A])]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  178. def toIndexedSeq: IndexedSeq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  179. final def toIterable: MixtureBuilderSymTrans.this.type
    Definition Classes
    Iterable → IterableOps
  180. def toList: List[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  181. def toMap[K, V](implicit ev: <:<[(Double, SymmetricProposalGeneratorWithTransition[A]), (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  182. final def toSeq: MixtureBuilderSymTrans.this.type
    Definition Classes
    Seq → IterableOnceOps
  183. def toSet[B >: (Double, SymmetricProposalGeneratorWithTransition[A])]: Set[B]
    Definition Classes
    IterableOnceOps
  184. def toString(): String
    Definition Classes
    Seq → Function1 → Iterable → AnyRef → Any
  185. def toVector: Vector[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
  186. def transpose[B](implicit asIterable: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Iterable[B]): Seq[Seq[B]]
    Definition Classes
    IterableOps
  187. def unapply(a: Int): Option[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    PartialFunction
  188. def unzip[A1, A2](implicit asPair: ((Double, SymmetricProposalGeneratorWithTransition[A])) => (A1, A2)): (Seq[A1], Seq[A2])
    Definition Classes
    IterableOps
  189. def unzip3[A1, A2, A3](implicit asTriple: ((Double, SymmetricProposalGeneratorWithTransition[A])) => (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
    Definition Classes
    IterableOps
  190. def updated[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](index: Int, elem: B): Seq[B]
    Definition Classes
    SeqOps
  191. def view: SeqView[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    SeqOps → IterableOps
  192. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  193. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  194. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  195. def withFilter(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): WithFilter[(Double, SymmetricProposalGeneratorWithTransition[A]), [_]Seq[_]]
    Definition Classes
    IterableOps
  196. def zip[B](that: IterableOnce[B]): Seq[((Double, SymmetricProposalGeneratorWithTransition[A]), B)]
    Definition Classes
    IterableOps
  197. def zipAll[A1 >: (Double, SymmetricProposalGeneratorWithTransition[A]), B](that: Iterable[B], thisElem: A1, thatElem: B): Seq[(A1, B)]
    Definition Classes
    IterableOps
  198. def zipWithIndex: Seq[((Double, SymmetricProposalGeneratorWithTransition[A]), Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, (Double, SymmetricProposalGeneratorWithTransition[A])) => 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: ((Double, SymmetricProposalGeneratorWithTransition[A]), 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, (Double, SymmetricProposalGeneratorWithTransition[A])) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  4. def companion: IterableFactory[[_]Seq[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

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

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

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

  7. final def prefixLength(p: ((Double, SymmetricProposalGeneratorWithTransition[A])) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  8. final def repr: Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]
    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

  9. def reverseMap[B](f: ((Double, SymmetricProposalGeneratorWithTransition[A])) => B): Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

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

  10. def seq: MixtureBuilderSymTrans.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  11. final def toIterator: Iterator[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  12. final def toStream: Stream[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  13. final def toTraversable: Traversable[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  14. final def union[B >: (Double, SymmetricProposalGeneratorWithTransition[A])](that: Seq[B]): Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  15. def view(from: Int, until: Int): View[(Double, SymmetricProposalGeneratorWithTransition[A])]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

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

Inherited from MixtureComponentSeq[SymmetricProposalGeneratorWithTransition[A]]

Inherited from Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]

Inherited from SeqOps[(Double, SymmetricProposalGeneratorWithTransition[A]), Seq, Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]

Inherited from Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]

Inherited from Equals

Inherited from SeqOps[(Double, SymmetricProposalGeneratorWithTransition[A]), [_]Seq[_], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]

Inherited from PartialFunction[Int, (Double, SymmetricProposalGeneratorWithTransition[A])]

Inherited from (Int) => (Double, SymmetricProposalGeneratorWithTransition[A])

Inherited from Iterable[(Double, SymmetricProposalGeneratorWithTransition[A])]

Inherited from Iterable[(Double, SymmetricProposalGeneratorWithTransition[A])]

Inherited from IterableFactoryDefaults[(Double, SymmetricProposalGeneratorWithTransition[A]), [x]Seq[x]]

Inherited from IterableOps[(Double, SymmetricProposalGeneratorWithTransition[A]), [_]Seq[_], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]

Inherited from IterableOnceOps[(Double, SymmetricProposalGeneratorWithTransition[A]), [_]Seq[_], Seq[(Double, SymmetricProposalGeneratorWithTransition[A])]]

Inherited from IterableOnce[(Double, SymmetricProposalGeneratorWithTransition[A])]

Inherited from AnyRef

Inherited from Any

Ungrouped