TableFor19

class TableFor19[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S](val heading: (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)*) extends IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)] with IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]

A table with 19 columns.

For an introduction to using tables, see the documentation for trait TableDrivenPropertyChecks.

This table is a sequence of Tuple19 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 TableFor19 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"),
   (  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),
   (  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),
   (  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),
   (  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),
   (  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)
 )

Because you supplied 19 members in each tuple, the type you'll get back will be a TableFor19.

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 TableFor19 as its first argument, then in a curried argument list takes the property check function. It invokes apply on the TableFor19, 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) =>
 a + b + c + d + e + f + g + h + i + j + k + l + m + n + o + p + q + r + s should equal (a * 19)
}

Because TableFor19 is a Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)], you can use it as a Seq. For example, here's how you could get a sequence of Outcomes 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.

Value parameters:
heading

a tuple containing string names of the columns in this table

rows

a variable length parameter list of Tuple19s containing the data of this table

Companion:
object
trait IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
trait IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
trait IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
trait IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
trait Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
trait SeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
trait Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
trait Equals
trait SeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
trait PartialFunction[Int, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
trait Int => (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)
trait Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
trait Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
trait IterableFactoryDefaults[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq]
trait IterableOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
trait IterableOnceOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
trait IterableOnce[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
class Object
trait Matchable
class Any

Value members

Concrete methods

def ++(others: Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]): TableFor19[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S]
def apply(idx: Int): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)

Selects a row of data by its index.

Selects a row of data by its index.

def apply[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result

Applies the passed property check function to each row of this TableFor19.

Applies the passed property check function to each row of this TableFor19.

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, this apply method wraps that exception in a TableDrivenPropertyCheckFailedException and completes abruptly with that exception. Once the property check function throws an exception for a row, this apply method will complete abruptly immediately and subsequent rows will not be checked against the function.

Value parameters:
fun

the property check function to apply to each row of this TableFor19

def exists[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
override def filter(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): TableFor19[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S]
Definition Classes
IterableOps -> IterableOnceOps
def forEvery[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
def length: Int

The number of rows of data in the table. (This does not include the heading tuple)

The number of rows of data in the table. (This does not include the heading tuple)

override 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
Seq -> Function1 -> Iterable -> Any

Inherited methods

@inline
final def ++[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](suffix: IterableOnce[B]): IndexedSeq[B]
Inherited from:
IterableOps
@inline
final override def ++:[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](prefix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
@inline
final def +:[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B): IndexedSeq[B]
Inherited from:
SeqOps
@inline
final def :+[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B): IndexedSeq[B]
Inherited from:
SeqOps
@inline
final def :++[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](suffix: IterableOnce[B]): IndexedSeq[B]
Inherited from:
SeqOps
@inline
final def addString(b: StringBuilder): StringBuilder
Inherited from:
IterableOnceOps
@inline
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from:
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from:
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), C]): PartialFunction[Int, C]
Inherited from:
PartialFunction
override def andThen[C](k: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => C): PartialFunction[Int, C]
Definition Classes
PartialFunction -> Function1
Inherited from:
PartialFunction
def appended[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B): IndexedSeq[B]
Inherited from:
SeqOps
def appendedAll[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](suffix: IterableOnce[B]): IndexedSeq[B]
Inherited from:
SeqOps
def applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](x: A1, default: A1 => B1): B1
Inherited from:
PartialFunction
override def canEqual(that: Any): Boolean
Definition Classes
IndexedSeq -> Seq -> Equals
Inherited from:
IndexedSeq
def collect[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), B]): IndexedSeq[B]
Inherited from:
IterableOps
def collectFirst[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), B]): Option[B]
Inherited from:
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)]]
Inherited from:
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)]
Inherited from:
PartialFunction
@unspecialized
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)
Inherited from:
Function1
@inline
final override def concat[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](suffix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
def contains[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: A1): Boolean
Inherited from:
SeqOps
def containsSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: Seq[B]): Boolean
Inherited from:
SeqOps
def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](xs: Array[B], start: Int, len: Int): Int
Inherited from:
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](xs: Array[B], start: Int): Int
Inherited from:
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](xs: Array[B]): Int
Inherited from:
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), B) => Boolean): Boolean
Inherited from:
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), B) => Boolean): Boolean
Inherited from:
IterableOnceOps
def count(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): Int
Inherited from:
IterableOnceOps
def diff[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: Seq[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
SeqOps
def distinct: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
SeqOps
def distinctBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
SeqOps
override def drop(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
override def dropRight(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def dropWhile(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOps
def elementWise: ElementWiseExtractor[Int, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
PartialFunction
override def empty: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from:
IterableFactoryDefaults
def endsWith[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: Iterable[B]): Boolean
Inherited from:
SeqOps
override def equals(o: Any): Boolean
Definition Classes
Seq -> Equals -> Any
Inherited from:
Seq
def exists(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): Boolean
Inherited from:
IterableOnceOps
def filterNot(pred: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOps
def find(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOnceOps
def findLast(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
SeqOps
def flatMap[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => IterableOnce[B]): IndexedSeq[B]
Inherited from:
IterableOps
def flatten[B](implicit asIterable: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => IterableOnce[B]): IndexedSeq[B]
Inherited from:
IterableOps
def fold[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](z: A1)(op: (A1, A1) => A1): A1
Inherited from:
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)) => B): B
Inherited from:
IterableOnceOps
override 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), B) => B): B
Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def forall(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): Boolean
Inherited from:
IterableOnceOps
def foreach[U](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => U): Unit
Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableFactoryDefaults
def groupBy[K](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => K): Map[K, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
Inherited from:
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)) => K)(f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B): Map[K, IndexedSeq[B]]
Inherited from:
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)) => K)(f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B)(reduce: (B, B) => B): Map[K, B]
Inherited from:
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)]]
Inherited from:
IterableOps
override def hashCode(): Int
Definition Classes
Seq -> Any
Inherited from:
Seq
override def head: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
override def headOption: Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
@deprecatedOverriding(message = "Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", since = "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)](elem: B): Int
Inherited from:
SeqOps
def indexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B, from: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", since = "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)](that: Seq[B]): Int
Inherited from:
SeqOps
def indexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: Seq[B], from: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", since = "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)) => Boolean): Int
Inherited from:
SeqOps
def indexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean, from: Int): Int
Inherited from:
SeqOps
def indices: Range
Inherited from:
SeqOps
def init: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOps
def inits: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
Inherited from:
IterableOps
def intersect[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: Seq[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
SeqOps
def isDefinedAt(idx: Int): Boolean
Inherited from:
SeqOps
override def isEmpty: Boolean
Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
override def iterableFactory: SeqFactory[IndexedSeq]
Definition Classes
IndexedSeq -> IndexedSeq -> Seq -> Seq -> Iterable -> Iterable -> IterableOps
Inherited from:
IndexedSeq
def iterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IndexedSeqOps
override def knownSize: Int
Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
override def last: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def lastIndexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B, end: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", since = "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)](that: Seq[B]): Int
Inherited from:
SeqOps
def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: Seq[B], end: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", since = "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)) => Boolean): Int
Inherited from:
SeqOps
def lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean, end: Int): Int
Inherited from:
SeqOps
def lastOption: Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
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), B, TableFor19[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S]]
Inherited from:
Iterable
final override def lengthCompare(that: Iterable[_]): Int
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
final override def lengthCompare(len: Int): Int
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
@inline
final def lengthIs: SizeCompareOps
Inherited from:
SeqOps
def lift: Int => Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
PartialFunction
override def map[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B): IndexedSeq[B]
Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def max[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](implicit ord: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)
Inherited from:
IterableOnceOps
def maxBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)
Inherited from:
IterableOnceOps
def maxByOption[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => 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)]
Inherited from:
IterableOnceOps
def maxOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](implicit ord: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOnceOps
def min[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](implicit ord: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)
Inherited from:
IterableOnceOps
def minBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)
Inherited from:
IterableOnceOps
def minByOption[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => 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)]
Inherited from:
IterableOnceOps
def minOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](implicit ord: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOnceOps
@inline
final def mkString: String
Inherited from:
IterableOnceOps
@inline
final def mkString(sep: String): String
Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from:
IterableOnceOps
protected def newSpecificBuilder: Builder[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
Inherited from:
IterableFactoryDefaults
@deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
def nonEmpty: Boolean
Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from:
PartialFunction
def padTo[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](len: Int, elem: B): IndexedSeq[B]
Inherited from:
SeqOps
def partition(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)])
Inherited from:
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)) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
Inherited from:
IterableOps
def patch[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
Inherited from:
SeqOps
def permutations: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
Inherited from:
SeqOps
override def prepended[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B): IndexedSeq[B]
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
def prependedAll[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](prefix: IterableOnce[B]): IndexedSeq[B]
Inherited from:
SeqOps
def product[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def reduce[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](op: (B, B) => B): B
Inherited from:
IterableOnceOps
def reduceLeft[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B): B
Inherited from:
IterableOnceOps
def reduceLeftOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](op: (B, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceRight[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), B) => B): B
Inherited from:
IterableOnceOps
def reduceRightOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), B) => B): Option[B]
Inherited from:
IterableOnceOps
override def reverse: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override def reverseIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override protected def reversed: Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def runWith[U](action: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => U): Int => Boolean
Inherited from:
PartialFunction
override def sameElements[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](o: IterableOnce[B]): Boolean
Definition Classes
IndexedSeq -> SeqOps
Inherited from:
IndexedSeq
def scala$collection$SeqOps$$super$concat[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](suffix: IterableOnce[B]): IndexedSeq[B]
Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(that: Iterable[_]): Int
Inherited from:
SeqOps
Inherited from:
SeqOps
Inherited from:
IndexedSeq
def scala$collection$immutable$IndexedSeq$$super$sameElements[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: IterableOnce[B]): Boolean
Inherited from:
IndexedSeq
def scala$collection$immutable$IndexedSeqOps$$super$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)]
Inherited from:
IndexedSeqOps
def scan[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](z: B)(op: (B, B) => B): IndexedSeq[B]
Inherited from:
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)) => B): IndexedSeq[B]
Inherited from:
IterableOps
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), B) => B): IndexedSeq[B]
Inherited from:
IterableOps
override def search[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override def search[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](elem: B)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
def segmentLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean, from: Int): Int
Inherited from:
SeqOps
final def segmentLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): Int
Inherited from:
SeqOps
final override def size: Int
Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
@inline
final def sizeIs: SizeCompareOps
Inherited from:
IterableOps
override 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)]
Definition Classes
IndexedSeqOps -> IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
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)]]
Inherited from:
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)]]
Inherited from:
IterableOps
def sortBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => 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)]
Inherited from:
SeqOps
def sortWith(lt: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
SeqOps
def sorted[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](implicit ord: Ordering[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
SeqOps
def span(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)])
Inherited from:
IterableOps
override def splitAt(n: Int): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)])
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def startsWith[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: IterableOnce[B], offset: Int): Boolean
Inherited from:
SeqOps
override 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), S]): S & EfficientSplit
Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
def sum[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def tail: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOps
def tails: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]]
Inherited from:
IterableOps
override def take(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
override def takeRight(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def takeWhile(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
IterableOps
override def tapEach[U](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => U): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def to[C1](factory: Factory[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), C1]): C1
Inherited from:
IterableOnceOps
def toArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S) : ClassTag]: Array[B]
Inherited from:
IterableOnceOps
@inline
final def toBuffer[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]: Buffer[B]
Inherited from:
IterableOnceOps
final override def toIndexedSeq: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeq -> IterableOnceOps
Inherited from:
IndexedSeq
def toList: List[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
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) <:< (K, V)): Map[K, V]
Inherited from:
IterableOnceOps
final override def toSeq: TableFor19[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S]
Definition Classes
Seq -> IterableOnceOps
Inherited from:
Seq
def toSet[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]: Set[B]
Inherited from:
IterableOnceOps
def toVector: Vector[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Inherited from:
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)) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
Inherited from:
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)]
Inherited from:
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)) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
Inherited from:
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)) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
Inherited from:
IterableOps
def updated[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](index: Int, elem: B): IndexedSeq[B]
Inherited from:
SeqOps
override def view: IndexedSeqView[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Definition Classes
IndexedSeqOps -> SeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def withFilter(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): WithFilter[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), IndexedSeq]
Inherited from:
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), B)]
Inherited from:
IterableOps
def zipAll[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
Inherited from:
IterableOps
def zipWithIndex: IndexedSeq[((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S), Int)]
Inherited from:
IterableOps

Deprecated and Inherited methods

@inline @deprecated(message = "Use foldLeft instead of /:", since = "2.13.0")
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)) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use foldRight instead of :\\", since = "2.13.0")
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), B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
@deprecated(message = "`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", since = "2.13.0")
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)) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
@inline @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @deprecated(message = "Use iterableFactory instead", since = "2.13.0")
def companion: IterableFactory[IndexedSeq]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
@inline @deprecated(message = "Use `dest ++= coll` instead", since = "2.13.0")
final def copyToBuffer[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
@deprecated(message = "Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", since = "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use segmentLength instead of prefixLength", since = "2.13.0")
final def prefixLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => Boolean): Int
Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
@deprecated(message = "Use coll instead of repr in a collection implementation, use the collection value itself from the outside", since = "2.13.0")
final def repr: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
@deprecated(message = "Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)", since = "2.13.0")
def reverseMap[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)) => B): IndexedSeq[B]
Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
@deprecated(message = "Iterable.seq always returns the iterable itself", since = "2.13.0")
def seq: TableFor19[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S]
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
@deprecated(message = "toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections", since = "2.13.7")
final def toIterable: TableFor19[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S]
Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
@inline @deprecated(message = "Use .iterator instead of .toIterator", since = "2.13.0")
final def toIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use .to(LazyList) instead of .toStream", since = "2.13.0")
final def toStream: Stream[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
@deprecated(message = "toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections", since = "2.13.0")
final def toTraversable: Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)]
Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
@inline @deprecated(message = "Use `concat` instead", since = "2.13.0")
final def union[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)](that: Seq[B]): IndexedSeq[B]
Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
@deprecated(message = "Use .view.slice(from, until) instead of .view(from, until)", since = "2.13.0")
override 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)]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps

Concrete fields

val heading: (String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String)