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