scala.collection.TraversableViewLike.FlatMapped

Transformed

trait Transformed[+B] extends TraversableView[B, Coll]

definition classes: TraversableViewLike

Inherits

  1. TraversableView
  2. TraversableViewLike
  3. Traversable
  4. GenericTraversableTemplate
  5. TraversableLike
  6. HasNewBuilder
  7. AnyRef
  8. Any

Type Members

  1. trait Appended[B >: A] extends Transformed[B]

  2. trait DroppedWhile extends Transformed[A]

  3. trait Filtered extends Transformed[A]

  4. trait FlatMapped[B] extends Transformed[B]

  5. trait Mapped[B] extends Transformed[B]

  6. trait Sliced extends Transformed[A]

    pre: from >= 0

  7. trait TakenWhile extends Transformed[A]

  8. trait Transformed[+B] extends TraversableView[B, Coll]

  9. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def ++[B >: B, That](that: Iterator[B])(bf: CanBuildFrom[TraversableView[B, Coll], B, That]): That

    Concatenates this collection with the elements of an iterator

    Concatenates this collection with the elements of an iterator.

    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 iterator 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: TraversableViewLikeTraversableLike
  2. def ++[B >: B, That](that: Traversable[B])(bf: CanBuildFrom[TraversableView[B, 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.

    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: TraversableViewLikeTraversableLike
  3. def /:[B](z: B)(op: (B, B) ⇒ 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, x1), x2), ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this collection.

    definition classes: TraversableLike
  4. def :\[B](z: B)(op: (B, 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(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this collection.

    definition classes: TraversableLike
  5. 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: TraversableLike
  6. 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: TraversableLike
  7. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this collection to a string builder using start, end, and separator strings

    Appends all elements of this collection to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this collection are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  8. def companion: GenericCompanion[Traversable[A][A]]

    The factory companion object that builds instances of class CC

    The factory companion object that builds instances of class CC.

    definition classes: TraversableGenericTraversableTemplate
  9. def copyToArray[B >: B](xs: Array[B]): Unit

    Copies elements of this collection to an array

    Copies elements of this collection to an array. Fills the given array xs with all elements of this collection, starting at position 0. 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: TraversableLike
  10. def copyToArray[B >: B](xs: Array[B], start: Int): Unit

    Copies elements of this collection to an array

    Copies elements of this collection to an array. Fills the given array xs with all 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.

    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: TraversableLike
  11. def copyToArray[B >: B](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
  12. def copyToBuffer[B >: B](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: TraversableLike
  13. def count(p: (B) ⇒ 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: TraversableLike
  14. def drop(n: Int): TraversableView[B, 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: TraversableViewLikeTraversableLike
  15. def dropWhile(p: (B) ⇒ Boolean): TraversableView[B, 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: TraversableViewLikeTraversableLike
  16. 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 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
  17. def exists(p: (B) ⇒ 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
  18. def filter(p: (B) ⇒ Boolean): TraversableView[B, 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: TraversableViewLikeTraversableLike
  19. def filterNot(p: (B) ⇒ Boolean): TraversableView[B, 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
  20. def find(p: (B) ⇒ Boolean): Option[B]

    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
  21. def flatMap[B, That](f: (B) ⇒ Traversable[B])(bf: CanBuildFrom[TraversableView[B, 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: TraversableViewLikeTraversableLike
  22. def flatten[B](asTraversable: (B) ⇒ Traversable[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
  23. def foldLeft[B](z: B)(op: (B, B) ⇒ 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, x1), x2, ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this collection.

    definition classes: TraversableLike
  24. def foldRight[B](z: B)(op: (B, 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(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this collection.

    definition classes: TraversableLike
  25. def forall(p: (B) ⇒ 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
  26. def force[B >: B, That](bf: CanBuildFrom[Coll, B, That]): That

  27. def foreach[U](f: (B) ⇒ 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.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  28. 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
  29. def groupBy[K](f: (B) ⇒ K): Map[K, TraversableView[B, 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: TraversableLike
  30. 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.

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

    definition classes: AnyRef ⇐ Any
  32. def head: B

    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.

    definition classes: TraversableLike
  33. def headOption: Option[B]

    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.

    definition classes: TraversableLike
  34. def init: TraversableView[B, 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.

    definition classes: TraversableViewLikeTraversableLike
  35. def isEmpty: Boolean

    Tests whether this collection is empty

    Tests whether this collection is empty.

    definition classes: TraversableLike
  36. def last: B

    Selects the last element

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    definition classes: TraversableLike
  37. def lastOption: Option[B]

    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.

    definition classes: TraversableLike
  38. def map[B, That](f: (B) ⇒ B)(bf: CanBuildFrom[TraversableView[B, 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: TraversableViewLikeTraversableLike
  39. def max[B >: B](cmp: Ordering[B]): B

    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: TraversableLike
  40. def min[B >: B](cmp: Ordering[B]): B

    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: TraversableLike
  41. def mkString: String

    Displays all elements of this collection in a string

    Displays all elements of this collection in a string.

    definition classes: TraversableLike
  42. def mkString(sep: String): String

    Displays all elements of this collection in a string using a separator string

    Displays all elements of this collection in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this collection. In the resulting string the string representations (w.r.t. the method toString) of all elements of this collection are separated by the string sep.

    definition classes: TraversableLike
  43. def mkString(start: String, sep: String, end: String): String

    Displays all elements of this collection in a string using start, end, and separator strings

    Displays all elements of this collection in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this collection. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this collection are separated by the string sep.

    definition classes: TraversableLike
  44. def nonEmpty: Boolean

    Tests whether the collection is not empty

    Tests whether the collection is not empty.

    definition classes: TraversableLike
  45. def partialMap[B, That](pf: PartialFunction[B, B])(bf: CanBuildFrom[TraversableView[B, 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: TraversableLike
  46. def partition(p: (B) ⇒ Boolean): (TraversableView[B, Coll], TraversableView[B, 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: TraversableLike
  47. def product[B >: B](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: TraversableLike
  48. def reduceLeft[B >: B](op: (B, B) ⇒ 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(x1, x2), ... ) , xn) }}} where x,,1,,, ..., x,,n,, are the elements of this collection.

    definition classes: TraversableLike
  49. def reduceLeftOption[B >: B](op: (B, B) ⇒ 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: TraversableLike
  50. def reduceRight[B >: B](op: (B, 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(x1, op(x2, ..., op(xn-1, xn)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this collection.

    definition classes: TraversableLike
  51. def reduceRightOption[B >: B](op: (B, 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: TraversableLike
  52. def repr: TraversableView[B, 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
  53. def size: Int

    The size of this collection

    The size of this collection.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  54. def slice(from: Int, until: Int): TraversableView[B, Coll]

    Selects an interval of elements

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the index of the first returned element in this collection.

    until

    the index one past the last returned element in this collection.

    returns

    a collection containing the elements starting at index from and extending up to (but not including) index until of this collection.

    definition classes: TraversableViewLikeTraversableLike
  55. def span(p: (B) ⇒ Boolean): (TraversableView[B, Coll], TraversableView[B, Coll])

    Spits this collection into a prefix/suffix pair according to a predicate

    Spits 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: TraversableViewLikeTraversableLike
  56. def splitAt(n: Int): (TraversableView[B, Coll], TraversableView[B, 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: TraversableViewLikeTraversableLike
  57. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: TraversableViewLikeTraversableLike
  58. def sum[B >: B](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: TraversableLike
  59. def tail: TraversableView[B, 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.

    definition classes: TraversableLike
  60. def take(n: Int): TraversableView[B, 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: TraversableViewLikeTraversableLike
  61. def takeWhile(p: (B) ⇒ Boolean): TraversableView[B, 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: TraversableViewLikeTraversableLike
  62. def toArray[B >: B](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: TraversableLike
  63. def toIndexedSeq[B >: B]: IndexedSeq[B]

    Converts this collection to an indexed sequence

    Converts this collection to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  64. def toIterable: Iterable[B]

    Converts this collection to an iterable collection

    Converts this collection to an iterable collection.

    Note: Will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  65. def toList: List[B]

    Converts this collection to a list

    Converts this collection to a list.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  66. def toSeq: Seq[B]

    Converts this collection to a sequence

    Converts this collection to a sequence.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  67. def toSet[B >: B]: Set[B]

    Converts this collection to a set

    Converts this collection to a set.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  68. def toStream: Stream[B]

    Converts this collection to a stream

    Converts this collection to a stream.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  69. def toString(): String

    Converts this collection to a string

    Converts this collection to a string

    definition classes: TraversableLike ⇐ AnyRef ⇐ Any
  70. def transpose[B](asTraversable: (B) ⇒ Traversable[B]): Traversable[Traversable[B]]

    Transposes this collection of traversable collections into

    Transposes this collection of traversable collections into

    definition classes: GenericTraversableTemplate
  71. var underlying: Coll

  72. def unzip[A1, A2](asPair: (B) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

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

    Converts this collection of pairs into two collections of the first and second halfs 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
  73. def view(from: Int, until: Int): TraversableView[B, TraversableView[B, 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
  74. def view: TraversableView[B, TraversableView[B, Coll]]

    Creates a non-strict view of this collection

    Creates a non-strict view of this collection.

    definition classes: TraversableLike
  75. def withFilter(p: (B) ⇒ Boolean): WithFilter

    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 satify the predicate p.

    definition classes: TraversableLike