The arithmetic mean of all the elements
The arithmetic mean of all the elements
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
The standard deviation of all the elements
The standard deviation of all the elements
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
The variance of all the elements (the one divided by n not n-1)
The variance of all the elements (the one divided by n not n-1)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).++(that)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).++:(that)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).++:(that)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).+:(elem)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]])./:(z)(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).:+(elem)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).:\(z)(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).addString(b)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).addString(b, sep)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).addString(b, start, sep, end)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).aggregate(z)(seqop, combop)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).andThen(k)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).apply(idx)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).applyOrElse(x, default)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).canEqual(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).collect(pf)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).collectFirst(pf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).combinations(n)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).companion
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).compose(g)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).contains(elem)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).containsSlice(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).copyToArray(xs, start, len)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).copyToArray(xs)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).copyToArray(xs, start)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).copyToBuffer(dest)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).corresponds(that)(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).count(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).diff(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).distinct
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).drop(n)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).dropRight(n)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).dropWhile(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).endsWith(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).equals(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).exists(p)
(collSeq5: MonadOps[Product5[T1, T2, T3, T4, T5]]).filter(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).filter(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).filterNot(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).find(p)
(collSeq5: MonadOps[Product5[T1, T2, T3, T4, T5]]).flatMap(f)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).flatMap(f)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).flatZip(that)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).flatten(asTraversable)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).fold(z)(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).foldLeft(z)(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).foldRight(z)(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).forall(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).foreach(f)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).genericBuilder
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).groupBy(f)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).grouped(size)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).hasDefiniteSize
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).hashCode()
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).head
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).headOption
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).indexOf(elem, from)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).indexOf(elem)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).indexOfSlice(that, from)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).indexOfSlice(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).indexWhere(p, from)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).indexWhere(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).indices
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).init
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).inits
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).intersect(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).isDefinedAt(idx)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).isEmpty
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).isTraversableAgain
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).iterator
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).last
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lastIndexOf(elem, end)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lastIndexOf(elem)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lastIndexOfSlice(that, end)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lastIndexOfSlice(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lastIndexWhere(p, end)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lastIndexWhere(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lastOption
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).length
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lengthCompare(len)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).lift
(collSeq5: MonadOps[Product5[T1, T2, T3, T4, T5]]).map(f)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).map(f)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).max(cmp)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).maxBy(f)(cmp)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).min(cmp)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).minBy(f)(cmp)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).mkString
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).mkString(sep)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).mkString(start, sep, end)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).nonEmpty
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).orElse(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).padTo(len, elem)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).par
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).partition(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).patch(from, patch, replaced)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).permutations
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).prefixLength(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).product(num)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).productArity
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).productElement(n)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).productIterator
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).productPrefix
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reduce(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reduceLeft(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reduceLeftOption(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reduceOption(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reduceRight(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reduceRightOption(op)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).repr
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reverse
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reverseIterator
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).reverseMap(f)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).runWith(action)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).sameElements(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).scan(z)(op)(cbf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).scanLeft(z)(op)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).scanRight(z)(op)(bf)
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).segmentLength(p, from)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).seq
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).size
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).slice(from, until)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).sliding(size, step)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).sliding(size)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).sortBy(f)(ord)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).sortWith(lt)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).sorted(ord)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).span(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).splitAt(n)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).startsWith(that, offset)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).startsWith(that)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).stringPrefix
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).sum(num)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).tail
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).tails
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).take(n)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).takeRight(n)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).takeWhile(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).to(cbf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toArray(arg0)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toBuffer
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toIndexedSeq
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toIterable
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toIterator
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toList
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toMap(ev)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toSeq
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toSet
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toStream
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toString()
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toTraversable
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).toVector
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).transpose(asTraversable)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(collSeq5: Stats[Product5[T1, T2, T3, T4, T5]]).underlying
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).underlying
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).union(that)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).unzip(asPair)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).unzip3(asTriple)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).updated(index, elem)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).view(from, until)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).view
(collSeq5: MonadOps[Product5[T1, T2, T3, T4, T5]]).withFilter(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).withFilter(p)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).zip(that)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).zipAll(that, thisElem, thatElem)(bf)
(collSeq5: collections.CollSeq1[Product5[T1, T2, T3, T4, T5]]).zipWithIndex(bf)