Seq_

final class Seq_[A](val coll: Seq[A]) extends AnyVal
class AnyVal
trait Matchable
class Any

Value members

Concrete methods

def #@@: String
def @@: String
def IQR(num: Numeric[A]): Double
def countBySelf: List[(A, Int)]
def distinctByAdjacency: Seq[A]
def duplicates: Seq[A]
def filterBy[B](p: B => Boolean)(f: A => B): Seq[A]
def filterByNot[B](p: B => Boolean)(f: A => B): Seq[A]
def force: Force[A]
def groupByKey[K, V](ev: A <:< (K, V)): Map[K, Seq[V]]
def groupByKeyWithListMap[K, V](ev: A <:< (K, V)): ListMap[K, Seq[V]]
def groupByKeyWithTreeMap[K, V](ev: A <:< (K, V), ord: Ordering[K]): TreeMap[K, Seq[V]]
def isDisjointWith[B >: A](that: Iterable[B]): Boolean
def isDistinct: Boolean
def join(sep: Separator): String
def join: String
def joinln: String
def joinlnln: String
def jointab: String
def mapIf[B <: A](pred: A => Boolean)(f: A => B): Seq[A]
def mean(num: Numeric[A]): Double
def median(num: Numeric[A]): Double
def percentile(n: Double)(num: Numeric[A]): Double
def range[B >: A](cmp: Ordering[B], num: Numeric[B]): B
def requireDistinct(): Seq[A]
def requireDistinctBy[B](f: A => B): Seq[A]
def section: String
def section(title: String): String
def section2: String
def section2(title: String): String
def slidingList(n: Int): List[List[A]]
def slidingPairs: List[(A, A)]
def splitAtHead: (A, Seq[A])
def splitAtLast: (Seq[A], A)
def stdev(num: Numeric[A]): Double
def stdev(mean: Double)(num: Numeric[A]): Double
def toListMap[K, V](ev: A <:< (K, V)): ListMap[K, V]
def toMutableMap[K, V](ev: A <:< (K, V)): HashMap[K, V]
def toOptionalSeq[B](ev: A <:< Option[B]): Option[Seq[B]]
def toTreeMap[K, V](ev: A <:< (K, V), ord: Ordering[K]): TreeMap[K, V]
def zipSameSize[B](that: Seq[B]): Seq[(A, B)]
def zipSameSize[B](that: Seq[B], debug: Seq[_] => Any): Seq[(A, B)]
def zipWithRank: Seq[(A, Rank)]

Concrete fields

val coll: Seq[A]