scala.collection.mutable

# OpenHashMap

#### class OpenHashMap[Key, Value] extends Map[Key, Value] with MapLike[Key, Value, OpenHashMap[Key, Value]]

A mutable hash map based on an open hashing scheme. The precise scheme is undefined, but it should make a reasonable effort to ensure that an insert with consecutive hash codes is not unneccessarily penalised. In particular, mappings of consecutive integer keys should work without significant performance loss.

Key

  type of the keys in this map.

Value

  type of the values in this map.

Source
  OpenHashMap.scala
Since

  2.7

Linear Supertypes
Map[Key, Value], MapLike[Key, Value, OpenHashMap[Key, Value]], Cloneable[OpenHashMap[Key, Value]], Shrinkable[Key], Builder[(Key, Value), OpenHashMap[Key, Value]], Growable[(Key, Value)], Map[Key, Value], MapLike[Key, Value, OpenHashMap[Key, Value]], Subtractable[Key, OpenHashMap[Key, Value]], PartialFunction[Key, Value], (Key) ⇒ Value, GenMap[Key, Value], GenMapLike[Key, Value, OpenHashMap[Key, Value]], Iterable[(Key, Value)], Iterable[(Key, Value)], IterableLike[(Key, Value), OpenHashMap[Key, Value]], Equals, GenIterable[(Key, Value)], GenIterableLike[(Key, Value), OpenHashMap[Key, Value]], Traversable[(Key, Value)], Mutable, Traversable[(Key, Value)], GenTraversable[(Key, Value)], GenericTraversableTemplate[(Key, Value), Iterable], TraversableLike[(Key, Value), OpenHashMap[Key, Value]], GenTraversableLike[(Key, Value), OpenHashMap[Key, Value]], Parallelizable[(Key, Value), ParMap[Key, Value]], TraversableOnce[(Key, Value)], GenTraversableOnce[(Key, Value)], FilterMonadic[(Key, Value), OpenHashMap[Key, Value]], HasNewBuilder[(Key, Value), OpenHashMap[Key, Value]], AnyRef, Any
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. OpenHashMap
2. Map
3. MapLike
4. Cloneable
5. Shrinkable
6. Builder
7. Growable
8. Map
9. MapLike
10. Subtractable
11. PartialFunction
12. Function1
13. GenMap
14. GenMapLike
15. Iterable
16. Iterable
17. IterableLike
18. Equals
19. GenIterable
20. GenIterableLike
21. Traversable
22. Mutable
23. Traversable
24. GenTraversable
25. GenericTraversableTemplate
26. TraversableLike
27. GenTraversableLike
28. Parallelizable
29. TraversableOnce
30. GenTraversableOnce
31. FilterMonadic
32. HasNewBuilder
33. AnyRef
34. Any

Visibility

1. Public
2. All

### Instance Constructors

1. #### new OpenHashMap()

   A default constructor creates a hashmap with initial size 8.

2. #### new OpenHashMap(initialSize: Int)

   initialSize

     the initial size of the internal hash table.

### Type Members

1. #### class DefaultKeySet extends Set[A]

   The implementation class of the set returned by `keySet`.

2. #### class DefaultValuesIterable extends Iterable[B]

   The implementation class of the iterable returned by `values`.

3. #### type Self = OpenHashMap[Key, Value]

   The type implementing this traversable

   The type implementing this traversable

   Attributes
     protected
   Definition Classes
     TraversableLike

4. #### class WithFilter extends FilterMonadic[A, Repr]

   A class supporting filtered operations.

### Value Members

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

   Definition Classes
     AnyRef

2. #### final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

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

   Definition Classes
     Any

3. #### final 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 ==

   Definition Classes
     AnyRef → Any

4. #### def +[B1 >: Value](elem1: (Key, B1), elem2: (Key, B1), elems: (Key, B1)*): Map[Key, B1]

   Creates a new map containing two or more key/value mappings and all the key/value mappings of this map.

   Creates a new map containing two or more key/value mappings and all the key/value mappings of this map.

   Specified mappings will override existing mappings from this map with the same keys.

   B1

     the type of the added values

   elem1

     the first element to add.

   elem2

     the second element to add.

   elems

     the remaining elements to add.

   returns

     a new map containing mappings of this map and two or more specified mappings.

   Definition Classes
     MapLike → MapLike
   Annotations
     @migration
   Migration

     (Changed in version 2.8.0) `+` creates a new map. Use `+=` to add an element to this map and return that map itself.

5. #### def +[B1 >: Value](kv: (Key, B1)): Map[Key, B1]

   Creates a new map containing a new key/value mapping and all the key/value mappings of this map.

   Creates a new map containing a new key/value mapping and all the key/value mappings of this map.

   Mapping `kv` will override existing mappings from this map with the same key.

   B1

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

   kv

     the key/value mapping to be added

   returns

     a new map containing mappings of this map and the mapping `kv`.

   Definition Classes
     MapLike → MapLike → GenMapLike
   Annotations
     @migration
   Migration

     (Changed in version 2.8.0) `+` creates a new map. Use `+=` to add an element to this map and return that map itself.

6. #### def ++[B1 >: Value](xs: GenTraversableOnce[(Key, B1)]): Map[Key, B1]

   Creates a new map containing the key/value mappings provided by the specified traversable object and all the key/value mappings of this map.

   Creates a new map containing the key/value mappings provided by the specified traversable object and all the key/value mappings of this map.

   Note that existing mappings from this map with the same key as those in `xs` will be overriden.

   B1

     the type of the added values

   xs

     the traversable object.

   returns

     a new map containing mappings of this map and those provided by `xs`.

   Definition Classes
     MapLike → MapLike
   Annotations
     @migration
   Migration

     (Changed in version 2.8.0) `++` creates a new map. Use `++=` to add an element to this map and return that map itself.

7. #### abstract def ++[B](that: GenTraversableOnce[B]): OpenHashMap[B]

   [use case] Returns a new open hash map containing the elements from the left hand operand followed by the elements from the right hand operand.

   [use case]

   Returns a new open hash map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the open hash map is the most specific superclass encompassing the element types of the two operands (see example).

   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 open hash map followed by all elements of `that`.

   Definition Classes
     GenTraversableLike

8. #### def ++[B >: (Key, Value), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

   Returns a new open hash map containing the elements from the left hand operand followed by the elements from the right hand operand.

   Returns a new open hash map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the open hash map is the most specific superclass encompassing the element types of the two operands (see example).

   Example:

           scala> val a = LinkedList(1)
           a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

           scala> val b = LinkedList(2)
           b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

           scala> val c = a ++ b
           c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

           scala> val d = LinkedList('a')
           d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)

           scala> val e = c ++ d
           e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)

   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 open hash map followed by all elements of `that`.

   Definition Classes
     TraversableLike → GenTraversableLike

9. #### def ++:[B >: (Key, Value), That](that: Traversable[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand. It differs from `++` in that the right operand determines the type of the resulting collection rather than the left one.

   Example:

           scala> val x = List(1)
           x: List[Int] = List(1)

           scala> val y = LinkedList(2)
           y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

           scala> val z = x ++: y
           z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

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

   Since `TraversableOnce` has no `++` method, we have to implement that directly, but `Traversable` and down can use the overload.

   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 open hash map which contains all elements of this open hash map followed by all elements of `that`.

   Definition Classes
     TraversableLike

10. #### abstract def ++:[B](that: TraversableOnce[B]): OpenHashMap[B]

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

    [use case]

    Concatenates this open hash map with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

      the element type of the returned collection.

    that

      the traversable to append.

    returns

      a new collection of type `That` which contains all elements of this open hash map followed by all elements of `that`.

    Definition Classes
      TraversableLike

11. #### def ++:[B >: (Key, Value), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

    Concatenates this open hash map with the elements of a traversable collection.

    Concatenates this open hash map with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    Example:

            scala> val x = List(1)
            x: List[Int] = List(1)

            scala> val y = LinkedList(2)
            y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

            scala> val z = x ++: y
            z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

    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 open hash map followed by all elements of `that`.

    Definition Classes
      TraversableLike

12. #### def ++=(xs: TraversableOnce[(Key, Value)]): OpenHashMap.this.type

    adds all elements produced by a TraversableOnce to this open hash map.

    adds all elements produced by a TraversableOnce to this open hash map.

    returns

      the open hash map itself.

    Definition Classes
      Growable

13. #### def +=(kv: (Key, Value)): OpenHashMap.this.type

    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

    Definition Classes
      OpenHashMap → MapLike → Builder → Growable

14. #### def +=(elem1: (Key, Value), elem2: (Key, Value), elems: (Key, Value)*): OpenHashMap.this.type

    adds two or more elements to this open hash map.

    adds two or more elements to this open hash map.

    elem1

      the first element to add.

    elem2

      the second element to add.

    elems

      the remaining elements to add.

    returns

      the open hash map itself

    Definition Classes
      Growable

15. #### def -(elem1: Key, elem2: Key, elems: Key*): OpenHashMap[Key, Value]

    Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of the two or more specified keys.

    Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of the two or more specified keys.

    elem1

      the first element to remove.

    elem2

      the second element to remove.

    elems

      the remaining elements to remove.

    returns

      a new map containing all the mappings of this map except mappings with a key equal to `elem1`, `elem2` or any of `elems`.

    Definition Classes
      MapLike → Subtractable
    Annotations
      @migration
    Migration

      (Changed in version 2.8.0) `-` creates a new map. Use `-=` to remove an element from this map and return that map itself.

16. #### def -(key: Key): OpenHashMap[Key, Value]

    Creates a new map with all the key/value mappings of this map except the key/value mapping with the specified key.

    Creates a new map with all the key/value mappings of this map except the key/value mapping with the specified key.

    key

      the key to be removed

    returns

      a new map with all the mappings of this map except that with a key `key`.

    Definition Classes
      MapLike → MapLike → Subtractable → GenMapLike
    Annotations
      @migration
    Migration

      (Changed in version 2.8.0) `-` creates a new map. Use `-=` to remove an element from this map and return that map itself.

17. #### def --(xs: GenTraversableOnce[Key]): OpenHashMap[Key, Value]

    Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of those provided by the specified traversable object.

    Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of those provided by the specified traversable object.

    xs

      the traversable object.

    returns

      a new map with all the key/value mappings of this map except mappings with a key equal to a key from `xs`.

    Definition Classes
      MapLike → Subtractable
    Annotations
      @migration
    Migration

      (Changed in version 2.8.0) `--` creates a new map. Use `--=` to remove an element from this map and return that map itself.

18. #### def --=(xs: TraversableOnce[Key]): OpenHashMap.this.type

    Removes all elements produced by an iterator from this open hash map.

    Removes all elements produced by an iterator from this open hash map.

    returns

      the open hash map itself

    Definition Classes
      Shrinkable

19. #### def -=(key: Key): OpenHashMap.this.type

    Removes a key from this map.

    Removes a key from this map.

    key

      the key to be removed

    returns

      the map itself.

    Definition Classes
      OpenHashMap → MapLike → Shrinkable

20. #### def -=(elem1: Key, elem2: Key, elems: Key*): OpenHashMap.this.type

    Removes two or more elements from this open hash map.

    Removes two or more elements from this open hash map.

    elem1

      the first element to remove.

    elem2

      the second element to remove.

    elems

      the remaining elements to remove.

    returns

      the open hash map itself

    Definition Classes
      Shrinkable

21. #### def /:[B](z: B)(op: (B, (Key, Value)) ⇒ B): B

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

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

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

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (5 /: a)(_+_)
             b: Int = 15

             scala> val c = (5 /: a)((x,y) => x + y)
             c: Int = 15

    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 open hash map, going left to right with the start value `z` on the left:

                      op(...op(op(z, x1), x2), ..., xn)

      where `x1, ..., xn` are the elements of this open hash map.

    Definition Classes
      TraversableOnce → GenTraversableOnce

22. #### def /:\[A1 >: (Key, Value)](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`.

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (a /:\ 5)(_+_)
             b: Int = 15

    Definition Classes
      GenTraversableOnce

23. #### def :\[B](z: B)(op: ((Key, Value), B) ⇒ B): B

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

    Applies a binary operator to all elements of this open hash 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.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (a :\ 5)(_+_)
             b: Int = 15

             scala> val c = (a :\ 5)((x,y) => x + y)
             c: Int = 15

    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 open hash map, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this open hash map.

    Definition Classes
      TraversableOnce → GenTraversableOnce

24. #### final def ==(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

25. #### final 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.

    Definition Classes
      Any

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
      MapLike → TraversableOnce

27. #### def addString(b: StringBuilder): StringBuilder

    Appends all elements of this open hash map to a string builder.

    Appends all elements of this open hash map to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this open hash map without any separator string.

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> val h = a.addString(b)
             b: StringBuilder = 1234

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

28. #### def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this open hash map to a string builder using a separator string.

    Appends all elements of this open hash 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 open hash map, separated by the string `sep`.

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> a.addString(b, ", ")
             res0: StringBuilder = 1, 2, 3, 4

    b

      the string builder to which elements are appended.

    sep

      the separator string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

29. #### def aggregate[B](z: B)(seqop: (B, (Key, Value)) ⇒ 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 an 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).

    B

      the type of accumulated results

    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

    Definition Classes
      TraversableOnce → GenTraversableOnce

30. #### def andThen[C](k: (Value) ⇒ C): PartialFunction[Key, 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
      PartialFunction → Function1

31. #### def apply(key: Key): Value

    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
      MapLike → GenMapLike → Function1

32. #### final 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.

    Definition Classes
      Any
    Exceptions thrown
      ClassCastException

      if the receiver object is not an instance of the erasure of type `T0`.

33. #### 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 open hash map should be compared

    returns

      `true`, if this open hash 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
      IterableLike → Equals

34. #### 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
      MapLike → Builder → Growable

35. #### def clone(): OpenHashMap[Key, Value]

    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.

    Definition Classes
      OpenHashMap → MapLike → Cloneable → AnyRef
    Note

      not specified by SLS as a member of AnyRef

36. #### abstract def collect[B](pf: PartialFunction[(Key, Value), B]): OpenHashMap[B]

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

    [use case]

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

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the open hash map.

    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
      GenTraversableLike

37. #### def collect[B, That](pf: PartialFunction[(Key, Value), B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

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

    Builds a new collection by applying a partial function to all elements of this open hash 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 open hash 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 → GenTraversableLike

38. #### def collectFirst[B](pf: PartialFunction[(Key, Value), B]): Option[B]

    Finds the first element of the open hash map for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the open hash map for which the given partial function is defined, and applies the partial function to it.

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

    pf

      the partial function

    returns

      an option value containing pf applied to the first value for which it is defined, or `None` if none exists.

    Definition Classes
      TraversableOnce
    Example:

    1. `Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)`

39. #### def companion: GenericCompanion[Iterable]

    The factory companion object that builds instances of class OpenHashMap.

    The factory companion object that builds instances of class OpenHashMap. (or its `Iterable` superclass where class OpenHashMap is not a `Seq`.)

    Definition Classes
      Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate

40. #### def compose[A](g: (A) ⇒ Key): (A) ⇒ Value

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

      a new function `f` such that `f(x) == apply(g(x))`

    Definition Classes
      Function1

41. #### def contains(key: Key): 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

42. #### abstract def copyToArray(xs: Array[(Key, Value)], start: Int, len: Int): Unit

    [use case] Copies elements of this open hash map to an array.

    [use case]

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

    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Definition Classes
      TraversableLike

43. #### def copyToArray[B >: (Key, Value)](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this open hash map to an array.

    Copies elements of this open hash map to an array. Fills the given array `xs` with at most `len` elements of this open hash map, starting at position `start`. Copying will stop once either the end of the current open hash 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
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

44. #### abstract def copyToArray(xs: Array[(Key, Value)]): Unit

    [use case] Copies values of this open hash map to an array.

    [use case]

    Copies values of this open hash map to an array. Fills the given array `xs` with values of this open hash map. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached.

    xs

      the array to fill.

    Definition Classes
      GenTraversableOnce

45. #### def copyToArray[B >: (Key, Value)](xs: Array[B]): Unit

    Copies values of this open hash map to an array.

    Copies values of this open hash map to an array. Fills the given array `xs` with values of this open hash map. Copying will stop once either the end of the current open hash 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
      TraversableOnce → GenTraversableOnce

46. #### abstract def copyToArray(xs: Array[(Key, Value)], start: Int): Unit

    [use case] Copies values of this open hash map to an array.

    [use case]

    Copies values of this open hash map to an array. Fills the given array `xs` with values of this open hash map, beginning at index `start`. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached.

    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      GenTraversableOnce

47. #### def copyToArray[B >: (Key, Value)](xs: Array[B], start: Int): Unit

    Copies values of this open hash map to an array.

    Copies values of this open hash map to an array. Fills the given array `xs` with values of this open hash map, beginning at index `start`. Copying will stop once either the end of the current open hash 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
      TraversableOnce → GenTraversableOnce

48. #### def copyToBuffer[B >: (Key, Value)](dest: Buffer[B]): Unit

    Copies all elements of this open hash map to a buffer.

    Copies all elements of this open hash map to a buffer.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce

49. #### def count(p: ((Key, Value)) ⇒ Boolean): Int

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

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

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableOnce → GenTraversableOnce

50. #### def default(key: Key): Value

    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 → GenMapLike
    Exceptions thrown
      `NoSuchElementException`

51. #### def drop(n: Int): OpenHashMap[Key, Value]

    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 open hash map.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike

52. #### def dropRight(n: Int): OpenHashMap[Key, Value]

    Selects all elements except last n ones.

    Selects all elements except last 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 open hash map consisting of all elements of this open hash map except the last `n` ones, or else the empty open hash map, if this open hash map has less than `n` elements.

    Definition Classes
      IterableLike

53. #### def dropWhile(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

    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 open hash map whose first element does not satisfy the predicate `p`.

    Definition Classes
      TraversableLike → GenTraversableLike

54. #### def empty: OpenHashMap[Key, Value]

    The empty map of the same type as this map

    The empty map of the same type as this map

    returns

      an empty map of type `This`.

    Definition Classes
      OpenHashMap → Map → Map → MapLike

55. #### final 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.

    Definition Classes
      AnyRef

56. #### 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

57. #### def exists(p: ((Key, Value)) ⇒ Boolean): Boolean

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

58. #### def filter(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

    Selects all elements of this open hash map which satisfy a predicate.

    Selects all elements of this open hash map which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

59. #### def filterKeys(p: (Key) ⇒ Boolean): Map[Key, Value]

    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

60. #### def filterNot(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

    Returns a new map with all key/value pairs for which the predicate `p` returns `true`.

    Returns a new map with all key/value pairs for which the predicate `p` returns `true`.

    Note: This method works by successively removing elements fro which the predicate is false from this set. If removal is slow, or you expect that most elements of the set will be removed, you might consider using `filter` with a negated predicate instead.

    p

      A predicate over key-value pairs

    returns

      A new map containing elements not satisfying the predicate.

    Definition Classes
      MapLike → TraversableLike → GenTraversableLike

61. #### 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()
    Note

      not specified by SLS as a member of AnyRef

62. #### def find(p: ((Key, Value)) ⇒ Boolean): Option[(Key, Value)]

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

    Finds the first element of the open hash 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 open hash map that satisfies `p`, or `None` if none exists.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

63. #### abstract def flatMap[B](f: ((Key, Value)) ⇒ GenTraversableOnce[B]): OpenHashMap[B]

    [use case] Builds a new collection by applying a function to all elements of this open hash map and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this open hash map and using the elements of the resulting collections. For example:

    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 open hash map and concatenating the results.

    Definition Classes
      GenTraversableLike

64. #### def flatMap[B, That](f: ((Key, Value)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

    Builds a new collection by applying a function to all elements of this open hash map and using the elements of the resulting collections.

    Builds a new collection by applying a function to all elements of this open hash map and using the elements of the resulting collections. For example:

         def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of open hash map. This might cause unexpected results sometimes. For example:

         // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
         def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

         // lettersOf will return a Set[Char], not a Seq
         def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)

         // xs will be a an Iterable[Int]
         val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)

         // ys will be a Map[Int, Int]
         val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)

    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 open hash map and concatenating the results.

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

65. #### abstract def flatten[B]: OpenHashMap[B]

    [use case] Converts this open hash map of traversable collections into a open hash map formed by the elements of these traversable collections.

    [use case]

    Converts this open hash map of traversable collections into a open hash map formed by the elements of these traversable collections.

    B

      the type of the elements of each traversable collection.

    returns

      a new open hash map resulting from concatenating all element open hash maps.

    Definition Classes
      GenericTraversableTemplate

66. #### def fold[A1 >: (Key, Value)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this open hash map using the specified associative binary operator.

    Folds the elements of this open hash map using the specified associative binary operator.

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

    A1

      a type parameter for the binary operator, a supertype of `A`.

    z

      a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change 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`

    Definition Classes
      TraversableOnce → GenTraversableOnce

67. #### def foldLeft[B](z: B)(op: (B, (Key, Value)) ⇒ B): B

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

    Applies a binary operator to a start value and all elements of this open hash 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 open hash map, going left to right with the start value `z` on the left:

                      op(...op(z, x1), x2, ..., xn)

      where `x1, ..., xn` are the elements of this open hash map.

    Definition Classes
      TraversableOnce → GenTraversableOnce

68. #### def foldRight[B](z: B)(op: ((Key, Value), B) ⇒ B): B

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

    Applies a binary operator to all elements of this open hash 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 open hash map, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this open hash map.

    Definition Classes
      IterableLike → TraversableOnce → GenTraversableOnce

69. #### def forall(p: ((Key, Value)) ⇒ Boolean): Boolean

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

70. #### def foreach[U](f: ((Key, Value)) ⇒ U): Unit

    Loop over the key, value mappings of this map.

    Loop over the key, value mappings of this map.

    The behaviour of modifying the map during an iteration is as follows:

    - Deleting a mapping is always permitted.
    - Changing the value of mapping which is already present is permitted.
    - Anything else is not permitted. It will usually, but not always, throw an exception.
    U

      The return type of the specified function `f`, return result of which is ignored.

    f

      The function to apply to each key, value mapping.

    Definition Classes
      OpenHashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

71. #### def genericBuilder[B]: Builder[B, Iterable[B]]

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

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

    Definition Classes
      GenericTraversableTemplate

72. #### def get(key: Key): Option[Value]

    Optionally returns the value associated with a key.

    Optionally returns the value associated with a key.

    key

      the key value

    returns

      an option value containing the value associated with `key` in this map, or `None` if none exists.

    Definition Classes
      OpenHashMap → MapLike → GenMapLike

73. #### final def getClass(): java.lang.Class[_]

    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.

    Definition Classes
      AnyRef → Any
    Note

      not specified by SLS as a member of AnyRef

74. #### abstract def getOrElse(key: Key, default: ⇒ Value): Value

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

    [use case]

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

    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 associated with `key` if it exists, otherwise the result of the `default` computation.

    Definition Classes
      MapLike

75. #### def getOrElse[B1 >: Value](key: Key, 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 associated with `key` if it exists, otherwise the result of the `default` computation.

    Definition Classes
      MapLike

76. #### def getOrElseUpdate(key: Key, op: ⇒ Value): Value

    If given key is already in this map, returns associated 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.

    key

      the key to test

    op

      the computation yielding the value to associate with `key`, if `key` is previously unbound.

    returns

      the value associated with key (either previously or as a result of executing the method).

    Definition Classes
      MapLike

77. #### def groupBy[K](f: ((Key, Value)) ⇒ K): Map[K, OpenHashMap[Key, Value]]

    Partitions this open hash map into a map of open hash maps according to some discriminator function.

    Partitions this open hash map into a map of open hash 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 open hash map.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

78. #### def grouped(size: Int): Iterator[OpenHashMap[Key, Value]]

    Partitions elements in fixed size open hash maps.

    Partitions elements in fixed size open hash maps.

    size

      the number of elements per group

    returns

      An iterator producing open hash maps of size `size`, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
      IterableLike
    See also

      Iterator#grouped

79. #### def hasDefiniteSize: Boolean

    Tests whether this open hash map is known to have a finite size.

    Tests whether this open hash 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.

    returns

      `true` if this collection is known to have finite size, `false` otherwise.

    Definition Classes
      TraversableLike → TraversableOnce → GenTraversableOnce

80. #### 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

81. #### def hashOf(key: Key): Int

    Returns a mangled hash code of the provided key.

    Returns a mangled hash code of the provided key.

    Attributes
      protected

82. #### def head: (Key, Value)

    Selects the first element of this open hash map.

    Selects the first element of this open hash map.

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

    returns

      the first element of this open hash map.

    Definition Classes
      IterableLike → GenIterableLike → TraversableLike → GenTraversableLike
    Exceptions thrown
      `NoSuchElementException`

      if the open hash map is empty.

83. #### def headOption: Option[(Key, Value)]

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

      the first element of this open hash map if it is nonempty, `None` if it is empty.

    Definition Classes
      TraversableLike

84. #### def init: OpenHashMap[Key, Value]

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

      a open hash map consisting of all elements of this open hash map except the last one.

    Definition Classes
      TraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the open hash map is empty.

85. #### def inits: Iterator[OpenHashMap[Key, Value]]

    Iterates over the inits of this open hash map.

    Iterates over the inits of this open hash map. The first value will be this open hash map and the final one will be an empty open hash map, with the intervening values the results of successive applications of `init`.

    returns

      an iterator over all the inits of this open hash map

    Definition Classes
      TraversableLike
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

86. #### def isDefinedAt(key: Key): 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
      MapLike → PartialFunction

87. #### def isEmpty: Boolean

    Tests whether the map is empty.

    Tests whether the map is empty.

    returns

      `true` if the map does not contain any key/value binding, `false` otherwise.

    Definition Classes
      MapLike → IterableLike → GenIterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

88. #### final 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.

    Definition Classes
      Any

89. #### final def isTraversableAgain: Boolean

    Tests whether this open hash map can be repeatedly traversed.

    Tests whether this open hash map can be repeatedly traversed.

    returns

      `true`

    Definition Classes
      GenTraversableLike → GenTraversableOnce

90. #### def iterator: Iterator[(Key, Value)]

    An iterator over the elements of this map.

    An iterator over the elements of this map. Use of this iterator follows the same contract for concurrent modification as the foreach method.

    returns

      the iterator

    Definition Classes
      OpenHashMap → MapLike → IterableLike → GenIterableLike

91. #### def keySet: Set[Key]

    Collects all keys of this map in a set.

    Collects all keys of this map in a set.

    returns

      a set containing all keys of this map.

    Definition Classes
      MapLike

92. #### def keys: Iterable[Key]

    Collects all keys of this map in an iterable collection.

    Collects all keys of this map in an iterable collection.

    returns

      the keys of this map as an iterable.

    Definition Classes
      MapLike
    Annotations
      @migration
    Migration

      (Changed in version 2.8.0) `keys` returns `Iterable[A]` rather than `Iterator[A]`.

93. #### def keysIterator: Iterator[Key]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

      an iterator over all keys.

    Definition Classes
      MapLike

94. #### def last: (Key, Value)

    Selects the last element.

    Selects the last element.

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

    returns

      The last element of this open hash map.

    Definition Classes
      TraversableLike
    Exceptions thrown
      NoSuchElementException

      If the open hash map is empty.

95. #### def lastOption: Option[(Key, Value)]

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

      the last element of this open hash map$ if it is nonempty, `None` if it is empty.

    Definition Classes
      TraversableLike

96. #### def lift: (Key) ⇒ Option[Value]

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

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

    returns

      a function that takes an argument `x` to `Some(this(x))` if `this` is defined for `x`, and to `None` otherwise.

    Definition Classes
      PartialFunction
    See also

      Function.unlift

97. #### abstract def map[B](f: ((Key, Value)) ⇒ B): OpenHashMap[B]

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

    [use case]

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

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

    Definition Classes
      GenTraversableLike

98. #### def map[B, That](f: ((Key, Value)) ⇒ B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

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

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

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

99. #### def mapResult[NewTo](f: (OpenHashMap[Key, Value]) ⇒ NewTo): Builder[(Key, Value), 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

100. #### def mapValues[C](f: (Value) ⇒ C): Map[Key, C]

     Transforms this map by applying a function to every retrieved value.

     Transforms this map by applying a function to every retrieved value.

     f

       the function used to transform values of this map.

     returns

       a map view which maps every key of this map to `f(this(key))`. The resulting map wraps the original map without copying any elements.

     Definition Classes
       MapLike

101. #### abstract def max: (Key, Value)

     [use case] Finds the largest element.

     [use case]

     Finds the largest element.

     returns

       the largest element of this open hash map with respect to the ordering `cmp`.

     Definition Classes
       GenTraversableOnce

102. #### def max[B >: (Key, Value)](implicit cmp: Ordering[B]): (Key, Value)

     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 open hash map with respect to the ordering `cmp`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

103. #### def maxBy[B](f: ((Key, Value)) ⇒ B)(implicit cmp: Ordering[B]): (Key, Value)

     Definition Classes
       TraversableOnce → GenTraversableOnce

104. #### abstract def min: (Key, Value)

     [use case] Finds the smallest element.

     [use case]

     Finds the smallest element.

     returns

       the smallest element of this open hash map with respect to the ordering `cmp`.

     Definition Classes
       GenTraversableOnce

105. #### def min[B >: (Key, Value)](implicit cmp: Ordering[B]): (Key, Value)

     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 open hash map with respect to the ordering `cmp`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

106. #### def minBy[B](f: ((Key, Value)) ⇒ B)(implicit cmp: Ordering[B]): (Key, Value)

     Definition Classes
       TraversableOnce → GenTraversableOnce

107. #### def mkString: String

     Displays all elements of this open hash map in a string.

     Displays all elements of this open hash map in a string.

     returns

       a string representation of this open hash map. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this open hash map follow each other without any separator string.

     Definition Classes
       TraversableOnce → GenTraversableOnce

108. #### def mkString(sep: String): String

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

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

     sep

       the separator string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("|") = "1|2|3"`

109. #### def mkString(start: String, sep: String, end: String): String

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

110. #### final 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.

     Definition Classes
       AnyRef

111. #### def newBuilder: Builder[(Key, Value), OpenHashMap[Key, Value]]

     A common implementation of `newBuilder` for all mutable maps in terms of `empty`.

     A common implementation of `newBuilder` for all mutable maps in terms of `empty`.

     Overrides `MapLike` implementation for better efficiency.

     Attributes
       protected[this]
     Definition Classes
       MapLike → MapLike → TraversableLike → HasNewBuilder

112. #### def nonEmpty: Boolean

     Tests whether the open hash map is not empty.

     Tests whether the open hash map is not empty.

     returns

       `true` if the open hash map contains at least one element, `false` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

113. #### final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

114. #### final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

115. #### def orElse[A1 <: Key, B1 >: Value](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

116. #### def par: ParMap[Key, Value]

     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

117. #### def parCombiner: Combiner[(Key, Value), ParMap[Key, Value]]

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

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

     returns

       a combiner for the parallel collection of type `ParRepr`

     Attributes
       protected[this]
     Definition Classes
       MapLike → MapLike → TraversableLike → Parallelizable

118. #### def partition(p: ((Key, Value)) ⇒ Boolean): (OpenHashMap[Key, Value], OpenHashMap[Key, Value])

     Partitions this open hash map in two open hash maps according to a predicate.

     Partitions this open hash map in two open hash maps according to a predicate.

     p

       the predicate on which to partition.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

119. #### abstract def product: (Key, Value)

     [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 open hash map with respect to the `*` operator in `num`.

     Definition Classes
       GenTraversableOnce

120. #### def product[B >: (Key, Value)](implicit num: Numeric[B]): B

     Multiplies up the elements of this collection.

     Multiplies up the elements of this collection.

     B

       the result type of the `*` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `*` operator to be used in forming the product.

     returns

       the product of all elements of this open hash map with respect to the `*` operator in `num`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

121. #### def put(key: Key, value: Value): Option[Value]

     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
       OpenHashMap → MapLike

122. #### def reduce[A1 >: (Key, Value)](op: (A1, A1) ⇒ A1): A1

     Reduces the elements of this open hash map using the specified associative binary operator.

     Reduces the elements of this open hash map using the specified associative binary operator.

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

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       The result of applying reduce operator `op` between all the elements if the open hash map is nonempty.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Exceptions thrown
       UnsupportedOperationException

       if this open hash map is empty.

123. #### def reduceLeft[B >: (Key, Value)](op: (B, (Key, Value)) ⇒ B): B

     Definition Classes
       TraversableOnce

124. #### def reduceLeftOption[B >: (Key, Value)](op: (B, (Key, Value)) ⇒ B): Option[B]

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

     Optionally applies a binary operator to all elements of this open hash 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 open hash map is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

125. #### def reduceOption[A1 >: (Key, Value)](op: (A1, A1) ⇒ A1): Option[A1]

     Reduces the elements of this open hash map, if any, using the specified associative binary operator.

     Reduces the elements of this open hash map, if any, using the specified associative binary operator.

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

     A1

       A type parameter for the binary operator, a supertype of `A`.

     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.

     Definition Classes
       TraversableOnce → GenTraversableOnce

126. #### def reduceRight[B >: (Key, Value)](op: ((Key, Value), B) ⇒ B): B

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

     Applies a binary operator to all elements of this open hash 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 open hash map, going right to left:

                       op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))

       where `x1, ..., xn` are the elements of this open hash map.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce
     Exceptions thrown
       `UnsupportedOperationException`

       if this open hash map is empty.

127. #### def reduceRightOption[B >: (Key, Value)](op: ((Key, Value), B) ⇒ B): Option[B]

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

     Optionally applies a binary operator to all elements of this open hash 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 open hash map is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

128. #### def remove(key: Key): Option[Value]

     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
       OpenHashMap → MapLike

129. #### def repr: OpenHashMap[Key, Value]

     The collection of type open hash map underlying this `TraversableLike` object.

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

     Definition Classes
       TraversableLike → GenTraversableLike

130. #### def result(): OpenHashMap[Key, Value]

     The result when this map is used as a builder

     The result when this map is used as a builder

     returns

       the map representation itself.

     Definition Classes
       MapLike → Builder

131. #### def retain(f: (Key, Value) ⇒ Boolean): OpenHashMap.this.type

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

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

     Definition Classes
       OpenHashMap → MapLike

132. #### def reversed: List[(Key, Value)]

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

133. #### abstract def sameElements(that: GenIterable[(Key, Value)]): Boolean

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

     [use case]

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

     that

       the collection to compare with.

     returns

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

     Definition Classes
       GenIterableLike

134. #### def sameElements[B >: (Key, Value)](that: GenIterable[B]): Boolean

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

     Checks if the other iterable collection contains the same elements in the same order as this open hash 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 → GenIterableLike

135. #### def scan[B >: (Key, Value), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[OpenHashMap[Key, Value], 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 open hash map containing the prefix scan of the elements in this open hash map

     Definition Classes
       TraversableLike → GenTraversableLike

136. #### def scanLeft[B, That](z: B)(op: (B, (Key, Value)) ⇒ B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], 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: might return different results for different runs, unless the underlying collection type is ordered.

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike

137. #### def scanRight[B, That](z: B)(op: ((Key, Value), B) ⇒ B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], 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: might return different results for different runs, unless the underlying collection type is ordered.

     Example:

            List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

138. #### def seq: Map[Key, Value]

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

     A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

     This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

     returns

       a sequential view of the collection.

     Definition Classes
       Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

139. #### def size: Int

     The size of this open hash map.

     The size of this open hash map.

     returns

       the number of elements in this open hash map.

     Definition Classes
       OpenHashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce

140. #### def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta.

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap `size` method. Currently this is assumed to be the case if and only if the collection is of type `IndexedSeqLike`. 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.

     coll

       the collection which serves as a hint for the result's size.

     delta

       a correction to add to the `coll.size` to produce the size hint.

     Definition Classes
       Builder

141. #### 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.

     size

       the hint how many elements will be added.

     Definition Classes
       Builder

142. #### def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection.

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection. 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.

     size

       the hint how many elements will be added.

     boundingColl

       the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

     Definition Classes
       Builder

143. #### def slice(from: Int, until: Int): OpenHashMap[Key, Value]

     Selects an interval of elements.

     Selects an interval of elements. The returned collection is made up of all elements `x` which satisfy the invariant:

            from <= indexOf(x) < until

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

     from

       the lowest index to include from this open hash map.

     until

       the highest index to EXCLUDE from this open hash map.

     returns

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

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

144. #### def sliding[B >: (Key, Value)](size: Int, step: Int): Iterator[OpenHashMap[Key, Value]]

     Definition Classes
       IterableLike

145. #### def sliding[B >: (Key, Value)](size: Int): Iterator[OpenHashMap[Key, Value]]

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

     size

       the number of elements per group

     returns

       An iterator producing open hash maps of size `size`, except the last and the only element will be truncated if there are fewer elements than size.

     Definition Classes
       IterableLike
     See also

       Iterator#sliding

146. #### def span(p: ((Key, Value)) ⇒ Boolean): (OpenHashMap[Key, Value], OpenHashMap[Key, Value])

     Splits this open hash map into a prefix/suffix pair according to a predicate.

     Splits this open hash 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 open hash map whose elements all satisfy `p`, and the rest of this open hash map.

     Definition Classes
       TraversableLike → GenTraversableLike

147. #### def splitAt(n: Int): (OpenHashMap[Key, Value], OpenHashMap[Key, Value])

     Splits this open hash map into two at a given position.

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

     Definition Classes
       TraversableLike → GenTraversableLike

148. #### 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 open hash map. Unless overridden in subclasses, the string prefix of every map is `"Map"`.

     Definition Classes
       OpenHashMap → MapLike → TraversableLike → GenTraversableLike

149. #### abstract def sum: (Key, Value)

     [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 open hash map with respect to the `+` operator in `num`.

     Definition Classes
       GenTraversableOnce

150. #### def sum[B >: (Key, Value)](implicit num: Numeric[B]): B

     Sums up the elements of this collection.

     Sums up the elements of this collection.

     B

       the result type of the `+` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `+` operator to be used in forming the sum.

     returns

       the sum of all elements of this open hash map with respect to the `+` operator in `num`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

151. #### final def synchronized[T0](arg0: ⇒ T0): T0

     Definition Classes
       AnyRef

152. #### def tail: OpenHashMap[Key, Value]

     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 open hash map consisting of all elements of this open hash map except the first one.

     Definition Classes
       TraversableLike → GenTraversableLike
     Exceptions thrown
       `UnsupportedOperationException`

       if the open hash map is empty.

153. #### def tails: Iterator[OpenHashMap[Key, Value]]

     Iterates over the tails of this open hash map.

     Iterates over the tails of this open hash map. The first value will be this open hash map and the final one will be an empty open hash map, with the intervening values the results of successive applications of `tail`.

     returns

       an iterator over all the tails of this open hash map

     Definition Classes
       TraversableLike
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

154. #### def take(n: Int): OpenHashMap[Key, Value]

     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 open hash map.

     returns

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

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

155. #### def takeRight(n: Int): OpenHashMap[Key, Value]

     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 open hash map consisting only of the last `n` elements of this open hash map, or else the whole open hash map, if it has less than `n` elements.

     Definition Classes
       IterableLike

156. #### def takeWhile(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

     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 open hash map whose elements all satisfy the predicate `p`.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

157. #### def thisCollection: Iterable[(Key, Value)]

     The underlying collection seen as an instance of `OpenHashMap`.

     The underlying collection seen as an instance of `OpenHashMap`. By default this is implemented as the current collection object itself, but this can be overridden.

     Attributes
       protected[this]
     Definition Classes
       IterableLike → TraversableLike

158. #### abstract def toArray: Array[(Key, Value)]

     [use case] Converts this open hash map to an array.

     [use case]

     Converts this open hash map to an array.

     returns

       an array containing all elements of this open hash map.

     Definition Classes
       GenTraversableOnce

159. #### def toArray[B >: (Key, Value)](implicit arg0: ClassManifest[B]): Array[B]

     Converts this open hash map to an array.

     Converts this open hash 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 open hash map.

     Definition Classes
       TraversableOnce → GenTraversableOnce

160. #### def toBuffer[C >: (Key, Value)]: Buffer[C]

     Converts this open hash map to a mutable buffer.

     Converts this open hash map to a mutable buffer.

     returns

       a buffer containing all elements of this open hash map.

     Definition Classes
       MapLike → TraversableOnce → GenTraversableOnce

161. #### def toCollection(repr: OpenHashMap[Key, Value]): Iterable[(Key, Value)]

     A conversion from collections of type `Repr` to `OpenHashMap` objects.

     A conversion from collections of type `Repr` to `OpenHashMap` objects. By default this is implemented as just a cast, but this can be overridden.

     Attributes
       protected[this]
     Definition Classes
       IterableLike → TraversableLike

162. #### def toIndexedSeq[B >: (Key, Value)]: IndexedSeq[B]

     Converts this open hash map to an indexed sequence.

     Converts this open hash map to an indexed sequence.

     returns

       an indexed sequence containing all elements of this open hash map.

     Definition Classes
       TraversableOnce → GenTraversableOnce

163. #### def toIterable: Iterable[(Key, Value)]

     Converts this open hash map to an iterable collection.

     Converts this open hash map 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).

     returns

       an `Iterable` containing all elements of this open hash map.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

164. #### def toIterator: Iterator[(Key, Value)]

     Returns an Iterator over the elements in this open hash map.

     Returns an Iterator over the elements in this open hash map. Will return the same Iterator if this instance is already an Iterator.

     returns

       an Iterator containing all elements of this open hash map.

     Definition Classes
       TraversableLike → GenTraversableOnce

165. #### def toList: List[(Key, Value)]

     Converts this open hash map to a list.

     Converts this open hash map to a list.

     returns

       a list containing all elements of this open hash map.

     Definition Classes
       TraversableOnce → GenTraversableOnce

166. #### abstract def toMap[T, U]: Map[T, U]

     [use case] Converts this open hash map to a map.

     [use case]

     Converts this open hash map 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.

     returns

       a map containing all elements of this open hash map.

     Definition Classes
       GenTraversableOnce

167. #### def toMap[T, U](implicit ev: <:<[(Key, Value), (T, U)]): Map[T, U]

     Converts this open hash map to a map.

     Converts this open hash map 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.

     returns

       a map containing all elements of this open hash map.

     Definition Classes
       TraversableOnce → GenTraversableOnce

168. #### def toSeq: Seq[(Key, Value)]

     Converts this open hash map to a sequence.

     Converts this open hash map to a sequence. As with `toIterable`, it's lazy in this default implementation, as this `TraversableOnce` may be lazy and unevaluated.

     returns

       a sequence containing all elements of this open hash map.

     Definition Classes
       MapLike → TraversableOnce → GenTraversableOnce

169. #### def toSet[B >: (Key, Value)]: Set[B]

     Converts this open hash map to a set.

     Converts this open hash map to a set.

     returns

       a set containing all elements of this open hash map.

     Definition Classes
       TraversableOnce → GenTraversableOnce

170. #### def toStream: Stream[(Key, Value)]

     Converts this open hash map to a stream.

     Converts this open hash map to a stream.

     returns

       a stream containing all elements of this open hash map.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

171. #### def toString(): String

     Converts this open hash map to a string.

     Converts this open hash map to a string.

     returns

       a string representation of this collection. By default this string consists of the `stringPrefix` of this open hash map, followed by all elements separated by commas and enclosed in parentheses.

     Definition Classes
       MapLike → TraversableLike → Function1 → AnyRef → Any

172. #### def toTraversable: Traversable[(Key, Value)]

     Converts this open hash map to an unspecified Traversable.

     Converts this open hash map to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

     returns

       a Traversable containing all elements of this open hash map.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

173. #### def transform(f: (Key, Value) ⇒ Value): OpenHashMap.this.type

     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 associated values.

     f

       the transformation to apply

     returns

       the map itself.

     Definition Classes
       OpenHashMap → MapLike

174. #### def transpose[B](implicit asTraversable: ((Key, Value)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

     Transposes this open hash map of traversable collections into a open hash map of open hash maps.

     Transposes this open hash map of traversable collections into a open hash map of open hash maps.

     B

       the type of the elements of each traversable collection.

     asTraversable

       an implicit conversion which asserts that the element type of this open hash map is a `Traversable`.

     returns

       a two-dimensional open hash map of open hash maps which has as nth row the nth column of this open hash map.

     Definition Classes
       GenericTraversableTemplate
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) `transpose` throws an `IllegalArgumentException` if collections are not uniformly sized.

     Exceptions thrown
       `IllegalArgumentException`

       if all collections in this open hash map are not of the same size.

175. #### def unzip[A1, A2](implicit asPair: ((Key, Value)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

     Converts this open hash map of pairs into two collections of the first and second half of each pair.

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

     returns

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

     Definition Classes
       GenericTraversableTemplate

176. #### def unzip3[A1, A2, A3](implicit asTriple: ((Key, Value)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

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

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

     asTriple

       an implicit conversion which asserts that the element type of this open hash map is a triple.

     returns

       a triple open hash maps, containing the first, second, respectively third member of each element triple of this open hash map.

     Definition Classes
       GenericTraversableTemplate

177. #### def update(key: Key, value: Value): 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
       OpenHashMap → MapLike

178. #### def updated[B1 >: Value](key: Key, value: B1): Map[Key, B1]

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

     Creates a new map consisting of all key/value pairs of the current map plus a new pair of a given 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
       MapLike → MapLike

179. #### def values: Iterable[Value]

     Collects all values of this map in an iterable collection.

     Collects all values of this map in an iterable collection.

     returns

       the values of this map as an iterable.

     Definition Classes
       MapLike
     Annotations
       @migration
     Migration

       (Changed in version 2.8.0) `values` returns `Iterable[B]` rather than `Iterator[B]`.

180. #### def valuesIterator: Iterator[Value]

     Creates an iterator for all values in this map.

     Creates an iterator for all values in this map.

     returns

       an iterator over all values that are associated with some key in this map.

     Definition Classes
       MapLike

181. #### def view(from: Int, until: Int): IterableView[(Key, Value), OpenHashMap[Key, Value]]

     Creates a non-strict view of a slice of this open hash map.

     Creates a non-strict view of a slice of this open hash map.

     Note: the difference between `view` and `slice` is that `view` produces a view of the current open hash map, whereas `slice` produces a new open hash 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 open hash map, starting at index `from` and extending up to (but not including) index `until`.

     Definition Classes
       IterableLike → TraversableLike

182. #### def view: IterableView[(Key, Value), OpenHashMap[Key, Value]]

     Creates a non-strict view of this open hash map.

     Creates a non-strict view of this open hash map.

     returns

       a non-strict view of this open hash map.

     Definition Classes
       IterableLike → TraversableLike

183. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

184. #### final def wait(arg0: Long, arg1: Int): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

185. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

186. #### def withDefault(d: (Key) ⇒ Value): Map[Key, Value]

     The same map with a given default function.

     The same map with a given default function.

     Invoking transformer methods (e.g. `map`) will not preserve the default value.

     d

       the function mapping keys to values, used for non-present keys

     returns

       a wrapper of the map with a default value

     Definition Classes
       Map

187. #### def withDefaultValue(d: Value): Map[Key, Value]

     The same map with a given default value.

     The same map with a given default value.

     Invoking transformer methods (e.g. `map`) will not preserve the default value.

     d

       the function mapping keys to values, used for non-present keys

     returns

       a wrapper of the map with a default value

     Definition Classes
       Map

188. #### def withFilter(p: ((Key, Value)) ⇒ Boolean): FilterMonadic[(Key, Value), OpenHashMap[Key, Value]]

     Creates a non-strict filter of this open hash map.

     Creates a non-strict filter of this open hash 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 open hash map which satisfy the predicate `p`.

     Definition Classes
       TraversableLike → FilterMonadic

189. #### abstract def zip[B](that: GenIterable[B]): OpenHashMap[((Key, Value), B)]

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

     [use case]

     Returns a open hash map formed from this open hash 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.

     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 open hash map and `that`. The length of the returned collection is the minimum of the lengths of this open hash map and `that`.

     Definition Classes
       GenIterableLike

190. #### def zip[A1 >: (Key, Value), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], (A1, B), That]): That

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

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

     Definition Classes
       IterableLike → GenIterableLike

191. #### abstract def zipAll[B](that: Iterable[B], thisElem: (Key, Value), thatElem: B): OpenHashMap[((Key, Value), B)]

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

     [use case]

     Returns a open hash map formed from this open hash 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.

     that

       the iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Definition Classes
       GenIterableLike

192. #### def zipAll[B, A1 >: (Key, Value), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], (A1, B), That]): That

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

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

     thatElem

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

193. #### abstract def zipWithIndex: OpenHashMap[((Key, Value), Int)]

     [use case] Zips this open hash map with its indices.

     [use case]

     Zips this open hash map with its indices.

     returns

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

     Definition Classes
       GenIterableLike

194. #### def zipWithIndex[A1 >: (Key, Value), That](implicit bf: CanBuildFrom[OpenHashMap[Key, Value], (A1, Int), That]): That

     Zips this open hash map with its indices.

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

     Definition Classes
       IterableLike → GenIterableLike

### Deprecated Value Members

1. #### def elements: Iterator[(Key, Value)]

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     (Since version 2.8.0) use `iterator' instead`

2. #### def first: (Key, Value)

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     (Since version 2.8.0) use `head' instead`

3. #### def firstOption: Option[(Key, Value)]

   `None` if iterable is empty.

   `None` if iterable is empty.

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     (Since version 2.8.0) use `headOption' instead`

4. #### def mapElements[C](f: (Value) ⇒ C): Map[Key, C]

   Definition Classes
     MapLike
   Annotations
     @deprecated
   Deprecated

     (Since version 2.8.0) use `mapValues' instead`

5. #### def projection: IterableView[(Key, Value), OpenHashMap[Key, Value]]

   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
   Annotations
     @deprecated
   Deprecated

     (Since version 2.8.0) use `view' instead`

6. #### def removeKey(key: Key): Option[Value]

   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
   Annotations
     @deprecated
   Deprecated

     (Since version 2.8.0) Use `remove' instead`

### Inherited from Map[Key, Value]

### Inherited from MapLike[Key, Value, OpenHashMap[Key, Value]]

### Inherited from Cloneable[OpenHashMap[Key, Value]]

### Inherited from Shrinkable[Key]

### Inherited from Builder[(Key, Value), OpenHashMap[Key, Value]]

### Inherited from Growable[(Key, Value)]

### Inherited from Map[Key, Value]

### Inherited from MapLike[Key, Value, OpenHashMap[Key, Value]]

### Inherited from Subtractable[Key, OpenHashMap[Key, Value]]

### Inherited from PartialFunction[Key, Value]

### Inherited from (Key) ⇒ Value

### Inherited from GenMap[Key, Value]

### Inherited from GenMapLike[Key, Value, OpenHashMap[Key, Value]]

### Inherited from Iterable[(Key, Value)]

### Inherited from IterableLike[(Key, Value), OpenHashMap[Key, Value]]

### Inherited from Equals

### Inherited from GenIterable[(Key, Value)]

### Inherited from GenIterableLike[(Key, Value), OpenHashMap[Key, Value]]

### Inherited from Traversable[(Key, Value)]

### Inherited from Mutable

### Inherited from Traversable[(Key, Value)]

### Inherited from GenTraversable[(Key, Value)]

### Inherited from GenericTraversableTemplate[(Key, Value), Iterable]

### Inherited from TraversableLike[(Key, Value), OpenHashMap[Key, Value]]

### Inherited from GenTraversableLike[(Key, Value), OpenHashMap[Key, Value]]

### Inherited from Parallelizable[(Key, Value), ParMap[Key, Value]]

### Inherited from TraversableOnce[(Key, Value)]

### Inherited from GenTraversableOnce[(Key, Value)]

### Inherited from FilterMonadic[(Key, Value), OpenHashMap[Key, Value]]

### Inherited from HasNewBuilder[(Key, Value), OpenHashMap[Key, Value]]

### Inherited from AnyRef

### Inherited from Any