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