scala.collection.immutable

HashMap

class HashMap [A, +B] extends Map[A, B] with MapLike[A, B, HashMap[A, B]] with Serializable with CustomParallelizable[(A, B), ParHashMap[A, B]]

This class implements immutable maps using a hash trie.

Note: the builder of a hash map returns specialized representations EmptyMap,Map1,..., Map4 for maps of size <= 4.

A

the type of the keys contained in this hash map.

B

the type of the values associated with the keys.

Annotations
@SerialVersionUID( uid = 2L )
Source
HashMap.scala
Version

2.8

Since

2.3

Linear Supertypes
CustomParallelizable[(A, B), ParHashMap[A, B]], Serializable, Serializable, Map[A, B], MapLike[A, B, HashMap[A, B]], Map[A, B], MapLike[A, B, HashMap[A, B]], Subtractable[A, HashMap[A, B]], PartialFunction[A, B], (A) ⇒ B, GenMap[A, B], GenMapLike[A, B, HashMap[A, B]], Iterable[(A, B)], Iterable[(A, B)], IterableLike[(A, B), HashMap[A, B]], Equals, GenIterable[(A, B)], GenIterableLike[(A, B), HashMap[A, B]], Traversable[(A, B)], Immutable, Traversable[(A, B)], GenTraversable[(A, B)], GenericTraversableTemplate[(A, B), Iterable], TraversableLike[(A, B), HashMap[A, B]], GenTraversableLike[(A, B), HashMap[A, B]], Parallelizable[(A, B), ParHashMap[A, B]], TraversableOnce[(A, B)], GenTraversableOnce[(A, B)], FilterMonadic[(A, B), HashMap[A, B]], HasNewBuilder[(A, B), HashMap[A, B]], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. HashMap
  2. CustomParallelizable
  3. Serializable
  4. Serializable
  5. Map
  6. MapLike
  7. Map
  8. MapLike
  9. Subtractable
  10. PartialFunction
  11. Function1
  12. GenMap
  13. GenMapLike
  14. Iterable
  15. Iterable
  16. IterableLike
  17. Equals
  18. GenIterable
  19. GenIterableLike
  20. Traversable
  21. Immutable
  22. Traversable
  23. GenTraversable
  24. GenericTraversableTemplate
  25. TraversableLike
  26. GenTraversableLike
  27. Parallelizable
  28. TraversableOnce
  29. GenTraversableOnce
  30. FilterMonadic
  31. HasNewBuilder
  32. AnyRef
  33. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HashMap ()

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 Merger [B1] = ((A, B1), (A, B1)) ⇒ (A, B1)

    Attributes
    protected
  4. type Self = HashMap[A, B]

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected
    Definition Classes
    TraversableLike
  5. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

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

    Equivalent to x.hashCode except for boxed numeric types.

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

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def + [B1 >: B] (elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): HashMap[A, B1]

    Adds two or more elements to this collection and returns a new collection.

    Adds two or more elements to this collection and returns a new collection.

    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 with the new bindings added to this map.

    Definition Classes
    HashMapMapLikeMapLike
  5. def + [B1 >: B] (kv: (A, B1)): HashMap[A, B1]

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

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

    B1

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

    kv

    the key/value pair.

    returns

    A new map with the new binding added to this map.

    Definition Classes
    HashMapMapMapLikeMapLike → GenMapLike
  6. def ++ [B1 >: B] (xs: TraversableOnce[(A, B1)]): Map[A, B1]

    Definition Classes
    MapLikeMapLike
    Annotations
    @bridge()
  7. def ++ [B1 >: B] (xs: GenTraversableOnce[(A, B1)]): Map[A, B1]

    Adds a number of elements provided by a traversable object and returns a new collection with the added elements.

    Adds a number of elements provided by a traversable object and returns a new collection with the added elements.

    B1

    the type of the added values

    xs

    the traversable object consisting of key-value pairs.

    returns

    a new immutable map with the bindings of this map and those from xs.

    Definition Classes
    MapLikeMapLike
  8. def ++ [B >: (A, B), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  9. def ++ [B] (that: GenTraversableOnce[B]): immutable.HashMap[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  10. def ++ [B >: (A, B), That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

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

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  11. def ++: [B >: (A, B), That] (that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

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

    Definition Classes
    TraversableLike
  12. def ++: [B] (that: TraversableOnce[B]): immutable.HashMap[B]

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

    [use case]

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

    Attributes
    abstract
    Definition Classes
    TraversableLike
  13. def ++: [B >: (A, B), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

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

    Definition Classes
    TraversableLike
  14. def - (key: A): Map[A, B]

    [use case] Removes a key from this map, returning a new map.

    [use case]

    Removes a key from this map, returning a new map.

    key

    the key to be removed

    returns

    a new map without a binding for key

    Attributes
    abstract
    Definition Classes
    MapLike
  15. def - (key: A): HashMap[A, B]

    Removes a key from this map, returning a new map.

    Removes a key from this map, returning a new map.

    key

    the key to be removed

    returns

    a new map without a binding for key

    Definition Classes
    HashMapMapLikeSubtractable → GenMapLike
  16. def - (elem1: A, elem2: A, elems: A*): HashMap[A, B]

    Creates a new immutable hash map from this immutable hash map with some elements removed.

    Creates a new immutable hash map from this immutable hash map with some elements removed.

    This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

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

    Definition Classes
    Subtractable
  17. def -- (xs: TraversableOnce[A]): HashMap[A, B]

    Definition Classes
    Subtractable
    Annotations
    @bridge()
  18. def -- (xs: GenTraversableOnce[A]): HashMap[A, B]

    Creates a new immutable hash map from this immutable hash map by removing all elements of another collection.

    Creates a new immutable hash map from this immutable hash map by removing all elements of another collection.

    returns

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

    Definition Classes
    Subtractable
  19. def /: [B] (z: B)(op: (B, (A, B)) ⇒ B): B

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

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

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

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable hash map, going left to right with the start value z on the left:

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

    where x,,1,,, ..., x,,n,, are the elements of this immutable hash map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  20. def /:\ [A1 >: (A, B)] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

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

    Definition Classes
    GenTraversableOnce
  21. def :\ [B] (z: B)(op: ((A, B), B) ⇒ B): B

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

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

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

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

    where x,,1,,, ..., x,,n,, are the elements of this immutable hash map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  22. def == (arg0: AnyRef): Boolean

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

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  24. 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
    MapLikeTraversableOnce
  25. def addString (b: StringBuilder): StringBuilder

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

    Appends all elements of this immutable 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 immutable hash map without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  26. def addString (b: StringBuilder, sep: String): StringBuilder

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

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

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  27. def aggregate [B] (z: B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    z

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

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  28. def andThen [C] (k: (B) ⇒ C): PartialFunction[A, C]

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

    Definition Classes
    PartialFunctionFunction1
  29. def apply (key: A): B

    Retrieves the value which is associated with the given key.

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

    key

    the key

    returns

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

    Definition Classes
    MapLike → GenMapLike → Function1
  30. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  31. def canEqual (that: Any): Boolean

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

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

    that

    The object with which this immutable hash map should be compared

    returns

    true, if this immutable 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
    IterableLikeEquals
  32. def clone (): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  33. def collect [B] (pf: PartialFunction[(A, B), B]): immutable.HashMap[B]

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

    [use case]

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  34. def collect [B, That] (pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

    Builds a new collection by applying a partial function to all elements of this immutable 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 immutable 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
  35. def collectFirst [B] (pf: PartialFunction[(A, B), B]): Option[B]

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

    Finds the first element of the immutable 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)

  36. def companion : GenericCompanion[Iterable]

    The factory companion object that builds instances of class immutable.

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

    Definition Classes
    IterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  37. def compose [A] (g: (A) ⇒ A): (A) ⇒ B

    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
  38. def contains (key: A): Boolean

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key.

    key

    the key

    returns

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

    Definition Classes
    MapLike
  39. def copyToArray (xs: Array[(A, B)], start: Int, len: Int): Unit

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

    [use case]

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

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

    Copies elements of this immutable hash map to an array.

    Copies elements of this immutable hash map to an array. Fills the given array xs with at most len elements of this immutable hash map, starting at position start. Copying will stop once either the end of the current immutable 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  41. def copyToArray (xs: Array[(A, B)]): Unit

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

    [use case]

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

    xs

    the array to fill.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  42. def copyToArray [B >: (A, B)] (xs: Array[B]): Unit

    Copies values of this immutable hash map to an array.

    Copies values of this immutable hash map to an array. Fills the given array xs with values of this immutable hash map. Copying will stop once either the end of the current immutable 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
    TraversableOnceGenTraversableOnce
  43. def copyToArray (xs: Array[(A, B)], start: Int): Unit

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

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

    Copies values of this immutable hash map to an array.

    Copies values of this immutable hash map to an array. Fills the given array xs with values of this immutable hash map, beginning at index start. Copying will stop once either the end of the current immutable 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
    TraversableOnceGenTraversableOnce
  45. def copyToBuffer [B >: (A, B)] (dest: Buffer[B]): Unit

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

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

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  46. def count (p: ((A, B)) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  47. def default (key: A): B

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

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

    key

    the given key value for which a binding is missing.

    Definition Classes
    MapLike → GenMapLike
  48. def drop (n: Int): HashMap[A, B]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

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

    n

    the number of elements to drop from this immutable hash map.

    returns

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

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  49. def dropRight (n: Int): HashMap[A, B]

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

    Definition Classes
    IterableLike
  50. def dropWhile (p: ((A, B)) ⇒ Boolean): HashMap[A, B]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

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

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  51. def elemHashCode (key: A): Int

    Attributes
    protected
  52. def empty : HashMap[A, B]

    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
    HashMapMapMapMapLike
  53. def eq (arg0: AnyRef): Boolean

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

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

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

    • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
    • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
    • null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  54. 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
  55. def exists (p: ((A, B)) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  56. def filter (p: ((A, B)) ⇒ Boolean): HashMap[A, B]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  57. def filterKeys (p: (A) ⇒ Boolean): Map[A, B]

    Filters this map by retaining only keys satisfying a predicate.

    Filters this map by retaining only keys satisfying a predicate.

    p

    the predicate used to test keys

    returns

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

    Definition Classes
    MapLikeMapLike
  58. def filterNot (p: ((A, B)) ⇒ Boolean): HashMap[A, B]

    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
    MapLikeTraversableLike → GenTraversableLike
  59. 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()
  60. def find (p: ((A, B)) ⇒ Boolean): Option[(A, B)]

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

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

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  61. def flatMap [B] (f: ((A, B)) ⇒ GenTraversableOnce[B]): immutable.HashMap[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this immutable hash map and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  62. def flatMap [B, That] (f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

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

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this immutable hash map and concatenating the results.

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  63. def flatten [B] : immutable.HashMap[B]

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

    [use case]

    Converts this immutable hash map of traversable collections into a immutable hash map in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenericTraversableTemplate
  64. def flatten [B] (implicit asTraversable: ((A, B)) ⇒ TraversableOnce[B]): Traversable[B]

    Converts this immutable hash map of traversable collections into a immutable hash map in which all element collections are concatenated.

    Converts this immutable hash map of traversable collections into a immutable hash map in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  65. def fold [A1 >: (A, B)] (z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

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

    z

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

    op

    a binary operator that must be associative

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  66. def foldLeft [B] (z: B)(op: (B, (A, B)) ⇒ B): B

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

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

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

    where x,,1,,, ..., x,,n,, are the elements of this immutable hash map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  67. def foldRight [B] (z: B)(op: ((A, B), B) ⇒ B): B

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

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

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

    where x,,1,,, ..., x,,n,, are the elements of this immutable hash map.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  68. def forall (p: ((A, B)) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  69. def foreach (f: ((A, B)) ⇒ Unit): Unit

    [use case] Applies a function f to all elements of this immutable hash map.

    [use case]

    Applies a function f to all elements of this immutable hash map.

    f

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

    Attributes
    abstract
    Definition Classes
    IterableLike
  70. def foreach [U] (f: ((A, B)) ⇒ U): Unit

    Applies a function f to all elements of this immutable hash map.

    Applies a function f to all elements of this immutable hash map.

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

    U

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

    f

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

    Definition Classes
    HashMapIterableLikeGenericTraversableTemplateTraversableLike → GenTraversableLike → TraversableOnceGenTraversableOnceFilterMonadic
  71. def genericBuilder [B] : Builder[B, Iterable[B]]

    The generic builder that builds instances of immutable.

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

    Definition Classes
    GenericTraversableTemplate
  72. def get (key: A): Option[B]

    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
    HashMapMapLike → GenMapLike
  73. def getClass (): java.lang.Class[_ <: java.lang.Object]

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

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

    The nature of the representation is platform dependent.

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  74. def getOrElse (key: A, default: ⇒ B): B

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

    Attributes
    abstract
    Definition Classes
    MapLike
  75. def getOrElse [B1 >: B] (key: A, default: ⇒ B1): B1

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

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

    B1

    the result type of the default computation.

    key

    the key.

    default

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

    returns

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

    Definition Classes
    MapLike
  76. def groupBy [K] (f: ((A, B)) ⇒ K): Map[K, HashMap[A, B]]

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

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

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  77. def grouped (size: Int): Iterator[HashMap[A, B]]

    Partitions elements in fixed size immutable hash maps.

    Partitions elements in fixed size immutable hash maps.

    size

    the number of elements per group

    returns

    An iterator producing immutable 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

  78. def hasDefiniteSize : Boolean

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

    Tests whether this immutable 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
    TraversableLikeTraversableOnceGenTraversableOnce
  79. 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
  80. def head : (A, B)

    Selects the first element of this immutable hash map.

    Selects the first element of this immutable hash map.

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

    returns

    the first element of this immutable hash map.

    Definition Classes
    IterableLike → GenIterableLike → TraversableLike → GenTraversableLike
  81. def headOption : Option[(A, B)]

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

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

    Definition Classes
    TraversableLike
  82. def improve (hcode: Int): Int

    Attributes
    protected final
  83. def init : HashMap[A, B]

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

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

    Definition Classes
    TraversableLike
  84. def inits : Iterator[HashMap[A, B]]

    Iterates over the inits of this immutable hash map.

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

    returns

    an iterator over all the inits of this immutable hash map

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  85. def isDefinedAt (key: A): Boolean

    Tests whether this map contains a binding for a key.

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

    key

    the key

    returns

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

    Definition Classes
    MapLikePartialFunction
  86. 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
    MapLikeIterableLike → GenIterableLike → TraversableLikeTraversableOnceGenTraversableOnce
  87. def isInstanceOf [T0] : Boolean

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

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

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  88. def isTraversableAgain : Boolean

    Tests whether this immutable hash map can be repeatedly traversed.

    Tests whether this immutable hash map can be repeatedly traversed.

    returns

    true

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  89. def iterator : Iterator[(A, B)]

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

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

    returns

    the new iterator

    Definition Classes
    HashMapMapLikeIterableLike → GenIterableLike
  90. def keySet : Set[A]

    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
    MapLikeMapLike
  91. def keys : Iterable[A]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    MapLike
    Annotations
    @migration
    Migration

    "As of 2.8, keys returns Iterable[A] rather than Iterator[A]."

  92. def keysIterator : Iterator[A]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    MapLike
  93. def last : (A, B)

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

    Definition Classes
    TraversableLike
  94. def lastOption : Option[(A, B)]

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

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

    Definition Classes
    TraversableLike
  95. def lift : (A) ⇒ Option[B]

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

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

    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

  96. def map [B] (f: ((A, B)) ⇒ B): immutable.HashMap[B]

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

    [use case]

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  97. def map [B, That] (f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  98. def mapValues [C] (f: (B) ⇒ C): Map[A, 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
    MapLikeMapLike
  99. def max : (A, B)

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  100. def max [B >: (A, B)] (implicit cmp: Ordering[B]): (A, B)

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  101. def maxBy [B] (f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnceGenTraversableOnce
  102. def merge [B1 >: B] (that: HashMap[A, B1], merger: Merger[B1]): HashMap[A, B1]

  103. def merge0 [B1 >: B] (that: HashMap[A, B1], level: Int, merger: Merger[B1]): HashMap[A, B1]

    Attributes
    protected
  104. def min : (A, B)

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  105. def min [B >: (A, B)] (implicit cmp: Ordering[B]): (A, B)

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  106. def minBy [B] (f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnceGenTraversableOnce
  107. def mkString : String

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

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

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  108. def mkString (sep: String): String

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

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

    sep

    the separator string.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
    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 immutable hash map in a string using start, end, and separator strings.

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

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

  110. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

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

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

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

    Attributes
    protected[this]
    Definition Classes
    MapLikeTraversableLikeHasNewBuilder
  112. def nonEmpty : Boolean

    Tests whether the immutable hash map is not empty.

    Tests whether the immutable hash map is not empty.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  113. def notify (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
  114. def notifyAll (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
  115. def orElse [A1 <: A, B1 >: B] (that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

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

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

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

    Definition Classes
    PartialFunction
  116. def par : ParHashMap[A, B]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    HashMapCustomParallelizableParallelizable
  117. def parCombiner : Combiner[(A, B), ParHashMap[A, B]]

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizableParallelizable
  118. def partition (p: ((A, B)) ⇒ Boolean): (HashMap[A, B], HashMap[A, B])

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

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

    p

    the predicate on which to partition.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  119. def product : (A, B)

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

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  120. def product [B >: (A, B)] (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 immutable hash map with respect to the * operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  121. def reduce [A1 >: (A, B)] (op: (A1, A1) ⇒ A1): A1

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  122. def reduceLeft [B >: (A, B)] (op: (B, (A, B)) ⇒ B): B

    Definition Classes
    TraversableOnce
  123. def reduceLeftOption [B >: (A, B)] (op: (B, (A, B)) ⇒ B): Option[B]

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

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  124. def reduceOption [A1 >: (A, B)] (op: (A1, A1) ⇒ A1): Option[A1]

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  125. def reduceRight [B >: (A, B)] (op: ((A, B), B) ⇒ B): B

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

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

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

    where x,,1,,, ..., x,,n,, are the elements of this immutable hash map.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  126. def reduceRightOption [B >: (A, B)] (op: ((A, B), B) ⇒ B): Option[B]

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

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  127. def removed0 (key: A, hash: Int, level: Int): HashMap[A, B]

    Attributes
    protected
  128. def repr : HashMap[A, B]

    The collection of type immutable hash map underlying this TraversableLike object.

    The collection of type immutable 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
  129. def reversed : List[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  130. def sameElements [B >: (A, B)] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  131. def sameElements (that: GenIterable[(A, B)]): Boolean

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

    [use case]

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

    that

    the collection to compare with.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  132. def sameElements [B >: (A, B)] (that: GenIterable[B]): Boolean

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

    Checks if the other iterable collection contains the same elements in the same order as this immutable 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
  133. def scan [B >: (A, B), That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashMap[A, B], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

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

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new immutable hash map containing the prefix scan of the elements in this immutable hash map

    Definition Classes
    TraversableLike → GenTraversableLike
  134. def scanLeft [B, That] (z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

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

    Note: 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
  135. def scanRight [B, That] (z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[HashMap[A, B], B, That]): That

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

    Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

    Note: 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

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

  136. def seq : Map[A, B]

    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
    MapMapGenMap → GenMapLike → IterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  137. def size : Int

    The size of this immutable hash map.

    The size of this immutable hash map.

    returns

    the number of elements in this immutable hash map.

    Definition Classes
    HashMap → GenTraversableLike → TraversableOnceGenTraversableOnce
  138. def slice (from: Int, until: Int): HashMap[A, B]

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    

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

    from

    the lowest index to include from this immutable hash map.

    until

    the highest index to EXCLUDE from this immutable hash map.

    returns

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

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  139. def sliding [B >: (A, B)] (size: Int, step: Int): Iterator[HashMap[A, B]]

    Definition Classes
    IterableLike
  140. def sliding [B >: (A, B)] (size: Int): Iterator[HashMap[A, B]]

    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 immutable 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

  141. def span (p: ((A, B)) ⇒ Boolean): (HashMap[A, B], HashMap[A, B])

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  142. def split : Seq[HashMap[A, B]]

  143. def splitAt (n: Int): (HashMap[A, B], HashMap[A, B])

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  144. 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 immutable hash map. Unless overridden in subclasses, the string prefix of every map is "Map".

    Definition Classes
    MapLikeTraversableLike → GenTraversableLike
  145. def sum : (A, B)

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

    [use case]

    Sums up the elements of this collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  146. def sum [B >: (A, B)] (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 immutable hash map with respect to the + operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  147. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  148. def tail : HashMap[A, B]

    Selects all elements except the first.

    Selects all elements except the first.

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

    returns

    a immutable hash map consisting of all elements of this immutable hash map except the first one.

    Definition Classes
    TraversableLike → GenTraversableLike
  149. def tails : Iterator[HashMap[A, B]]

    Iterates over the tails of this immutable hash map.

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

    returns

    an iterator over all the tails of this immutable hash map

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  150. def take (n: Int): HashMap[A, B]

    Selects first n elements.

    Selects first n elements.

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

    n

    Tt number of elements to take from this immutable hash map.

    returns

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

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  151. def takeRight (n: Int): HashMap[A, B]

    Selects last n elements.

    Selects last n elements.

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

    n

    the number of elements to take

    returns

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

    Definition Classes
    IterableLike
  152. def takeWhile (p: ((A, B)) ⇒ Boolean): HashMap[A, B]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

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

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  153. def thisCollection : Iterable[(A, B)]

    The underlying collection seen as an instance of immutable.HashMap.

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

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  154. def toArray : Array[(A, B)]

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

    [use case]

    Converts this immutable hash map to an array.

    returns

    an array containing all elements of this immutable hash map.

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

    Converts this immutable hash map to an array.

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  156. def toBuffer [C >: (A, B)] : Buffer[C]

    Converts this immutable hash map to a mutable buffer.

    Converts this immutable hash map to a mutable buffer.

    returns

    a buffer containing all elements of this immutable hash map.

    Definition Classes
    MapLikeTraversableOnceGenTraversableOnce
  157. def toCollection (repr: HashMap[A, B]): Iterable[(A, B)]

    A conversion from collections of type Repr to immutable.HashMap objects.

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

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  158. def toIndexedSeq [B >: (A, B)] : IndexedSeq[B]

    Converts this immutable hash map to an indexed sequence.

    Converts this immutable hash map to an indexed sequence.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  159. def toIterable : Iterable[(A, B)]

    Converts this immutable hash map to an iterable collection.

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

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  160. def toIterator : Iterator[(A, B)]

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

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

    returns

    an Iterator containing all elements of this immutable hash map.

    Definition Classes
    TraversableLikeGenTraversableOnce
  161. def toList : List[(A, B)]

    Converts this immutable hash map to a list.

    Converts this immutable hash map to a list.

    returns

    a list containing all elements of this immutable hash map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  162. def toMap [T, U] : Map[T, U]

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

    [use case]

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  163. def toMap [T, U] (implicit ev: <:<[(A, B), (T, U)]): Map[T, U]

    Converts this immutable hash map to a map.

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

    Definition Classes
    MapTraversableOnceGenTraversableOnce
  164. def toSeq : Seq[(A, B)]

    Overridden for efficiency.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this immutable hash map.

    Definition Classes
    MapLikeTraversableOnceGenTraversableOnce
  165. def toSet [B >: (A, B)] : Set[B]

    Converts this immutable hash map to a set.

    Converts this immutable hash map to a set.

    returns

    a set containing all elements of this immutable hash map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  166. def toStream : Stream[(A, B)]

    Converts this immutable hash map to a stream.

    Converts this immutable hash map to a stream.

    returns

    a stream containing all elements of this immutable hash map.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  167. def toString (): String

    Converts this immutable hash map to a string.

    Converts this immutable hash map to a string.

    returns

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

    Definition Classes
    MapLikeTraversableLikeFunction1 → AnyRef → Any
  168. def toTraversable : Traversable[(A, B)]

    Converts this immutable hash map to an unspecified Traversable.

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

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  169. def transform [C, That] (f: (A, B) ⇒ C)(implicit bf: CanBuildFrom[HashMap[A, B], (A, C), That]): That

    This function transforms all the values of mappings contained in this map with function f.

    This function transforms all the values of mappings contained in this map with function f.

    f

    A function over keys and values

    returns

    the updated map

    Definition Classes
    MapLike
  170. def transpose [B] (implicit asTraversable: ((A, B)) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  171. def unzip [A1, A2] (implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

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

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  172. def unzip3 [A1, A2, A3] (implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

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

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  173. def updated [B1 >: B] (key: A, value: B1): HashMap[A, B1]

    Add a key/value pair to this map.

    Add a key/value pair to this map.

    B1

    the type of the added value

    key

    the key

    value

    the value

    returns

    A new map with the new binding added to this map

    Definition Classes
    HashMapMapMapLikeMapLike
  174. def values : Iterable[B]

    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

    "As of 2.8, values returns Iterable[B] rather than Iterator[B]."

  175. def valuesIterator : Iterator[B]

    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
  176. def view (from: Int, until: Int): IterableView[(A, B), HashMap[A, B]]

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

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

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

    Definition Classes
    IterableLikeTraversableLike
  177. def view : IterableView[(A, B), HashMap[A, B]]

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

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

    returns

    a non-strict view of this immutable hash map.

    Definition Classes
    IterableLikeTraversableLike
  178. def wait (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  181. def withDefault [B1 >: B] (d: (A) ⇒ B1): Map[A, B1]

    The same map with a given default function.

    The same map with a given default function. Note: get, contains, iterator, keys, etc are not affected by withDefault.

    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
  182. def withDefaultValue [B1 >: B] (d: B1): Map[A, B1]

    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
  183. def withFilter (p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), HashMap[A, B]]

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

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

    Definition Classes
    TraversableLikeFilterMonadic
  184. def writeReplace (): AnyRef

    Attributes
    protected
  185. def zip [A1 >: (A, B), B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[HashMap[A, B], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  186. def zip [B] (that: GenIterable[B]): immutable.HashMap[((A, B), B)]

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

    [use case]

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  187. def zip [A1 >: (A, B), B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[A, B], (A1, B), That]): That

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

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

    Definition Classes
    IterableLike → GenIterableLike
  188. def zipAll [B, A1 >: (A, B), That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[A, B], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  189. def zipAll [B] (that: Iterable[B], thisElem: (A, B), thatElem: B): immutable.HashMap[((A, B), B)]

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

    [use case]

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

    thatElem

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

    returns

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

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

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

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

    thatElem

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

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  191. def zipWithIndex : immutable.HashMap[((A, B), Int)]

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

    [use case]

    Zips this immutable hash map with its indices.

    returns

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

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

    Zips this immutable hash map with its indices.

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

    Definition Classes
    IterableLike → GenIterableLike
  193. def elements : Iterator[(A, B)]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  194. def first : (A, B)

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

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

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  196. def mapElements [C] (f: (B) ⇒ C): Map[A, C]

    Definition Classes
    MapLike
    Annotations
    @deprecated
    Deprecated

    use mapValues' instead

  197. def projection : IterableView[(A, B), HashMap[A, B]]

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

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

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

Inherited from CustomParallelizable[(A, B), ParHashMap[A, B]]

Inherited from Serializable

Inherited from Serializable

Inherited from Map[A, B]

Inherited from MapLike[A, B, HashMap[A, B]]

Inherited from Map[A, B]

Inherited from MapLike[A, B, HashMap[A, B]]

Inherited from Subtractable[A, HashMap[A, B]]

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from GenMap[A, B]

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

Inherited from Iterable[(A, B)]

Inherited from Iterable[(A, B)]

Inherited from IterableLike[(A, B), HashMap[A, B]]

Inherited from Equals

Inherited from GenIterable[(A, B)]

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

Inherited from Traversable[(A, B)]

Inherited from Immutable

Inherited from Traversable[(A, B)]

Inherited from GenTraversable[(A, B)]

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

Inherited from TraversableLike[(A, B), HashMap[A, B]]

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

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

Inherited from TraversableOnce[(A, B)]

Inherited from GenTraversableOnce[(A, B)]

Inherited from FilterMonadic[(A, B), HashMap[A, B]]

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

Inherited from AnyRef

Inherited from Any