Packages

class TableFor16[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P] extends IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)] with IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]

A table with 16 columns.

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

This table is a sequence of Tuple16 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 TableFor16 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"),
 *     (  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),
    (  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),
    (  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),
    (  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),
    (  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)
  )

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

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

Because TableFor16 is a Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], 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.

Source
TableFor1.scala
Linear Supertypes
IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]], Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], SeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]], Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], Equals, SeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]], PartialFunction[Int, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], (Int) => (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], IterableFactoryDefaults[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [x]IndexedSeq[x]], IterableOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]], IterableOnceOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]], IterableOnce[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TableFor16
  2. IndexedSeq
  3. IndexedSeqOps
  4. IndexedSeq
  5. IndexedSeqOps
  6. Seq
  7. SeqOps
  8. Seq
  9. Equals
  10. SeqOps
  11. PartialFunction
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableFactoryDefaults
  16. IterableOps
  17. IterableOnceOps
  18. IterableOnce
  19. AnyRef
  20. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TableFor16(heading: (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)*)

    heading

    a tuple containing string names of the columns in this table

    rows

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++(others: Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]): TableFor16[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P]
  4. final def ++[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. final def ++:[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  6. final def +:[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. final def :+[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def :++[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  13. def andThen[C](k: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  14. def andThen[C](k: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  15. def appended[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  16. def appendedAll[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  17. def apply[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result

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

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

    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.

    fun

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

  18. def apply(idx: Int): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)

    Selects a row of data by its index.

    Selects a row of data by its index.

    Definition Classes
    TableFor16 → SeqOps → Function1
  19. def applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  20. def applyPreferredMaxLength: Int
    Attributes
    protected
    Definition Classes
    IndexedSeq
  21. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  22. def canEqual(that: Any): Boolean
    Definition Classes
    IndexedSeq → Seq → Equals
  23. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  24. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  25. final def coll: TableFor16.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  26. def collect[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  27. def collectFirst[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B]): Option[B]
    Definition Classes
    IterableOnceOps
  28. def combinations(n: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    SeqOps
  29. 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)]
    Definition Classes
    PartialFunction
  30. def compose[A](g: (A) => Int): (A) => (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. final def concat[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  32. def contains[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: A1): Boolean
    Definition Classes
    SeqOps
  33. def containsSlice[B](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  34. def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  35. def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  36. def copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  37. def corresponds[B](that: Seq[B])(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B) => Boolean): Boolean
    Definition Classes
    SeqOps
  38. def corresponds[B](that: IterableOnce[B])(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  39. def count(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Int
    Definition Classes
    IterableOnceOps
  40. def diff[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Seq[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  41. def distinct: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  42. def distinctBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  43. def drop(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  44. def dropRight(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → IterableOps
  45. def dropWhile(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps → IterableOnceOps
  46. def elementWise: ElementWiseExtractor[Int, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    PartialFunction
  47. def empty: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  48. def endsWith[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  49. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  50. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  51. def exists[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
  52. def exists(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  53. def filter(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): TableFor16[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P]
    Definition Classes
    TableFor16 → IterableOps → IterableOnceOps
  54. def filterNot(pred: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps → IterableOnceOps
  55. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  56. def find(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
  57. def findLast(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  58. def flatMap[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  59. def flatten[B](implicit asIterable: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  60. def fold[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  61. def foldLeft[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): B
    Definition Classes
    IterableOnceOps
  62. def foldRight[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B) => B): B
    Definition Classes
    IterableOnceOps
  63. def forEvery[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
  64. def forall(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  65. def foreach[U](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => U): Unit
    Definition Classes
    IterableOnceOps
  66. def fromSpecific(coll: IterableOnce[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  67. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  68. def groupBy[K](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => K): Map[K, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    IterableOps
  69. def groupMap[K, B](key: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => K)(f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): Map[K, IndexedSeq[B]]
    Definition Classes
    IterableOps
  70. def groupMapReduce[K, B](key: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => K)(f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  71. def grouped(size: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    IterableOps
  72. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  73. def head: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)
    Definition Classes
    IterableOps
  74. def headOption: Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps
  75. val heading: (String, String, String, String, String, String, String, String, String, String, String, String, String, String, String, String)
  76. def indexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
  77. def indexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  78. def indexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
  79. def indexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  80. def indexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
  81. def indexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  82. def indices: Range
    Definition Classes
    SeqOps
  83. def init: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps
  84. def inits: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    IterableOps
  85. def intersect[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Seq[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  86. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  87. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  88. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  89. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  90. def iterableFactory: SeqFactory[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  91. def iterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → IterableOnce
  92. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  93. def last: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)
    Definition Classes
    IndexedSeqOps → IterableOps
  94. def lastIndexOf[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  95. def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
  96. def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  97. def lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
  98. def lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  99. def lastOption: Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps
  100. def lazyZip[B](that: Iterable[B]): LazyZip2[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B, TableFor16.this.type]
    Definition Classes
    Iterable
  101. 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
    TableFor16 → SeqOps
  102. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  103. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  104. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  105. def lift: (Int) => Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    PartialFunction
  106. def map[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  107. def max[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit ord: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)
    Definition Classes
    IterableOnceOps
  108. def maxBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)
    Definition Classes
    IterableOnceOps
  109. def maxByOption[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B)(implicit cmp: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
  110. def maxOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit ord: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
  111. def min[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit ord: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)
    Definition Classes
    IterableOnceOps
  112. def minBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)
    Definition Classes
    IterableOnceOps
  113. def minByOption[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B)(implicit cmp: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
  114. def minOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit ord: Ordering[B]): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
  115. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  116. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  117. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  118. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  119. def newSpecificBuilder: Builder[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  120. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  121. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  122. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  123. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[scala.collection]
    Definition Classes
    SeqOps
  124. def orElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  125. def padTo[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](len: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  126. def partition(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)])
    Definition Classes
    IterableOps
  127. def partitionMap[A1, A2](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  128. def patch[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
    Definition Classes
    SeqOps
  129. def permutations: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    SeqOps
  130. def prepended[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  131. def prependedAll[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  132. def product[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  133. def reduce[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  134. def reduceLeft[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): B
    Definition Classes
    IterableOnceOps
  135. def reduceLeftOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): Option[B]
    Definition Classes
    IterableOnceOps
  136. def reduceOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  137. def reduceRight[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B) => B): B
    Definition Classes
    IterableOnceOps
  138. def reduceRightOption[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  139. def reverse: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → SeqOps
  140. def reverseIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → SeqOps
  141. def reversed: Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  142. def runWith[U](action: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  143. def sameElements[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](o: IterableOnce[B]): Boolean
    Definition Classes
    IndexedSeq → SeqOps
  144. def scan[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](z: B)(op: (B, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  145. def scanLeft[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  146. def scanRight[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  147. def search[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  148. def search[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  149. def segmentLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  150. final def segmentLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Int
    Definition Classes
    SeqOps
  151. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  152. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  153. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  154. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  155. def slice(from: Int, until: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
  156. def sliding(size: Int, step: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    IterableOps
  157. def sliding(size: Int): Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    IterableOps
  158. def sortBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B)(implicit ord: Ordering[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  159. def sortWith(lt: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  160. def sorted[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit ord: Ordering[B]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    SeqOps
  161. def span(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)])
    Definition Classes
    IterableOps → IterableOnceOps
  162. def splitAt(n: Int): (IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)])
    Definition Classes
    IterableOps → IterableOnceOps
  163. def startsWith[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  164. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  165. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
    Annotations
    @deprecatedOverriding("Compatibility override", "2.13.0")
  166. def sum[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  167. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  168. def tail: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps
  169. def tails: Iterator[IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]
    Definition Classes
    IterableOps
  170. def take(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  171. def takeRight(n: Int): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → IterableOps
  172. def takeWhile(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps → IterableOnceOps
  173. def tapEach[U](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => U): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps → IterableOnceOps
  174. def to[C1](factory: Factory[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), C1]): C1
    Definition Classes
    IterableOnceOps
  175. def toArray[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  176. final def toBuffer[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  177. final def toIndexedSeq: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeq → IterableOnceOps
  178. final def toIterable: TableFor16.this.type
    Definition Classes
    Iterable → IterableOps
  179. def toList: List[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
  180. def toMap[K, V](implicit ev: <:<[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  181. final def toSeq: TableFor16.this.type
    Definition Classes
    Seq → IterableOnceOps
  182. def toSet[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]: Set[B]
    Definition Classes
    IterableOnceOps
  183. 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
    TableFor16 → Seq → Function1 → Iterable → AnyRef → Any
  184. def toVector: Vector[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
  185. def transpose[B](implicit asIterable: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    IterableOps
  186. def unapply(a: Int): Option[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    PartialFunction
  187. def unzip[A1, A2](implicit asPair: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  188. def unzip3[A1, A2, A3](implicit asTriple: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    IterableOps
  189. def updated[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](index: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  190. def view: IndexedSeqView[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  191. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  192. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  193. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  194. def withFilter(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): WithFilter[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_]]
    Definition Classes
    IterableOps
  195. def zip[B](that: IterableOnce[B]): IndexedSeq[((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B)]
    Definition Classes
    IterableOps
  196. def zipAll[A1 >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
    Definition Classes
    IterableOps
  197. def zipWithIndex: IndexedSeq[((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  4. 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

  5. final def copyToBuffer[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  6. 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)

  7. final def prefixLength(p: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  8. final def repr: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    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

  9. def reverseMap[B](f: ((A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)) => B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  10. def seq: TableFor16.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  11. final def toIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  12. final def toStream: Stream[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  13. final def toTraversable: Traversable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  14. final def union[B >: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)](that: Seq[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  15. def view(from: Int, until: Int): IndexedSeqView[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), IndexedSeq, IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]

Inherited from IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from IndexedSeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]

Inherited from Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from SeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]

Inherited from Seq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from Equals

Inherited from SeqOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]

Inherited from PartialFunction[Int, (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from (Int) => (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)

Inherited from Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from Iterable[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from IterableFactoryDefaults[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [x]IndexedSeq[x]]

Inherited from IterableOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]

Inherited from IterableOnceOps[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P), [_]IndexedSeq[_], IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]]

Inherited from IterableOnce[(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)]

Inherited from AnyRef

Inherited from Any

Ungrouped