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