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