Class/Object

org.scalatest.prop

TableFor5

Related Docs: object TableFor5 | package prop

Permalink

class TableFor5[A, B, C, D, E] extends IndexedSeq[(A, B, C, D, E)] with IndexedSeqLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

A table with 5 columns.

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

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

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

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

forAll (examples) { (a, b, c, d, e) =>
  a + b + c + d + e should equal (a * 5)
}

Because TableFor5 is a Seq[(A, B, C, D, E)], 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.

Linear Supertypes
IndexedSeq[(A, B, C, D, E)], IndexedSeqLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], Seq[(A, B, C, D, E)], SeqLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], GenSeq[(A, B, C, D, E)], GenSeqLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], Iterable[(A, B, C, D, E)], IterableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], Equals, GenIterable[(A, B, C, D, E)], GenIterableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], Traversable[(A, B, C, D, E)], GenTraversable[(A, B, C, D, E)], GenericTraversableTemplate[(A, B, C, D, E), IndexedSeq], TraversableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], GenTraversableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], Parallelizable[(A, B, C, D, E), ParSeq[(A, B, C, D, E)]], TraversableOnce[(A, B, C, D, E)], GenTraversableOnce[(A, B, C, D, E)], FilterMonadic[(A, B, C, D, E), TableFor5[A, B, C, D, E]], HasNewBuilder[(A, B, C, D, E), TableFor5[A, B, C, D, E]], PartialFunction[Int, (A, B, C, D, E)], (Int) ⇒ (A, B, C, D, E), AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TableFor5
  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 TableFor5(heading: (String, String, String, String, String), rows: (A, B, C, D, E)*)

    Permalink

    heading

    a tuple containing string names of the columns in this table

    rows

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

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = TableFor5[A, B, C, D, E]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++(others: Iterable[(A, B, C, D, E)]): TableFor5[A, B, C, D, E]

    Permalink
  4. def ++[B >: (A, B, C, D, E), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (A, B, C, D, E), That](that: Traversable[B])(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  6. def ++:[B >: (A, B, C, D, E), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  7. def +:[B >: (A, B, C, D, E), That](elem: B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  8. def /:[B](z: B)(op: (B, (A, B, C, D, E)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :+[B >: (A, B, C, D, E), That](elem: B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  10. def :\[B](z: B)(op: ((A, B, C, D, E), B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  11. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  12. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  15. def aggregate[B](z: ⇒ B)(seqop: (B, (A, B, C, D, E)) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. def andThen[C](k: ((A, B, C, D, E)) ⇒ C): PartialFunction[Int, C]

    Permalink
    Definition Classes
    PartialFunction → Function1
  17. def apply[ASSERTION](fun: (A, B, C, D, E) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result

    Permalink

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

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

    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 TableFor5

  18. def apply(idx: Int): (A, B, C, D, E)

    Permalink

    Selects a row of data by its index.

    Selects a row of data by its index.

    Definition Classes
    TableFor5 → SeqLike → GenSeqLike → Function1
  19. def applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E)](x: A1, default: (A1) ⇒ B1): B1

    Permalink
    Definition Classes
    PartialFunction
  20. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  21. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  22. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. def collect[B, That](pf: PartialFunction[(A, B, C, D, E), B])(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def collectFirst[B](pf: PartialFunction[(A, B, C, D, E), B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  25. def combinations(n: Int): Iterator[TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    SeqLike
  26. def companion: GenericCompanion[IndexedSeq]

    Permalink
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  27. def compose[A](g: (A) ⇒ Int): (A) ⇒ (A, B, C, D, E)

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def contains[A1 >: (A, B, C, D, E)](elem: A1): Boolean

    Permalink
    Definition Classes
    SeqLike
  29. def containsSlice[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike
  30. def copyToArray[B >: (A, B, C, D, E)](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: (A, B, C, D, E)](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: (A, B, C, D, E)](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: (A, B, C, D, E)](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  34. def corresponds[B](that: GenSeq[B])(p: ((A, B, C, D, E), B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  35. def count(p: ((A, B, C, D, E)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def diff[B >: (A, B, C, D, E)](that: GenSeq[B]): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  37. def distinct: TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  38. def drop(n: Int): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  39. def dropRight(n: Int): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    IterableLike
  40. def dropWhile(p: ((A, B, C, D, E)) ⇒ Boolean): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def endsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  42. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  43. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    GenSeqLike → Equals → Any
  44. def exists[ASSERTION](fun: (A, B, C, D, E) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result

    Permalink
  45. def exists(p: ((A, B, C, D, E)) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def filter(p: ((A, B, C, D, E)) ⇒ Boolean): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    TableFor5 → TraversableLike → GenTraversableLike
  47. def filterNot(p: ((A, B, C, D, E)) ⇒ Boolean): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  49. def find(p: ((A, B, C, D, E)) ⇒ Boolean): Option[(A, B, C, D, E)]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def flatMap[B, That](f: ((A, B, C, D, E)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  51. def flatten[B](implicit asTraversable: ((A, B, C, D, E)) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  52. def fold[A1 >: (A, B, C, D, E)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def foldLeft[B](z: B)(op: (B, (A, B, C, D, E)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldRight[B](z: B)(op: ((A, B, C, D, E), B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  55. def forEvery[ASSERTION](fun: (A, B, C, D, E) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result

    Permalink
  56. def forall(p: ((A, B, C, D, E)) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def foreach[U](f: ((A, B, C, D, E)) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  58. def genericBuilder[B]: Builder[B, IndexedSeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  59. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  60. def groupBy[K](f: ((A, B, C, D, E)) ⇒ K): Map[K, TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  61. def grouped(size: Int): Iterator[TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    IterableLike
  62. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  63. def hashCode(): Int

    Permalink
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  64. def head: (A, B, C, D, E)

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  65. def headOption: Option[(A, B, C, D, E)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  66. val heading: (String, String, String, String, String)

    Permalink

    a tuple containing string names of the columns in this table

  67. def indexOf[B >: (A, B, C, D, E)](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  68. def indexOf[B >: (A, B, C, D, E)](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  69. def indexOfSlice[B >: (A, B, C, D, E)](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike
  70. def indexOfSlice[B >: (A, B, C, D, E)](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  71. def indexWhere(p: ((A, B, C, D, E)) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  72. def indexWhere(p: ((A, B, C, D, E)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  73. def indices: Range

    Permalink
    Definition Classes
    SeqLike
  74. def init: TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def inits: Iterator[TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    TraversableLike
  76. def intersect[B >: (A, B, C, D, E)](that: GenSeq[B]): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  77. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  78. def isEmpty: Boolean

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  79. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  80. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  81. def iterator: Iterator[(A, B, C, D, E)]

    Permalink
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  82. def last: (A, B, C, D, E)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def lastIndexOf[B >: (A, B, C, D, E)](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  84. def lastIndexOf[B >: (A, B, C, D, E)](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  85. def lastIndexOfSlice[B >: (A, B, C, D, E)](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike
  86. def lastIndexOfSlice[B >: (A, B, C, D, E)](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  87. def lastIndexWhere(p: ((A, B, C, D, E)) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  88. def lastIndexWhere(p: ((A, B, C, D, E)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  89. def lastOption: Option[(A, B, C, D, E)]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  90. def length: Int

    Permalink

    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
    TableFor5 → SeqLike → GenSeqLike
  91. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    SeqLike
  92. def lift: (Int) ⇒ Option[(A, B, C, D, E)]

    Permalink
    Definition Classes
    PartialFunction
  93. def map[B, That](f: ((A, B, C, D, E)) ⇒ B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  94. def max[B >: (A, B, C, D, E)](implicit cmp: Ordering[B]): (A, B, C, D, E)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def maxBy[B](f: ((A, B, C, D, E)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def min[B >: (A, B, C, D, E)](implicit cmp: Ordering[B]): (A, B, C, D, E)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def minBy[B](f: ((A, B, C, D, E)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E)

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  102. def newBuilder: Builder[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

    Permalink

    Creates a new Builder for TableFor5s.

    Creates a new Builder for TableFor5s.

    Attributes
    protected[this]
    Definition Classes
    TableFor5 → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  103. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  105. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  106. def orElse[A1 <: Int, B1 >: (A, B, C, D, E)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Permalink
    Definition Classes
    PartialFunction
  107. def padTo[B >: (A, B, C, D, E), That](len: Int, elem: B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  108. def par: ParSeq[(A, B, C, D, E)]

    Permalink
    Definition Classes
    Parallelizable
  109. def parCombiner: Combiner[(A, B, C, D, E), ParSeq[(A, B, C, D, E)]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  110. def partition(p: ((A, B, C, D, E)) ⇒ Boolean): (TableFor5[A, B, C, D, E], TableFor5[A, B, C, D, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def patch[B >: (A, B, C, D, E), That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  112. def permutations: Iterator[TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    SeqLike
  113. def prefixLength(p: ((A, B, C, D, E)) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  114. def product[B >: (A, B, C, D, E)](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def reduce[A1 >: (A, B, C, D, E)](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduceLeft[B >: (A, B, C, D, E)](op: (B, (A, B, C, D, E)) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  117. def reduceLeftOption[B >: (A, B, C, D, E)](op: (B, (A, B, C, D, E)) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceOption[A1 >: (A, B, C, D, E)](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduceRight[B >: (A, B, C, D, E)](op: ((A, B, C, D, E), B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  120. def reduceRightOption[B >: (A, B, C, D, E)](op: ((A, B, C, D, E), B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def repr: TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def reverse: TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  123. def reverseIterator: Iterator[(A, B, C, D, E)]

    Permalink
    Definition Classes
    SeqLike
  124. def reverseMap[B, That](f: ((A, B, C, D, E)) ⇒ B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  125. def reversed: List[(A, B, C, D, E)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  126. def runWith[U](action: ((A, B, C, D, E)) ⇒ U): (Int) ⇒ Boolean

    Permalink
    Definition Classes
    PartialFunction
  127. def sameElements[B >: (A, B, C, D, E)](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  128. def scan[B >: (A, B, C, D, E), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def scanLeft[B, That](z: B)(op: (B, (A, B, C, D, E)) ⇒ B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def scanRight[B, That](z: B)(op: ((A, B, C, D, E), B) ⇒ B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

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

  131. def segmentLength(p: ((A, B, C, D, E)) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  132. def seq: IndexedSeq[(A, B, C, D, E)]

    Permalink
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  133. def size: Int

    Permalink
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  134. def slice(from: Int, until: Int): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  135. def sliding(size: Int, step: Int): Iterator[TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    IterableLike
  136. def sliding(size: Int): Iterator[TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    IterableLike
  137. def sortBy[B](f: ((A, B, C, D, E)) ⇒ B)(implicit ord: Ordering[B]): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    SeqLike
  138. def sortWith(lt: ((A, B, C, D, E), (A, B, C, D, E)) ⇒ Boolean): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    SeqLike
  139. def sorted[B >: (A, B, C, D, E)](implicit ord: Ordering[B]): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    SeqLike
  140. def span(p: ((A, B, C, D, E)) ⇒ Boolean): (TableFor5[A, B, C, D, E], TableFor5[A, B, C, D, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  141. def splitAt(n: Int): (TableFor5[A, B, C, D, E], TableFor5[A, B, C, D, E])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  143. def startsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  144. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  145. def sum[B >: (A, B, C, D, E)](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  147. def tail: TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def tails: Iterator[TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    TraversableLike
  149. def take(n: Int): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  150. def takeRight(n: Int): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    IterableLike
  151. def takeWhile(p: ((A, B, C, D, E)) ⇒ Boolean): TableFor5[A, B, C, D, E]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  152. def thisCollection: IndexedSeq[(A, B, C, D, E)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  153. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B, C, D, E), Col[(A, B, C, D, E)]]): Col[(A, B, C, D, E)]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  154. def toArray[B >: (A, B, C, D, E)](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. def toBuffer[A1 >: (A, B, C, D, E)]: Buffer[A1]

    Permalink
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  156. def toCollection(repr: TableFor5[A, B, C, D, E]): IndexedSeq[(A, B, C, D, E)]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  157. def toIndexedSeq: IndexedSeq[(A, B, C, D, E)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def toIterable: Iterable[(A, B, C, D, E)]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  159. def toIterator: Iterator[(A, B, C, D, E)]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  160. def toList: List[(A, B, C, D, E)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def toMap[T, U](implicit ev: <:<[(A, B, C, D, E), (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def toSeq: Seq[(A, B, C, D, E)]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  163. def toSet[B >: (A, B, C, D, E)]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. def toStream: Stream[(A, B, C, D, E)]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  165. def toString(): String

    Permalink

    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
    TableFor5 → SeqLike → TraversableLike → Function1 → AnyRef → Any
  166. def toTraversable: Traversable[(A, B, C, D, E)]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  167. def toVector: Vector[(A, B, C, D, E)]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. def transpose[B](implicit asTraversable: ((A, B, C, D, E)) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  169. def union[B >: (A, B, C, D, E), That](that: GenSeq[B])(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  170. def unzip[A1, A2](implicit asPair: ((A, B, C, D, E)) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  171. def unzip3[A1, A2, A3](implicit asTriple: ((A, B, C, D, E)) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  172. def updated[B >: (A, B, C, D, E), That](index: Int, elem: B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  173. def view(from: Int, until: Int): SeqView[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  174. def view: SeqView[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  175. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  176. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  177. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  178. def withFilter(p: ((A, B, C, D, E)) ⇒ Boolean): FilterMonadic[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  179. def zip[A1 >: (A, B, C, D, E), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  180. def zipAll[B, A1 >: (A, B, C, D, E), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  181. def zipWithIndex[A1 >: (A, B, C, D, E), That](implicit bf: CanBuildFrom[TableFor5[A, B, C, D, E], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

Inherited from IndexedSeq[(A, B, C, D, E)]

Inherited from IndexedSeqLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from Seq[(A, B, C, D, E)]

Inherited from SeqLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from GenSeq[(A, B, C, D, E)]

Inherited from GenSeqLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from Iterable[(A, B, C, D, E)]

Inherited from IterableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from Equals

Inherited from GenIterable[(A, B, C, D, E)]

Inherited from GenIterableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from Traversable[(A, B, C, D, E)]

Inherited from GenTraversable[(A, B, C, D, E)]

Inherited from GenericTraversableTemplate[(A, B, C, D, E), IndexedSeq]

Inherited from TraversableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from GenTraversableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from Parallelizable[(A, B, C, D, E), ParSeq[(A, B, C, D, E)]]

Inherited from TraversableOnce[(A, B, C, D, E)]

Inherited from GenTraversableOnce[(A, B, C, D, E)]

Inherited from FilterMonadic[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from HasNewBuilder[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

Inherited from PartialFunction[Int, (A, B, C, D, E)]

Inherited from (Int) ⇒ (A, B, C, D, E)

Inherited from AnyRef

Inherited from Any

Ungrouped