class TableFor20[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T] extends IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)] with IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
A table with 20 columns.
For an introduction to using tables, see the documentation for trait TableDrivenPropertyChecks.
This table is a sequence of Tuple20
objects, where each tuple represents one row of the table.
The first element of each tuple comprise the first column of the table, the second element of
each tuple comprise the second column, and so on. This table also carries with it
a heading tuple that gives string names to the columns of the table.
A handy way to create a TableFor20
is via an apply
factory method in the Table
singleton object provided by the Tables
trait. Here's an example:
val examples = Table( ("a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t"), * ( 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), ( 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), ( 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2), ( 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3), ( 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4), ( 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5), ( 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6), ( 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7), ( 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8), ( 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9) )
Because you supplied 20 members in each tuple, the type you'll get back will be a TableFor20
.
The table provides an apply
method that takes a function with a parameter list that matches
the types and arity of the tuples contained in this table. The apply
method will invoke the
function with the members of each row tuple passed as arguments, in ascending order by index. (I.e.,
the zeroth tuple is checked first, then the tuple with index 1, then index 2, and so on until all the rows
have been checked (or until a failure occurs). The function represents a property of the code under test
that should succeed for every row of the table. If the function returns normally, that indicates the property
check succeeded for that row. If the function completes abruptly with an exception, that indicates the
property check failed and the apply
method will complete abruptly with a
TableDrivenPropertyCheckFailedException
that wraps the exception thrown by the supplied property function.
The usual way you'd invoke the apply
method that checks a property is via a forAll
method
provided by trait TableDrivenPropertyChecks
. The forAll
method takes a TableFor20
as its
first argument, then in a curried argument list takes the property check function. It invokes apply
on
the TableFor20
, passing in the property check function. Here's an example:
forAll (examples) { (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) => a + b + c + d + e + f + g + h + i + j + k + l + m + n + o + p + q + r + s + t should equal (a * 20) }
Because TableFor20
is a Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
, you can use it as a Seq
. For example, here's how
you could get a sequence of Outcome
s for each row of the table, indicating whether a property check succeeded or failed
on each row of the table:
for (row <- examples) yield { outcomeOf { row._1 should not equal (7) } }
Note: the outcomeOf
method, contained in the OutcomeOf
trait, will execute the supplied code (a by-name parameter) and
transform it to an Outcome
. If no exception is thrown by the code, outcomeOf
will result in a
Succeeded
, indicating the "property check"
succeeded. If the supplied code completes abruptly in an exception that would normally cause a test to fail, outcomeOf
will result in
in a Failed
instance containing that exception. For example, the previous for expression would give you:
Vector(Succeeded, Succeeded, Succeeded, Succeeded, Succeeded, Succeeded, Succeeded, Failed(org.scalatest.TestFailedException: 7 equaled 7), Succeeded, Succeeded)
This shows that all the property checks succeeded, except for the one at index 7.
- Source
- TableFor1.scala
- Alphabetic
- By Inheritance
- TableFor20
- IndexedSeq
- IndexedSeqOps
- IndexedSeq
- IndexedSeqOps
- Seq
- SeqOps
- Seq
- Equals
- SeqOps
- PartialFunction
- Function1
- Iterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new TableFor20(heading: (String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String), rows: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)*)
- heading
a tuple containing string names of the columns in this table
- rows
a variable length parameter list of
Tuple20
s containing the data of this table
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- def ++(others: Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]): TableFor20[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T]
- final def ++[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](suffix: IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++:[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](prefix: IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- final def +:[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B): IndexedSeq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :+[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B): IndexedSeq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :++[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](suffix: IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def andThen[C](k: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), C]): PartialFunction[Int, C]
- Definition Classes
- PartialFunction
- def andThen[C](k: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
- def appended[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B): IndexedSeq[B]
- Definition Classes
- SeqOps
- def appendedAll[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](suffix: IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- SeqOps
- def apply[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
Applies the passed property check function to each row of this
TableFor20
.Applies the passed property check function to each row of this
TableFor20
.If the property checks for all rows succeed (the property check function returns normally when passed the data for each row), this
apply
method returns normally. If the property check function completes abruptly with an exception for any row, thisapply
method wraps that exception in aTableDrivenPropertyCheckFailedException
and completes abruptly with that exception. Once the property check function throws an exception for a row, thisapply
method will complete abruptly immediately and subsequent rows will not be checked against the function.- fun
the property check function to apply to each row of this
TableFor20
- def apply(idx: Int): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
Selects a row of data by its index.
Selects a row of data by its index.
- Definition Classes
- TableFor20 → SeqOps → Function1
- def applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](x: A1, default: (A1) => B1): B1
- Definition Classes
- PartialFunction
- def applyPreferredMaxLength: Int
- Attributes
- protected
- Definition Classes
- IndexedSeq
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def canEqual(that: Any): Boolean
- Definition Classes
- IndexedSeq → Seq → Equals
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def coll: TableFor20.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B]): IndexedSeq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B]): Option[B]
- Definition Classes
- IterableOnceOps
- def combinations(n: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- SeqOps
- def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- PartialFunction
- def compose[A](g: (A) => Int): (A) => (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def concat[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](suffix: IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- def contains[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: A1): Boolean
- Definition Classes
- SeqOps
- def containsSlice[B](that: Seq[B]): Boolean
- Definition Classes
- SeqOps
- def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- def corresponds[B](that: Seq[B])(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B) => Boolean): Boolean
- Definition Classes
- SeqOps
- def corresponds[B](that: IterableOnce[B])(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def diff[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Seq[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def distinct: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def distinctBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def drop(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → IterableOps → IterableOnceOps
- def dropRight(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → IterableOps
- def dropWhile(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps → IterableOnceOps
- def elementWise: ElementWiseExtractor[Int, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- PartialFunction
- def empty: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def endsWith[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Iterable[B]): Boolean
- Definition Classes
- SeqOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(o: Any): Boolean
- Definition Classes
- Seq → Equals → AnyRef → Any
- def exists[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
- def exists(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): TableFor20[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T]
- Definition Classes
- TableFor20 → IterableOps → IterableOnceOps
- def filterNot(pred: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps → IterableOnceOps
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- def findLast(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def flatMap[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B) => B): B
- Definition Classes
- IterableOnceOps
- def forEvery[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
- def forall(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def groupBy[K](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => K): Map[K, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => K)(f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): Map[K, IndexedSeq[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => K)(f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Seq → AnyRef → Any
- def head: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
- Definition Classes
- IterableOps
- def headOption: Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps
- val heading: (String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String)
- def indexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
- def indexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B, from: Int): Int
- Definition Classes
- SeqOps
- def indexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
- def indexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Seq[B], from: Int): Int
- Definition Classes
- SeqOps
- def indexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
- def indexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- def indices: Range
- Definition Classes
- SeqOps
- def init: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps
- def inits: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- IterableOps
- def intersect[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Seq[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def isDefinedAt(idx: Int): Boolean
- Definition Classes
- SeqOps
- def isEmpty: Boolean
- Definition Classes
- SeqOps → IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: SeqFactory[IndexedSeq]
- Definition Classes
- IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
- def iterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → IterableOnce
- def knownSize: Int
- Definition Classes
- IndexedSeqOps → IterableOnce
- def last: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
- Definition Classes
- IndexedSeqOps → IterableOps
- def lastIndexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B, end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
- def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Seq[B], end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
- def lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean, end: Int): Int
- Definition Classes
- SeqOps
- def lastOption: Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B, TableFor20.this.type]
- Definition Classes
- Iterable
- def length: Int
The number of rows of data in the table.
The number of rows of data in the table. (This does not include the
heading
tuple)- Definition Classes
- TableFor20 → SeqOps
- final def lengthCompare(that: Iterable[_]): Int
- Definition Classes
- IndexedSeqOps → SeqOps
- final def lengthCompare(len: Int): Int
- Definition Classes
- IndexedSeqOps → SeqOps
- final def lengthIs: SizeCompareOps
- Definition Classes
- SeqOps
- Annotations
- @inline()
- def lift: (Int) => Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- PartialFunction
- def map[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): IndexedSeq[B]
- Definition Classes
- IndexedSeqOps → IterableOps → IterableOnceOps
- def max[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit ord: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B)(implicit cmp: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit ord: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- def min[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit ord: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
- Definition Classes
- IterableOnceOps
- def minBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B)(implicit cmp: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- def minOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit ord: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def occCounts[B](sq: Seq[B]): Map[B, Int]
- Attributes
- protected[scala.collection]
- Definition Classes
- SeqOps
- def orElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- def padTo[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](len: Int, elem: B): IndexedSeq[B]
- Definition Classes
- SeqOps
- def partition(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
- Definition Classes
- IterableOps
- def patch[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
- Definition Classes
- SeqOps
- def permutations: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- SeqOps
- def prepended[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B): IndexedSeq[B]
- Definition Classes
- IndexedSeqOps → SeqOps
- def prependedAll[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](prefix: IterableOnce[B]): IndexedSeq[B]
- Definition Classes
- SeqOps
- def product[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reverse: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → SeqOps
- def reverseIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → SeqOps
- def reversed: Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Attributes
- protected
- Definition Classes
- IndexedSeqOps → IterableOnceOps
- def runWith[U](action: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => U): (Int) => Boolean
- Definition Classes
- PartialFunction
- def sameElements[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](o: IterableOnce[B]): Boolean
- Definition Classes
- IndexedSeq → SeqOps
- def scan[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](z: B)(op: (B, B) => B): IndexedSeq[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): IndexedSeq[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B) => B): IndexedSeq[B]
- Definition Classes
- IterableOps
- def search[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- IndexedSeqOps → SeqOps
- def search[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](elem: B)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- IndexedSeqOps → SeqOps
- def segmentLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- final def segmentLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Int
- Definition Classes
- SeqOps
- final def size: Int
- Definition Classes
- SeqOps → IterableOnceOps
- final def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeCompare(otherSize: Int): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- IterableOps
- def sortBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B)(implicit ord: Ordering[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def sortWith(lt: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def sorted[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit ord: Ordering[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- SeqOps
- def span(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)])
- Definition Classes
- IterableOps → IterableOnceOps
- def startsWith[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: IterableOnce[B], offset: Int): Boolean
- Definition Classes
- SeqOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), S]): S with EfficientSplit
- Definition Classes
- IndexedSeqOps → IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- IndexedSeq → Seq → Iterable
- Annotations
- @deprecatedOverriding("Compatibility override", "2.13.0")
- def sum[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps
- def tails: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]]
- Definition Classes
- IterableOps
- def take(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → IterableOps → IterableOnceOps
- def takeRight(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → IterableOps
- def takeWhile(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => U): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def toIndexedSeq: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeq → IterableOnceOps
- final def toIterable: TableFor20.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- final def toSeq: TableFor20.this.type
- Definition Classes
- Seq → IterableOnceOps
- def toSet[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
A string representation of this object, which includes the heading strings as well as the rows of data.
A string representation of this object, which includes the heading strings as well as the rows of data.
- Definition Classes
- TableFor20 → Seq → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
- Definition Classes
- IterableOps
- def unapply(a: Int): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- PartialFunction
- def unzip[A1, A2](implicit asPair: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
- Definition Classes
- IterableOps
- def updated[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](index: Int, elem: B): IndexedSeq[B]
- Definition Classes
- SeqOps
- def view: IndexedSeqView[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → SeqOps → IterableOps
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def withFilter(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): WithFilter[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), [_]IndexedSeq[_]]
- Definition Classes
- IterableOps
- def zip[B](that: IterableOnce[B]): IndexedSeq[((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: IndexedSeq[((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), Int)]
- Definition Classes
- IterableOps → IterableOnceOps
Deprecated Value Members
- final def /:[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T), B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def companion: IterableFactory[[_]IndexedSeq[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def prefixLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
- final def repr: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def reverseMap[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)) => B): IndexedSeq[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
- def seq: TableFor20.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- final def union[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)](that: Seq[B]): IndexedSeq[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
concat
instead
- def view(from: Int, until: Int): IndexedSeqView[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)]
- Definition Classes
- IndexedSeqOps → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)