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