scala.collection.TraversableViewLike.TakenWhile

Ordering

Alphabetic
By inheritance

Inherited

Hide All
Show all

TakenWhile
Transformed
TraversableView
TraversableViewLike
ViewMkString
Traversable
GenericTraversableTemplate
TraversableLike
Parallelizable
TraversableOnce
FilterMonadic
HasNewBuilder
AnyRef
Any

Visibility

Public
All

Impl.

Concrete
Abstract

Type Members

trait Appended [B >: A] extends Transformed[B]
trait DroppedWhile extends Transformed[A]
trait EmptyView extends Transformed[Nothing]
trait Filtered extends Transformed[A]
trait FlatMapped [B] extends Transformed[B]
trait Forced [B] extends Transformed[B]

A fall back which forces everything into a vector and then applies an operation on it.
trait Mapped [B] extends Transformed[B]
type Self = TraversableView[A, Coll]

The type implementing this traversable

The type implementing this traversable
attributes: protected
definition classes: TraversableLike
trait Sliced extends Transformed[A]
trait TakenWhile extends Transformed[A]
trait Transformed [+B] extends TraversableView[B, Coll]

The implementation base trait of this view.
class WithFilter extends FilterMonadic[A, Repr]

A class supporting filtered operations.

Value Members

def != ( arg0 : AnyRef ) : Boolean

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

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

o != arg0 is the same as !(o == (arg0)).
arg0
the object to compare against this object for dis-equality.
returns
false if the receiver object is equivalent to the argument; true otherwise.
attributes: final
definition classes: Any
def ## () : Int

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

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

attributes: final
definition classes: AnyRef
def ++ [B] ( that : TraversableOnce[B] ) : CC[B]

[use case] Concatenates this collection with the elements of a traversable collection.

[use case]
Concatenates this collection with the elements of a traversable collection.
B
the element type of the returned collection.
that
the traversable to append.
returns
a new collection which contains all elements of this collection followed by all elements of that.
attributes: abstract
definition classes: TraversableLike
def ++ [B >: A, That] ( xs : TraversableOnce[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

Concatenates this collection with the elements of a traversable collection.

Concatenates this collection with the elements of a traversable collection.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this collection followed by all elements of that.
definition classes: TraversableViewLike → TraversableLike
def ++: [B >: A, That] ( that : Traversable[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.
definition classes: TraversableLike
def ++: [B] ( that : TraversableOnce[B] ) : CC[B]

[use case] Concatenates this collection with the elements of a traversable collection.

[use case]
Concatenates this collection with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.
B
the element type of the returned collection.
that
the traversable to append.
returns
a new collection which contains all elements of this collection followed by all elements of that.
attributes: abstract
definition classes: TraversableLike
def ++: [B >: A, That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

Concatenates this collection with the elements of a traversable collection.

Concatenates this collection with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the traversable to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this collection followed by all elements of that.
definition classes: TraversableLike
def /: [B] ( z : B )( op : (B, A) ⇒ B ) : B

Applies a binary operator to a start value and all elements of this collection, going left to right.
Applies a binary operator to a start value and all elements of this collection, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this collection, going left to right with the start value z on the left:
```
            op(...op(op(z, x,,1,,), x,,2,,), ..., x,,n,,)
```
where x,,1,,, ..., x,,n,, are the elements of this collection.
definition classes: TraversableOnce
def :\ [B] ( z : B )( op : (A, B) ⇒ B ) : B

Applies a binary operator to all elements of this collection and a start value, going right to left.
Applies a binary operator to all elements of this collection and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this collection, going right to left with the start value z on the right:
```
            op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
```
where x,,1,,, ..., x,,n,, are the elements of this collection.
definition classes: TraversableOnce
def == ( arg0 : AnyRef ) : Boolean

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

o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
arg0
the object to compare against this object for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: AnyRef
def == ( arg0 : Any ) : Boolean

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

o == arg0 is the same as o.equals(arg0).
arg0
the object to compare against this object for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: Any
def addString ( b : StringBuilder , start : String , sep : String , end : String ) : StringBuilder

definition classes: ViewMkString → TraversableOnce → ViewMkString
def addString ( b : StringBuilder ) : StringBuilder

Appends all elements of this collection to a string builder.

Appends all elements of this collection to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this collection without any separator string.
b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.
definition classes: TraversableOnce
def addString ( b : StringBuilder , sep : String ) : StringBuilder

Appends all elements of this collection to a string builder using a separator string.

Appends all elements of this collection to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this collection, separated by the string sep.
b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.
definition classes: TraversableOnce
def asInstanceOf [T0] : T0

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

This method is used to cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.
returns
the receiver object.
attributes: final
definition classes: Any
def clone () : AnyRef

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

This method creates and returns a copy of the receiver object.
The default implementation of the clone method is platform dependent.
returns
a copy of the receiver object.
attributes: protected[lang]
definition classes: AnyRef
annotations: @throws()
def collect [B] ( pf : PartialFunction[A, B] ) : CC[B]

[use case] Builds a new collection by applying a partial function to all elements of this collection on which the function is defined.

[use case]
Builds a new collection by applying a partial function to all elements of this collection on which the function is defined.
B
the element type of the returned collection.
pf
the partial function which filters and maps the collection.
returns
a new collection resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
attributes: abstract
definition classes: TraversableLike
def collect [B, That] ( pf : PartialFunction[A, B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

Builds a new collection by applying a partial function to all elements of this collection on which the function is defined.

Builds a new collection by applying a partial function to all elements of this collection on which the function is defined.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
pf
the partial function which filters and maps the collection.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
definition classes: TraversableViewLike → TraversableLike
def collectFirst [B] ( pf : PartialFunction[A, B] ) : Option[B]

Finds the first element of the collection for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the collection for which the given partial function is defined, and applies the partial function to it.
Note: may not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
pf
the partial function
returns
an option value containing pf applied to the first value for which it is defined, or None if none exists.
definition classes: TraversableOnce
Example :
1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
def companion : GenericCompanion[Traversable]

The factory companion object that builds instances of class CC.

The factory companion object that builds instances of class CC. (or its Iterable superclass where class CC is not a Seq.)
definition classes: Traversable → GenericTraversableTemplate
def copyToArray ( xs : Array[A] , start : Int , len : Int ) : Unit

[use case] Copies elements of this collection to an array.

[use case]
Copies elements of this collection to an array. Fills the given array xs with at most len elements of this collection, starting at position start. Copying will stop once either the end of the current collection is reached, or the end of the array is reached, or len elements have been copied.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.
attributes: abstract
definition classes: TraversableLike
def copyToArray [B >: A] ( xs : Array[B] , start : Int , len : Int ) : Unit

Copies elements of this collection to an array.

Copies elements of this collection to an array. Fills the given array xs with at most len elements of this collection, starting at position start. Copying will stop once either the end of the current collection is reached, or the end of the array is reached, or len elements have been copied.
Note: will not terminate for infinite-sized collections.
B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.
definition classes: TraversableLike → TraversableOnce
def copyToArray ( xs : Array[A] ) : Unit

[use case] Copies values of this collection to an array.

[use case]
Copies values of this collection to an array. Fills the given array xs with values of this collection. Copying will stop once either the end of the current collection is reached, or the end of the array is reached.
xs
the array to fill.
attributes: abstract
definition classes: TraversableOnce
def copyToArray [B >: A] ( xs : Array[B] ) : Unit

Copies values of this collection to an array.

Copies values of this collection to an array. Fills the given array xs with values of this collection. Copying will stop once either the end of the current collection is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.
B
the type of the elements of the array.
xs
the array to fill.
definition classes: TraversableOnce
def copyToArray ( xs : Array[A] , start : Int ) : Unit

[use case] Copies values of this collection to an array.

[use case]
Copies values of this collection to an array. Fills the given array xs with values of this collection, after skipping start values. Copying will stop once either the end of the current collection is reached, or the end of the array is reached.
xs
the array to fill.
start
the starting index.
attributes: abstract
definition classes: TraversableOnce
def copyToArray [B >: A] ( xs : Array[B] , start : Int ) : Unit

Copies values of this collection to an array.

Copies values of this collection to an array. Fills the given array xs with values of this collection, after skipping start values. Copying will stop once either the end of the current collection is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.
B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.
definition classes: TraversableOnce
def copyToBuffer [B >: A] ( dest : Buffer[B] ) : Unit

Copies all elements of this collection to a buffer.

Copies all elements of this collection to a buffer.
Note: will not terminate for infinite-sized collections.
dest
The buffer to which elements are copied.
definition classes: TraversableOnce
def count ( p : (A) ⇒ Boolean ) : Int

Counts the number of elements in the collection which satisfy a predicate.

Counts the number of elements in the collection which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.
definition classes: TraversableOnce
def drop ( n : Int ) : TraversableView[A, Coll]

Selects all elements except first n ones.

Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the number of elements to drop from this collection.
returns
a collection consisting of all elements of this collection except the first n ones, or else the empty collection, if this collection has less than n elements.
definition classes: TraversableViewLike → TraversableLike
def dropWhile ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

Drops longest prefix of elements that satisfy a predicate.

Drops longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
The predicate used to test elements.
returns
the longest suffix of this collection whose first element does not satisfy the predicate p.
definition classes: TraversableViewLike → TraversableLike
def eq ( arg0 : AnyRef ) : Boolean

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

This method is used to test whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
arg0
the object to compare against this object for reference equality.
returns
true if the argument is a reference to the receiver object; false otherwise.
attributes: final
definition classes: AnyRef
def equals ( arg0 : Any ) : Boolean

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

This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.
The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same Int (o1.hashCode.equals(o2.hashCode)).
arg0
the object to compare against this object for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.
definition classes: AnyRef → Any
def exists ( p : (A) ⇒ Boolean ) : Boolean

Tests whether a predicate holds for some of the elements of this collection.

Tests whether a predicate holds for some of the elements of this collection.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
true if the given predicate p holds for some of the elements of this collection, otherwise false.
definition classes: TraversableLike → TraversableOnce
def filter ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

Selects all elements of this collection which satisfy a predicate.

Selects all elements of this collection which satisfy a predicate.
p
the predicate used to test elements.
returns
a new collection consisting of all elements of this collection that satisfy the given predicate p. The order of the elements is preserved.
definition classes: TraversableViewLike → TraversableLike
def filterNot ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

Selects all elements of this collection which do not satisfy a predicate.

Selects all elements of this collection which do not satisfy a predicate.
p
the predicate used to test elements.
returns
a new collection consisting of all elements of this collection that do not satisfy the given predicate p. The order of the elements is preserved.
definition classes: TraversableLike
def finalize () : Unit

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

This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize method are invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.
attributes: protected[lang]
definition classes: AnyRef
annotations: @throws()
def find ( p : (A) ⇒ Boolean ) : Option[A]

Finds the first element of the collection satisfying a predicate, if any.

Finds the first element of the collection satisfying a predicate, if any.
Note: may not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the predicate used to test elements.
returns
an option value containing the first element in the collection that satisfies p, or None if none exists.
definition classes: TraversableLike → TraversableOnce
def flatMap [B] ( f : (A) ⇒ TraversableOnce[B] ) : CC[B]

[use case] Builds a new collection by applying a function to all elements of this collection and concatenating the results.

[use case]
Builds a new collection by applying a function to all elements of this collection and concatenating the results.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new collection resulting from applying the given collection-valued function f to each element of this collection and concatenating the results.
attributes: abstract
definition classes: TraversableLike
def flatMap [B, That] ( f : (A) ⇒ TraversableOnce[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

Builds a new collection by applying a function to all elements of this collection and concatenating the results.

Builds a new collection by applying a function to all elements of this collection and concatenating the results.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given collection-valued function f to each element of this collection and concatenating the results.
definition classes: TraversableViewLike → TraversableLike → FilterMonadic
def flatten [B] : CC[B]

[use case] Converts this collection of traversable collections into a collection in which all element collections are concatenated.

[use case]
Converts this collection of traversable collections into a collection in which all element collections are concatenated.
B
the type of the elements of each traversable collection.
returns
a new collection resulting from concatenating all element collections.
attributes: abstract
definition classes: GenericTraversableTemplate
def flatten [B] (implicit asTraversable : (A) ⇒ TraversableOnce[B] ) : Traversable[B]

Converts this collection of traversable collections into a collection in which all element collections are concatenated.

Converts this collection of traversable collections into a collection in which all element collections are concatenated.
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this collection is a Traversable.
returns
a new collection resulting from concatenating all element collections.
definition classes: GenericTraversableTemplate
def foldLeft [B] ( z : B )( op : (B, A) ⇒ B ) : B

Applies a binary operator to a start value and all elements of this collection, going left to right.
Applies a binary operator to a start value and all elements of this collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this collection, going left to right with the start value z on the left:
```
            op(...op(z, x,,1,,), x,,2,,, ..., x,,n,,)
```
where x,,1,,, ..., x,,n,, are the elements of this collection.
definition classes: TraversableOnce
def foldRight [B] ( z : B )( op : (A, B) ⇒ B ) : B

Applies a binary operator to all elements of this collection and a start value, going right to left.
Applies a binary operator to all elements of this collection and a start value, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this collection, going right to left with the start value z on the right:
```
            op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
```
where x,,1,,, ..., x,,n,, are the elements of this collection.
definition classes: TraversableOnce
def forall ( p : (A) ⇒ Boolean ) : Boolean

Tests whether a predicate holds for all elements of this collection.

Tests whether a predicate holds for all elements of this collection.
Note: may not terminate for infinite-sized collections.
p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this collection, otherwise false.
definition classes: TraversableLike → TraversableOnce
def force [B >: A, That] (implicit bf : CanBuildFrom[Coll, B, That] ) : That

definition classes: TraversableViewLike
def foreach ( f : (A) ⇒ Unit ) : Unit

[use case] Applies a function f to all elements of this collection.

[use case]
Applies a function f to all elements of this collection.
f
the function that is applied for its side-effect to every element. The result of function f is discarded.
attributes: abstract
definition classes: GenericTraversableTemplate
def foreach [U] ( f : (A) ⇒ U ) : Unit

Applies a function f to all elements of this collection.

Applies a function f to all elements of this collection.
U
the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.
f
the function that is applied for its side-effect to every element. The result of function f is discarded.
definition classes: TakenWhile → Transformed → GenericTraversableTemplate → TraversableLike → TraversableOnce → FilterMonadic
def genericBuilder [B] : Builder[B, Traversable[B]]

The generic builder that builds instances of CC at arbitrary element types.

The generic builder that builds instances of CC at arbitrary element types.
definition classes: GenericTraversableTemplate
def getClass () : java.lang.Class[_ <: java.lang.Object]

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

Returns a representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
returns
a representation that corresponds to the dynamic class of the receiver object.
attributes: final
definition classes: AnyRef
def groupBy [K] ( f : (A) ⇒ K ) : Map[K, TraversableView[A, Coll]]

Partitions this collection into a map of collections according to some discriminator function.
Partitions this collection into a map of collections according to some discriminator function.
Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new collection.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to collections such that the following invariant holds:
```
                (xs partition f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a collection of those elements x for which f(x) equals k.
definition classes: TraversableViewLike → TraversableLike
def hasDefiniteSize : Boolean

Tests whether this collection is known to have a finite size.

Tests whether this collection is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.
Note: many collection methods will not work on collections of infinite sizes.
returns
true if this collection is known to have finite size, false otherwise.
definition classes: TraversableLike → TraversableOnce
def hashCode () : Int

Returns a hash code value for the object.

Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.
returns
the hash code value for the object.
definition classes: AnyRef → Any
def head : A

Selects the first element of this collection.

Selects the first element of this collection.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the first element of this collection.
definition classes: TraversableLike
def headOption : Option[A]

Optionally selects the first element.

Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the first element of this collection if it is nonempty, None if it is empty.
definition classes: TraversableLike
def init : TraversableView[A, Coll]

Selects all elements except the last.

Selects all elements except the last.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
a collection consisting of all elements of this collection except the last one.
definition classes: TraversableViewLike → TraversableLike
def inits : Iterator[TraversableView[A, Coll]]

Iterates over the inits of this collection.
Iterates over the inits of this collection. The first value will be this collection and the final one will be an empty collection, with the intervening values the results of successive applications of init.
returns
an iterator over all the inits of this collection
definition classes: TraversableLike
Example :
1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
def isEmpty : Boolean

Tests whether this collection is empty.

Tests whether this collection is empty.
returns
true if the collection contain no elements, false otherwise.
definition classes: TraversableLike → TraversableOnce
def isInstanceOf [T0] : Boolean

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

This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.
attributes: final
definition classes: Any
def isTraversableAgain : Boolean

Tests whether this collection can be repeatedly traversed.

Tests whether this collection can be repeatedly traversed.
returns
true
attributes: final
definition classes: TraversableLike → TraversableOnce
def last : A

Selects the last element.

Selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
The last element of this collection.
definition classes: TraversableLike
def lastOption : Option[A]

Optionally selects the last element.

Optionally selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the last element of this collection$ if it is nonempty, None if it is empty.
definition classes: TraversableLike
def map [B] ( f : (A) ⇒ B ) : CC[B]

[use case] Builds a new collection by applying a function to all elements of this collection.

[use case]
Builds a new collection by applying a function to all elements of this collection.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new collection resulting from applying the given function f to each element of this collection and collecting the results.
attributes: abstract
definition classes: TraversableLike
def map [B, That] ( f : (A) ⇒ B )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

Builds a new collection by applying a function to all elements of this collection.

Builds a new collection by applying a function to all elements of this collection.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given function f to each element of this collection and collecting the results.
definition classes: TraversableViewLike → TraversableLike → FilterMonadic
def max : A

[use case] Finds the largest element.

[use case]
Finds the largest element.
returns
the largest element of this collection.
attributes: abstract
definition classes: TraversableOnce
def max [B >: A] (implicit cmp : Ordering[B] ) : A

Finds the largest element.

Finds the largest element.
B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the largest element of this collection with respect to the ordering cmp.
definition classes: TraversableOnce
def maxBy [B] ( f : (A) ⇒ B )(implicit cmp : Ordering[B] ) : A

definition classes: TraversableOnce
def min : A

[use case] Finds the smallest element.

[use case]
Finds the smallest element.
returns
the smallest element of this collection
attributes: abstract
definition classes: TraversableOnce
def min [B >: A] (implicit cmp : Ordering[B] ) : A

Finds the smallest element.

Finds the smallest element.
B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the smallest element of this collection with respect to the ordering cmp.
definition classes: TraversableOnce
def minBy [B] ( f : (A) ⇒ B )(implicit cmp : Ordering[B] ) : A

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

definition classes: ViewMkString → TraversableOnce → ViewMkString
def mkString ( sep : String ) : String

definition classes: ViewMkString → TraversableOnce → ViewMkString
def mkString : String

definition classes: ViewMkString → TraversableOnce → ViewMkString
def ne ( arg0 : AnyRef ) : Boolean

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

o.ne(arg0) is the same as !(o.eq(arg0)).
arg0
the object to compare against this object for reference dis-equality.
returns
false if the argument is not a reference to the receiver object; true otherwise.
attributes: final
definition classes: AnyRef
def newAppended [B >: A] ( that : Traversable[B] ) : Transformed[B]

attributes: protected
definition classes: TraversableViewLike
def newBuilder : Builder[A, TraversableView[A, Coll]]

The builder that builds instances of type CC[A]

The builder that builds instances of type CC[A]
attributes: protected[this]
definition classes: TraversableViewLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
def newDropped ( n : Int ) : Transformed[A]

attributes: protected
definition classes: TraversableViewLike
def newDroppedWhile ( p : (A) ⇒ Boolean ) : Transformed[A]

attributes: protected
definition classes: TraversableViewLike
def newFiltered ( p : (A) ⇒ Boolean ) : Transformed[A]

attributes: protected
definition classes: TraversableViewLike
def newFlatMapped [B] ( f : (A) ⇒ TraversableOnce[B] ) : Transformed[B]

attributes: protected
definition classes: TraversableViewLike
def newForced [B] ( xs : ⇒ Seq[B] ) : Transformed[B]

Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes
attributes: protected
definition classes: TraversableViewLike
def newMapped [B] ( f : (A) ⇒ B ) : Transformed[B]

attributes: protected
definition classes: TraversableViewLike
def newSliced ( _endpoints : SliceInterval ) : Transformed[A]

attributes: protected
definition classes: TraversableViewLike
def newTaken ( n : Int ) : Transformed[A]

attributes: protected
definition classes: TraversableViewLike
def newTakenWhile ( p : (A) ⇒ Boolean ) : Transformed[A]

attributes: protected
definition classes: TraversableViewLike
def nonEmpty : Boolean

Tests whether the collection is not empty.

Tests whether the collection is not empty.
returns
true if the collection contains at least one element, false otherwise.
definition classes: TraversableOnce
def notify () : Unit

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

Wakes up a single thread that is waiting on the receiver object's monitor.
attributes: final
definition classes: AnyRef
def notifyAll () : Unit

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

Wakes up all threads that are waiting on the receiver object's monitor.
attributes: final
definition classes: AnyRef
def par : ParIterable[A]

Returns a parallel implementation of this collection.

Returns a parallel implementation of this collection.
For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.
Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.
All parallel collections return a reference to themselves.
returns
a parallel implementation of this collection
definition classes: Parallelizable → Parallelizable
def parCombiner : Combiner[A, ParIterable[A]]

The default par implementation uses the combiner provided by this method to create a new parallel collection.

The default par implementation uses the combiner provided by this method to create a new parallel collection.
returns
a combiner for the parallel collection of type ParRepr
attributes: protected[this]
definition classes: TraversableLike → Parallelizable
def partition ( p : (A) ⇒ Boolean ) : (TraversableView[A, Coll], TraversableView[A, Coll])

Partitions this collection in two collections according to a predicate.

Partitions this collection in two collections according to a predicate.
p
the predicate on which to partition.
returns
a pair of collections: the first collection consists of all elements that satisfy the predicate p and the second collection consists of all elements that don't. The relative order of the elements in the resulting collections is the same as in the original collection.
definition classes: TraversableViewLike → TraversableLike
val pred : (A) ⇒ Boolean

attributes: protected[this] abstract
def product : A

[use case] Multiplies up the elements of this collection.

[use case]
Multiplies up the elements of this collection.
returns
the product of all elements in this collection of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the collection and as result type of product. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
definition classes: TraversableOnce
def product [B >: A] (implicit num : Numeric[B] ) : B

Multiplies up the elements of this collection.

Multiplies up the elements of this collection.
B
the result type of the * operator.
num
an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.
returns
the product of all elements of this collection with respect to the * operator in num.
definition classes: TraversableOnce
def reduceLeft [B >: A] ( op : (B, A) ⇒ B ) : B

Applies a binary operator to all elements of this collection, going left to right.
Applies a binary operator to all elements of this collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this collection, going left to right:
```
            op(...(op(x,,1,,, x,,2,,), ... ) , x,,n,,)
```
where x,,1,,, ..., x,,n,, are the elements of this collection.
definition classes: TraversableOnce
def reduceLeftOption [B >: A] ( op : (B, A) ⇒ B ) : Option[B]

Optionally applies a binary operator to all elements of this collection, going left to right.

Optionally applies a binary operator to all elements of this collection, going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this collection is nonempty, None otherwise.
definition classes: TraversableOnce
def reduceRight [B >: A] ( op : (A, B) ⇒ B ) : B

Applies a binary operator to all elements of this collection, going right to left.
Applies a binary operator to all elements of this collection, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this collection, going right to left:
```
            op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
```
where x,,1,,, ..., x,,n,, are the elements of this collection.
definition classes: TraversableOnce
def reduceRightOption [B >: A] ( op : (A, B) ⇒ B ) : Option[B]

Optionally applies a binary operator to all elements of this collection, going right to left.

Optionally applies a binary operator to all elements of this collection, going right to left.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this collection is nonempty, None otherwise.
definition classes: TraversableOnce
def repr : TraversableView[A, Coll]

The collection of type collection underlying this TraversableLike object.

The collection of type collection underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.
definition classes: TraversableLike
def reversed : List[A]

attributes: protected[this]
definition classes: TraversableOnce
def scanLeft [B, That] ( z : B )( op : (B, A) ⇒ B )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

Produces a collection containing cummulative results of applying the operator going left to right.

Produces a collection containing cummulative results of applying the operator going left to right.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results
definition classes: TraversableViewLike → TraversableLike
def scanRight [B, That] ( z : B )( op : (A, B) ⇒ B )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

Produces a collection containing cummulative results of applying the operator going right to left.
Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Example:
```
   List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
```
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results
definition classes: TraversableViewLike → TraversableLike
annotations: @migration( 2 , 9 , ... )
def seq : TraversableOnce[A]

A version of this collection with all of the operations implemented sequentially (i.

A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).
This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.
returns
a sequential view of the collection.
definition classes: TraversableOnce
def size : Int

The size of this collection.

The size of this collection.
Note: will not terminate for infinite-sized collections.
returns
the number of elements in this collection.
definition classes: TraversableOnce
def slice ( from : Int , until : Int ) : TraversableView[A, Coll]

Selects an interval of elements.
Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:
```
   from <= indexOf(x) < until
```
Note: might return different results for different runs, unless the underlying collection type is ordered.
from
the lowest index to include from this collection.
until
the highest index to EXCLUDE from this collection.
returns
a collection containing the elements greater than or equal to index from extending up to (but not including) index until of this collection.
definition classes: TraversableViewLike → TraversableLike
def span ( p : (A) ⇒ Boolean ) : (TraversableView[A, Coll], TraversableView[A, Coll])

Splits this collection into a prefix/suffix pair according to a predicate.

Splits this collection into a prefix/suffix pair according to a predicate.
Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the test predicate
returns
a pair consisting of the longest prefix of this collection whose elements all satisfy p, and the rest of this collection.
definition classes: TraversableViewLike → TraversableLike
def splitAt ( n : Int ) : (TraversableView[A, Coll], TraversableView[A, Coll])

Splits this collection into two at a given position.

Splits this collection into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the position at which to split.
returns
a pair of collections consisting of the first n elements of this collection, and the other elements.
definition classes: TraversableViewLike → TraversableLike
def stringPrefix : String

Defines the prefix of this object's toString representation.

Defines the prefix of this object's toString representation.
returns
a string representation which starts the result of toString applied to this collection. By default the string prefix is the simple name of the collection class collection.
definition classes: Transformed → TraversableViewLike → TraversableLike
def sum : A

[use case] Sums up the elements of this collection.

[use case]
Sums up the elements of this collection.
returns
the sum of all elements in this collection of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the collection and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
definition classes: TraversableOnce
def sum [B >: A] (implicit num : Numeric[B] ) : B

Sums up the elements of this collection.

Sums up the elements of this collection.
B
the result type of the + operator.
num
an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.
returns
the sum of all elements of this collection with respect to the + operator in num.
definition classes: TraversableOnce
def synchronized [T0] ( arg0 : ⇒ T0 ) : T0

attributes: final
definition classes: AnyRef
def tail : TraversableView[A, Coll]

Selects all elements except the first.

Selects all elements except the first.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
a collection consisting of all elements of this collection except the first one.
definition classes: TraversableLike
def tails : Iterator[TraversableView[A, Coll]]

Iterates over the tails of this collection.
Iterates over the tails of this collection. The first value will be this collection and the final one will be an empty collection, with the intervening values the results of successive applications of tail.
returns
an iterator over all the tails of this collection
definition classes: TraversableLike
Example :
1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
def take ( n : Int ) : TraversableView[A, Coll]

Selects first n elements.

Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
Tt number of elements to take from this collection.
returns
a collection consisting only of the first n elements of this collection, or else the whole collection, if it has less than n elements.
definition classes: TraversableViewLike → TraversableLike
def takeWhile ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

Takes longest prefix of elements that satisfy a predicate.

Takes longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
The predicate used to test elements.
returns
the longest prefix of this collection whose elements all satisfy the predicate p.
definition classes: TraversableViewLike → TraversableLike
def thisCollection : Traversable[A]

The underlying collection seen as an instance of CC.

The underlying collection seen as an instance of CC. By default this is implemented as the current collection object itself, but this can be overridden.
attributes: protected[this]
definition classes: TraversableLike
def thisSeq : Seq[A]

attributes: protected[this]
definition classes: ViewMkString → ViewMkString
def toArray : Array[A]

[use case] Converts this collection to an array.

[use case]
Converts this collection to an array.
Note: will not terminate for infinite-sized collections.
returns
an array containing all elements of this collection. A ClassManifest must be available for the element type of this collection.
attributes: abstract
definition classes: TraversableOnce
def toArray [B >: A] (implicit arg0 : ClassManifest[B] ) : Array[B]

Converts this collection to an array.

Converts this collection to an array.
Note: will not terminate for infinite-sized collections.
B
the type of the elements of the array. A ClassManifest for this type must be available.
returns
an array containing all elements of this collection.
definition classes: TraversableOnce
def toBuffer [B >: A] : Buffer[B]

Converts this collection to a mutable buffer.

Converts this collection to a mutable buffer.
Note: will not terminate for infinite-sized collections.
returns
a buffer containing all elements of this collection.
definition classes: TraversableOnce
def toCollection ( repr : TraversableView[A, Coll] ) : Traversable[A]

A conversion from collections of type Repr to CC objects.

A conversion from collections of type Repr to CC objects. By default this is implemented as just a cast, but this can be overridden.
attributes: protected[this]
definition classes: TraversableLike
def toIndexedSeq [B >: A] : IndexedSeq[B]

Converts this collection to an indexed sequence.

Converts this collection to an indexed sequence.
Note: will not terminate for infinite-sized collections.
returns
an indexed sequence containing all elements of this collection.
definition classes: TraversableOnce
def toIterable : Iterable[A]

Converts this collection to an iterable collection.

Converts this collection to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).
Note: will not terminate for infinite-sized collections.
returns
an Iterable containing all elements of this collection.
definition classes: TraversableOnce
def toIterator : Iterator[A]

Returns an Iterator over the elements in this collection.

Returns an Iterator over the elements in this collection. Will return the same Iterator if this instance is already an Iterator.
Note: will not terminate for infinite-sized collections.
returns
an Iterator containing all elements of this collection.
definition classes: TraversableLike → TraversableOnce
def toList : List[A]

Converts this collection to a list.

Converts this collection to a list.
Note: will not terminate for infinite-sized collections.
returns
a list containing all elements of this collection.
definition classes: TraversableOnce
def toMap [T, U] : Map[T, U]

[use case] Converts this collection to a map.

[use case]
Converts this collection to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
Note: will not terminate for infinite-sized collections.
returns
a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this collection.
attributes: abstract
definition classes: TraversableOnce
def toMap [T, U] (implicit ev : <:<[A, (T, U)] ) : Map[T, U]

Converts this collection to a map.

Converts this collection to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
Note: will not terminate for infinite-sized collections.
returns
a map containing all elements of this collection.
definition classes: TraversableOnce
def toSeq : Seq[A]

Converts this collection to a sequence.

Converts this collection to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.
Note: will not terminate for infinite-sized collections.
returns
a sequence containing all elements of this collection.
definition classes: TraversableOnce
def toSet [B >: A] : Set[B]

Converts this collection to a set.

Converts this collection to a set.
Note: will not terminate for infinite-sized collections.
returns
a set containing all elements of this collection.
definition classes: TraversableOnce
def toStream : Stream[A]

Converts this collection to a stream.

Converts this collection to a stream.
Note: will not terminate for infinite-sized collections.
returns
a stream containing all elements of this collection.
definition classes: TraversableLike → TraversableOnce
def toString () : String

Converts this collection to a string.

Converts this collection to a string.
returns
a string representation of this collection. By default this string consists of the stringPrefix of this collection, followed by all elements separated by commas and enclosed in parentheses.
definition classes: Transformed → TraversableViewLike → TraversableLike → AnyRef → Any
def toTraversable : Traversable[A]

Converts this collection to an unspecified Traversable.

Converts this collection to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
Note: will not terminate for infinite-sized collections.
returns
a Traversable containing all elements of this collection.
definition classes: TraversableLike → TraversableOnce
def transpose [B] (implicit asTraversable : (A) ⇒ TraversableOnce[B] ) : Traversable[Traversable[B]]

Transposes this collection of traversable collections into a collection of collections.

Transposes this collection of traversable collections into a collection of collections.
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this collection is a Traversable.
returns
a two-dimensional collection of collections which has as nth row the nth column of this collection.
definition classes: GenericTraversableTemplate
annotations: @migration( 2 , 9 , ... )
lazy val underlying : Coll

definition classes: Transformed → TraversableViewLike
def unzip [A1, A2] (implicit asPair : (A) ⇒ (A1, A2) ) : (Traversable[A1], Traversable[A2])

Converts this collection of pairs into two collections of the first and second half of each pair.

Converts this collection of pairs into two collections of the first and second half of each pair.
asPair
an implicit conversion which asserts that the element type of this collection is a pair.
returns
a pair collections, containing the first, respectively second half of each element pair of this collection.
definition classes: GenericTraversableTemplate
def unzip3 [A1, A2, A3] (implicit asTriple : (A) ⇒ (A1, A2, A3) ) : (Traversable[A1], Traversable[A2], Traversable[A3])

Converts this collection of triples into three collections of the first, second, and third element of each triple.

Converts this collection of triples into three collections of the first, second, and third element of each triple.
returns
a triple collections, containing the first, second, respectively third member of each element triple of this collection.
definition classes: GenericTraversableTemplate
def view ( from : Int , until : Int ) : TraversableView[A, TraversableView[A, Coll]]

Creates a non-strict view of a slice of this collection.

Creates a non-strict view of a slice of this collection.
Note: the difference between view and slice is that view produces a view of the current collection, whereas slice produces a new collection.
Note: view(from, to) is equivalent to view.slice(from, to)
Note: might return different results for different runs, unless the underlying collection type is ordered.
from
the index of the first element of the view
until
the index of the element following the view
returns
a non-strict view of a slice of this collection, starting at index from and extending up to (but not including) index until.
definition classes: TraversableLike
def view : TraversableView[A, TraversableView[A, Coll]]

Creates a non-strict view of this collection.

Creates a non-strict view of this collection.
returns
a non-strict view of this collection.
definition classes: TraversableLike
def viewIdString : String

attributes: protected[this] final
definition classes: Transformed → TraversableViewLike
def viewIdentifier : String

attributes: protected[this] final
definition classes: TakenWhile → TraversableViewLike
def viewToString : String

definition classes: TraversableViewLike
def wait () : Unit

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

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

attributes: final
definition classes: AnyRef
annotations: @throws()
def withFilter ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

Creates a non-strict filter of this collection.

Creates a non-strict filter of this collection.
Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the predicate used to test elements.
returns
an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this collection which satisfy the predicate p.
definition classes: TraversableViewLike → TraversableLike → FilterMonadic

TakenWhile

trait TakenWhile extends Transformed[A]

Type Members

type Self = TraversableView[A, Coll]

Value Members

def != ( arg0 : AnyRef ) : Boolean

def != ( arg0 : Any ) : Boolean

def ## () : Int

def $asInstanceOf [T0] () : T0

def $isInstanceOf [T0] () : Boolean

def ++ [B] ( that : TraversableOnce[B] ) : CC[B]

def ++ [B >: A, That] ( xs : TraversableOnce[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

def ++: [B >: A, That] ( that : Traversable[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

def ++: [B] ( that : TraversableOnce[B] ) : CC[B]

def ++: [B >: A, That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

def /: [B] ( z : B )( op : (B, A) ⇒ B ) : B

def :\ [B] ( z : B )( op : (A, B) ⇒ B ) : B

def == ( arg0 : AnyRef ) : Boolean

def == ( arg0 : Any ) : Boolean

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

def addString ( b : StringBuilder ) : StringBuilder

def addString ( b : StringBuilder , sep : String ) : StringBuilder

def asInstanceOf [T0] : T0

def clone () : AnyRef

def collect [B] ( pf : PartialFunction[A, B] ) : CC[B]

def collect [B, That] ( pf : PartialFunction[A, B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

def collectFirst [B] ( pf : PartialFunction[A, B] ) : Option[B]

def companion : GenericCompanion[Traversable]

def copyToArray ( xs : Array[A] , start : Int , len : Int ) : Unit

def copyToArray [B >: A] ( xs : Array[B] , start : Int , len : Int ) : Unit

def copyToArray ( xs : Array[A] ) : Unit

def copyToArray [B >: A] ( xs : Array[B] ) : Unit

def copyToArray ( xs : Array[A] , start : Int ) : Unit

def copyToArray [B >: A] ( xs : Array[B] , start : Int ) : Unit

def copyToBuffer [B >: A] ( dest : Buffer[B] ) : Unit

def count ( p : (A) ⇒ Boolean ) : Int

def drop ( n : Int ) : TraversableView[A, Coll]

def dropWhile ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

def eq ( arg0 : AnyRef ) : Boolean

def equals ( arg0 : Any ) : Boolean

def exists ( p : (A) ⇒ Boolean ) : Boolean

def filter ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

def filterNot ( p : (A) ⇒ Boolean ) : TraversableView[A, Coll]

def finalize () : Unit

def find ( p : (A) ⇒ Boolean ) : Option[A]

def flatMap [B] ( f : (A) ⇒ TraversableOnce[B] ) : CC[B]

def flatMap [B, That] ( f : (A) ⇒ TraversableOnce[B] )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

def flatten [B] : CC[B]

def flatten [B] (implicit asTraversable : (A) ⇒ TraversableOnce[B] ) : Traversable[B]

def foldLeft [B] ( z : B )( op : (B, A) ⇒ B ) : B

def foldRight [B] ( z : B )( op : (A, B) ⇒ B ) : B

def forall ( p : (A) ⇒ Boolean ) : Boolean

def force [B >: A, That] (implicit bf : CanBuildFrom[Coll, B, That] ) : That

def foreach ( f : (A) ⇒ Unit ) : Unit

def foreach [U] ( f : (A) ⇒ U ) : Unit

def genericBuilder [B] : Builder[B, Traversable[B]]

def getClass () : java.lang.Class[_ <: java.lang.Object]

def groupBy [K] ( f : (A) ⇒ K ) : Map[K, TraversableView[A, Coll]]

def hasDefiniteSize : Boolean

def hashCode () : Int

def head : A

def headOption : Option[A]

def init : TraversableView[A, Coll]

def inits : Iterator[TraversableView[A, Coll]]

def isEmpty : Boolean

def isInstanceOf [T0] : Boolean

def isTraversableAgain : Boolean

def last : A

def lastOption : Option[A]

def map [B] ( f : (A) ⇒ B ) : CC[B]

def map [B, That] ( f : (A) ⇒ B )(implicit bf : CanBuildFrom[TraversableView[A, Coll], B, That] ) : That

def max : A

def max [B >: A] (implicit cmp : Ordering[B] ) : A

def maxBy [B] ( f : (A) ⇒ B )(implicit cmp : Ordering[B] ) : A

def min : A

def min [B >: A] (implicit cmp : Ordering[B] ) : A

def minBy [B] ( f : (A) ⇒ B )(implicit cmp : Ordering[B] ) : A

def mkString ( start : String , sep : String , end : String ) : String

def mkString ( sep : String ) : String

def mkString : String