Packages

class TableFor9[A, B, C, D, E, F, G, H, I] extends IndexedSeq[(A, B, C, D, E, F, G, H, I)] with IndexedSeqLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]]

A table with 9 columns.

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

This table is a sequence of Tuple9 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 TableFor9 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"),
 *     (  0,   0,   0,   0,   0,   0,   0,   0,   0),
    (  1,   1,   1,   1,   1,   1,   1,   1,   1),
    (  2,   2,   2,   2,   2,   2,   2,   2,   2),
    (  3,   3,   3,   3,   3,   3,   3,   3,   3),
    (  4,   4,   4,   4,   4,   4,   4,   4,   4),
    (  5,   5,   5,   5,   5,   5,   5,   5,   5),
    (  6,   6,   6,   6,   6,   6,   6,   6,   6),
    (  7,   7,   7,   7,   7,   7,   7,   7,   7),
    (  8,   8,   8,   8,   8,   8,   8,   8,   8),
    (  9,   9,   9,   9,   9,   9,   9,   9,   9)
  )

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

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 TableFor9 as its first argument, then in a curried argument list takes the property check function. It invokes apply on the TableFor9, passing in the property check function. Here's an example:

forAll (examples) { (a, b, c, d, e, f, g, h, i) =>
  a + b + c + d + e + f + g + h + i should equal (a * 9)
}

Because TableFor9 is a Seq[(A, B, C, D, E, F, G, H, I)], 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)], IndexedSeqLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], Seq[(A, B, C, D, E, F, G, H, I)], SeqLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], GenSeq[(A, B, C, D, E, F, G, H, I)], GenSeqLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], Iterable[(A, B, C, D, E, F, G, H, I)], IterableLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], Equals, GenIterable[(A, B, C, D, E, F, G, H, I)], GenIterableLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], Traversable[(A, B, C, D, E, F, G, H, I)], GenTraversable[(A, B, C, D, E, F, G, H, I)], GenericTraversableTemplate[(A, B, C, D, E, F, G, H, I), IndexedSeq], TraversableLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], GenTraversableLike[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], Parallelizable[(A, B, C, D, E, F, G, H, I), ParSeq[(A, B, C, D, E, F, G, H, I)]], TraversableOnce[(A, B, C, D, E, F, G, H, I)], GenTraversableOnce[(A, B, C, D, E, F, G, H, I)], FilterMonadic[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], HasNewBuilder[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]], PartialFunction[Int, (A, B, C, D, E, F, G, H, I)], (Int) ⇒ (A, B, C, D, E, F, G, H, I), AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TableFor9
  2. IndexedSeq
  3. IndexedSeqLike
  4. Seq
  5. SeqLike
  6. GenSeq
  7. GenSeqLike
  8. Iterable
  9. IterableLike
  10. Equals
  11. GenIterable
  12. GenIterableLike
  13. Traversable
  14. GenTraversable
  15. GenericTraversableTemplate
  16. TraversableLike
  17. GenTraversableLike
  18. Parallelizable
  19. TraversableOnce
  20. GenTraversableOnce
  21. FilterMonadic
  22. HasNewBuilder
  23. PartialFunction
  24. Function1
  25. AnyRef
  26. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TableFor9(heading: (String, String, String, String, String, String, String, String, String), rows: (A, B, C, D, E, F, G, H, I)*)

    heading

    a tuple containing string names of the columns in this table

    rows

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

Type Members

  1. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. def ++(others: Iterable[(A, B, C, D, E, F, G, H, I)]): TableFor9[A, B, C, D, E, F, G, H, I]
  2. def ++[B >: (A, B, C, D, E, F, G, H, I), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  3. def ++:[B >: (A, B, C, D, E, F, G, H, I), That](that: Traversable[B])(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike
  4. def ++:[B >: (A, B, C, D, E, F, G, H, I), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike
  5. def +:[B >: (A, B, C, D, E, F, G, H, I), That](elem: B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  6. def /:[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  7. def :+[B >: (A, B, C, D, E, F, G, H, I), That](elem: B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  8. def :\[B](z: B)(op: ((A, B, C, D, E, F, G, H, I), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: ⇒ B)(seqop: (B, (A, B, C, D, E, F, G, H, I)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def andThen[C](k: ((A, B, C, D, E, F, G, H, I)) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  14. def apply[ASSERTION](fun: (A, B, C, D, E, F, G, H, I) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result

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

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

    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 TableFor9

  15. def apply(idx: Int): (A, B, C, D, E, F, G, H, I)

    Selects a row of data by its index.

    Selects a row of data by its index.

    Definition Classes
    TableFor9 → SeqLike → GenSeqLike → Function1
  16. def applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I)](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  17. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  18. def collect[B, That](pf: PartialFunction[(A, B, C, D, E, F, G, H, I), B])(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  19. def collectFirst[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I), B]): Option[B]
    Definition Classes
    TraversableOnce
  20. def combinations(n: Int): Iterator[TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    SeqLike
  21. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  22. def compose[A](g: (A) ⇒ Int): (A) ⇒ (A, B, C, D, E, F, G, H, I)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  23. def contains[A1 >: (A, B, C, D, E, F, G, H, I)](elem: A1): Boolean
    Definition Classes
    SeqLike
  24. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  25. def copyToArray[B >: (A, B, C, D, E, F, G, H, I)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  26. def copyToArray[B >: (A, B, C, D, E, F, G, H, I)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def copyToArray[B >: (A, B, C, D, E, F, G, H, I)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def copyToBuffer[B >: (A, B, C, D, E, F, G, H, I)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  29. def corresponds[B](that: GenSeq[B])(p: ((A, B, C, D, E, F, G, H, I), B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  30. def count(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def diff[B >: (A, B, C, D, E, F, G, H, I)](that: GenSeq[B]): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    SeqLike → GenSeqLike
  32. def distinct: TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    SeqLike → GenSeqLike
  33. def drop(n: Int): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  34. def dropRight(n: Int): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    IterableLike
  35. def dropWhile(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  37. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  38. def exists[ASSERTION](fun: (A, B, C, D, E, F, G, H, I) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
  39. def exists(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def filter(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    TableFor9 → TraversableLike → GenTraversableLike
  41. def filterNot(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def find(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): Option[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def flatMap[B, That](f: ((A, B, C, D, E, F, G, H, I)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  44. def flatten[B](implicit asTraversable: ((A, B, C, D, E, F, G, H, I)) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  45. def fold[A1 >: (A, B, C, D, E, F, G, H, I)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def foldLeft[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def foldRight[B](z: B)(op: ((A, B, C, D, E, F, G, H, I), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  48. def forEvery[ASSERTION](fun: (A, B, C, D, E, F, G, H, I) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
  49. def forall(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def foreach[U](f: ((A, B, C, D, E, F, G, H, I)) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  51. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  52. def groupBy[K](f: ((A, B, C, D, E, F, G, H, I)) ⇒ K): Map[K, TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def grouped(size: Int): Iterator[TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    IterableLike
  54. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  55. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  56. def head: (A, B, C, D, E, F, G, H, I)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  57. def headOption: Option[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. val heading: (String, String, String, String, String, String, String, String, String)
  59. def indexOf[B >: (A, B, C, D, E, F, G, H, I)](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  60. def indexOf[B >: (A, B, C, D, E, F, G, H, I)](elem: B): Int
    Definition Classes
    GenSeqLike
  61. def indexOfSlice[B >: (A, B, C, D, E, F, G, H, I)](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  62. def indexOfSlice[B >: (A, B, C, D, E, F, G, H, I)](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  63. def indexWhere(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  64. def indexWhere(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  65. def indices: Range
    Definition Classes
    SeqLike
  66. def init: TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def inits: Iterator[TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    TraversableLike
  68. def intersect[B >: (A, B, C, D, E, F, G, H, I)](that: GenSeq[B]): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    SeqLike → GenSeqLike
  69. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  70. def isEmpty: Boolean
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  71. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  72. def iterator: Iterator[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  73. def last: (A, B, C, D, E, F, G, H, I)
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def lastIndexOf[B >: (A, B, C, D, E, F, G, H, I)](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  75. def lastIndexOf[B >: (A, B, C, D, E, F, G, H, I)](elem: B): Int
    Definition Classes
    GenSeqLike
  76. def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I)](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  77. def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I)](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  78. def lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  79. def lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  80. def lastOption: Option[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. 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
    TableFor9 → SeqLike → GenSeqLike
  82. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  83. def lift: (Int) ⇒ Option[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    PartialFunction
  84. def map[B, That](f: ((A, B, C, D, E, F, G, H, I)) ⇒ B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  85. def max[B >: (A, B, C, D, E, F, G, H, I)](implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def maxBy[B](f: ((A, B, C, D, E, F, G, H, I)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def min[B >: (A, B, C, D, E, F, G, H, I)](implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def minBy[B](f: ((A, B, C, D, E, F, G, H, I)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def orElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  94. def padTo[B >: (A, B, C, D, E, F, G, H, I), That](len: Int, elem: B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  95. def par: ParSeq[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    Parallelizable
  96. def partition(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): (TableFor9[A, B, C, D, E, F, G, H, I], TableFor9[A, B, C, D, E, F, G, H, I])
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def patch[B >: (A, B, C, D, E, F, G, H, I), That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  98. def permutations: Iterator[TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    SeqLike
  99. def prefixLength(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  100. def product[B >: (A, B, C, D, E, F, G, H, I)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduce[A1 >: (A, B, C, D, E, F, G, H, I)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceLeft[B >: (A, B, C, D, E, F, G, H, I)](op: (B, (A, B, C, D, E, F, G, H, I)) ⇒ B): B
    Definition Classes
    TraversableOnce
  103. def reduceLeftOption[B >: (A, B, C, D, E, F, G, H, I)](op: (B, (A, B, C, D, E, F, G, H, I)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceOption[A1 >: (A, B, C, D, E, F, G, H, I)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def reduceRight[B >: (A, B, C, D, E, F, G, H, I)](op: ((A, B, C, D, E, F, G, H, I), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  106. def reduceRightOption[B >: (A, B, C, D, E, F, G, H, I)](op: ((A, B, C, D, E, F, G, H, I), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def repr: TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def reverse: TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    SeqLike → GenSeqLike
  109. def reverseIterator: Iterator[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    SeqLike
  110. def reverseMap[B, That](f: ((A, B, C, D, E, F, G, H, I)) ⇒ B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  111. def runWith[U](action: ((A, B, C, D, E, F, G, H, I)) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  112. def sameElements[B >: (A, B, C, D, E, F, G, H, I)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  113. def scan[B >: (A, B, C, D, E, F, G, H, I), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  114. def scanLeft[B, That](z: B)(op: (B, (A, B, C, D, E, F, G, H, I)) ⇒ B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  115. def scanRight[B, That](z: B)(op: ((A, B, C, D, E, F, G, H, I), B) ⇒ B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  116. def segmentLength(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  117. def seq: IndexedSeq[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  118. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  119. def slice(from: Int, until: Int): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  120. def sliding(size: Int, step: Int): Iterator[TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    IterableLike
  121. def sliding(size: Int): Iterator[TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    IterableLike
  122. def sortBy[B](f: ((A, B, C, D, E, F, G, H, I)) ⇒ B)(implicit ord: Ordering[B]): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    SeqLike
  123. def sortWith(lt: ((A, B, C, D, E, F, G, H, I), (A, B, C, D, E, F, G, H, I)) ⇒ Boolean): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    SeqLike
  124. def sorted[B >: (A, B, C, D, E, F, G, H, I)](implicit ord: Ordering[B]): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    SeqLike
  125. def span(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): (TableFor9[A, B, C, D, E, F, G, H, I], TableFor9[A, B, C, D, E, F, G, H, I])
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def splitAt(n: Int): (TableFor9[A, B, C, D, E, F, G, H, I], TableFor9[A, B, C, D, E, F, G, H, I])
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  128. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  129. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def sum[B >: (A, B, C, D, E, F, G, H, I)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def tail: TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def tails: Iterator[TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    TraversableLike
  133. def take(n: Int): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  134. def takeRight(n: Int): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    IterableLike
  135. def takeWhile(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): TableFor9[A, B, C, D, E, F, G, H, I]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  136. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B, C, D, E, F, G, H, I), Col[(A, B, C, D, E, F, G, H, I)]]): Col[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  137. def toArray[B >: (A, B, C, D, E, F, G, H, I)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toBuffer[A1 >: (A, B, C, D, E, F, G, H, I)]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  139. def toIndexedSeq: IndexedSeq[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toIterable: Iterable[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  141. def toIterator: Iterator[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  142. def toList: List[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toMap[T, U](implicit ev: <:<[(A, B, C, D, E, F, G, H, I), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toSeq: Seq[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  145. def toSet[B >: (A, B, C, D, E, F, G, H, I)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def toStream: Stream[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  147. 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
    TableFor9 → SeqLike → TraversableLike → Function1 → AnyRef → Any
  148. def toTraversable: Traversable[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  149. def toVector: Vector[(A, B, C, D, E, F, G, H, I)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. def transpose[B](implicit asTraversable: ((A, B, C, D, E, F, G, H, I)) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  151. def union[B >: (A, B, C, D, E, F, G, H, I), That](that: GenSeq[B])(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  152. def unzip[A1, A2](implicit asPair: ((A, B, C, D, E, F, G, H, I)) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    GenericTraversableTemplate
  153. def unzip3[A1, A2, A3](implicit asTriple: ((A, B, C, D, E, F, G, H, I)) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    GenericTraversableTemplate
  154. def updated[B >: (A, B, C, D, E, F, G, H, I), That](index: Int, elem: B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  155. def view(from: Int, until: Int): SeqView[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  156. def view: SeqView[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  157. def withFilter(p: ((A, B, C, D, E, F, G, H, I)) ⇒ Boolean): FilterMonadic[(A, B, C, D, E, F, G, H, I), TableFor9[A, B, C, D, E, F, G, H, I]]
    Definition Classes
    TraversableLike → FilterMonadic
  158. def zip[A1 >: (A, B, C, D, E, F, G, H, I), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  159. def zipAll[B, A1 >: (A, B, C, D, E, F, G, H, I), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  160. def zipWithIndex[A1 >: (A, B, C, D, E, F, G, H, I), That](implicit bf: CanBuildFrom[TableFor9[A, B, C, D, E, F, G, H, I], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike