class TableFor11[A, B, C, D, E, F, G, H, I, J, K] extends IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K)] with IndexedSeqLike[(A, B, C, D, E, F, G, H, I, J, K), TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
A table with 11 columns.
For an introduction to using tables, see the documentation for trait TableDrivenPropertyChecks.
This table is a sequence of Tuple11
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 TableFor11
is via an apply
factory method in the Table
singleton object provided by the Tables
trait. Here's an example:
val examples = Table( ("a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k"), * ( 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), ( 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), ( 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2), ( 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3), ( 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4), ( 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5), ( 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6), ( 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7), ( 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8), ( 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9) )
Because you supplied 11 members in each tuple, the type you'll get back will be a TableFor11
.
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 TableFor11
as its
first argument, then in a curried argument list takes the property check function. It invokes apply
on
the TableFor11
, passing in the property check function. Here's an example:
forAll (examples) { (a, b, c, d, e, f, g, h, i, j, k) => a + b + c + d + e + f + g + h + i + j + k should equal (a * 11) }
Because TableFor11
is a Seq[(A, B, C, D, E, F, G, H, I, J, K)]
, you can use it as a Seq
. For example, here's how
you could get a sequence of Outcome
s 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
- Alphabetic
- By Inheritance
- TableFor11
- IndexedSeq
- IndexedSeqLike
- Seq
- SeqLike
- GenSeq
- GenSeqLike
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- PartialFunction
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
TableFor11(heading: (String, String, String, String, String, String, String, String, String, String, String), rows: (A, B, C, D, E, F, G, H, I, J, K)*)
- heading
a tuple containing string names of the columns in this table
- rows
a variable length parameter list of
Tuple11
s containing the data of this table
Type Members
-
class
Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
- Attributes
- protected
- Definition Classes
- IndexedSeqLike
- Annotations
- @SerialVersionUID()
-
type
Self = TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def ++(others: Iterable[(A, B, C, D, E, F, G, H, I, J, K)]): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
-
def
++[B >: (A, B, C, D, E, F, G, H, I, J, K), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: (A, B, C, D, E, F, G, H, I, J, K), That](that: Traversable[B])(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: (A, B, C, D, E, F, G, H, I, J, K), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike
-
def
+:[B >: (A, B, C, D, E, F, G, H, I, J, K), That](elem: B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
/:[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K)) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:+[B >: (A, B, C, D, E, F, G, H, I, J, K), That](elem: B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
:\[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (A, B, C, D, E, F, G, H, I, J, K)) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[C](k: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
Applies the passed property check function to each row of this
TableFor11
.Applies the passed property check function to each row of this
TableFor11
.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, thisapply
method wraps that exception in aTableDrivenPropertyCheckFailedException
and completes abruptly with that exception. Once the property check function throws an exception for a row, thisapply
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
TableFor11
-
def
apply(idx: Int): (A, B, C, D, E, F, G, H, I, J, K)
Selects a row of data by its index.
Selects a row of data by its index.
- Definition Classes
- TableFor11 → SeqLike → GenSeqLike → Function1
-
def
applyOrElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K)](x: A1, default: (A1) ⇒ B1): B1
- Definition Classes
- PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K), B])(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[(A, B, C, D, E, F, G, H, I, J, K), B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
combinations(n: Int): Iterator[TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- SeqLike
-
def
companion: GenericCompanion[IndexedSeq]
- Definition Classes
- IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ (A, B, C, D, E, F, G, H, I, J, K)
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains[A1 >: (A, B, C, D, E, F, G, H, I, J, K)](elem: A1): Boolean
- Definition Classes
- SeqLike
-
def
containsSlice[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike
-
def
copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K)](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K)](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (A, B, C, D, E, F, G, H, I, J, K)](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (A, B, C, D, E, F, G, H, I, J, K)](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenSeq[B])(p: ((A, B, C, D, E, F, G, H, I, J, K), B) ⇒ Boolean): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
count(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
diff[B >: (A, B, C, D, E, F, G, H, I, J, K)](that: GenSeq[B]): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- SeqLike → GenSeqLike
-
def
distinct: TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- SeqLike → GenSeqLike
-
def
drop(n: Int): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- IterableLike
-
def
dropWhile(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
endsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenSeqLike → Equals → Any
- def exists[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
-
def
exists(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- TableFor11 → TraversableLike → GenTraversableLike
-
def
filterNot(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): Option[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: (A, B, C, D, E, F, G, H, I, J, K)](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K)) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
- def forEvery[ASSERTION](fun: (A, B, C, D, E, F, G, H, I, J, K) ⇒ ASSERTION)(implicit asserting: TableAsserting[ASSERTION], prettifier: Prettifier, pos: Position): Result
-
def
forall(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, IndexedSeq[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ K): Map[K, TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- IndexedSeqLike → GenSeqLike → Any
-
def
head: (A, B, C, D, E, F, G, H, I, J, K)
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- TraversableLike → GenTraversableLike
- val heading: (String, String, String, String, String, String, String, String, String, String, String)
-
def
indexOf[B >: (A, B, C, D, E, F, G, H, I, J, K)](elem: B, from: Int): Int
- Definition Classes
- GenSeqLike
-
def
indexOf[B >: (A, B, C, D, E, F, G, H, I, J, K)](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
indexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K)](that: GenSeq[B], from: Int): Int
- Definition Classes
- SeqLike
-
def
indexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K)](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
indexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
indexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
indices: Range
- Definition Classes
- SeqLike
-
def
init: TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- TraversableLike
-
def
intersect[B >: (A, B, C, D, E, F, G, H, I, J, K)](that: GenSeq[B]): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- SeqLike → GenSeqLike
-
def
isDefinedAt(idx: Int): Boolean
- Definition Classes
- GenSeqLike
-
def
isEmpty: Boolean
- Definition Classes
- SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- IndexedSeqLike → IterableLike → GenIterableLike
-
def
last: (A, B, C, D, E, F, G, H, I, J, K)
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastIndexOf[B >: (A, B, C, D, E, F, G, H, I, J, K)](elem: B, end: Int): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOf[B >: (A, B, C, D, E, F, G, H, I, J, K)](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K)](that: GenSeq[B], end: Int): Int
- Definition Classes
- SeqLike
-
def
lastIndexOfSlice[B >: (A, B, C, D, E, F, G, H, I, J, K)](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean, end: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
lastIndexWhere(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
lastOption: Option[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- TraversableLike → GenTraversableLike
-
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
- TableFor11 → SeqLike → GenSeqLike
-
def
lengthCompare(len: Int): Int
- Definition Classes
- SeqLike
-
def
lift: (Int) ⇒ Option[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- PartialFunction
-
def
map[B, That](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: (A, B, C, D, E, F, G, H, I, J, K)](implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: (A, B, C, D, E, F, G, H, I, J, K)](implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ B)(implicit cmp: Ordering[B]): (A, B, C, D, E, F, G, H, I, J, K)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[(A, B, C, D, E, F, G, H, I, J, K), TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
Creates a new
Builder
forTableFor11
s.Creates a new
Builder
forTableFor11
s.- Attributes
- protected[this]
- Definition Classes
- TableFor11 → GenericTraversableTemplate → TraversableLike → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orElse[A1 <: Int, B1 >: (A, B, C, D, E, F, G, H, I, J, K)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
padTo[B >: (A, B, C, D, E, F, G, H, I, J, K), That](len: Int, elem: B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
par: ParSeq[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[(A, B, C, D, E, F, G, H, I, J, K), ParSeq[(A, B, C, D, E, F, G, H, I, J, K)]]
- Attributes
- protected[this]
- Definition Classes
- SeqLike → TraversableLike → Parallelizable
-
def
partition(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): (TableFor11[A, B, C, D, E, F, G, H, I, J, K], TableFor11[A, B, C, D, E, F, G, H, I, J, K])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
patch[B >: (A, B, C, D, E, F, G, H, I, J, K), That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
permutations: Iterator[TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- SeqLike
-
def
prefixLength(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
product[B >: (A, B, C, D, E, F, G, H, I, J, K)](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: (A, B, C, D, E, F, G, H, I, J, K)](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (A, B, C, D, E, F, G, H, I, J, K)](op: (B, (A, B, C, D, E, F, G, H, I, J, K)) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (A, B, C, D, E, F, G, H, I, J, K)](op: (B, (A, B, C, D, E, F, G, H, I, J, K)) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (A, B, C, D, E, F, G, H, I, J, K)](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (A, B, C, D, E, F, G, H, I, J, K)](op: ((A, B, C, D, E, F, G, H, I, J, K), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (A, B, C, D, E, F, G, H, I, J, K)](op: ((A, B, C, D, E, F, G, H, I, J, K), B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reverse: TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- SeqLike → GenSeqLike
-
def
reverseIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- SeqLike
-
def
reverseMap[B, That](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
reversed: List[(A, B, C, D, E, F, G, H, I, J, K)]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ U): (Int) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: (A, B, C, D, E, F, G, H, I, J, K)](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: (A, B, C, D, E, F, G, H, I, J, K), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, (A, B, C, D, E, F, G, H, I, J, K)) ⇒ B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: ((A, B, C, D, E, F, G, H, I, J, K), B) ⇒ B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], 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.
-
def
segmentLength(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
seq: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- IndexedSeqLike → GenTraversableOnce
-
def
slice(from: Int, until: Int): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- IterableLike
-
def
sortBy[B](f: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ B)(implicit ord: Ordering[B]): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- SeqLike
-
def
sortWith(lt: ((A, B, C, D, E, F, G, H, I, J, K), (A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- SeqLike
-
def
sorted[B >: (A, B, C, D, E, F, G, H, I, J, K)](implicit ord: Ordering[B]): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- SeqLike
-
def
span(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): (TableFor11[A, B, C, D, E, F, G, H, I, J, K], TableFor11[A, B, C, D, E, F, G, H, I, J, K])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (TableFor11[A, B, C, D, E, F, G, H, I, J, K], TableFor11[A, B, C, D, E, F, G, H, I, J, K])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
startsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- GenSeqLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: (A, B, C, D, E, F, G, H, I, J, K)](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- IterableLike
-
def
takeWhile(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): TableFor11[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K)]
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B, C, D, E, F, G, H, I, J, K), Col[(A, B, C, D, E, F, G, H, I, J, K)]]): Col[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: (A, B, C, D, E, F, G, H, I, J, K)](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: (A, B, C, D, E, F, G, H, I, J, K)]: Buffer[A1]
- Definition Classes
- IndexedSeqLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: TableFor11[A, B, C, D, E, F, G, H, I, J, K]): IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K)]
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(A, B, C, D, E, F, G, H, I, J, K), (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (A, B, C, D, E, F, G, H, I, J, K)]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
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
- TableFor11 → SeqLike → TraversableLike → Function1 → AnyRef → Any
-
def
toTraversable: Traversable[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[(A, B, C, D, E, F, G, H, I, J, K)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
union[B >: (A, B, C, D, E, F, G, H, I, J, K), That](that: GenSeq[B])(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
unzip[A1, A2](implicit asPair: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
updated[B >: (A, B, C, D, E, F, G, H, I, J, K), That](index: Int, elem: B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
view(from: Int, until: Int): SeqView[(A, B, C, D, E, F, G, H, I, J, K), TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
def
view: SeqView[(A, B, C, D, E, F, G, H, I, J, K), TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: ((A, B, C, D, E, F, G, H, I, J, K)) ⇒ Boolean): FilterMonadic[(A, B, C, D, E, F, G, H, I, J, K), TableFor11[A, B, C, D, E, F, G, H, I, J, K]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: (A, B, C, D, E, F, G, H, I, J, K), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: (A, B, C, D, E, F, G, H, I, J, K), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: (A, B, C, D, E, F, G, H, I, J, K), That](implicit bf: CanBuildFrom[TableFor11[A, B, C, D, E, F, G, H, I, J, K], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike