org.scalatest.prop

TableFor5

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 optional exceptions for each row of the table, indicating whether a property check succeeded or failed on each row of the table:

for (row <- examples) yield {
  failureOf { row._1 should not equal (7) }
}

Note: the failureOf method, contained in the FailureOf trait, will execute the supplied code (a by-name parameter) and catch any exception. If no exception is thrown by the code, failureOf will result in None, indicating the "property check" succeeded. If the supplied code completes abruptly in an exception that would normally cause a test to fail, failureOf will result in a Some wrapping that exception. For example, the previous for expression would give you:

Vector(None, None, None, None, None, None, None,
    Some(org.scalatest.TestFailedException: 7 equaled 7), None, None)

This shows that all the property checks succeeded, except for the one at index 7.

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 optional exceptions for each row of the table, indicating whether a property check succeeded or failed on each row of the table:

for (row <- examples) yield {
  failureOf { row._1 should not equal (7) }
}

Note: the failureOf method, contained in the FailureOf trait, will execute the supplied code (a by-name parameter) and catch any exception. If no exception is thrown by the code, failureOf will result in None, indicating the "property check" succeeded. If the supplied code completes abruptly in an exception that would normally cause a test to fail, failureOf will result in a Some wrapping that exception. For example, the previous for expression would give you:

Vector(None, None, None, None, None, None, None,
    Some(org.scalatest.TestFailedException: 7 equaled 7), None, None)

This shows that all the property checks succeeded, except for the one at index 7.

go to: companion
linear super types: 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]], Iterable[(A, B, C, D, E)], IterableLike[(A, B, C, D, E), TableFor5[A, B, C, D, E]], Equals, Traversable[(A, B, C, D, E)], GenericTraversableTemplate[(A, B, C, D, E), IndexedSeq], TraversableLike[(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)], 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. Hide All
  2. Show all
  1. TableFor5
  2. IndexedSeq
  3. IndexedSeqLike
  4. Seq
  5. SeqLike
  6. Iterable
  7. IterableLike
  8. Equals
  9. Traversable
  10. GenericTraversableTemplate
  11. TraversableLike
  12. Parallelizable
  13. TraversableOnce
  14. FilterMonadic
  15. HasNewBuilder
  16. PartialFunction
  17. Function1
  18. AnyRef
  19. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new TableFor5 ( heading : (String, String, String, String, String) , rows : (A, B, C, D, E)* )

    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. type Self = TableFor5[A, B, C, D, E]

    attributes: protected
    definition classes: TraversableLike

Value Members

  1. def != ( arg0 : AnyRef ) : Boolean

    attributes: final
    definition classes: AnyRef
  2. def != ( arg0 : Any ) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

    false if the receiver object is equivalent to the argument; true otherwise.

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def ++ [B >: (A, B, C, D, E), That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: TraversableLike
  7. def ++: [B >: (A, B, C, D, E), That] ( that : Traversable[B] )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: TraversableLike
  8. def ++: [B >: (A, B, C, D, E), That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: TraversableLike
  9. def +: [B >: (A, B, C, D, E), That] ( elem : B )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: SeqLike
  10. def /: [B] ( z : B )( op : (B, (A, B, C, D, E)) ⇒ B ) : B

    definition classes: TraversableOnce
  11. def :+ [B >: (A, B, C, D, E), That] ( elem : B )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: SeqLike
  12. def :\ [B] ( z : B )( op : ((A, B, C, D, E), B) ⇒ B ) : B

    definition classes: TraversableOnce
  13. def == ( arg0 : AnyRef ) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: AnyRef
  14. def == ( arg0 : Any ) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: Any
  15. def addString ( b : StringBuilder ) : StringBuilder

    definition classes: TraversableOnce
  16. def addString ( b : StringBuilder , sep : String ) : StringBuilder

    definition classes: TraversableOnce
  17. def addString ( b : StringBuilder , start : String , sep : String , end : String ) : StringBuilder

    definition classes: TraversableOnce
  18. def andThen [C] ( k : ((A, B, C, D, E)) ⇒ C ) : PartialFunction[Int, C]

    definition classes: PartialFunction → Function1
  19. def apply ( fun : (A, B, C, D, E) ⇒ Unit ) : Unit

    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

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

    Selects a row of data by its index.

    Selects a row of data by its index.

    definition classes: TableFor5 → SeqLike → Function1
  21. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  22. def canEqual ( that : Any ) : Boolean

    definition classes: IterableLike → Equals
  23. def clone () : AnyRef

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected[lang]
    definition classes: AnyRef
    annotations: @throws()
  24. def collect [B, That] ( pf : PartialFunction[(A, B, C, D, E), B] )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: TraversableLike
  25. def collectFirst [B] ( pf : PartialFunction[(A, B, C, D, E), B] ) : Option[B]

    definition classes: TraversableOnce
  26. def combinations ( n : Int ) : Iterator[TableFor5[A, B, C, D, E]]

    definition classes: SeqLike
  27. def companion : GenericCompanion[IndexedSeq]

    definition classes: IndexedSeq → Seq → Iterable → Traversable → GenericTraversableTemplate
  28. def compose [A] ( g : (A) ⇒ Int ) : (A) ⇒ (A, B, C, D, E)

    definition classes: Function1
  29. def contains ( elem : Any ) : Boolean

    definition classes: SeqLike
  30. def containsSlice [B] ( that : Seq[B] ) : Boolean

    definition classes: SeqLike
  31. def copyToArray [B >: (A, B, C, D, E)] ( xs : Array[B] , start : Int , len : Int ) : Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce
  32. def copyToArray [B >: (A, B, C, D, E)] ( xs : Array[B] ) : Unit

    definition classes: TraversableOnce
  33. def copyToArray [B >: (A, B, C, D, E)] ( xs : Array[B] , start : Int ) : Unit

    definition classes: TraversableOnce
  34. def copyToBuffer [B >: (A, B, C, D, E)] ( dest : Buffer[B] ) : Unit

    definition classes: TraversableOnce
  35. def corresponds [B] ( that : Seq[B] )( p : ((A, B, C, D, E), B) ⇒ Boolean ) : Boolean

    definition classes: SeqLike
  36. def count ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Int

    definition classes: TraversableOnce
  37. def diff [B >: (A, B, C, D, E)] ( that : Seq[B] ) : TableFor5[A, B, C, D, E]

    definition classes: SeqLike
  38. def distinct : TableFor5[A, B, C, D, E]

    definition classes: SeqLike
  39. def drop ( n : Int ) : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  40. def dropRight ( n : Int ) : TableFor5[A, B, C, D, E]

    definition classes: IterableLike
  41. def dropWhile ( p : ((A, B, C, D, E)) ⇒ Boolean ) : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  42. def elements : Iterator[(A, B, C, D, E)]

    definition classes: IterableLike
    annotations: @deprecated()
      deprecated:
    1. use iterator' instead

  43. def endsWith [B] ( that : Seq[B] ) : Boolean

    definition classes: SeqLike
  44. def eq ( arg0 : AnyRef ) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    attributes: final
    definition classes: AnyRef
  45. def equals ( that : Any ) : Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same scala.Int (o1.hashCode.equals(o2.hashCode)).

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: SeqLike → Equals → AnyRef → Any
  46. def equalsWith [B] ( that : Seq[B] )( f : ((A, B, C, D, E), B) ⇒ Boolean ) : Boolean

    definition classes: SeqLike
    annotations: @deprecated()
      deprecated:
    1. use corresponds instead

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

    definition classes: IterableLike → TraversableLike → TraversableOnce
  48. def filter ( p : ((A, B, C, D, E)) ⇒ Boolean ) : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  49. def filterNot ( p : ((A, B, C, D, E)) ⇒ Boolean ) : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  50. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    The details of when and if the finalize method are invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

    attributes: protected[lang]
    definition classes: AnyRef
    annotations: @throws()
  51. def find ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Option[(A, B, C, D, E)]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  52. def findIndexOf ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Int

    definition classes: SeqLike
    annotations: @deprecated()
      deprecated:
    1. Use indexWhere(p) instead.

  53. def findLastIndexOf ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Int

    definition classes: SeqLike
    annotations: @deprecated()
      deprecated:
    1. use lastIndexWhere instead

  54. def first : (A, B, C, D, E)

    definition classes: IterableLike
    annotations: @deprecated()
      deprecated:
    1. use head' instead

  55. def firstOption : Option[(A, B, C, D, E)]

    definition classes: IterableLike
    annotations: @deprecated()
      deprecated:
    1. use headOption' instead

  56. def flatMap [B, That] ( f : ((A, B, C, D, E)) ⇒ TraversableOnce[B] )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: TraversableLike → FilterMonadic
  57. def flatten [B] (implicit asTraversable : ((A, B, C, D, E)) ⇒ TraversableOnce[B] ) : IndexedSeq[B]

    definition classes: GenericTraversableTemplate
  58. def foldLeft [B] ( z : B )( op : (B, (A, B, C, D, E)) ⇒ B ) : B

    definition classes: TraversableOnce
  59. def foldRight [B] ( z : B )( op : ((A, B, C, D, E), B) ⇒ B ) : B

    definition classes: IterableLike → TraversableOnce
  60. def forall ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  61. def foreach [U] ( f : ((A, B, C, D, E)) ⇒ U ) : Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce → FilterMonadic
  62. def genericBuilder [B] : Builder[B, IndexedSeq[B]]

    definition classes: GenericTraversableTemplate
  63. def getClass () : java.lang.Class[_]

    Returns a representation that corresponds to the dynamic class of the receiver object.

    Returns a representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    attributes: final
    definition classes: AnyRef
  64. def groupBy [K] ( f : ((A, B, C, D, E)) ⇒ K ) : Map[K, TableFor5[A, B, C, D, E]]

    definition classes: TraversableLike
  65. def grouped ( size : Int ) : Iterator[TableFor5[A, B, C, D, E]]

    definition classes: IterableLike
  66. def hasDefiniteSize : Boolean

    definition classes: TraversableLike → TraversableOnce
  67. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: SeqLike → AnyRef → Any
  68. def head : (A, B, C, D, E)

    definition classes: IterableLike → TraversableLike
  69. def headOption : Option[(A, B, C, D, E)]

    definition classes: TraversableLike
  70. val heading : (String, String, String, String, String)

    a tuple containing string names of the columns in this table

    a tuple containing string names of the columns in this table

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

    definition classes: SeqLike
  72. def indexOf [B >: (A, B, C, D, E)] ( elem : B ) : Int

    definition classes: SeqLike
  73. def indexOfSlice [B >: (A, B, C, D, E)] ( that : Seq[B] , from : Int ) : Int

    definition classes: SeqLike
  74. def indexOfSlice [B >: (A, B, C, D, E)] ( that : Seq[B] ) : Int

    definition classes: SeqLike
  75. def indexWhere ( p : ((A, B, C, D, E)) ⇒ Boolean , from : Int ) : Int

    definition classes: SeqLike
  76. def indexWhere ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Int

    definition classes: SeqLike
  77. def indices : Range

    definition classes: SeqLike
  78. def init : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  79. def inits : Iterator[TableFor5[A, B, C, D, E]]

    definition classes: TraversableLike
  80. def intersect [B >: (A, B, C, D, E)] ( that : Seq[B] ) : TableFor5[A, B, C, D, E]

    definition classes: SeqLike
  81. def isDefinedAt ( idx : Int ) : Boolean

    definition classes: SeqLike
  82. def isEmpty : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  83. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    attributes: final
    definition classes: Any
  84. def isTraversableAgain : Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce
  85. def iterator : Iterator[(A, B, C, D, E)]

    definition classes: IndexedSeqLike → IterableLike
  86. def last : (A, B, C, D, E)

    definition classes: TraversableLike
  87. def lastIndexOf [B >: (A, B, C, D, E)] ( elem : B , end : Int ) : Int

    definition classes: SeqLike
  88. def lastIndexOf [B >: (A, B, C, D, E)] ( elem : B ) : Int

    definition classes: SeqLike
  89. def lastIndexOfSlice [B >: (A, B, C, D, E)] ( that : Seq[B] , end : Int ) : Int

    definition classes: SeqLike
  90. def lastIndexOfSlice [B >: (A, B, C, D, E)] ( that : Seq[B] ) : Int

    definition classes: SeqLike
  91. def lastIndexWhere ( p : ((A, B, C, D, E)) ⇒ Boolean , end : Int ) : Int

    definition classes: SeqLike
  92. def lastIndexWhere ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Int

    definition classes: SeqLike
  93. def lastOption : Option[(A, B, C, D, E)]

    definition classes: TraversableLike
  94. 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: TableFor5 → SeqLike
  95. def lengthCompare ( len : Int ) : Int

    definition classes: SeqLike
  96. def lift : (Int) ⇒ Option[(A, B, C, D, E)]

    definition classes: PartialFunction
  97. def map [B, That] ( f : ((A, B, C, D, E)) ⇒ B )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: TraversableLike → FilterMonadic
  98. def max [B >: (A, B, C, D, E)] (implicit cmp : Ordering[B] ) : (A, B, C, D, E)

    definition classes: TraversableOnce
  99. def maxBy [B] ( f : ((A, B, C, D, E)) ⇒ B )(implicit cmp : Ordering[B] ) : (A, B, C, D, E)

    definition classes: TraversableOnce
  100. def min [B >: (A, B, C, D, E)] (implicit cmp : Ordering[B] ) : (A, B, C, D, E)

    definition classes: TraversableOnce
  101. def minBy [B] ( f : ((A, B, C, D, E)) ⇒ B )(implicit cmp : Ordering[B] ) : (A, B, C, D, E)

    definition classes: TraversableOnce
  102. def mkString : String

    definition classes: TraversableOnce
  103. def mkString ( sep : String ) : String

    definition classes: TraversableOnce
  104. def mkString ( start : String , sep : String , end : String ) : String

    definition classes: TraversableOnce
  105. def ne ( arg0 : AnyRef ) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  106. def newBuilder : Builder[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

    Creates a new Builder for TableFor5s.

    Creates a new Builder for TableFor5s.

    attributes: protected[this]
    definition classes: TableFor5 → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  107. def nonEmpty : Boolean

    definition classes: TraversableOnce
  108. def notify () : Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  109. def notifyAll () : Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  110. def orElse [A1 <: Int, B1 >: (A, B, C, D, E)] ( that : PartialFunction[A1, B1] ) : PartialFunction[A1, B1]

    definition classes: PartialFunction
  111. 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

    definition classes: SeqLike
  112. def par : ParSeq[(A, B, C, D, E)]

    definition classes: Parallelizable → Parallelizable
  113. def parCombiner : Combiner[(A, B, C, D, E), ParSeq[(A, B, C, D, E)]]

    attributes: protected[this]
    definition classes: SeqLike → TraversableLike → Parallelizable
  114. def partition ( p : ((A, B, C, D, E)) ⇒ Boolean ) : (TableFor5[A, B, C, D, E], TableFor5[A, B, C, D, E])

    definition classes: TraversableLike
  115. def patch [B >: (A, B, C, D, E), That] ( from : Int , patch : Seq[B] , replaced : Int )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: SeqLike
  116. def permutations : Iterator[TableFor5[A, B, C, D, E]]

    definition classes: SeqLike
  117. def prefixLength ( p : ((A, B, C, D, E)) ⇒ Boolean ) : Int

    definition classes: SeqLike
  118. def product [B >: (A, B, C, D, E)] (implicit num : Numeric[B] ) : B

    definition classes: TraversableOnce
  119. def projection : SeqView[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

    definition classes: SeqLike → IterableLike
    annotations: @deprecated()
      deprecated:
    1. use view' instead

  120. def reduceLeft [B >: (A, B, C, D, E)] ( op : (B, (A, B, C, D, E)) ⇒ B ) : B

    definition classes: TraversableOnce
  121. def reduceLeftOption [B >: (A, B, C, D, E)] ( op : (B, (A, B, C, D, E)) ⇒ B ) : Option[B]

    definition classes: TraversableOnce
  122. def reduceRight [B >: (A, B, C, D, E)] ( op : ((A, B, C, D, E), B) ⇒ B ) : B

    definition classes: IterableLike → TraversableOnce
  123. def reduceRightOption [B >: (A, B, C, D, E)] ( op : ((A, B, C, D, E), B) ⇒ B ) : Option[B]

    definition classes: TraversableOnce
  124. def repr : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  125. def reverse : TableFor5[A, B, C, D, E]

    definition classes: SeqLike
  126. def reverseIterator : Iterator[(A, B, C, D, E)]

    definition classes: SeqLike
  127. def reverseMap [B, That] ( f : ((A, B, C, D, E)) ⇒ B )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: SeqLike
  128. def reversed : List[(A, B, C, D, E)]

    attributes: protected[this]
    definition classes: TraversableOnce
  129. def reversedElements : Iterator[(A, B, C, D, E)]

    definition classes: SeqLike
    annotations: @deprecated()
      deprecated:
    1. use reverseIterator' instead

  130. def sameElements [B >: (A, B, C, D, E)] ( that : Iterable[B] ) : Boolean

    definition classes: IterableLike
  131. 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

    definition classes: TraversableLike
  132. 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

    definition classes: TraversableLike
    annotations: @migration()
  133. def segmentLength ( p : ((A, B, C, D, E)) ⇒ Boolean , from : Int ) : Int

    definition classes: SeqLike
  134. def seq : Seq[(A, B, C, D, E)]

    definition classes: Seq → TraversableOnce
  135. def size : Int

    definition classes: SeqLike → TraversableOnce
  136. def slice ( from : Int , until : Int ) : TableFor5[A, B, C, D, E]

    definition classes: IterableLike → TraversableLike
  137. def sliding [B >: (A, B, C, D, E)] ( size : Int , step : Int ) : Iterator[TableFor5[A, B, C, D, E]]

    definition classes: IterableLike
  138. def sliding [B >: (A, B, C, D, E)] ( size : Int ) : Iterator[TableFor5[A, B, C, D, E]]

    definition classes: IterableLike
  139. def sortBy [B] ( f : ((A, B, C, D, E)) ⇒ B )(implicit ord : Ordering[B] ) : TableFor5[A, B, C, D, E]

    definition classes: SeqLike
  140. def sortWith ( lt : ((A, B, C, D, E), (A, B, C, D, E)) ⇒ Boolean ) : TableFor5[A, B, C, D, E]

    definition classes: SeqLike
  141. def sorted [B >: (A, B, C, D, E)] (implicit ord : Ordering[B] ) : TableFor5[A, B, C, D, E]

    definition classes: SeqLike
  142. def span ( p : ((A, B, C, D, E)) ⇒ Boolean ) : (TableFor5[A, B, C, D, E], TableFor5[A, B, C, D, E])

    definition classes: TraversableLike
  143. def splitAt ( n : Int ) : (TableFor5[A, B, C, D, E], TableFor5[A, B, C, D, E])

    definition classes: TraversableLike
  144. def startsWith [B] ( that : Seq[B] ) : Boolean

    definition classes: SeqLike
  145. def startsWith [B] ( that : Seq[B] , offset : Int ) : Boolean

    definition classes: SeqLike
  146. def stringPrefix : String

    definition classes: TraversableLike
  147. def sum [B >: (A, B, C, D, E)] (implicit num : Numeric[B] ) : B

    definition classes: TraversableOnce
  148. def synchronized [T0] ( arg0 : ⇒ T0 ) : T0

    attributes: final
    definition classes: AnyRef
  149. def tail : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  150. def tails : Iterator[TableFor5[A, B, C, D, E]]

    definition classes: TraversableLike
  151. def take ( n : Int ) : TableFor5[A, B, C, D, E]

    definition classes: TraversableLike
  152. def takeRight ( n : Int ) : TableFor5[A, B, C, D, E]

    definition classes: IterableLike
  153. def takeWhile ( p : ((A, B, C, D, E)) ⇒ Boolean ) : TableFor5[A, B, C, D, E]

    definition classes: IterableLike → TraversableLike
  154. def thisCollection : IndexedSeq[(A, B, C, D, E)]

    attributes: protected[this]
    definition classes: IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  155. def toArray [B >: (A, B, C, D, E)] (implicit arg0 : ClassManifest[B] ) : Array[B]

    definition classes: TraversableOnce
  156. def toBuffer [A1 >: (A, B, C, D, E)] : Buffer[A1]

    definition classes: IndexedSeqLike → TraversableOnce
  157. def toCollection ( repr : TableFor5[A, B, C, D, E] ) : IndexedSeq[(A, B, C, D, E)]

    attributes: protected[this]
    definition classes: IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  158. def toIndexedSeq [B >: (A, B, C, D, E)] : IndexedSeq[B]

    definition classes: TraversableOnce
  159. def toIterable : Iterable[(A, B, C, D, E)]

    definition classes: IterableLike → TraversableOnce
  160. def toIterator : Iterator[(A, B, C, D, E)]

    definition classes: TraversableLike → TraversableOnce
  161. def toList : List[(A, B, C, D, E)]

    definition classes: TraversableOnce
  162. def toMap [T, U] (implicit ev : <:<[(A, B, C, D, E), (T, U)] ) : Map[T, U]

    definition classes: TraversableOnce
  163. def toSeq : Seq[(A, B, C, D, E)]

    definition classes: SeqLike → TraversableOnce
  164. def toSet [B >: (A, B, C, D, E)] : Set[B]

    definition classes: TraversableOnce
  165. def toStream : Stream[(A, B, C, D, E)]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  166. 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.@return a string representation of the object. */

    definition classes: TableFor5 → SeqLike → TraversableLike → Function1 → AnyRef → Any
  167. def toTraversable : Traversable[(A, B, C, D, E)]

    definition classes: TraversableLike → TraversableOnce
  168. def transpose [B] (implicit asTraversable : ((A, B, C, D, E)) ⇒ TraversableOnce[B] ) : IndexedSeq[IndexedSeq[B]]

    definition classes: GenericTraversableTemplate
    annotations: @migration()
  169. def union [B >: (A, B, C, D, E), That] ( that : Seq[B] )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], B, That] ) : That

    definition classes: SeqLike
  170. def unzip [A1, A2] (implicit asPair : ((A, B, C, D, E)) ⇒ (A1, A2) ) : (IndexedSeq[A1], IndexedSeq[A2])

    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])

    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

    definition classes: SeqLike
  173. def view ( from : Int , until : Int ) : SeqView[(A, B, C, D, E), TableFor5[A, B, C, D, E]]

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

    definition classes: SeqLike → IterableLike → TraversableLike
  175. def wait () : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  176. def wait ( arg0 : Long , arg1 : Int ) : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  177. def wait ( arg0 : Long ) : Unit

    attributes: final
    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]]

    definition classes: TraversableLike → FilterMonadic
  179. def zip [A1 >: (A, B, C, D, E), B, That] ( that : Iterable[B] )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], (A1, B), That] ) : That

    definition classes: IterableLike
  180. def zipAll [B, A1 >: (A, B, C, D, E), That] ( that : Iterable[B] , thisElem : A1 , thatElem : B )(implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], (A1, B), That] ) : That

    definition classes: IterableLike
  181. def zipWithIndex [A1 >: (A, B, C, D, E), That] (implicit bf : CanBuildFrom[TableFor5[A, B, C, D, E], (A1, Int), That] ) : That

    definition classes: IterableLike

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 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 Traversable[(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 Parallelizable[(A, B, C, D, E), ParSeq[(A, B, C, D, E)]]

Inherited from TraversableOnce[(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