scala.collection

GenMap

trait GenMap [A, +B] extends GenMapLike[A, B, GenMap[A, B]] with GenIterable[(A, B)]

A trait for all traversable collections which may possibly have their operations implemented in parallel.

Source
GenMap.scala
Since

2.9

Linear Supertypes
GenIterable[(A, B)], GenTraversable[(A, B)], GenericTraversableTemplate[(A, B), GenIterable], HasNewBuilder[(A, B), GenIterable[(A, B)]], GenMapLike[A, B, GenMap[A, B]], Equals, GenIterableLike[(A, B), GenMap[A, B]], GenTraversableLike[(A, B), GenMap[A, B]], Parallelizable[(A, B), ParMap[A, B]], GenTraversableOnce[(A, B)], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. GenMap
  2. GenIterable
  3. GenTraversable
  4. GenericTraversableTemplate
  5. HasNewBuilder
  6. GenMapLike
  7. Equals
  8. GenIterableLike
  9. GenTraversableLike
  10. Parallelizable
  11. GenTraversableOnce
  12. AnyRef
  13. Any
Visibility
  1. Public
  2. All

Abstract Value Members

  1. def + [B1 >: B] (kv: (A, B1)): GenMap[A, B1]

    Attributes
    abstract
    Definition Classes
    GenMapLike
  2. def ++ [B >: (A, B), That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[GenMap[A, B], 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  3. def - (key: A): GenMap[A, B]

    Attributes
    abstract
    Definition Classes
    GenMapLike
  4. def /: [B] (z: B)(op: (B, (A, 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, x,,1,,), x,,2,,), ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  5. def :\ [B] (z: B)(op: ((A, 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(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  6. def aggregate [B] (z: B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

       pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
    

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  7. def apply (key: A): B

    Attributes
    abstract
    Definition Classes
    GenMapLike
  8. def canEqual (that: Any): Boolean

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass.

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

    that

    the value being probed for possible equality

    returns

    true if this instance can possibly equal that, otherwise false

    Attributes
    abstract
    Definition Classes
    Equals
  9. def collect [B, That] (pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[GenMap[A, B], 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  10. def copyToArray [B >: (A, B)] (xs: Array[B], start: Int, len: Int): Unit

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  11. def copyToArray [B >: (A, B)] (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, beginning at index 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  12. def copyToArray [B >: (A, B)] (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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  13. def count (p: ((A, 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  14. def default (key: A): B

    Attributes
    abstract
    Definition Classes
    GenMapLike
  15. def drop (n: Int): GenMap[A, B]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  16. def dropWhile (pred: ((A, B)) ⇒ Boolean): GenMap[A, B]

    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.

    returns

    the longest suffix of this collection whose first element does not satisfy the predicate p.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  17. def exists (pred: ((A, B)) ⇒ Boolean): Boolean

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  18. def filter (pred: ((A, B)) ⇒ Boolean): GenMap[A, B]

    Selects all elements of this collection which satisfy a predicate.

    Selects all elements of this collection which satisfy a predicate.

    returns

    a new collection consisting of all elements of this collection that satisfy the given predicate p. Their order may not be preserved.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  19. def filterNot (pred: ((A, B)) ⇒ Boolean): GenMap[A, B]

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

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

    returns

    a new collection consisting of all elements of this collection that do not satisfy the given predicate p. Their order may not be preserved.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  20. def find (pred: ((A, B)) ⇒ Boolean): Option[(A, 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.

    returns

    an option value containing the first element in the collection that satisfies p, or None if none exists.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  21. def flatMap [B, That] (f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[GenMap[A, B], 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  22. def fold [A1 >: (A, B)] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this sequence using the specified associative binary operator.

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.

    z

    a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. Nil for list concatenation, 0 for addition, or 1 for multiplication)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  23. def foldLeft [B] (z: B)(op: (B, (A, 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, x,,1,,), x,,2,,, ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  24. def foldRight [B] (z: B)(op: ((A, 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(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  25. def forall (pred: ((A, B)) ⇒ Boolean): Boolean

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  26. def foreach [U] (f: ((A, 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
  27. def get (key: A): Option[B]

    Attributes
    abstract
    Definition Classes
    GenMapLike
  28. def groupBy [K] (f: ((A, B)) ⇒ K): GenMap[K, GenMap[A, B]]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  29. def hasDefiniteSize : Boolean

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  30. def iterator : Iterator[(A, B)]

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  31. def map [B, That] (f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[GenMap[A, B], 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  32. def max [A1 >: (A, B)] (implicit ord: Ordering[A1]): (A, B)

    Finds the largest element.

    Finds the largest element.

    returns

    the largest element of this collection with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  33. def maxBy [B] (f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  34. def min [A1 >: (A, B)] (implicit ord: Ordering[A1]): (A, B)

    Finds the smallest element.

    Finds the smallest element.

    returns

    the smallest element of this collection with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  35. def minBy [B] (f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  36. def mkString : String

    Displays all elements of this collection in a string.

    Displays all elements of this collection in a 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 follow each other without any separator string.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  37. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  40. def parCombiner : Combiner[(A, B), ParMap[A, B]]

    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] abstract
    Definition Classes
    Parallelizable
  41. def partition (pred: ((A, B)) ⇒ Boolean): (GenMap[A, B], GenMap[A, B])

    Partitions this collection in two collections according to a predicate.

    Partitions this collection in two collections according to a predicate.

    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 may not be preserved.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  42. def product [A1 >: (A, B)] (implicit num: Numeric[A1]): A1

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  43. def reduce [A1 >: (A, B)] (op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this sequence using the specified associative binary operator.

    Reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the collection is nonempty.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  44. def reduceLeftOption [B >: (A, B)] (op: (B, (A, 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  45. def reduceOption [A1 >: (A, B)] (op: (A1, A1) ⇒ A1): Option[A1]

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  46. def reduceRight [B >: (A, B)] (op: ((A, 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(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  47. def reduceRightOption [B >: (A, B)] (op: ((A, 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  48. def repr : GenMap[A, B]

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  49. def sameElements [A1 >: (A, B)] (that: GenIterable[A1]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this collection.

    Checks if the other iterable collection contains the same elements in the same order as this collection.

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

    Note: will not terminate for infinite-sized collections.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  50. def scan [B >: (A, B), That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[GenMap[A, B], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new collection containing the prefix scan of the elements in this collection

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  51. def scanLeft [B, That] (z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[GenMap[A, B], 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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  52. def scanRight [B, That] (z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[GenMap[A, B], 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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
    Annotations
    @migration
    Migration

    "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

  53. def seq : Map[A, B]

    Attributes
    abstract
    Definition Classes
    GenMapGenIterableGenTraversable → GenMapLike → ParallelizableGenTraversableOnce
  54. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  55. def slice (unc_from: Int, unc_until: Int): GenMap[A, B]

    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.

    returns

    a collection containing the elements greater than or equal to index from extending up to (but not including) index until of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  56. def span (pred: ((A, B)) ⇒ Boolean): (GenMap[A, B], GenMap[A, B])

    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.

    returns

    a pair consisting of the longest prefix of this collection whose elements all satisfy p, and the rest of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  57. def splitAt (n: Int): (GenMap[A, B], GenMap[A, B])

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  58. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  59. def sum [A1 >: (A, B)] (implicit num: Numeric[A1]): A1

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  60. def take (n: Int): GenMap[A, B]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  61. def takeWhile (pred: ((A, B)) ⇒ Boolean): GenMap[A, B]

    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.

    returns

    the longest prefix of this collection whose elements all satisfy the predicate p.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  62. def toArray [A1 >: (A, B)] (implicit arg0: ClassManifest[A1]): Array[A1]

    Converts this collection to an array.

    Converts this collection to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  63. def toBuffer [A1 >: (A, B)] : Buffer[A1]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  64. def toIndexedSeq [A1 >: (A, B)] : IndexedSeq[A1]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  65. def toIterable : GenIterable[(A, B)]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  66. def toIterator : Iterator[(A, B)]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  67. def toList : List[(A, B)]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  68. def toMap [K, V] (implicit ev: <:<[(A, B), (K, V)]): GenMap[K, V]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  69. def toSeq : GenSeq[(A, B)]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  70. def toSet [A1 >: (A, B)] : GenSet[A1]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  71. def toStream : Stream[(A, B)]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  72. def toTraversable : GenTraversable[(A, B)]

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  73. def zip [A1 >: (A, B), B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[GenMap[A, B], (A1, B), That]): That

    Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs.

    Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    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 (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this collection and that. The length of the returned collection is the minimum of the lengths of this collection and that.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  74. def zipAll [B, A1 >: (A, B), That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[GenMap[A, B], (A1, B), That]): That

    Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs.

    Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

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

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this collection is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this collection.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this collection and that. The length of the returned collection is the maximum of the lengths of this collection and that. If this collection is shorter than that, thisElem values are used to pad the result. If that is shorter than this collection, thatElem values are used to pad the result.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  75. def zipWithIndex [A1 >: (A, B), That] (implicit bf: CanBuildFrom[GenMap[A, B], (A1, Int), That]): That

    Zips this collection with its indices.

    Zips this collection with its indices.

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    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 (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

    A new collection of type That containing pairs consisting of all elements of this collection paired with their index. Indices start at 0.

    Attributes
    abstract
    Definition Classes
    GenIterableLike

Concrete Value Members

  1. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  2. def != (arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

    true if !(this == that), false otherwise.

    Attributes
    final
    Definition Classes
    Any
  3. def ## (): Int

    Equivalent to x.hashCode except for boxed numeric types.

    Equivalent to x.hashCode except for boxed numeric types. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them.

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def ++ [B] (that: GenTraversableOnce[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 of type That which contains all elements of this collection followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  5. def /:\ [A1 >: (A, B)] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Definition Classes
    GenTraversableOnce
  6. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  7. def == (arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  8. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  9. def clone (): AnyRef

    Create a copy of the receiver object.

    Create 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()
  10. def collect [B] (pf: PartialFunction[(A, B), 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 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  11. def companion : GenericCompanion[GenIterable]

    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
    GenIterableGenTraversableGenericTraversableTemplate
  12. def copyToArray (xs: Array[(A, B)], 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, beginning at index start. 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
    GenTraversableOnce
  13. def copyToArray (xs: Array[(A, B)]): 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
    GenTraversableOnce
  14. def eq (arg0: AnyRef): Boolean

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional 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).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  15. def equals (that: Any): Boolean

    Compares two maps structurally; i.

    Compares two maps structurally; i.e. checks if all mappings contained in this map are also contained in the other map, and vice versa.

    that

    the other map

    returns

    true if both maps contain exactly the same mappings, false otherwise.

    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  16. def finalize (): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the finalize method is 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()
  17. def flatMap [B] (f: ((A, B)) ⇒ GenTraversableOnce[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 of type That resulting from applying the given collection-valued function f to each element of this collection and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  18. 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
  19. def flatten [B] (implicit asTraversable: ((A, B)) ⇒ TraversableOnce[B]): GenIterable[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
  20. def foreach (f: ((A, B)) ⇒ 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
  21. def genericBuilder [B] : Builder[B, GenIterable[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
  22. def getClass (): java.lang.Class[_ <: java.lang.Object]

    A representation that corresponds to the dynamic class of the receiver object.

    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
  23. def hashCode (): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in Any.

    returns

    the hash code value for this object.

    Definition Classes
    GenMapLike → AnyRef → Any
  24. def head : (A, B)

    Definition Classes
    GenIterableLike → GenTraversableLike
  25. def isEmpty : Boolean

    Tests whether the collection is empty.

    Tests whether the collection is empty.

    returns

    true if the collection contains no elements, false otherwise.

    Definition Classes
    GenIterableLike → GenTraversableOnce
  26. def isInstanceOf [T0] : Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the 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 specified type.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    Attributes
    final
    Definition Classes
    Any
  27. 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
    GenTraversableLike → GenTraversableOnce
  28. def map [B] (f: ((A, B)) ⇒ 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 of type That resulting from applying the given function f to each element of this collection and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  29. def max : (A, B)

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this collection with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  30. def min : (A, B)

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this collection with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  31. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

    true if the argument is not a reference to the receiver object; false otherwise.

    Attributes
    final
    Definition Classes
    AnyRef
  32. def newBuilder : Builder[(A, B), GenIterable[(A, B)]]

    The builder that builds instances of type CC[A]

    The builder that builds instances of type CC[A]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplateHasNewBuilder
  33. 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
  34. 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
  35. def par : ParMap[A, B]

    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
  36. def product : (A, B)

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements of this collection with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  37. def sameElements (that: GenIterable[(A, B)]): Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this collection.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this collection.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  38. def sum : (A, B)

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements of this collection with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  39. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  40. def tail : GenMap[A, B]

    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
    GenTraversableLike
  41. def toArray : Array[(A, B)]

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  42. 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 containing all elements of this collection.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  43. def toString (): String

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

    a String representation of the object.

    Definition Classes
    AnyRef → Any
  44. def transpose [B] (implicit asTraversable: ((A, B)) ⇒ TraversableOnce[B]): GenIterable[GenIterable[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
    Migration

    "As of 2.9, transpose throws an exception if collections are not uniformly sized."

  45. def unzip [A1, A2] (implicit asPair: ((A, B)) ⇒ (A1, A2)): (GenIterable[A1], GenIterable[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
  46. def unzip3 [A1, A2, A3] (implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (GenIterable[A1], GenIterable[A2], GenIterable[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
  47. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  48. def wait (arg0: Long, arg1: Int): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  49. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  50. def zip [B] (that: GenIterable[B]): CC[((A, B), B)]

    [use case] Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this collection and that. The length of the returned collection is the minimum of the lengths of this collection and that.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  51. def zipAll [B] (that: Iterable[B], thisElem: (A, B), thatElem: B): CC[((A, B), B)]

    [use case] Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a collection formed from this collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this collection is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this collection.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this collection and that. The length of the returned collection is the maximum of the lengths of this collection and that. If this collection is shorter than that, thisElem values are used to pad the result. If that is shorter than this collection, thatElem values are used to pad the result.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  52. def zipWithIndex : CC[((A, B), Int)]

    [use case] Zips this collection with its indices.

    [use case]

    Zips this collection with its indices.

    returns

    A new collection of type That containing pairs consisting of all elements of this collection paired with their index. Indices start at 0.

    Attributes
    abstract
    Definition Classes
    GenIterableLike

Inherited from GenIterable[(A, B)]

Inherited from GenTraversable[(A, B)]

Inherited from GenericTraversableTemplate[(A, B), GenIterable]

Inherited from HasNewBuilder[(A, B), GenIterable[(A, B)]]

Inherited from GenMapLike[A, B, GenMap[A, B]]

Inherited from Equals

Inherited from GenIterableLike[(A, B), GenMap[A, B]]

Inherited from GenTraversableLike[(A, B), GenMap[A, B]]

Inherited from Parallelizable[(A, B), ParMap[A, B]]

Inherited from GenTraversableOnce[(A, B)]

Inherited from AnyRef

Inherited from Any