scala.collection.mutable

MultiMap

trait MultiMap[A, B] extends Map[A, Set[B]]

This class is typically used as a mixin. It turns maps which map A to Set[B] objects into multi maps which map A to B objects.

Inherits

  1. Map
  2. MapLike
  3. Shrinkable
  4. Builder
  5. Growable
  6. MapLikeBase
  7. Cloneable
  8. Map
  9. MapLike
  10. Subtractable
  11. PartialFunction
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableLike
  16. Equals
  17. Traversable
  18. Mutable
  19. Traversable
  20. GenericTraversableTemplate
  21. TraversableLike
  22. HasNewBuilder
  23. AnyRef
  24. Any

Type Members

  1. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def +(elem1: (A, Set[B]), elem2: (A, Set[B]), elems: (A, Set[B])*): MapLike[A, Set[B], Map[A, Set[B]]]

    Adds two or more key/value mappings and return the map itself

    Adds two or more key/value mappings and return the map itself. with the added elements.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    definition classes: MapLike
  2. def +(kv: (A, Set[B])): MapLike[A, Set[B], Map[A, Set[B]]]

    Add a new key/value mapping and return the map itself

    Add a new key/value mapping and return the map itself.

    kv

    the key/value mapping to be added

    definition classes: MapLike
  3. def +[B1 >: Set[B]](kv: (A, B1)): Map[A, B1]

    Adds a key/value pair to this map, returning a new map

    Adds a key/value pair to this map, returning a new map.

    B1

    the type of the value in the key/value pair.

    kv

    the key/value pair

    returns

    a new map with the new binding added to this map

    definition classes: MapLikeBaseMapLike
  4. def +[B1 >: Set[B]](kv1: (A, B1), kv2: (A, B1), kvs: (A, B1)*): Map[A, B1]

    Adds key/value pairs to this map, returning a new map

    Adds key/value pairs to this map, returning a new map.

    This method takes two or more key/value pairs. Another overloaded variant of this method handles the case where a single key/value pair is added.

    B1

    the type of the added values

    kv1

    the first key/value pair

    kv2

    the second key/value pair

    kvs

    the remaining key/value pairs

    returns

    a new map with the given bindings added to this map

    definition classes: MapLike
  5. def ++(iter: Iterator[(A, Set[B])]): MapLike[A, Set[B], Map[A, Set[B]]]

    Adds a number of elements provided by an iterator via its iterator method and returns the collection itself

    Adds a number of elements provided by an iterator via its iterator method and returns the collection itself.

    iter

    the iterator

    definition classes: MapLike
  6. def ++(iter: Traversable[(A, Set[B])]): MapLike[A, Set[B], Map[A, Set[B]]]

    Adds a number of elements provided by a traversable object via its iterator method and returns either the collection itself (if it is mutable), or a new collection with the added elements

    Adds a number of elements provided by a traversable object via its iterator method and returns either the collection itself (if it is mutable), or a new collection with the added elements.

    iter

    the traversable object.

    definition classes: MapLike
  7. def ++[B1 >: Set[B]](iter: Iterator[(A, B1)]): Map[A, B1]

    Adds all key/value pairs produced by an iterator to this map, returning a new map

    Adds all key/value pairs produced by an iterator to this map, returning a new map.

    B1

    the type of the added values

    iter

    the iterator producing key/value pairs

    returns

    a new map with the given bindings added to this map

    definition classes: MapLike
  8. def ++[B1 >: Set[B]](kvs: Traversable[(A, B1)]): Map[A, B1]

    Adds all key/value pairs in a traversable collection to this map, returning a new map

    Adds all key/value pairs in a traversable collection to this map, returning a new map.

    B1

    the type of the added values

    kvs

    the collection containing the added key/value pairs

    returns

    a new map with the given bindings added to this map

    definition classes: MapLike
  9. def ++[B >: (A, Set[B]), That](that: Iterator[B])(bf: CanBuildFrom[Map[A, Set[B]], B, That]): That

    Concatenates this mutable map with the elements of an iterator

    Concatenates this mutable map 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 mutable map followed by all elements of that.

    definition classes: TraversableLike
  10. def ++[B >: (A, Set[B]), That](that: Traversable[B])(bf: CanBuildFrom[Map[A, Set[B]], B, That]): That

    Concatenates this mutable map with the elements of a traversable collection

    Concatenates this mutable map 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 mutable map followed by all elements of that.

    definition classes: TraversableLike
  11. def ++=(elems: Traversable[(A, Set[B])]): Growable[(A, Set[B])]

    adds all elements contained in a traversable collection to this mutable map

    adds all elements contained in a traversable collection to this mutable map.

    elems

    the collection containing the elements to add.

    returns

    the mutable map itself.

    definition classes: Growable
  12. def ++=(iter: Iterator[(A, Set[B])]): Growable[(A, Set[B])]

    adds all elements produced by an iterator to this mutable map

    adds all elements produced by an iterator to this mutable map.

    iter

    the iterator producing the elements to add.

    returns

    the mutable map itself.

    definition classes: Growable
  13. def +=(elem1: (A, Set[B]), elem2: (A, Set[B]), elems: (A, Set[B])*): Growable[(A, Set[B])]

    adds two or more elements to this mutable map

    adds two or more elements to this mutable map.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the mutable map itself

    definition classes: Growable
  14. def +=(kv: (A, Set[B])): MapLike[A, Set[B], Map[A, Set[B]]]

    Adds a new key/value pair to this map

    Adds a new key/value pair to this map. If the map already contains a mapping for the key, it will be overridden by the new value.

    kv

    the key/value pair.

    returns

    the map itself

    attributes: abstract
    definition classes: MapLikeBuilderGrowable
  15. def -(elem1: A, elem2: A, elems: A*): Map[A, Set[B]]

    Removes two or more elements from this collection and returns the collection itself

    Removes two or more elements from this collection and returns the collection itself.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new mutable map that contains all elements of the current mutable map except one less occurrence of each of the given elements.

    definition classes: MapLikeSubtractable
  16. def -(key: A): Map[A, Set[B]]

    Delete a key from this map if it is present and return the map itself

    Delete a key from this map if it is present and return the map itself.

    key

    the key to be removed

    returns

    a new map without a binding for key

    definition classes: MapLikeMapLikeSubtractable
  17. def --(iter: Iterator[A]): Map[A, Set[B]]

    Removes a number of elements provided by an iterator and returns the collection itself

    Removes a number of elements provided by an iterator and returns the collection itself.

    iter

    the iterator

    returns

    a new mutable map that contains all elements of the current mutable map except one less occurrence of each of the elements produced by iter.

    definition classes: MapLikeSubtractable
  18. def --(iter: Traversable[A]): Map[A, Set[B]]

    Removes a number of elements provided by a Traversable object and returns the collection itself

    Removes a number of elements provided by a Traversable object and returns the collection itself.

    iter

    the Traversable object.

    returns

    a new mutable map that contains all elements of the current mutable map except one less occurrence of each of the elements of elems.

    definition classes: MapLikeSubtractable
  19. def --=(iter: Traversable[A]): Shrinkable[A]

    Removes all elements contained in a traversable collection from this mutable map

    Removes all elements contained in a traversable collection from this mutable map.

    iter

    the collection containing the elements to remove.

    returns

    the mutable map itself

    definition classes: Shrinkable
  20. def --=(iter: Iterator[A]): Shrinkable[A]

    Removes all elements produced by an iterator from this mutable map

    Removes all elements produced by an iterator from this mutable map.

    iter

    the iterator producing the elements to remove.

    returns

    the mutable map itself

    definition classes: Shrinkable
  21. def -=(elem1: A, elem2: A, elems: A*): Shrinkable[A]

    Removes two or more elements from this mutable map

    Removes two or more elements from this mutable map.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the mutable map itself

    definition classes: Shrinkable
  22. def -=(key: A): MapLike[A, Set[B], Map[A, Set[B]]]

    Removes a key from this map

    Removes a key from this map.

    key

    the key to be removed

    returns

    the map itself.

    attributes: abstract
    definition classes: MapLikeShrinkable
  23. def /:[B](z: B)(op: (B, (A, Set[B])) ⇒ B): B

    Applies a binary operator to a start value and all elements of this mutable map, going left to right

    Applies a binary operator to a start value and all elements of this mutable map, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    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 mutable map$, 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 mutable map.

    definition classes: TraversableLike
  24. def :\[B](z: B)(op: ((A, Set[B]), B) ⇒ B): B

    Applies a binary operator to all elements of this mutable map and a start value, going right to left

    Applies a binary operator to all elements of this mutable map and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    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 mutable map$, 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 mutable map.

    definition classes: TraversableLike
  25. def addBinding(key: A, value: B): MultiMap[A, B]

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

    Appends all bindings of this map to a string builder using start, end, and separator strings

    Appends all bindings of this map 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 of all bindings of this map in the form of key -> value are separated by the string sep.

    b

    the builder to which strings 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: MapLikeTraversableLike
  27. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this mutable map to a string builder

    Appends all elements of this mutable map to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this mutable map 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
  28. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this mutable map to a string builder using a separator string

    Appends all elements of this mutable map 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 mutable map, 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
  29. def andThen[C](k: (Set[B]) ⇒ C): PartialFunction[A, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    definition classes: PartialFunctionFunction1
  30. def apply(key: A): Set[B]

    Retrieves the value which is associated with the given key

    Retrieves the value which is associated with the given key. This method invokes the default method of the map if there is no mapping from the given key to a value. Unless overridden, the default method throws a NoSuchElementException.

    key

    the key

    returns

    the value associated with the given key, or the result of the map's default method, if none exists.

    definition classes: MapLikeFunction1
  31. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this mutable map should be compared

    returns

    true, if this mutable map can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  32. def clear(): Unit

    Removes all bindings from the map

    Removes all bindings from the map. After this operation has completed, the map will be empty.

    definition classes: MapLikeBuilderGrowable
  33. def clone(): Map[A, Set[B]]

    This method creates and returns a copy of the receiver object

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

    The default implementation of the clone method is platform dependent.

    definition classes: MapLikeCloneable ⇐ AnyRef
  34. def companion: GenericCompanion[Iterable[A][A]]

    The factory companion object that builds instances of class mutable

    The factory companion object that builds instances of class mutable.Map.

  35. def compose[A](g: (A) ⇒ A): (A) ⇒ Set[B]

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  36. def contains(key: A): Boolean

    Tests whether this map contains a binding for a key

    Tests whether this map contains a binding for a key.

    key

    the key

    returns

    true if there is a binding for key in this map, false otherwise.

    definition classes: MapLike
  37. def copyToArray[B >: (A, Set[B])](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this mutable map to an array

    Copies elements of this mutable map to an array. Fills the given array xs with at most len elements of this mutable map, starting at position start. Copying will stop once either the end of the current mutable map is reached, or the end of the array is reached, or len elements have been copied.

    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: IterableLikeTraversableLike
  38. def copyToArray[B >: (A, Set[B])](xs: Array[B]): Unit

    Copies elements of this mutable map to an array

    Copies elements of this mutable map to an array. Fills the given array xs with all elements of this mutable map, starting at position 0. Copying will stop once either the end of the current mutable map is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableLike
  39. def copyToArray[B >: (A, Set[B])](xs: Array[B], start: Int): Unit

    Copies elements of this mutable map to an array

    Copies elements of this mutable map to an array. Fills the given array xs with all elements of this mutable map, starting at position start. Copying will stop once either the end of the current mutable map is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableLike
  40. def copyToBuffer[B >: (A, Set[B])](dest: Buffer[B]): Unit

    Copies all elements of this mutable map to a buffer

    Copies all elements of this mutable map to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableLike
  41. def count(p: ((A, Set[B])) ⇒ Boolean): Int

    Counts the number of elements in the mutable map which satisfy a predicate

    Counts the number of elements in the mutable map which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableLike
  42. def default(key: A): Set[B]

    Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses

    Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.

    key

    the given key value for which a binding is missing.

    definition classes: MapLike
  43. def drop(n: Int): Map[A, Set[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 mutable map.

    returns

    a mutable map consisting of all elements of this mutable map except the first n ones, or else the empty mutable map, if this mutable map has less than n elements.

    definition classes: TraversableLike
  44. def dropRight(n: Int): Map[A, Set[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 take

    returns

    a mutable map consisting of all elements of this mutable map except the first n ones, or else the empty mutable map, if this mutable map has less than n elements.

    definition classes: IterableLike
  45. def dropWhile(p: ((A, Set[B])) ⇒ Boolean): Map[A, Set[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.

    p

    The predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  46. def elements: Iterator[(A, Set[B])]

  47. def empty: Map[A, Set[B]]

  48. def entryExists(key: A, p: (B) ⇒ Boolean): Boolean

  49. 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: MapLikeEquals ⇐ AnyRef ⇐ Any
  50. def exists(p: ((A, Set[B])) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this mutable map

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this mutable map, otherwise false.

    definition classes: IterableLikeTraversableLike
  51. def filter(p: ((A, Set[B])) ⇒ Boolean): Map[A, Set[B]]

    Selects all elements of this mutable map which satisfy a predicate

    Selects all elements of this mutable map which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new mutable map consisting of all elements of this mutable map that satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  52. def filterKeys(p: (A) ⇒ Boolean): DefaultMap[A, Set[B]]

    Filters this map by retaining only keys satisfying a predicate

    Filters this map by retaining only keys satisfying a predicate.

    p

    the predicate used to test keys

    returns

    an immutable map consisting only of those key value pairs of this map where the key satisfies the predicate p. The resulting map wraps the original map without copying any elements.

    definition classes: MapLike
  53. def filterNot(p: ((A, Set[B])) ⇒ Boolean): Map[A, Set[B]]

    Selects all elements of this mutable map which do not satisfy a predicate

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

    p

    the predicate used to test elements.

    returns

    a new mutable map consisting of all elements of this mutable map that do not satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  54. def find(p: ((A, Set[B])) ⇒ Boolean): Option[(A, Set[B])]

    Finds the first element of the mutable map satisfying a predicate, if any

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

    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 mutable map that satisfies p, or None if none exists.

    definition classes: IterableLikeTraversableLike
  55. def first: (A, Set[B])

  56. def firstOption: Option[(A, Set[B])]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
  57. def flatMap[B, That](f: ((A, Set[B])) ⇒ Traversable[B])(bf: CanBuildFrom[Map[A, Set[B]], B, That]): That

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

    Builds a new collection by applying a function to all elements of this mutable map 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 mutable map and concatenating the results.

    definition classes: TraversableLike
  58. def flatten[B](asTraversable: ((A, Set[B])) ⇒ Traversable[B]): Iterable[B]

    Converts this mutable map of traversable collections into a mutable map in which all element collections are concatenated

    Converts this mutable map of traversable collections into a mutable map 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 mutable map is a Traversable.

    returns

    a new mutable map resulting from concatenating all element mutable maps.

    definition classes: GenericTraversableTemplate
  59. def foldLeft[B](z: B)(op: (B, (A, Set[B])) ⇒ B): B

    Applies a binary operator to a start value and all elements of this mutable map, going left to right

    Applies a binary operator to a start value and all elements of this mutable map, going left to right.

    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 mutable map$, 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 mutable map.

    definition classes: TraversableLike
  60. def foldRight[B](z: B)(op: ((A, Set[B]), B) ⇒ B): B

    Applies a binary operator to all elements of this mutable map and a start value, going right to left

    Applies a binary operator to all elements of this mutable map and a start value, going right to left.

    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 mutable map$, 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 mutable map.

    definition classes: IterableLikeTraversableLike
  61. def forall(p: ((A, Set[B])) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this mutable map

    Tests whether a predicate holds for all elements of this mutable map.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this mutable map, otherwise false.

    definition classes: IterableLikeTraversableLike
  62. def foreach[U](f: ((A, Set[B])) ⇒ U): Unit

    Applies a function f to all elements of this mutable map

    Applies a function f to all elements of this mutable map.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    definition classes: IterableLikeTraversableLike
  63. def genericBuilder[B]: Builder[B, Iterable[B]]

    The generic builder that builds instances of mutable

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

    definition classes: GenericTraversableTemplate
  64. def get(key: A): Option[Set[B]]

    Optionally returns the value associated with a key

    Optionally returns the value associated with a key.

    attributes: abstract
    definition classes: MapLike
  65. def getOrElse[B1 >: Set[B]](key: A, default: ⇒ B1): B1

    Returns the value associated with a key, or a default value if the key is not contained in the map

    Returns the value associated with a key, or a default value if the key is not contained in the map.

    B1

    the result type of the default computation.

    key

    the key.

    default

    a computation that yields a default value in case no binding for key is found in the map.

    returns

    the value assocuated with key if it exists, otherwise the result of the default computation.

    definition classes: MapLike
  66. def getOrElseUpdate(key: A, op: ⇒ Set[B]): Set[B]

    If given key is already in this map, returns associated value Otherwise, computes value from given expression op, stores with key in map and returns that value

    If given key is already in this map, returns associated value Otherwise, computes value from given expression op, stores with key in map and returns that value.

    definition classes: MapLike
  67. def groupBy[K](f: ((A, Set[B])) ⇒ K): Map[K, Map[A, Set[B]]]

    Partitions this mutable map into a map of mutable maps according to some discriminator function

    Partitions this mutable map into a map of mutable maps 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 mutable map.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to mutable maps 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 mutable map of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  68. def hasDefiniteSize: Boolean

    Tests whether this mutable map is known to have a finite size

    Tests whether this mutable map 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
  69. 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: MapLike ⇐ AnyRef ⇐ Any
  70. def head: (A, Set[B])

    Selects the first element of this mutable map

    Selects the first element of this mutable map.

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

    definition classes: IterableLikeTraversableLike
  71. def headOption: Option[(A, Set[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
  72. def init: Map[A, Set[B]]

    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: TraversableLike
  73. def isDefinedAt(key: A): Boolean

    Tests whether this map contains a binding for a key

    Tests whether this map contains a binding for a key. This method, which implements an abstract method of trait PartialFunction, is equivalent to contains.

    key

    the key

    returns

    true if there is a binding for key in this map, false otherwise.

    definition classes: MapLikePartialFunction
  74. def isEmpty: Boolean

    Tests whether the map is empty

    Tests whether the map is empty.

    definition classes: MapLikeIterableLikeTraversableLike
  75. def iterator: Iterator[(A, Set[B])]

    Creates a new iterator over all key/value pairs of this map

    Creates a new iterator over all key/value pairs of this map

    attributes: abstract
    definition classes: MapLikeIterableLike
  76. def keySet: Set[A]

    Collects all keys of this map in a set

    Collects all keys of this map in a set.

    definition classes: MapLike
  77. def keys: Iterator[A]

    Creates an iterator for all keys

    Creates an iterator for all keys.

    definition classes: MapLike
  78. def keysIterator: Iterator[A]

    Creates an iterator for all keys

    Creates an iterator for all keys.

    definition classes: MapLike
  79. def last: (A, Set[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
  80. def lastOption: Option[(A, Set[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
  81. def lift: (A) ⇒ Option[Set[B]]

    Turns this partial function into an plain function returning an Option result

    Turns this partial function into an plain function returning an Option result.

    definition classes: PartialFunction
  82. def map[B, That](f: ((A, Set[B])) ⇒ B)(bf: CanBuildFrom[Map[A, Set[B]], B, That]): That

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

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

    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 mutable map and collecting the results.

    definition classes: TraversableLike
  83. def mapElements[C](f: (Set[B]) ⇒ C): DefaultMap[A, C]

  84. def mapResult[NewTo](f: (Map[A, Set[B]]) ⇒ NewTo): Builder[(A, Set[B]), NewTo]

    Creates a new builder by applying a transformation function to the results of this builder

    Creates a new builder by applying a transformation function to the results of this builder.

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    definition classes: Builder
  85. def mapValues[C](f: (Set[B]) ⇒ C): DefaultMap[A, C]

    A map view resulting from applying a given function f to each value associated with a key in this map

    A map view resulting from applying a given function f to each value associated with a key in this map.

    definition classes: MapLike
  86. def max[B >: (A, Set[B])](cmp: Ordering[B]): (A, Set[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 mutable map with respect to the ordering cmp.

    definition classes: TraversableLike
  87. def min[B >: (A, Set[B])](cmp: Ordering[B]): (A, Set[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 mutable map with respect to the ordering cmp.

    definition classes: TraversableLike
  88. def mkString: String

    Displays all elements of this mutable map in a string

    Displays all elements of this mutable map in a string.

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

    Displays all elements of this mutable map in a string using a separator string

    Displays all elements of this mutable map in a string using a separator string.

    sep

    the separator string.

    returns

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

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

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

    Displays all elements of this mutable map 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 mutable map. 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 mutable map are separated by the string sep.

    definition classes: TraversableLike
  91. def nonEmpty: Boolean

    Tests whether the mutable map is not empty

    Tests whether the mutable map is not empty.

    definition classes: TraversableLike
  92. def orElse[A1 <: A, B1 >: Set[B]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.

    definition classes: PartialFunction
  93. def partialMap[B, That](pf: PartialFunction[(A, Set[B]), B])(bf: CanBuildFrom[Map[A, Set[B]], B, That]): That

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

    Builds a new collection by applying a partial function to all elements of this mutable map 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 mutable map.

    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
  94. def partition(p: ((A, Set[B])) ⇒ Boolean): (Map[A, Set[B]], Map[A, Set[B]])

    Partitions this mutable map in two mutable maps according to a predicate

    Partitions this mutable map in two mutable maps according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of mutable maps: the first mutable map consists of all elements that satisfy the predicate p and the second mutable map consists of all elements that don't. The relative order of the elements in the resulting mutable maps is the same as in the original mutable map.

    definition classes: TraversableLike
  95. def product[B >: (A, Set[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 mutable map with respect to the * operator in num.

    definition classes: TraversableLike
  96. def projection: IterableView[(A, Set[B]), Map[A, Set[B]]]

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    definition classes: IterableLike
  97. def put(key: A, value: Set[B]): Option[Set[B]]

    Adds a new key/value pair to this map and optionally returns previously bound value

    Adds a new key/value pair to this map and optionally returns previously bound value. If the map already contains a mapping for the key, it will be overridden by the new value.

    key

    the key to update

    value

    the new value

    returns

    an option value containing the value associated with the key before the put operation was executed, or None if key was not defined in the map before.

    definition classes: MapLike
  98. def reduceLeft[B >: (A, Set[B])](op: (B, (A, Set[B])) ⇒ B): B

    Applies a binary operator to all elements of this mutable map, going left to right

    Applies a binary operator to all elements of this mutable map, going left to right.

    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 mutable map$, going left to right: {{{ op(...(op(x1, x2), ... ) , xn) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable map.

    definition classes: TraversableLike
  99. def reduceLeftOption[B >: (A, Set[B])](op: (B, (A, Set[B])) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this mutable map, going left to right

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

    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 mutable map is nonempty, None otherwise.

    definition classes: TraversableLike
  100. def reduceRight[B >: (A, Set[B])](op: ((A, Set[B]), B) ⇒ B): B

    Applies a binary operator to all elements of this mutable map, going right to left

    Applies a binary operator to all elements of this mutable map, going right to left.

    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 mutable map$, going right to left: {{{ op(x1, op(x2, ..., op(xn-1, xn)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this mutable map.

    definition classes: IterableLikeTraversableLike
  101. def reduceRightOption[B >: (A, Set[B])](op: ((A, Set[B]), B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this mutable map, going right to left

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

    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 mutable map is nonempty, None otherwise.

    definition classes: TraversableLike
  102. def remove(key: A): Option[Set[B]]

    Removes a key from this map, returning the value associated previously with that key as an option

    Removes a key from this map, returning the value associated previously with that key as an option.

    key

    the key to be removed

    returns

    an option value containing the value associated previously with key, or None if key was not defined in the map before.

    definition classes: MapLike
  103. def removeBinding(key: A, value: B): MultiMap[A, B]

  104. def removeKey(key: A): Option[Set[B]]

    If given key is defined in this map, remove it and return associated value as an Option

    If given key is defined in this map, remove it and return associated value as an Option. If key is not present return None.

    key

    the key to be removed

    definition classes: MapLike
  105. def repr: Map[A, Set[B]]

    The collection of type mutable map underlying this TraversableLike object

    The collection of type mutable map underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    definition classes: TraversableLike
  106. def result(): Map[A, Set[B]]

    The result when this map is used as a builder

    The result when this map is used as a builder

    definition classes: MapLikeBuilder
  107. def retain(p: (A, Set[B]) ⇒ Boolean): MapLike[A, Set[B], Map[A, Set[B]]]

    Retains only those mappings for which the predicate p returns true

    Retains only those mappings for which the predicate p returns true.

    p

    The test predicate

    definition classes: MapLike
  108. def sameElements[B >: (A, Set[B])](that: Iterable[B]): Boolean

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

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

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    definition classes: IterableLike
  109. def size: Int

    The size of this mutable map

    The size of this mutable map.

    definition classes: TraversableLike
  110. def sizeHint(size: Int): Unit

    Gives a hint how many elements are expected to be added when the next result is called

    Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    definition classes: Builder
  111. def slice(from: Int, until: Int): Map[A, Set[B]]

    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 mutable map.

    until

    the index one past the last returned element in this mutable map.

    returns

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

    definition classes: IterableLikeTraversableLike
  112. def span(p: ((A, Set[B])) ⇒ Boolean): (Map[A, Set[B]], Map[A, Set[B]])

    Spits this mutable map into a prefix/suffix pair according to a predicate

    Spits this mutable map 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 mutable map whose elements all satisfy p, and the rest of this mutable map.

    definition classes: TraversableLike
  113. def splitAt(n: Int): (Map[A, Set[B]], Map[A, Set[B]])

    Splits this mutable map into two at a given position

    Splits this mutable map 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 mutable maps consisting of the first n elements of this mutable map, and the other elements.

    definition classes: TraversableLike
  114. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: MapLikeTraversableLike
  115. def sum[B >: (A, Set[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 mutable map with respect to the + operator in num.

    definition classes: TraversableLike
  116. def tail: Map[A, Set[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.

    definition classes: TraversableLike
  117. def take(n: Int): Map[A, Set[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 mutable map.

    returns

    a mutable map consisting only of the first n elements of this mutable map, or else the whole mutable map, if it has less than n elements.

    definition classes: IterableLikeTraversableLike
  118. def takeRight(n: Int): Map[A, Set[B]]

    Selects last n elements

    Selects last n elements.

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

    n

    the number of elements to take

    returns

    a mutable map consisting only of the last n elements of this mutable map, or else the whole mutable map, if it has less than n elements.

    definition classes: IterableLike
  119. def takeWhile(p: ((A, Set[B])) ⇒ Boolean): Map[A, Set[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.

    p

    The predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLike
  120. def toArray[B >: (A, Set[B])](arg0: ClassManifest[B]): Array[B]

    Converts this mutable map to an array

    Converts this mutable map to an array.

    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 mutable map.

    definition classes: TraversableLike
  121. def toIndexedSeq[B >: (A, Set[B])]: IndexedSeq[B]

    Converts this mutable map to an indexed sequence

    Converts this mutable map to an indexed sequence.

    definition classes: TraversableLike
  122. def toIterable: Iterable[(A, Set[B])]

    Converts this mutable map to an iterable collection

    Converts this mutable map to an iterable collection.

    Note: Will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  123. def toList: List[(A, Set[B])]

    Converts this mutable map to a list

    Converts this mutable map to a list.

    definition classes: TraversableLike
  124. def toSeq: Seq[(A, Set[B])]

    Converts this mutable map to a sequence

    Converts this mutable map to a sequence.

    definition classes: TraversableLike
  125. def toSet[B >: (A, Set[B])]: Set[B]

    Converts this mutable map to a set

    Converts this mutable map to a set.

    definition classes: TraversableLike
  126. def toStream: Stream[(A, Set[B])]

    Converts this mutable map to a stream

    Converts this mutable map to a stream.

    definition classes: IterableLikeTraversableLike
  127. def toString(): String

    Converts this mutable map to a string

    Converts this mutable map to a string

    definition classes: MapLikeTraversableLikeFunction1 ⇐ AnyRef ⇐ Any
  128. def transform(f: (A, Set[B]) ⇒ Set[B]): MapLike[A, Set[B], Map[A, Set[B]]]

    Applies a transformation function to all values contained in this map

    Applies a transformation function to all values contained in this map. The transformation function produces new values from existing keys asssociated values.

    f

    the transformation to apply

    returns

    the map itself.

    definition classes: MapLike
  129. def transpose[B](asTraversable: ((A, Set[B])) ⇒ Traversable[B]): Iterable[Iterable[B]]

    Transposes this mutable map of traversable collections into

    Transposes this mutable map of traversable collections into

    definition classes: GenericTraversableTemplate
  130. def unzip[A1, A2](asPair: ((A, Set[B])) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

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

    Converts this mutable map 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 mutable map is a pair.

    returns

    a pair mutable maps, containing the first, respectively second half of each element pair of this mutable map.

    definition classes: GenericTraversableTemplate
  131. def update(key: A, value: Set[B]): Unit

    Adds a new key/value pair to this map

    Adds a new key/value pair to this map. If the map already contains a mapping for the key, it will be overridden by the new value.

    key

    The key to update

    value

    The new value

    definition classes: MapLike
  132. def updated[B1 >: Set[B]](key: A, value: B1): Map[A, B1]

    Creates a new map consisting of all key/value pairs of the current map plus a new pair of a guven key and value

    Creates a new map consisting of all key/value pairs of the current map plus a new pair of a guven key and value.

    B1

    the type of the added value

    key

    The key to add

    value

    The new value

    returns

    A fresh immutable map with the binding from key to value added to this map.

    definition classes: MapLikeMapLike
  133. def values: Iterator[Set[B]]

    Creates an iterator for all contained values

    Creates an iterator for all contained values.

    definition classes: MapLike
  134. def valuesIterable: Iterable[Set[B]]

    Collects all values of this map in an iterable collection

    Collects all values of this map in an iterable collection.

    definition classes: MapLike
  135. def valuesIterator: Iterator[Set[B]]

    Creates an iterator for all values in this map

    Creates an iterator for all values in this map.

    definition classes: MapLike
  136. def view(from: Int, until: Int): IterableView[(A, Set[B]), Map[A, Set[B]]]

    Creates a non-strict view of a slice of this mutable map

    Creates a non-strict view of a slice of this mutable map.

    Note: the difference between view and slice is that view produces a view of the current mutable map, whereas slice produces a new mutable map.

    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 mutable map, starting at index from and extending up to (but not including) index until.

    definition classes: IterableLikeTraversableLike
  137. def view: IterableView[(A, Set[B]), Map[A, Set[B]]]

    Creates a non-strict view of this mutable map

    Creates a non-strict view of this mutable map.

    definition classes: IterableLikeTraversableLike
  138. def withFilter(p: ((A, Set[B])) ⇒ Boolean): WithFilter

    Creates a non-strict filter of this mutable map

    Creates a non-strict filter of this mutable map.

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

    definition classes: TraversableLike
  139. def zip[A1 >: (A, Set[B]), B, That](that: Iterable[B])(bf: CanBuildFrom[Map[A, Set[B]], (A1, B), That]): That

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

    Returns a mutable map formed from this mutable map 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 mutable map and that. The length of the returned collection is the minimum of the lengths of this mutable map$ and that.

    definition classes: IterableLike
  140. def zipAll[B, A1 >: (A, Set[B]), That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[Map[A, Set[B]], (A1, B), That]): That

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

    Returns a mutable map formed from this mutable map 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 mutable map is shorter than that.

    thatElem

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

    returns

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

    definition classes: IterableLike
  141. def zipWithIndex[A1 >: (A, Set[B]), That](bf: CanBuildFrom[Map[A, Set[B]], (A1, Int), That]): That

    Zips this mutable map with its indices

    Zips this mutable map 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 mutable map paired with their index. Indices start at 0.

    definition classes: IterableLike