scalatestCoreDottyJS
API
Generated with
scalatestCoreDottyJS/org.scalatest/org.scalatest.prop/TableFor5

TableFor5

org.scalatest.prop.TableFor5
See theTableFor5 companion object
class TableFor5[A, B, C, D, E](val heading: (String, String, String, String, String), rows: (A, B, C, D, E)*) extends IndexedSeq[(A, B, C, D, E)], IndexedSeqOps[(A, B, C, D, E), IndexedSeq, IndexedSeq[(A, B, C, D, E)]]

A table with 5 columns.

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

This table is a sequence of Tuple5 objects, where each tuple represents one row of the table. The first element of each tuple comprise the first column of the table, the second element of each tuple comprise the second column, and so on. This table also carries with it a heading tuple that gives string names to the columns of the table.

A handy way to create a TableFor5 is via an apply factory method in the Table singleton object provided by the Tables trait. Here's an example:

val examples =
 Table(
   ("a", "b", "c", "d", "e"),
   (  0,   0,   0,   0,   0),
   (  1,   1,   1,   1,   1),
   (  2,   2,   2,   2,   2),
   (  3,   3,   3,   3,   3),
   (  4,   4,   4,   4,   4),
   (  5,   5,   5,   5,   5),
   (  6,   6,   6,   6,   6),
   (  7,   7,   7,   7,   7),
   (  8,   8,   8,   8,   8),
   (  9,   9,   9,   9,   9)
 )

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

The table provides an apply method that takes a function with a parameter list that matches the types and arity of the tuples contained in this table. The apply method will invoke the function with the members of each row tuple passed as arguments, in ascending order by index. (I.e., the zeroth tuple is checked first, then the tuple with index 1, then index 2, and so on until all the rows have been checked (or until a failure occurs). The function represents a property of the code under test that should succeed for every row of the table. If the function returns normally, that indicates the property check succeeded for that row. If the function completes abruptly with an exception, that indicates the property check failed and the apply method will complete abruptly with a TableDrivenPropertyCheckFailedException that wraps the exception thrown by the supplied property function.

The usual way you'd invoke the apply method that checks a property is via a forAll method provided by trait TableDrivenPropertyChecks. The forAll method takes a TableFor5 as its first argument, then in a curried argument list takes the property check function. It invokes apply on the TableFor5, passing in the property check function. Here's an example:

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

Because TableFor5 is a Seq[(A, B, C, D, E)], you can use it as a Seq. For example, here's how you could get a sequence of Outcomes for each row of the table, indicating whether a property check succeeded or failed on each row of the table:

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

Note: the outcomeOf method, contained in the OutcomeOf trait, will execute the supplied code (a by-name parameter) and transform it to an Outcome. If no exception is thrown by the code, outcomeOf will result in a Succeeded, indicating the "property check" succeeded. If the supplied code completes abruptly in an exception that would normally cause a test to fail, outcomeOf will result in in a Failed instance containing that exception. For example, the previous for expression would give you:

Vector(Succeeded, Succeeded, Succeeded, Succeeded, Succeeded, Succeeded, Succeeded,
   Failed(org.scalatest.TestFailedException: 7 equaled 7), Succeeded, Succeeded)

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

Value parameters

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

Attributes

Companion
object
Graph
Supertypes
trait IndexedSeq[(A, B, C, D, E)]
trait IndexedSeqOps[(A, B, C, D, E), IndexedSeq, IndexedSeq[(A, B, C, D, E)]]
trait IndexedSeq[(A, B, C, D, E)]
trait IndexedSeqOps[(A, B, C, D, E), IndexedSeq, IndexedSeq[(A, B, C, D, E)]]
trait Seq[(A, B, C, D, E)]
trait SeqOps[(A, B, C, D, E), IndexedSeq, IndexedSeq[(A, B, C, D, E)]]
trait Seq[(A, B, C, D, E)]
trait Equals
trait SeqOps[(A, B, C, D, E), IndexedSeq, IndexedSeq[(A, B, C, D, E)]]
trait PartialFunction[Int, (A, B, C, D, E)]
trait Int => (A, B, C, D, E)
trait Iterable[(A, B, C, D, E)]
trait Iterable[(A, B, C, D, E)]
trait IterableFactoryDefaults[(A, B, C, D, E), IndexedSeq]
trait IterableOps[(A, B, C, D, E), IndexedSeq, IndexedSeq[(A, B, C, D, E)]]
trait IterableOnceOps[(A, B, C, D, E), IndexedSeq, IndexedSeq[(A, B, C, D, E)]]
trait IterableOnce[(A, B, C, D, E)]
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

def ++(others: Iterable[(A, B, C, D, E)]): TableFor5[A, B, C, D, E]
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.

Attributes

def apply[ASSERTION](fun: (A, B, C, D, E) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result

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.

Value parameters

fun

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

Attributes

def exists[ASSERTION](fun: (A, B, C, D, E) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
override def filter(p: ((A, B, C, D, E)) => Boolean): TableFor5[A, B, C, D, E]

Attributes

Definition Classes
IterableOps -> IterableOnceOps
def forEvery[ASSERTION](fun: (A, B, C, D, E) => ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
def length: Int

The number of rows of data in the table. (This does not include the heading tuple)

The number of rows of data in the table. (This does not include the heading tuple)

Attributes

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

Attributes

Definition Classes
Seq -> Function1 -> Iterable -> Any

Inherited methods

final def ++[B >: (A, B, C, D, E)](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
final override def ++:[B >: (A, B, C, D, E)](prefix: IterableOnce[B]): CC[B]

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def +:[B >: (A, B, C, D, E)](elem: B): CC[B]

Attributes

Inherited from:
SeqOps
final def :+[B >: (A, B, C, D, E)](elem: B): CC[B]

Attributes

Inherited from:
SeqOps
final def :++[B >: (A, B, C, D, E)](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
SeqOps
final def addString(b: StringBuilder): StringBuilder

Attributes

Inherited from:
IterableOnceOps
final def addString(b: StringBuilder, sep: String): StringBuilder

Attributes

Inherited from:
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Attributes

Inherited from:
IterableOnceOps
def andThen[C](k: PartialFunction[(A, B, C, D, E), C]): PartialFunction[A, C]

Attributes

Inherited from:
PartialFunction
override def andThen[C](k: ((A, B, C, D, E)) => C): PartialFunction[A, C]

Attributes

Definition Classes
PartialFunction -> Function1
Inherited from:
PartialFunction
def appended[B >: (A, B, C, D, E)](elem: B): CC[B]

Attributes

Inherited from:
SeqOps
def appendedAll[B >: (A, B, C, D, E)](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
SeqOps
def applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E)](x: A1, default: A1 => B1): B1

Attributes

Inherited from:
PartialFunction
override def canEqual(that: Any): Boolean

Attributes

Definition Classes
IndexedSeq -> Seq -> Equals
Inherited from:
IndexedSeq
def collect[B](pf: PartialFunction[(A, B, C, D, E), B]): CC[B]

Attributes

Inherited from:
IterableOps
def collectFirst[B](pf: PartialFunction[(A, B, C, D, E), B]): Option[B]

Attributes

Inherited from:
IterableOnceOps
def combinations(n: Int): Iterator[C]

Attributes

Inherited from:
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, B]

Attributes

Inherited from:
PartialFunction
def compose[A](g: A => Int): A => R

Attributes

Inherited from:
Function1
final override def concat[B >: (A, B, C, D, E)](suffix: IterableOnce[B]): CC[B]

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
def contains[A1 >: (A, B, C, D, E)](elem: A1): Boolean

Attributes

Inherited from:
SeqOps
def containsSlice[B >: (A, B, C, D, E)](that: Seq[B]): Boolean

Attributes

Inherited from:
SeqOps
def copyToArray[B >: (A, B, C, D, E)](xs: Array[B], start: Int, len: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: (A, B, C, D, E)](xs: Array[B], start: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: (A, B, C, D, E)](xs: Array[B]): Int

Attributes

Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: ((A, B, C, D, E), B) => Boolean): Boolean

Attributes

Inherited from:
SeqOps
def corresponds[B](that: IterableOnce[B])(p: ((A, B, C, D, E), B) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def count(p: ((A, B, C, D, E)) => Boolean): Int

Attributes

Inherited from:
IterableOnceOps
def diff[B >: (A, B, C, D, E)](that: Seq[B]): C

Attributes

Inherited from:
SeqOps
def distinct: C

Attributes

Inherited from:
SeqOps
def distinctBy[B](f: ((A, B, C, D, E)) => B): C

Attributes

Inherited from:
SeqOps
override def drop(n: Int): C

Attributes

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
override def dropRight(n: Int): C

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def dropWhile(p: ((A, B, C, D, E)) => Boolean): C

Attributes

Inherited from:
IterableOps
def elementWise: ElementWiseExtractor[A, B]

Attributes

Inherited from:
PartialFunction
override def empty: CC[A]

Attributes

Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from:
IterableFactoryDefaults
def endsWith[B >: (A, B, C, D, E)](that: Iterable[B]): Boolean

Attributes

Inherited from:
SeqOps
override def equals(o: Any): Boolean

Compares the receiver object (this) with the argument object (that) for equivalence.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an 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 Any 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 usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Value parameters

that

the object to compare against this object for equality.

Attributes

Returns

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

Definition Classes
Seq -> Equals -> Any
Inherited from:
Seq
def exists(p: ((A, B, C, D, E)) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def filterNot(pred: ((A, B, C, D, E)) => Boolean): C

Attributes

Inherited from:
IterableOps
def find(p: ((A, B, C, D, E)) => Boolean): Option[A]

Attributes

Inherited from:
IterableOnceOps
def findLast(p: ((A, B, C, D, E)) => Boolean): Option[A]

Attributes

Inherited from:
SeqOps
def flatMap[B](f: ((A, B, C, D, E)) => IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
def flatten[B](implicit asIterable: ((A, B, C, D, E)) => IterableOnce[B]): CC[B]

Attributes

Inherited from:
IterableOps
def fold[A1 >: (A, B, C, D, E)](z: A1)(op: (A1, A1) => A1): A1

Attributes

Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, (A, B, C, D, E)) => B): B

Attributes

Inherited from:
IterableOnceOps
override def foldRight[B](z: B)(op: ((A, B, C, D, E), B) => B): B

Attributes

Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def forall(p: ((A, B, C, D, E)) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def foreach[U](f: ((A, B, C, D, E)) => U): Unit

Attributes

Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[(A, B, C, D, E)]): CC[A]

Attributes

Inherited from:
IterableFactoryDefaults
def groupBy[K](f: ((A, B, C, D, E)) => K): Map[K, C]

Attributes

Inherited from:
IterableOps
def groupMap[K, B](key: ((A, B, C, D, E)) => K)(f: ((A, B, C, D, E)) => B): Map[K, CC[B]]

Attributes

Inherited from:
IterableOps
def groupMapReduce[K, B](key: ((A, B, C, D, E)) => K)(f: ((A, B, C, D, E)) => B)(reduce: (B, B) => B): Map[K, B]

Attributes

Inherited from:
IterableOps
def grouped(size: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
override def hashCode(): Int

Calculate a hash code value for the object.

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

Attributes

Returns

the hash code value for this object.

Definition Classes
Seq -> Any
Inherited from:
Seq
override def head: A

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
override def headOption: Option[A]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def indexOf[B >: (A, B, C, D, E)](elem: B): Int

Attributes

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

Attributes

Inherited from:
SeqOps
def indexOfSlice[B >: (A, B, C, D, E)](that: Seq[B]): Int

Attributes

Inherited from:
SeqOps
def indexOfSlice[B >: (A, B, C, D, E)](that: Seq[B], from: Int): Int

Attributes

Inherited from:
SeqOps
def indexWhere(p: ((A, B, C, D, E)) => Boolean): Int

Attributes

Inherited from:
SeqOps
def indexWhere(p: ((A, B, C, D, E)) => Boolean, from: Int): Int

Attributes

Inherited from:
SeqOps
def indices: Range

Attributes

Inherited from:
SeqOps
def init: C

Attributes

Inherited from:
IterableOps
def inits: Iterator[C]

Attributes

Inherited from:
IterableOps
def intersect[B >: (A, B, C, D, E)](that: Seq[B]): C

Attributes

Inherited from:
SeqOps
def isDefinedAt(idx: Int): Boolean

Attributes

Inherited from:
SeqOps
override def isEmpty: Boolean

Attributes

Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
override def isTraversableAgain: Boolean

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
override def iterableFactory: SeqFactory[IndexedSeq]

Attributes

Definition Classes
IndexedSeq -> IndexedSeq -> Seq -> Seq -> Iterable -> Iterable -> IterableOps
Inherited from:
IndexedSeq
def iterator: Iterator[A]

Attributes

Inherited from:
IndexedSeqOps
override def knownSize: Int

Attributes

Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
override def last: A

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def lastIndexOf[B >: (A, B, C, D, E)](elem: B, end: Int): Int

Attributes

Inherited from:
SeqOps
def lastIndexOfSlice[B >: (A, B, C, D, E)](that: Seq[B]): Int

Attributes

Inherited from:
SeqOps
def lastIndexOfSlice[B >: (A, B, C, D, E)](that: Seq[B], end: Int): Int

Attributes

Inherited from:
SeqOps
def lastIndexWhere(p: ((A, B, C, D, E)) => Boolean): Int

Attributes

Inherited from:
SeqOps
def lastIndexWhere(p: ((A, B, C, D, E)) => Boolean, end: Int): Int

Attributes

Inherited from:
SeqOps
def lastOption: Option[A]

Attributes

Inherited from:
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, Iterable]

Attributes

Inherited from:
Iterable
final override def lengthCompare(that: Iterable[_]): Int

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
final override def lengthCompare(len: Int): Int

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
final def lengthIs: SizeCompareOps

Attributes

Inherited from:
SeqOps
def lift: A => Option[B]

Attributes

Inherited from:
PartialFunction
override def map[B](f: ((A, B, C, D, E)) => B): CC[B]

Attributes

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def max[B >: (A, B, C, D, E)](implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def maxBy[B](f: ((A, B, C, D, E)) => B)(implicit cmp: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def maxByOption[B](f: ((A, B, C, D, E)) => B)(implicit cmp: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def maxOption[B >: (A, B, C, D, E)](implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def min[B >: (A, B, C, D, E)](implicit ord: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def minBy[B](f: ((A, B, C, D, E)) => B)(implicit cmp: Ordering[B]): A

Attributes

Inherited from:
IterableOnceOps
def minByOption[B](f: ((A, B, C, D, E)) => B)(implicit cmp: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
def minOption[B >: (A, B, C, D, E)](implicit ord: Ordering[B]): Option[A]

Attributes

Inherited from:
IterableOnceOps
final def mkString: String

Attributes

Inherited from:
IterableOnceOps
final def mkString(sep: String): String

Attributes

Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String

Attributes

Inherited from:
IterableOnceOps
protected def newSpecificBuilder: Builder[A, CC[A]]

Attributes

Inherited from:
IterableFactoryDefaults
def nonEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: (A, B, C, D, E)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

Attributes

Inherited from:
PartialFunction
def padTo[B >: (A, B, C, D, E)](len: Int, elem: B): CC[B]

Attributes

Inherited from:
SeqOps
def partition(p: ((A, B, C, D, E)) => Boolean): (C, C)

Attributes

Inherited from:
IterableOps
def partitionMap[A1, A2](f: ((A, B, C, D, E)) => Either[A1, A2]): (CC[A1], CC[A2])

Attributes

Inherited from:
IterableOps
def patch[B >: (A, B, C, D, E)](from: Int, other: IterableOnce[B], replaced: Int): CC[B]

Attributes

Inherited from:
SeqOps
def permutations: Iterator[C]

Attributes

Inherited from:
SeqOps
override def prepended[B >: (A, B, C, D, E)](elem: B): CC[B]

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
def prependedAll[B >: (A, B, C, D, E)](prefix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
SeqOps
def product[B >: (A, B, C, D, E)](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def reduce[B >: (A, B, C, D, E)](op: (B, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeft[B >: (A, B, C, D, E)](op: (B, (A, B, C, D, E)) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeftOption[B >: (A, B, C, D, E)](op: (B, (A, B, C, D, E)) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceOption[B >: (A, B, C, D, E)](op: (B, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceRight[B >: (A, B, C, D, E)](op: ((A, B, C, D, E), B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceRightOption[B >: (A, B, C, D, E)](op: ((A, B, C, D, E), B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
override def reverse: C

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override def reverseIterator: Iterator[A]

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override protected def reversed: Iterable[A]

Attributes

Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def runWith[U](action: ((A, B, C, D, E)) => U): A => Boolean

Attributes

Inherited from:
PartialFunction
override def sameElements[B >: (A, B, C, D, E)](o: IterableOnce[B]): Boolean

Attributes

Definition Classes
IndexedSeq -> SeqOps
Inherited from:
IndexedSeq
def scala$collection$SeqOps$$super$concat[B >: (A, B, C, D, E)](suffix: IterableOnce[B]): CC[B]

Attributes

Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(that: Iterable[_]): Int

Attributes

Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(otherSize: Int): Int

Attributes

Inherited from:
SeqOps
def scala$collection$immutable$IndexedSeq$$super$canEqual(that: Any): Boolean

Attributes

Inherited from:
IndexedSeq
def scala$collection$immutable$IndexedSeq$$super$sameElements[B >: (A, B, C, D, E)](that: IterableOnce[B]): Boolean

Attributes

Inherited from:
IndexedSeq
def scala$collection$immutable$IndexedSeqOps$$super$slice(from: Int, until: Int): C

Attributes

Inherited from:
IndexedSeqOps
def scan[B >: (A, B, C, D, E)](z: B)(op: (B, B) => B): CC[B]

Attributes

Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, (A, B, C, D, E)) => B): CC[B]

Attributes

Inherited from:
IterableOps
def scanRight[B](z: B)(op: ((A, B, C, D, E), B) => B): CC[B]

Attributes

Inherited from:
IterableOps
override def search[B >: (A, B, C, D, E)](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override def search[B >: (A, B, C, D, E)](elem: B)(implicit ord: Ordering[B]): SearchResult

Attributes

Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
def segmentLength(p: ((A, B, C, D, E)) => Boolean, from: Int): Int

Attributes

Inherited from:
SeqOps
final def segmentLength(p: ((A, B, C, D, E)) => Boolean): Int

Attributes

Inherited from:
SeqOps
final override def size: Int

Attributes

Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int

Attributes

Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def sizeIs: SizeCompareOps

Attributes

Inherited from:
IterableOps
override def slice(from: Int, until: Int): C

Attributes

Definition Classes
IndexedSeqOps -> IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def sliding(size: Int, step: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
def sliding(size: Int): Iterator[C]

Attributes

Inherited from:
IterableOps
def sortBy[B](f: ((A, B, C, D, E)) => B)(implicit ord: Ordering[B]): C

Attributes

Inherited from:
SeqOps
def sortWith(lt: ((A, B, C, D, E), (A, B, C, D, E)) => Boolean): C

Attributes

Inherited from:
SeqOps
def sorted[B >: (A, B, C, D, E)](implicit ord: Ordering[B]): C

Attributes

Inherited from:
SeqOps
def span(p: ((A, B, C, D, E)) => Boolean): (C, C)

Attributes

Inherited from:
IterableOps
override def splitAt(n: Int): (C, C)

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def startsWith[B >: (A, B, C, D, E)](that: IterableOnce[B], offset: Int): Boolean

Attributes

Inherited from:
SeqOps
override def stepper[S <: Stepper[_]](implicit shape: StepperShape[(A, B, C, D, E), S]): S & EfficientSplit

Attributes

Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
def sum[B >: (A, B, C, D, E)](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def tail: C

Attributes

Inherited from:
IterableOps
def tails: Iterator[C]

Attributes

Inherited from:
IterableOps
override def take(n: Int): C

Attributes

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
override def takeRight(n: Int): C

Attributes

Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def takeWhile(p: ((A, B, C, D, E)) => Boolean): C

Attributes

Inherited from:
IterableOps
override def tapEach[U](f: ((A, B, C, D, E)) => U): C

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def to[C1](factory: Factory[(A, B, C, D, E), C1]): C1

Attributes

Inherited from:
IterableOnceOps
def toArray[B >: (A, B, C, D, E) : ClassTag]: Array[B]

Attributes

Inherited from:
IterableOnceOps
final def toBuffer[B >: (A, B, C, D, E)]: Buffer[B]

Attributes

Inherited from:
IterableOnceOps
final override def toIndexedSeq: IndexedSeq[A]

Attributes

Definition Classes
IndexedSeq -> IterableOnceOps
Inherited from:
IndexedSeq
def toList: List[A]

Attributes

Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: (A, B, C, D, E) <:< (K, V)): Map[K, V]

Attributes

Inherited from:
IterableOnceOps
final override def toSeq: Seq.this.type

Attributes

Definition Classes
Seq -> IterableOnceOps
Inherited from:
Seq
def toSet[B >: (A, B, C, D, E)]: Set[B]

Attributes

Inherited from:
IterableOnceOps
def toVector: Vector[A]

Attributes

Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: ((A, B, C, D, E)) => Iterable[B]): CC[CC[B]]

Attributes

Inherited from:
IterableOps
def unapply(a: Int): Option[B]

Attributes

Inherited from:
PartialFunction
def unzip[A1, A2](implicit asPair: ((A, B, C, D, E)) => (A1, A2)): (CC[A1], CC[A2])

Attributes

Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: ((A, B, C, D, E)) => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])

Attributes

Inherited from:
IterableOps
def updated[B >: (A, B, C, D, E)](index: Int, elem: B): CC[B]

Attributes

Inherited from:
SeqOps
override def view: IndexedSeqView[A]

Attributes

Definition Classes
IndexedSeqOps -> SeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def withFilter(p: ((A, B, C, D, E)) => Boolean): WithFilter[A, CC]

Attributes

Inherited from:
IterableOps
def zip[B](that: IterableOnce[B]): CC[(A, B)]

Attributes

Inherited from:
IterableOps
def zipAll[A1 >: (A, B, C, D, E), B](that: Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]

Attributes

Inherited from:
IterableOps
def zipWithIndex: CC[(A, Int)]

Attributes

Inherited from:
IterableOps

Deprecated and Inherited methods

final def /:[B](z: B)(op: (B, (A, B, C, D, E)) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: ((A, B, C, D, E), B) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, (A, B, C, D, E)) => B, combop: (B, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
def companion: IterableFactory[CC]

Attributes

Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: (A, B, C, D, E)](dest: Buffer[B]): Unit

Attributes

Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
def hasDefiniteSize: Boolean

Attributes

Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
final def prefixLength(p: ((A, B, C, D, E)) => Boolean): Int

Attributes

Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
final def repr: C

Attributes

Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
def reverseMap[B](f: ((A, B, C, D, E)) => B): CC[B]

Attributes

Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
def seq: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
final def toIterator: Iterator[A]

Attributes

Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[A]

Attributes

Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[A]

Attributes

Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
final def union[B >: (A, B, C, D, E)](that: Seq[B]): CC[B]

Attributes

Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
override def view(from: Int, until: Int): IndexedSeqView[A]

Attributes

Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps

Concrete fields

val heading: (String, String, String, String, String)
Generated with