Type Members
-
-
class
WithFilter extends FilterMonadic[A, Repr]
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++[B >: SortedSparseCounts, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
++:[B >: SortedSparseCounts, That](that: Traversable[B])(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
++:[B >: SortedSparseCounts, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
+:[B >: SortedSparseCounts, That](elem: B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
-
def
:+[B >: SortedSparseCounts, That](elem: B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, SortedSparseCounts) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[C](k: (SortedSparseCounts) ⇒ C): PartialFunction[Int, C]
-
-
def
applyOrElse[A1 <: Int, B1 >: SortedSparseCounts](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
def
collect[B, That](pf: PartialFunction[SortedSparseCounts, B])(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
collectFirst[B](pf: PartialFunction[SortedSparseCounts, B]): Option[B]
-
def
combinations(n: Int): Iterator[Seq[SortedSparseCounts]]
-
def
companion: GenericCompanion[Seq]
-
-
def
contains(elem: Any): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
def
copyToArray[B >: SortedSparseCounts](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: SortedSparseCounts](xs: Array[B]): Unit
-
def
copyToArray[B >: SortedSparseCounts](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: SortedSparseCounts](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenSeq[B])(p: (SortedSparseCounts, B) ⇒ Boolean): Boolean
-
-
def
countsTotal: Int
-
-
-
-
-
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
-
-
-
def
finalize(): Unit
-
-
def
flatMap[B, That](f: (SortedSparseCounts) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
flatten[B](implicit asTraversable: (SortedSparseCounts) ⇒ GenTraversableOnce[B]): Seq[B]
-
def
fold[A1 >: SortedSparseCounts](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, SortedSparseCounts) ⇒ B): B
-
def
foldRight[B](z: B)(op: (SortedSparseCounts, B) ⇒ B): B
-
-
-
def
genericBuilder[B]: Builder[B, Seq[B]]
-
final
def
getClass(): Class[_]
-
-
def
grouped(size: Int): Iterator[Seq[SortedSparseCounts]]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
-
final
def
increment(discrete: Int, mixture: Int, incr: Int): Unit
-
def
incrementCountsAtPositions(discrete: Int, mixture1: Int, incr1: Int, pos1: Int, mixture2: Int, incr2: Int, pos2: Int): Unit
-
-
-
def
indexOf[B >: SortedSparseCounts](elem: B, from: Int): Int
-
-
def
indexOfSlice[B >: SortedSparseCounts](that: GenSeq[B], from: Int): Int
-
def
indexOfSlice[B >: SortedSparseCounts](that: GenSeq[B]): Int
-
def
indexWhere(p: (SortedSparseCounts) ⇒ Boolean, from: Int): Int
-
-
def
indices: Range
-
-
-
-
def
isDefinedAt(idx: Int): Boolean
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
-
def
lastIndexOf[B >: SortedSparseCounts](elem: B, end: Int): Int
-
-
def
lastIndexOfSlice[B >: SortedSparseCounts](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: SortedSparseCounts](that: GenSeq[B]): Int
-
def
lastIndexWhere(p: (SortedSparseCounts) ⇒ Boolean, end: Int): Int
-
def
lastIndexWhere(p: (SortedSparseCounts) ⇒ Boolean): Int
-
-
def
length: Int
-
def
lengthCompare(len: Int): Int
-
-
def
map[B, That](f: (SortedSparseCounts) ⇒ B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
-
-
-
-
val
mixtureCounts: Array[Int]
-
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orElse[A1 <: Int, B1 >: SortedSparseCounts](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
def
padTo[B >: SortedSparseCounts, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
-
-
-
def
patch[B >: SortedSparseCounts, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
-
def
prefixLength(p: (SortedSparseCounts) ⇒ Boolean): Int
-
-
def
reduce[A1 >: SortedSparseCounts](op: (A1, A1) ⇒ A1): A1
-
-
-
def
reduceOption[A1 >: SortedSparseCounts](op: (A1, A1) ⇒ A1): Option[A1]
-
-
-
-
-
-
def
reverseMap[B, That](f: (SortedSparseCounts) ⇒ B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
-
def
runWith[U](action: (SortedSparseCounts) ⇒ U): (Int) ⇒ Boolean
-
def
sameElements[B >: SortedSparseCounts](that: GenIterable[B]): Boolean
-
def
scan[B >: SortedSparseCounts, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, SortedSparseCounts) ⇒ B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
scanRight[B, That](z: B)(op: (SortedSparseCounts, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
segmentLength(p: (SortedSparseCounts) ⇒ Boolean, from: Int): Int
-
-
def
size: Int
-
def
slice(from: Int, until: Int): Seq[SortedSparseCounts]
-
def
sliding(size: Int, step: Int): Iterator[Seq[SortedSparseCounts]]
-
def
sliding(size: Int): Iterator[Seq[SortedSparseCounts]]
-
-
-
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
-
def
toArray[B >: SortedSparseCounts](implicit arg0: ClassTag[B]): Array[B]
-
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[SortedSparseCounts, (T, U)]): Map[T, U]
-
-
-
-
def
toString(): String
-
-
-
def
transpose[B](implicit asTraversable: (SortedSparseCounts) ⇒ GenTraversableOnce[B]): Seq[Seq[B]]
-
def
union[B >: SortedSparseCounts, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
def
unzip[A1, A2](implicit asPair: (SortedSparseCounts) ⇒ (A1, A2)): (Seq[A1], Seq[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (SortedSparseCounts) ⇒ (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
-
def
updated[B >: SortedSparseCounts, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], B, That]): That
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: SortedSparseCounts, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], (A1, B), That]): That
-
def
zipAll[B, A1 >: SortedSparseCounts, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Seq[SortedSparseCounts], (A1, B), That]): That
-
def
zipWithIndex[A1 >: SortedSparseCounts, That](implicit bf: CanBuildFrom[Seq[SortedSparseCounts], (A1, Int), That]): That
Inherited from Equals
Inherited from Any