Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package scalatest

    ScalaTest's main traits, classes, and other members, including members supporting ScalaTest's DSL for the Scala interpreter.

    ScalaTest's main traits, classes, and other members, including members supporting ScalaTest's DSL for the Scala interpreter.

    Definition Classes
    org
  • package prop

    Scalatest support for Property-based testing.

    Scalatest support for Property-based testing.

    Introduction to Property-based Testing

    In traditional unit testing, you write tests that describe precisely what the test will do: create these objects, wire them together, call these functions, assert on the results, and so on. It is clear and deterministic, but also limited, because it only covers the exact situations you think to test. In most cases, it is not feasible to test all of the possible combinations of data that might arise in real-world use.

    Property-based testing works the other way around. You describe properties -- rules that you expect your classes to live by -- and describe how to test those properties. The test system then generates relatively large amounts of synthetic data (with an emphasis on edge cases that tend to make things break), so that you can see if the properties hold true in these situations.

    As a result, property-based testing is scientific in the purest sense: you are stating a hypothesis about how things should work (the property), and the system is trying to falsify that hypothesis. If the tests pass, that doesn't prove the property holds, but it at least gives you some confidence that you are probably correct.

    Property-based testing is deliberately a bit random: while the edge cases get tried upfront, the system also usually generates a number of random values to try out. This makes things a bit non-deterministic -- each run will be tried with somewhat different data. To make it easier to debug, and to build regression tests, the system provides tools to re-run a failed test with precisely the same data.

    Background

    TODO: Bill should insert a brief section on QuickCheck, ScalaCheck, etc, and how this system is similar and different.

    Using Property Checks

    In order to use the tools described here, you should import this package:

    import org.scalatest._
import org.scalatest.prop._

    This library is designed to work well with the types defined in Scalactic, and some functions take types such as PosZInt as parameters. So it can also be helpful to import those with:

    import org.scalactic.anyvals._

    In order to call forAll, the function that actually performs property checks, you will need to either extend or import GeneratorDrivenPropertyChecks, like this:

    class DocExamples extends FlatSpec with Matchers with GeneratorDrivenPropertyChecks {

    There's nothing special about FlatSpec, though -- you may use any of ScalaTest's styles with property checks. GeneratorDrivenPropertyChecks extends CommonGenerators, so it also provides access to the many utilities found there.

    What Does a Property Look Like?

    Let's check a simple property of Strings -- that if you concatenate a String to itself, its length will be doubled:

    "Strings" should "have the correct length when doubled" in {
  forAll { (s: String) =>
    val s2 = s * 2
    s2.length should equal (s.length * 2)
  }
}

    (Note that the examples here are all using the FlatSpec style, but will work the same way with any of ScalaTest's styles.)

    As the name of the tests suggests, the property we are testing is the length of a String that has been doubled.

    The test begins with forAll. This is usually the way you'll want to begin property checks, and that line can be read as, "For all Strings, the following should be true".

    The test harness will generate a number of Strings, with various contents and lengths. For each one, we compute s * 2. (* is a function on String, which appends the String to itself as many times as you specify.) And then we check that the length of the doubled String is twice the length of the original one.

    Using Specific Generators

    Let's try a more general version of this test, multiplying arbitrary Strings by arbitrary multipliers:

    "Strings" should "have the correct length when multiplied" in {
  forAll { (s: String, n: PosZInt) =>
    val s2 = s * n.value
    s2.length should equal (s.length * n.value)
  }
}

    Again, you can read the first line of the test as "For all Strings, and all non-negative Integers, the following should be true". (PosZInt is a type defined in Scalactic, which can be any positive integer, including zero. It is appropriate to use here, since multiplying a String by a negative number doesn't make sense.)

    This intuitively makes sense, but when we try to run it, we get a JVM Out of Memory error! Why? Because the test system tries to test with the "edge cases" first, and one of the more important edge cases is Int.MaxValue. It is trying to multiply a String by that, which is far larger than the memory of even a big computer, and crashing.

    So we want to constrain our test to sane values of n, so that it doesn't crash. We can do this by using more specific Generators.

    When we write a forAll test like the above, ScalaTest has to generate the values to be tested -- the semi-random Strings, Ints and other types that you are testing. It does this by calling on an implicit Generator for the desired type. The Generator generates values to test, starting with the edge cases and then moving on to randomly-selected values.

    ScalaTest has built-in Generators for many major types, including String and PosZInt, but these Generators are generic: they will try any value, including values that can break your test, as shown above. But it also provides tools to let you be more specific.

    Here is the fixed version of the above test:

    "Strings" should "have the correct length when multiplied" in {
  forAll(strings, posZIntsBetween(0, 1000))
  { (s: String, n: PosZInt) =>
    val s2 = s * n.value
    s2.length should equal (s.length * n.value)
  }
}

    This is using a variant of forAll, which lets you specify the Generators to use instead of just picking the implicit one. CommonGenerators.strings is the built-in Generator for Strings, the same one you were getting implicitly. (The other built-ins can be found in CommonGenerators. They are mixed into GeneratorDrivenPropertyChecks, so they are readily available.)

    But CommonGenerators.posZIntsBetween is a function that creates a Generator that selects from the given values. In this case, it will create a Generator that only creates numbers from 0 to 1000 -- small enough to not blow up our computer's memory. If you try this test, this runs correctly.

    The moral of the story is that, while using the built-in Generators is very convenient, and works most of the time, you should think about the data you are trying to test, and pick or create a more-specific Generator when the test calls for it.

    CommonGenerators contains many functions that are helpful in common cases. In particular:

    • xxsBetween (where xxs might be Int, Long, Float or most other significant numeric types) gives you a value of the desired type in the given range, as in the posZIntsBetween() example above.
    • CommonGenerators.specificValue and CommonGenerators.specificValues create Generators that produce either one specific value every time, or one of several values randomly. This is useful for enumerations and types that behave like enumerations.
    • CommonGenerators.evenly and CommonGenerators.frequency create higher-level Generators that call other Generators, either more or less equally or with a distribution you define.

    Testing Your Own Types

    Testing the built-in types isn't very interesting, though. Usually, you have your own types that you want to check the properties of. So let's build up an example piece by piece.

    Say you have this simple type:

    sealed trait Shape {
  def area: Double
}
case class Rectangle(width: Int, height: Int) extends Shape {
  require(width > 0)
  require(height > 0)
  def area: Double = width * height
}

    Let's confirm a nice straightforward property that is surely true: that the area is greater than zero:

    "Rectangles" should "have a positive area" in {
   forAll { (w: PosInt, h: PosInt) =>
     val rect = Rectangle(w, h)
     rect.area should be > 0.0
   }
 }

    Note that, even though our class takes ordinary Ints as parameters (and checks the values at runtime), it is actually easier to generate the legal values using Scalactic's PosInt type.

    This should work, right? Actually, it doesn't -- if we run it a few times, we quickly hit an error!

    [info] Rectangles
[info] - should have a positive area *** FAILED ***
[info]   GeneratorDrivenPropertyCheckFailedException was thrown during property evaluation.
[info]    (DocExamples.scala:42)
[info]     Falsified after 2 successful property evaluations.
[info]     Location: (DocExamples.scala:42)
[info]     Occurred when passed generated values (
[info]       None = PosInt(399455539),
[info]       None = PosInt(703518968)
[info]     )
[info]     Init Seed: 1568878346200

    TODO: fix the above error to reflect the better errors we should get when we merge in the code being forward-ported from 3.0.5.

    Looking at it, we can see that the numbers being used are pretty large. What happens when we multiply them together?

    scala> 399455539 * 703518968
res0: Int = -2046258840

    We're hitting an Int overflow problem here: the numbers are too big to multiply together and still get an Int. So we have to fix our area function:

    case class Rectangle(width: Int, height: Int) extends Shape {
  require(width > 0)
  require(height > 0)
  def area: Double = width.toLong * height.toLong
}

    Now, when we run our property check, it consistently passes. Excellent -- we've caught a bug, because ScalaTest tried sufficiently large numbers.

    Composing Your Own Generators

    Doing things as shown above works, but having to generate the parameters and construct a Rectangle every time is a nuisance. What we really want is to create our own Generator that just hands us Rectangles, the same way we can do for PosInt. Fortunately, this is easy.

    Generators can be composed in for comprehensions. So we can create our own Generator for Rectangle like this:

    implicit val rectGenerator = for {
  w <- posInts
  h <- posInts
}
  yield Rectangle(w, h)

    Taking that line by line:

    w <- posInts

    CommonGenerators.posInts is the built-in Generator for positive Ints. So this line puts a randomly-generated positive Int in w, and

    h <- posInts

    this line puts another one in h. Finally, this line:

    yield Rectangle(w, h)

    combines w and h to make a Rectangle.

    That's pretty much all you need in order to build any normal case class -- just build it out of the Generators for the type of each field. (And if the fields are complex data structures themselves, build Generators for them the same way, until you are just using primitives.)

    Now, our property check becomes simpler:

    "Generated Rectangles" should "have a positive area" in {
   forAll { (rect: Rectangle) =>
     rect.area should be > 0.0
   }
 }

    That's about as close to plain English as we can reasonably hope for!

    Filtering Values with whenever()

    Sometimes, not all of your generated values make sense for the property you want to check -- you know (via external information) that some of these values will never come up. In cases like this, you can create a custom Generator that only creates the values you do want, but it's often easier to just use Whenever.whenever. (Whenever is mixed into GeneratorDrivenPropertyChecks, so this is available when you need it.)

    The Whenever.whenever function can be used inside of GeneratorDrivenPropertyChecks.forAll. It says that only the filtered values should be used, and anything else should be discarded. For example, look at this property:

    "Fractions" should "get smaller when squared" in {
  forAll { (n: Float) =>
    whenever(n > 0 && n < 1) {
      (n * n) should be < n
    }
  }
}

    We are testing a property of numbers less than 1, so we filter away everything that is not the numbers we want. This property check succeeds, because we've screened out the values that would make it fail.

    Discard Limits

    You shouldn't push Whenever.whenever too far, though. This system is all about trying random data, but if too much of the random data simply isn't usable, you can't get valid answers, and the system tracks that.

    For example, consider this apparently-reasonable test:

    "Space Chars" should "not also be letters" in {
  forAll { (c: Char) =>
    whenever (c.isSpaceChar) {
      assert(!c.isLetter)
    }
  }
}

    Although the property is true, this test will fail with an error like this:

    [info] Lowercase Chars
[info] - should upper-case correctly *** FAILED ***
[info]   Gave up after 0 successful property evaluations. 49 evaluations were discarded.
[info]   Init Seed: 1568855247784

    Because the vast majority of Chars are not spaces, nearly all of the generated values are being discarded. As a result, the system gives up after a while. In cases like this, you usually should write a custom Generator instead.

    The proportion of how many discards to permit, relative to the number of successful checks, is configuration-controllable. See GeneratorDrivenPropertyChecks for more details.

    Randomization

    The point of Generator is to create pseudo-random values for checking properties. But it turns out to be very inconvenient if those values are actually random -- that would mean that, when a property check fails occasionally, you have no good way to invoke that specific set of circumstances again for debugging. We want "randomness", but we also want it to be deterministic, and reproducible when you need it.

    To support this, all "randomness" in ScalaTest's property checking system uses the Randomizer class. You start by creating a Randomizer using an initial seed value, and call that to get your "random" value. Each call to a Randomizer function returns a new Randomizer, which you should use to fetch the next value.

    GeneratorDrivenPropertyChecks.forAll uses Randomizer under the hood: each time you run a forAll-based test, it will automatically create a new Randomizer, which by default is seeded based on the current system time. You can override this, as discussed below.

    Since Randomizer is actually deterministic (the "random" values are unobvious, but will always be the same given the same initial seed), this means that re-running a test with the same seed will produce the same values.

    If you need random data for your own Generators and property checks, you should use Randomizer in the same way; that way, your tests will also be re-runnable, when needed for debugging.

    Debugging, and Re-running a Failed Property Check

    In Testing Your Own Types above, we found to our surprise that the property check failed with this error:

    [info] Rectangles
[info] - should have a positive area *** FAILED ***
[info]   GeneratorDrivenPropertyCheckFailedException was thrown during property evaluation.
[info]    (DocExamples.scala:42)
[info]     Falsified after 2 successful property evaluations.
[info]     Location: (DocExamples.scala:42)
[info]     Occurred when passed generated values (
[info]       None = PosInt(399455539),
[info]       None = PosInt(703518968)
[info]     )
[info]     Init Seed: 1568878346200

    There must be a bug here -- but once we've fixed it, how can we make sure that we are re-testing exactly the same case that failed?

    This is where the pseudo-random nature of Randomizer comes in, and why it is so important to use it consistently. So long as all of our "random" data comes from that, then all we need to do is re-run with the same seed.

    That's why the Init Seed shown in the message above is crucial. We can re-use that seed -- and therefore get exactly the same "random" data -- by using the -S flag to ScalaTest.

    So you can run this command in sbt to re-run exactly the same property check:

    testOnly *DocExamples -- -z "have a positive area" -S 1568878346200

    Taking that apart:

    • testOnly *DocExamples says that we only want to run suites whose paths end with DocExamples
    • -z "have a positive area" says to only run tests whose names include that string.
    • -S 1568878346200 says to run all tests with a "random" seed of 1568878346200

    By combining these flags, you can re-run exactly the property check you need, with the right random seed to make sure you are re-creating the failed test. You should get exactly the same failure over and over until you fix the bug, and then you can confirm your fix with confidence.

    Configuration

    In general, forAll() works well out of the box. But you can tune several configuration parameters when needed. See GeneratorDrivenPropertyChecks for info on how to set configuration parameters for your test.

    Table-Driven Properties

    Sometimes, you want something in between traditional hard-coded unit tests and Generator-driven, randomized tests. Instead, you sometimes want to check your properties against a specific set of inputs.

    (This is particularly useful for regression tests, when you have found certain inputs that have caused problems in the past, and want to make sure that they get consistently re-tested.)

    ScalaTest supports these, by mixing in TableDrivenPropertyChecks. See the documentation for that class for the full details.

    Definition Classes
    scalatest
  • Chooser
  • Classification
  • CommonGenerators
  • Configuration
  • Generator
  • GeneratorDrivenPropertyChecks
  • HavingLength
  • HavingSize
  • PrettyFunction0
  • PropertyArgument
  • PropertyCheckResult
  • PropertyChecks
  • Randomizer
  • SizeParam
  • TableDrivenPropertyChecks
  • TableFor1
  • TableFor10
  • TableFor11
  • TableFor12
  • TableFor13
  • TableFor14
  • TableFor15
  • TableFor16
  • TableFor17
  • TableFor18
  • TableFor19
  • TableFor2
  • TableFor20
  • TableFor21
  • TableFor22
  • TableFor3
  • TableFor4
  • TableFor5
  • TableFor6
  • TableFor7
  • TableFor8
  • TableFor9
  • Tables
  • Whenever

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

A table with 8 columns.

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

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

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

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

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

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

    heading

    a tuple containing string names of the columns in this table

    rows

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

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = TableFor8[A, B, C, D, E, F, G, H]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

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

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

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

    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 TableFor8

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

    Selects a row of data by its index.

    Selects a row of data by its index.

    Definition Classes
    TableFor8 → SeqLike → GenSeqLike → Function1
  19. def applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H)](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  20. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  21. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  22. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  23. def collect[B, That](pf: PartialFunction[(A, B, C, D, E, F, G, H), B])(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def collectFirst[B](pf: PartialFunction[(A, B, C, D, E, F, G, H), B]): Option[B]
    Definition Classes
    TraversableOnce
  25. def combinations(n: Int): Iterator[TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    SeqLike
  26. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  27. def compose[A](g: (A) ⇒ Int): (A) ⇒ (A, B, C, D, E, F, G, H)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def contains[A1 >: (A, B, C, D, E, F, G, H)](elem: A1): Boolean
    Definition Classes
    SeqLike
  29. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  30. def copyToArray[B >: (A, B, C, D, E, F, G, H)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: (A, B, C, D, E, F, G, H)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: (A, B, C, D, E, F, G, H)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: (A, B, C, D, E, F, G, H)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  34. def corresponds[B](that: GenSeq[B])(p: ((A, B, C, D, E, F, G, H), B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  35. def count(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def diff[B >: (A, B, C, D, E, F, G, H)](that: GenSeq[B]): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    SeqLike → GenSeqLike
  37. def distinct: TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    SeqLike → GenSeqLike
  38. def drop(n: Int): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  39. def dropRight(n: Int): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    IterableLike
  40. def dropWhile(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  42. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  43. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  44. def exists[ASSERTION](fun: (A, B, C, D, E, F, G, H) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
  45. def exists(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def filter(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    TableFor8 → TraversableLike → GenTraversableLike
  47. def filterNot(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  49. def find(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): Option[(A, B, C, D, E, F, G, H)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def flatMap[B, That](f: ((A, B, C, D, E, F, G, H)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  51. def flatten[B](implicit asTraversable: ((A, B, C, D, E, F, G, H)) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  52. def fold[A1 >: (A, B, C, D, E, F, G, H)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def foldLeft[B](z: B)(op: (B, (A, B, C, D, E, F, G, H)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldRight[B](z: B)(op: ((A, B, C, D, E, F, G, H), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  55. def forEvery[ASSERTION](fun: (A, B, C, D, E, F, G, H) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
  56. def forall(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def foreach[U](f: ((A, B, C, D, E, F, G, H)) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  58. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  59. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  60. def groupBy[K](f: ((A, B, C, D, E, F, G, H)) ⇒ K): Map[K, TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    TraversableLike → GenTraversableLike
  61. def grouped(size: Int): Iterator[TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    IterableLike
  62. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  63. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  64. def head: (A, B, C, D, E, F, G, H)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  65. def headOption: Option[(A, B, C, D, E, F, G, H)]
    Definition Classes
    TraversableLike → GenTraversableLike
  66. val heading: (String, String, String, String, String, String, String, String)
  67. def indexOf[B >: (A, B, C, D, E, F, G, H)](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  68. def indexOf[B >: (A, B, C, D, E, F, G, H)](elem: B): Int
    Definition Classes
    GenSeqLike
  69. def indexOfSlice[B >: (A, B, C, D, E, F, G, H)](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  70. def indexOfSlice[B >: (A, B, C, D, E, F, G, H)](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  71. def indexWhere(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  72. def indexWhere(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  73. def indices: Range
    Definition Classes
    SeqLike
  74. def init: TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def inits: Iterator[TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    TraversableLike
  76. def intersect[B >: (A, B, C, D, E, F, G, H)](that: GenSeq[B]): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    SeqLike → GenSeqLike
  77. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  78. def isEmpty: Boolean
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  79. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  80. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  81. def iterator: Iterator[(A, B, C, D, E, F, G, H)]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  82. def last: (A, B, C, D, E, F, G, H)
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def lastIndexOf[B >: (A, B, C, D, E, F, G, H)](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  84. def lastIndexOf[B >: (A, B, C, D, E, F, G, H)](elem: B): Int
    Definition Classes
    GenSeqLike
  85. def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H)](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  86. def lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H)](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  87. def lastIndexWhere(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  88. def lastIndexWhere(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  89. def lastOption: Option[(A, B, C, D, E, F, G, H)]
    Definition Classes
    TraversableLike → GenTraversableLike
  90. 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
    TableFor8 → SeqLike → GenSeqLike
  91. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  92. def lift: (Int) ⇒ Option[(A, B, C, D, E, F, G, H)]
    Definition Classes
    PartialFunction
  93. def map[B, That](f: ((A, B, C, D, E, F, G, H)) ⇒ B)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  94. def max[B >: (A, B, C, D, E, F, G, H)](implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def maxBy[B](f: ((A, B, C, D, E, F, G, H)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def min[B >: (A, B, C, D, E, F, G, H)](implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def minBy[B](f: ((A, B, C, D, E, F, G, H)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  102. def newBuilder: Builder[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

    Creates a new Builder for TableFor8s.

    Creates a new Builder for TableFor8s.

    Attributes
    protected[this]
    Definition Classes
    TableFor8 → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  103. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  105. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  106. def orElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  107. def padTo[B >: (A, B, C, D, E, F, G, H), That](len: Int, elem: B)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  108. def par: ParSeq[(A, B, C, D, E, F, G, H)]
    Definition Classes
    Parallelizable
  109. def parCombiner: Combiner[(A, B, C, D, E, F, G, H), ParSeq[(A, B, C, D, E, F, G, H)]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  110. def partition(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): (TableFor8[A, B, C, D, E, F, G, H], TableFor8[A, B, C, D, E, F, G, H])
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def patch[B >: (A, B, C, D, E, F, G, H), That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  112. def permutations: Iterator[TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    SeqLike
  113. def prefixLength(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  114. def product[B >: (A, B, C, D, E, F, G, H)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def reduce[A1 >: (A, B, C, D, E, F, G, H)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduceLeft[B >: (A, B, C, D, E, F, G, H)](op: (B, (A, B, C, D, E, F, G, H)) ⇒ B): B
    Definition Classes
    TraversableOnce
  117. def reduceLeftOption[B >: (A, B, C, D, E, F, G, H)](op: (B, (A, B, C, D, E, F, G, H)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceOption[A1 >: (A, B, C, D, E, F, G, H)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduceRight[B >: (A, B, C, D, E, F, G, H)](op: ((A, B, C, D, E, F, G, H), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  120. def reduceRightOption[B >: (A, B, C, D, E, F, G, H)](op: ((A, B, C, D, E, F, G, H), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def repr: TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def reverse: TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    SeqLike → GenSeqLike
  123. def reverseIterator: Iterator[(A, B, C, D, E, F, G, H)]
    Definition Classes
    SeqLike
  124. def reverseMap[B, That](f: ((A, B, C, D, E, F, G, H)) ⇒ B)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  125. def reversed: List[(A, B, C, D, E, F, G, H)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  126. def runWith[U](action: ((A, B, C, D, E, F, G, H)) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  127. def sameElements[B >: (A, B, C, D, E, F, G, H)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  128. def scan[B >: (A, B, C, D, E, F, G, H), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def scanLeft[B, That](z: B)(op: (B, (A, B, C, D, E, F, G, H)) ⇒ B)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def scanRight[B, That](z: B)(op: ((A, B, C, D, E, F, G, H), B) ⇒ B)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], 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.

  131. def segmentLength(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  132. def seq: IndexedSeq[(A, B, C, D, E, F, G, H)]
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  133. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  134. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  135. def slice(from: Int, until: Int): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  136. def sliding(size: Int, step: Int): Iterator[TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    IterableLike
  137. def sliding(size: Int): Iterator[TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    IterableLike
  138. def sortBy[B](f: ((A, B, C, D, E, F, G, H)) ⇒ B)(implicit ord: Ordering[B]): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    SeqLike
  139. def sortWith(lt: ((A, B, C, D, E, F, G, H), (A, B, C, D, E, F, G, H)) ⇒ Boolean): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    SeqLike
  140. def sorted[B >: (A, B, C, D, E, F, G, H)](implicit ord: Ordering[B]): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    SeqLike
  141. def span(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): (TableFor8[A, B, C, D, E, F, G, H], TableFor8[A, B, C, D, E, F, G, H])
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def splitAt(n: Int): (TableFor8[A, B, C, D, E, F, G, H], TableFor8[A, B, C, D, E, F, G, H])
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  144. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  145. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  146. def sum[B >: (A, B, C, D, E, F, G, H)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  148. def tail: TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def tails: Iterator[TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    TraversableLike
  150. def take(n: Int): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  151. def takeRight(n: Int): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    IterableLike
  152. def takeWhile(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): TableFor8[A, B, C, D, E, F, G, H]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  153. def thisCollection: IndexedSeq[(A, B, C, D, E, F, G, H)]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  154. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B, C, D, E, F, G, H), Col[(A, B, C, D, E, F, G, H)]]): Col[(A, B, C, D, E, F, G, H)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  155. def toArray[B >: (A, B, C, D, E, F, G, H)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def toBuffer[A1 >: (A, B, C, D, E, F, G, H)]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  157. def toCollection(repr: TableFor8[A, B, C, D, E, F, G, H]): IndexedSeq[(A, B, C, D, E, F, G, H)]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  158. def toIndexedSeq: IndexedSeq[(A, B, C, D, E, F, G, H)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def toIterable: Iterable[(A, B, C, D, E, F, G, H)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  160. def toIterator: Iterator[(A, B, C, D, E, F, G, H)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  161. def toList: List[(A, B, C, D, E, F, G, H)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def toMap[T, U](implicit ev: <:<[(A, B, C, D, E, F, G, H), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def toSeq: Seq[(A, B, C, D, E, F, G, H)]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  164. def toSet[B >: (A, B, C, D, E, F, G, H)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. def toStream: Stream[(A, B, C, D, E, F, G, H)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  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.

    Definition Classes
    TableFor8 → SeqLike → TraversableLike → Function1 → AnyRef → Any
  167. def toTraversable: Traversable[(A, B, C, D, E, F, G, H)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  168. def toVector: Vector[(A, B, C, D, E, F, G, H)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def transpose[B](implicit asTraversable: ((A, B, C, D, E, F, G, H)) ⇒ 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.

  170. def union[B >: (A, B, C, D, E, F, G, H), That](that: GenSeq[B])(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  171. def unzip[A1, A2](implicit asPair: ((A, B, C, D, E, F, G, H)) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    GenericTraversableTemplate
  172. def unzip3[A1, A2, A3](implicit asTriple: ((A, B, C, D, E, F, G, H)) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    GenericTraversableTemplate
  173. def updated[B >: (A, B, C, D, E, F, G, H), That](index: Int, elem: B)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  174. def view(from: Int, until: Int): SeqView[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  175. def view: SeqView[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  176. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  177. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  178. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  179. def withFilter(p: ((A, B, C, D, E, F, G, H)) ⇒ Boolean): FilterMonadic[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]
    Definition Classes
    TraversableLike → FilterMonadic
  180. def zip[A1 >: (A, B, C, D, E, F, G, H), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  181. def zipAll[B, A1 >: (A, B, C, D, E, F, G, H), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  182. def zipWithIndex[A1 >: (A, B, C, D, E, F, G, H), That](implicit bf: CanBuildFrom[TableFor8[A, B, C, D, E, F, G, H], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

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

Inherited from IndexedSeqLike[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

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

Inherited from SeqLike[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

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

Inherited from GenSeqLike[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

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

Inherited from IterableLike[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

Inherited from Equals

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

Inherited from GenIterableLike[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

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

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

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

Inherited from TraversableLike[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

Inherited from GenTraversableLike[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

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

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

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

Inherited from FilterMonadic[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

Inherited from HasNewBuilder[(A, B, C, D, E, F, G, H), TableFor8[A, B, C, D, E, F, G, H]]

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped