Packages

sealed abstract class HashMap[K, +V] extends Map[K, V] with MapOps[K, V, HashMap, HashMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, HashMap[K, V]] with Serializable

This class implements immutable maps using a hash trie.

Note: The builder of this hash map may return specialized representations for small maps.

K

the type of the keys contained in this hash map.

V

the type of the values associated with the keys.

Annotations
@SerialVersionUID()
Source
HashMap.scala
Version

2.8

Since

2.3

See also

"Scala's Collection Library overview" section on Hash Tries for more information.

Linear Supertypes
Serializable, java.io.Serializable, StrictOptimizedIterableOps[(K, V), Iterable, HashMap[K, V]], Map[K, V], MapOps[K, V, HashMap, HashMap[K, V]], collection.Map[K, V], Equals, collection.MapOps[K, V, HashMap, HashMap[K, V]], PartialFunction[K, V], (K) ⇒ V, Iterable[(K, V)], collection.Iterable[(K, V)], IterableOps[(K, V), Iterable, HashMap[K, V]], IterableOnceOps[(K, V), Iterable, HashMap[K, V]], IterableOnce[(K, V)], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HashMap
  2. Serializable
  3. Serializable
  4. StrictOptimizedIterableOps
  5. Map
  6. MapOps
  7. Map
  8. Equals
  9. MapOps
  10. PartialFunction
  11. Function1
  12. Iterable
  13. Iterable
  14. IterableOps
  15. IterableOnceOps
  16. IterableOnce
  17. AnyRef
  18. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by toLazyZipOps
  3. by toLazyZipOps
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class WithFilter extends collection.WithFilter[A, CC]

    A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.

    A template trait that contains just the map, flatMap, foreach and withFilter methods of trait Iterable.

    Definition Classes
    IterableOps
  2. trait GenKeySet extends Serializable

    A generic trait that is reused by keyset implementations

    A generic trait that is reused by keyset implementations

    Attributes
    protected
    Definition Classes
    MapOps
  3. class KeySet extends Set[K] with GenKeySet

    The implementation class of the set returned by keySet.

    The implementation class of the set returned by keySet.

    Attributes
    protected
    Definition Classes
    MapOps
    Annotations
    @SerialVersionUID()
  4. class MapWithFilter extends WithFilter

    Specializes WithFilter for Map collection types

    Specializes WithFilter for Map collection types

    Definition Classes
    MapOps
  5. type IterableCC[X] = Iterable[X]
    Attributes
    protected[this]
    Definition Classes
    IterableOps
  6. type MapCC[K, V] = HashMap[K, V]
    Attributes
    protected[this]
    Definition Classes
    MapOps
  7. class ImmutableKeySet extends Set[K] with GenKeySet

    The implementation class of the set returned by keySet

    The implementation class of the set returned by keySet

    Attributes
    protected
    Definition Classes
    MapOps
    Annotations
    @SerialVersionUID()

Abstract Value Members

  1. abstract def contains0(key: K, hash: Int, level: Int): Boolean
    Attributes
    protected
  2. abstract def filter0(p: ((K, V)) ⇒ Boolean, negate: Boolean, level: Int, buffer: Array[HashMap[K, V]], offset0: Int): HashMap[K, V]
    Attributes
    protected
  3. abstract def get0(key: K, hash: Int, level: Int): Option[V]
    Attributes
    protected
  4. abstract def iterator(): Iterator[(K, V)]

    Iterator can be used only once

    Iterator can be used only once

    Definition Classes
    IterableOnce
  5. abstract def merge0[V1 >: V](that: HashMap[K, V1], level: Int, merger: Merger[K, V1]): HashMap[K, V1]
    Attributes
    protected
  6. abstract def removed0(key: K, hash: Int, level: Int): HashMap[K, V]
    Attributes
    protected
  7. abstract def updated0[V1 >: V](key: K, hash: Int, level: Int, value: V1, kv: (K, V1), merger: Merger[K, V1]): HashMap[K, V1]
    Attributes
    protected

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Equivalent to x.hashCode except for boxed numeric types and null.

    Equivalent to x.hashCode except for boxed numeric types and null. 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. For null returns a hashcode where null.hashCode throws a NullPointerException.

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  3. final def +[V1 >: V](kv: (K, V1)): HashMap[K, V1]

    Alias for updated

    Alias for updated

    V1

    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
    HashMapMapOpsMapOps
    Annotations
    @inline()
  4. def ++[V2 >: V](xs: collection.Iterable[(K, V2)]): HashMap[K, V2]

    Alias for concat

    Alias for concat

    Definition Classes
    MapOps
  5. final def ++[B >: (K, V)](suffix: collection.Iterable[B]): Iterable[B]

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  6. final def -(key: K): HashMap[K, V]

    Alias for remove

    Alias for remove

    Definition Classes
    MapOps
    Annotations
    @inline()
  7. final def --(keys: IterableOnce[K]): HashMap[K, V]

    Alias for removeAll

    Alias for removeAll

    Definition Classes
    MapOps
    Annotations
    @inline()
  8. def ->[B](y: B): (HashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to ArrowAssoc[HashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  9. final def ==(arg0: Any): Boolean

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

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

    Definition Classes
    AnyRef → Any
  10. def addString(b: mutable.StringBuilder): mutable.StringBuilder

    Appends all elements of this $coll to a string builder.

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

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    h: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
  11. def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder

    Appends all elements of this $coll to a string builder using a separator string.

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

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
  12. def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type

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

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

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b , "List(" , ", " , ")")
    res5: StringBuilder = List(1, 2, 3, 4)
    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
  13. def andThen[C](k: (V) ⇒ C): PartialFunction[K, 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
  14. def apply(key: K): V

    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
    MapOpsFunction1
    Annotations
    @throws( cause = ... )
  15. def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1

    Applies this partial function to the given argument when it is contained in the function domain.

    Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.

    Note that expression pf.applyOrElse(x, default) is equivalent to

    if(pf isDefinedAt x) pf(x) else default(x)

    except that applyOrElse method can be implemented more efficiently. For all partial function literals the compiler generates an applyOrElse implementation which avoids double evaluation of pattern matchers and guards. This makes applyOrElse the basis for the efficient implementation for many operations and scenarios, such as:

    • combining partial functions into orElse/andThen chains does not lead to excessive apply/isDefinedAt evaluation
    • lift and unlift do not evaluate source functions twice on each invocation
    • runWith allows efficient imperative-style combining of partial functions with conditionally applied actions

    For non-literal partial function classes with nontrivial isDefinedAt method it is recommended to override applyOrElse with custom implementation that avoids double isDefinedAt evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.

    x

    the function argument

    default

    the fallback function

    returns

    the result of this function or fallback function application.

    Definition Classes
    MapOpsPartialFunction
    Since

    2.10

  16. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown

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

  17. def canEqual(that: Any): Boolean

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

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

    that

    the value being probed for possible equality

    returns

    true if this instance can possibly equal that, otherwise false

    Definition Classes
    MapEquals
  18. def className: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for ListMap this method should return "ListMap", not "Map" (the supertype) or "Node" (an implementation subclass).

    It is recommended to overwrite this method even if the default implementation returns the correct name, to avoid the implementation using reflection.

    returns

    a string representation which starts the result of toString applied to this immutable hash map. By default the string prefix is the simple name of the collection class immutable hash map.

    Definition Classes
    HashMapIterableOps
  19. 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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
    Note

    not specified by SLS as a member of AnyRef

  20. def coll: HashMap.this.type

    returns

    This collection as a C.

    Attributes
    protected[this]
    Definition Classes
    IterableIterableOps
  21. def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]

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

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

    B

    the element type of the returned iterable collection.

    pf

    the partial function which filters and maps the iterable collection.

    returns

    a new iterable collection resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  22. def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): HashMap[K2, V2]

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

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

    K2

    the key type of the returned map.

    V2

    the value type of the returned map.

    pf

    the partial function which filters and maps the map.

    returns

    a new map resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    MapOps
  23. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

    Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the $coll for which the given partial function is defined, and applies the partial function to it.

    $mayNotTerminateInf $orderDependent

    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
    IterableOnceOps
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  24. def compose[A](g: (A) ⇒ K): (A) ⇒ V

    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
    Annotations
    @unspecialized()
  25. def concat[V1 >: V](that: collection.Iterable[(K, V1)]): HashMap[K, V1]

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

    Returns a new immutable map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the immutable map is the most specific superclass encompassing the element types of the two operands.

    returns

    a new immutable map which contains all elements of this immutable map followed by all elements of suffix.

    Definition Classes
    MapOpsMapOps
  26. def concat[B >: (K, V)](suffix: collection.Iterable[B]): Iterable[B]

    Returns a new iterable collection containing the elements from the left hand operand followed by the elements from the right hand operand.

    Returns a new iterable collection containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the iterable collection is the most specific superclass encompassing the element types of the two operands.

    B

    the element type of the returned collection.

    suffix

    the traversable to append.

    returns

    a new iterable collection which contains all elements of this iterable collection followed by all elements of suffix.

    Definition Classes
    IterableOps
  27. final def contains(key: K): 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
    HashMapMapOps
  28. def copyToArray(xs: Array[(K, V)], start: Int, len: Int): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableOnceOps
    Full Signature

    def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): xs.type

  29. def copyToArray(xs: Array[(K, V)], start: Int): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    IterableOnceOps
    Full Signature

    def copyToArray[B >: (K, V)](xs: Array[B], start: Int = 0): xs.type

  30. def count(p: ((K, V)) ⇒ Boolean): Int

    Counts the number of elements in the $coll which satisfy a predicate.

    Counts the number of elements in the $coll which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOnceOps
  31. def default(key: K): V

    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
    MapOps
    Annotations
    @throws( cause = ... )
    Exceptions thrown
  32. def drop(n: Int): HashMap[K, V]

    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 iterable collection.

    returns

    a iterable collection consisting of all elements of this iterable collection except the first n ones, or else the empty iterable collection, if this iterable collection has less than n elements. If n is negative, don't drop any elements.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  33. def dropRight(n: Int): HashMap[K, V]

    The rest of the collection without its n last elements.

    The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.

    Definition Classes
    IterableOps
  34. def dropWhile(p: ((K, V)) ⇒ Boolean): HashMap[K, V]

    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 iterable collection whose first element does not satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  35. def empty: MapCC[K, V]

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

    Definition Classes
    MapMapOps
  36. def ensuring(cond: (HashMap[K, V]) ⇒ Boolean, msg: ⇒ Any): HashMap[K, V]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to Ensuring[HashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  37. def ensuring(cond: (HashMap[K, V]) ⇒ Boolean): HashMap[K, V]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to Ensuring[HashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  38. def ensuring(cond: Boolean, msg: ⇒ Any): HashMap[K, V]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to Ensuring[HashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  39. def ensuring(cond: Boolean): HashMap[K, V]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to Ensuring[HashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  40. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Definition Classes
    AnyRef
  41. def equals(o: Any): Boolean

    The universal equality method defined in AnyRef.

    The universal equality method defined in AnyRef.

    Definition Classes
    MapEquals → AnyRef → Any
  42. def exists(p: ((K, V)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for at least one element of this $coll.

    Tests whether a predicate holds for at least one element of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if the given predicate p is satisfied by at least one element of this $coll, otherwise false

    Definition Classes
    IterableOnceOps
  43. def filter(pred: ((K, V)) ⇒ Boolean): HashMap[K, V]

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

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

    returns

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

    Definition Classes
    HashMapStrictOptimizedIterableOpsIterableOpsIterableOnceOps
  44. def filterImpl(pred: ((K, V)) ⇒ Boolean, isFlipped: Boolean): HashMap[K, V]
    Attributes
    protected[scala.collection]
    Definition Classes
    StrictOptimizedIterableOps
  45. def filterKeys(p: (K) ⇒ Boolean): MapView[K, V]

    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
    MapOps
  46. def filterNot(pred: ((K, V)) ⇒ Boolean): HashMap[K, V]

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

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

    pred

    the predicate used to test elements.

    returns

    a new immutable hash map consisting of all elements of this immutable hash map that do not satisfy the given predicate pred. Their order may not be preserved.

    Definition Classes
    HashMapStrictOptimizedIterableOpsIterableOpsIterableOnceOps
  47. 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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
    Note

    not specified by SLS as a member of AnyRef

  48. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

    Finds the first element of the $coll satisfying a predicate, if any.

    Finds the first element of the $coll satisfying a predicate, if any.

    $mayNotTerminateInf $orderDependent

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOnceOps
  49. def flatMap[B](f: ((K, V)) ⇒ IterableOnce[B]): Iterable[B]

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

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

    For example:

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

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

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new iterable collection resulting from applying the given collection-valued function f to each element of this iterable collection and concatenating the results.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  50. def flatMap[K2, V2](f: ((K, V)) ⇒ IterableOnce[(K2, V2)]): HashMap[K2, V2]

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

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

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    MapOps
  51. def flatten[B](implicit toIterableOnce: ((K, V)) ⇒ IterableOnce[B]): Iterable[B]

    Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.

    Converts this iterable collection of traversable collections into a iterable collection formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the type of iterable collection. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(1, 2, 3)
             ).flatten
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(
               List(1, 2, 3),
               List(3, 2, 1)
             ).flatten
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new iterable collection resulting from concatenating all element iterable collections.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  52. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B

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

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

    $willNotTerminateInf $orderDependentFold

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

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this $coll. Returns z if this $coll is empty.

    Definition Classes
    IterableOnceOps
  53. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B

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

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

    $willNotTerminateInf $orderDependentFold

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

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this $coll. Returns z if this $coll is empty.

    Definition Classes
    IterableOnceOps
  54. def forall(p: ((K, V)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this $coll.

    Tests whether a predicate holds for all elements of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if this $coll is empty or the given predicate p holds for all elements of this $coll, otherwise false.

    Definition Classes
    IterableOnceOps
  55. def foreach[U](f: ((K, V)) ⇒ U): Unit

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
    IterableOnceOps
  56. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to StringFormat[HashMap[K, V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  57. final def fromIterable[E](it: collection.Iterable[E]): Iterable[E]

    Similar to fromSpecificIterable, but for a (possibly) different type of element.

    Similar to fromSpecificIterable, but for a (possibly) different type of element. Note that the return type is now CC[E].

    Attributes
    protected[this]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  58. def fromSpecificIterable(coll: collection.Iterable[(K, V)]): MapCC[K, V]

    Defines how to turn a given Iterable[A] into a collection of type C.

    Defines how to turn a given Iterable[A] into a collection of type C.

    This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.

    Attributes
    protected[this]
    Definition Classes
    MapIterableIterableOps
  59. def get(key: K): Option[V]

    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
    HashMapMapOps
  60. final def getClass(): Class[_]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  61. def getOrElse(key: K, default: ⇒ V): V

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

    [use case]

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

    key

    the key.

    default

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

    returns

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

    Definition Classes
    MapOps
    Full Signature

    def getOrElse[V1 >: V](key: K, default: ⇒ V1): V1

  62. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, HashMap[K, V]]

    Partitions this iterable collection into a map of iterable collections according to some discriminator function.

    Partitions this iterable collection into a map of iterable collections according to some discriminator function.

    Note: When applied to a view or a lazy collection it will always force the elements.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to iterable collections such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a iterable collection of those elements x for which f(x) equals k.

    Definition Classes
    IterableOps
  63. def groupMap[K, B](key: ((K, V)) ⇒ K)(f: ((K, V)) ⇒ B): Map[K, Iterable[B]]

    Partitions this iterable collection into a map of iterable collections according to a discriminator function key.

    Partitions this iterable collection into a map of iterable collections according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

    It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.

    case class User(name: String, age: Int)
    
    def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
      users.groupMap(_.age)(_.name)
    K

    the type of keys returned by the discriminator function

    B

    the type of values returned by the transformation function

    key

    the discriminator function

    f

    the element transformation function

    Definition Classes
    IterableOps
  64. def groupMapReduce[K, B](key: ((K, V)) ⇒ K)(f: ((K, V)) ⇒ B)(reduce: (B, B) ⇒ B): Map[K, B]

    Partitions this iterable collection into a map according to a discriminator function key.

    Partitions this iterable collection into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the value function and then reduced into a single value with the reduce function.

    It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.

    def occurrences[A](as: Seq[A]): Map[A, Int] =
      as.groupMapReduce(identity)(_ => 1)(_ + _)
    Definition Classes
    IterableOps
  65. def grouped(size: Int): Iterator[HashMap[K, V]]

    Partitions elements in fixed size iterable collections.

    Partitions elements in fixed size iterable collections.

    size

    the number of elements per group

    returns

    An iterator producing iterable collections of size size, except the last will be less than size size if the elements don't divide evenly.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method grouped

  66. def hashCode(): Int

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    Map → AnyRef → Any
  67. def head: (K, V)

    Selects the first element of this iterable collection.

    Selects the first element of this iterable collection.

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

    returns

    the first element of this iterable collection.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException if the iterable collection is empty.

  68. def headOption: Option[(K, V)]

    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 iterable collection if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  69. def init: HashMap[K, V]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Definition Classes
    HashMapIterableOps
  70. def inits: Iterator[HashMap[K, V]]

    Iterates over the inits of this iterable collection.

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

    returns

    an iterator over all the inits of this iterable collection

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

  71. def isDefinedAt(key: K): 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
    MapOpsPartialFunction
  72. def isEmpty: Boolean

    Tests whether the $coll is empty.

    Tests whether the $coll is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.

    returns

    true if the $coll contains no elements, false otherwise.

    Definition Classes
    IterableOnceOps
  73. final def isInstanceOf[T0]: Boolean

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

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

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

    returns

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

    Definition Classes
    Any
  74. def iterableFactory: IterableFactory[IterableCC]

    returns

    The companion object of this immutable collection, providing various factory methods.

    Definition Classes
    IterableIterableIterableOps
  75. def keySet: Set[K]

    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
    MapOpsMapOps
  76. def keys: collection.Iterable[K]

    Collects all keys of this map in an iterable collection.

    Collects all keys of this map in an iterable collection.

    returns

    the keys of this map as an iterable.

    Definition Classes
    MapOps
  77. def keysIterator(): Iterator[K]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    MapOps
  78. def knownSize: Int

    The number of elements in this $coll, if it can be cheaply computed, -1 otherwise.

    The number of elements in this $coll, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

    Definition Classes
    IterableOnceOps
  79. def last: (K, V)

    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 iterable collection.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException If the iterable collection is empty.

  80. def lastOption: Option[(K, V)]

    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 iterable collection$ if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  81. def lift: (K) ⇒ Option[V]

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

    Turns this partial function into a 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

  82. def map[B](f: ((K, V)) ⇒ B): Iterable[B]

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

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

    B

    the element type of the returned iterable collection.

    f

    the function to apply to each element.

    returns

    a new iterable collection resulting from applying the given function f to each element of this iterable collection and collecting the results.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  83. def map[K2, V2](f: ((K, V)) ⇒ (K2, V2)): HashMap[K2, V2]

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

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

    f

    the function to apply to each element.

    returns

    a new map resulting from applying the given function f to each element of this map and collecting the results.

    Definition Classes
    MapOps
  84. def mapFactory: MapFactory[HashMap]
    Definition Classes
    HashMapMapMapMapOps
  85. final def mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): HashMap[K2, V2]

    Similar to fromIterable, but returns a Map collection type.

    Similar to fromIterable, but returns a Map collection type. Note that the return type is now CC[K2, V2] aka MapCC[K2, V2] rather than IterableCC[(K2, V2)].

    Attributes
    protected[this]
    Definition Classes
    MapOps
    Annotations
    @inline()
  86. def mapValues[W](f: (V) ⇒ W): MapView[K, W]

    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
    MapOps
  87. def max: (K, V)

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this immutable hash map.

    Definition Classes
    IterableOnceOps
    Full Signature

    def max[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)

    Exceptions thrown

    UnsupportedOperationException if this immutable hash map is empty.

  88. def maxBy[B](f: ((K, V)) ⇒ B): (K, V)

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this immutable hash map with the largest value measured by function f.

    Definition Classes
    IterableOnceOps
    Full Signature

    def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: math.Ordering[B]): (K, V)

    Exceptions thrown

    UnsupportedOperationException if this immutable hash map is empty.

  89. def merged[V1 >: V](that: HashMap[K, V1])(mergef: MergeFunction[K, V1]): HashMap[K, V1]

    Creates a new map which is the merge of this and the argument hash map.

    Creates a new map which is the merge of this and the argument hash map.

    Uses the specified collision resolution function if two keys are the same. The collision resolution function will always take the first argument from this hash map and the second from that.

    The merged method is on average more performant than doing a traversal and reconstructing a new immutable hash map from scratch, or ++.

    V1

    the value type of the other hash map

    that

    the other hash map

    mergef

    the merge function or null if the first key-value pair is to be picked

  90. def min: (K, V)

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this immutable hash map

    Definition Classes
    IterableOnceOps
    Full Signature

    def min[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)

    Exceptions thrown

    UnsupportedOperationException if this immutable hash map is empty.

  91. def minBy[B](f: ((K, V)) ⇒ B): (K, V)

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this immutable hash map with the smallest value measured by function f.

    Definition Classes
    IterableOnceOps
    Full Signature

    def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: math.Ordering[B]): (K, V)

    Exceptions thrown

    UnsupportedOperationException if this immutable hash map is empty.

  92. def mkString(start: String, sep: String, end: String): String

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

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

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

  93. def mkString: String

    Displays all elements of this $coll in a string.

    Displays all elements of this $coll in a string.

    returns

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

    Definition Classes
    IterableOnceOps
  94. def mkString(sep: String): String

    Displays all elements of this $coll in a string using a separator string.

    Displays all elements of this $coll in a string using a separator string.

    sep

    the separator string.

    returns

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

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

  95. final def ne(arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Definition Classes
    AnyRef
  96. def newSpecificBuilder(): Builder[(K, V), MapCC[K, V]]

    returns

    a strict builder for the same collection type. Note that in the case of lazy collections (e.g. View or immutable.LazyList), it is possible to implement this method but the resulting Builder will break laziness. As a consequence, operations should preferably be implemented with fromSpecificIterable instead of this method.

    Attributes
    protected[this]
    Definition Classes
    MapIterableIterableOps
  97. def nonEmpty: Boolean

    Tests whether the $coll is not empty.

    Tests whether the $coll is not empty.

    returns

    true if the $coll contains at least one element, false otherwise.

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding( message = ... , since = "2.13.0" )
  98. final def notify(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  99. final def notifyAll(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  100. def orElse[A1 <: K, B1 >: V](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
  101. def partition(p: ((K, V)) ⇒ Boolean): (HashMap[K, V], HashMap[K, V])

    A pair of, first, all elements that satisfy prediacte p and, second, all elements that do not.

    A pair of, first, all elements that satisfy prediacte p and, second, all elements that do not. Interesting because it splits a collection in two.

    The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of partition in Buildable, which requires only a single traversal.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  102. def product: (K, V)

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this immutable hash map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable hash map and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    IterableOnceOps
    Full Signature

    def product[B >: (K, V)](implicit num: math.Numeric[B]): B

  103. def reduce[B >: (K, V)](op: (B, B) ⇒ B): B

    Reduces the elements of this $coll using the specified associative binary operator.

    Reduces the elements of this $coll using the specified associative binary operator.

    $undefinedorder

    B

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  104. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B

    Applies a binary operator to all elements of this $coll, going left to right.

    Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going left to right:

    op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)

    where x1, ..., xn are the elements of this $coll.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  105. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this $coll, going left to right.

    Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) if this $coll is nonempty, None otherwise.

    Definition Classes
    IterableOnceOps
  106. def reduceOption[B >: (K, V)](op: (B, B) ⇒ B): Option[B]

    Reduces the elements of this $coll, if any, using the specified associative binary operator.

    Reduces the elements of this $coll, if any, using the specified associative binary operator.

    $undefinedorder

    B

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    IterableOnceOps
  107. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B

    Applies a binary operator to all elements of this $coll, going right to left.

    Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this $coll.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  108. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this $coll, going right to left.

    Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) if this $coll is nonempty, None otherwise.

    Definition Classes
    IterableOnceOps
  109. def remove(key: K): HashMap[K, V]

    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
    HashMapMapOps
  110. def removeAll(keys: IterableOnce[K]): HashMap[K, V]

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

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

    keys

    the collection containing the removed elements.

    returns

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

    Definition Classes
    MapOps
  111. def reversed: collection.Iterable[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    IterableOnceOps
  112. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean

    Composes this partial function with an action function which gets applied to results of this partial function.

    Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.

    Note that expression pf.runWith(action)(x) is equivalent to

    if(pf isDefinedAt x) { action(pf(x)); true } else false

    except that runWith is implemented via applyOrElse and thus potentially more efficient. Using runWith avoids double evaluation of pattern matchers and guards for partial function literals.

    action

    the action function

    returns

    a function which maps arguments x to isDefinedAt(x). The resulting function runs action(this(x)) where this is defined.

    Definition Classes
    PartialFunction
    Since

    2.10

    See also

    applyOrElse.

  113. def scan[B >: (K, V)](z: B)(op: (B, B) ⇒ B): Iterable[B]

    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

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

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

    Definition Classes
    IterableOps
  114. def scanLeft[B](z: B)(op: (B, (K, V)) ⇒ B): Iterable[B]

    Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.

    Produces a iterable collection containing cumulative results of applying the operator going left to right, including the initial value.

    Note: will not terminate for infinite-sized collections.

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

    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  115. def scanRight[B](z: B)(op: ((K, V), B) ⇒ B): Iterable[B]

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

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

    Note: will not terminate for infinite-sized collections.

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

    Example:

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

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOps
  116. def size: Int

    The size of this $coll.

    The size of this $coll.

    $willNotTerminateInf

    returns

    the number of elements in this $coll.

    Definition Classes
    IterableOnceOps
  117. def slice(from: Int, until: Int): HashMap[K, V]

    Selects an interval of elements.

    Selects an interval of elements. The returned iterable 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 iterable collection.

    until

    the lowest index to EXCLUDE from this iterable collection.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  118. def sliding(size: Int, step: Int): Iterator[HashMap[K, V]]

    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

    step

    the distance between the first elements of successive groups

    returns

    An iterator producing iterable collections of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  119. def sliding(size: Int): Iterator[HashMap[K, V]]

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

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

    size

    the number of elements per group

    returns

    An iterator producing iterable collections of size size, except the last element (which may be the only element) will be truncated if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method sliding

  120. def span(p: ((K, V)) ⇒ Boolean): (HashMap[K, V], HashMap[K, V])

    Splits this iterable collection into a prefix/suffix pair according to a predicate.

    Splits this iterable collection into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

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

    p

    the test predicate

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Note

    Reuse: $consumesOneAndProducesTwoIterators

  121. def split: Seq[HashMap[K, V]]
  122. def splitAt(n: Int): (HashMap[K, V], HashMap[K, V])

    Splits this iterable collection into two at a given position.

    Splits this iterable collection into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

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

    n

    the position at which to split.

    returns

    a pair of iterable collections consisting of the first n elements of this iterable collection, and the other elements.

    Definition Classes
    IterableOps
  123. def sum: (K, V)

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this immutable hash map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable hash map and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    IterableOnceOps
    Full Signature

    def sum[B >: (K, V)](implicit num: math.Numeric[B]): B

  124. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  125. def tail: HashMap[K, V]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    HashMapIterableOps
  126. def tails: Iterator[HashMap[K, V]]

    Iterates over the tails of this iterable collection.

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

    returns

    an iterator over all the tails of this iterable collection

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

  127. def take(n: Int): HashMap[K, V]

    Selects first n elements.

    Selects first n elements.

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

    n

    the number of elements to take from this iterable collection.

    returns

    a iterable collection consisting only of the first n elements of this iterable collection, or else the whole iterable collection, if it has less than n elements. If n is negative, returns an empty iterable collection.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  128. def takeRight(n: Int): HashMap[K, V]

    A collection containing the last n elements of this collection.

    A collection containing the last n elements of this collection.

    Definition Classes
    IterableOps
  129. def takeWhile(p: ((K, V)) ⇒ Boolean): HashMap[K, V]

    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 iterable collection whose elements all satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
    Note

    Reuse: $consumesAndProducesIterator

  130. def to[C1](factory: Factory[(K, V), C1]): C1

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A.

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A. Example uses:

    xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]

    Definition Classes
    IterableOnceOps
  131. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Definition Classes
    IterableOnceOps
  132. def toIndexedSeq: IndexedSeq[(K, V)]
    Definition Classes
    IterableOnceOps
  133. final def toIterable: HashMap.this.type

    returns

    This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

    Definition Classes
    IterableIterableOps
  134. def toList: List[(K, V)]
    Definition Classes
    IterableOnceOps
  135. final def toMap[K2, V2](implicit ev: <:<[(K, V), (K2, V2)]): Map[K2, V2]
    Definition Classes
    MapIterableOnceOps
  136. def toSeq: Seq[(K, V)]

    returns

    This collection as a Seq[A]. This is equivalent to to(Seq) but might be faster.

    Definition Classes
    IterableOnceOps
  137. def toSet[B >: (K, V)]: Set[B]
    Definition Classes
    IterableOnceOps
  138. def toString(): String

    Creates a String representation of this object.

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

    returns

    a String representation of the object.

    Definition Classes
    MapOpsFunction1IterableOps → AnyRef → Any
  139. def toVector: Vector[(K, V)]
    Definition Classes
    IterableOnceOps
  140. def transform[W](f: (K, V) ⇒ W): HashMap[K, W]

    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
    MapOps
  141. def transpose[B](implicit asIterable: ((K, V)) ⇒ collection.Iterable[B]): Iterable[Iterable[B]]

    Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.

    Transposes this iterable collection of iterable collections into a iterable collection of iterable collections.

    The resulting collection's type will be guided by the static type of iterable collection. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(4, 5, 6)).transpose
    // xs == List(
    //         List(1, 4),
    //         List(2, 5),
    //         List(3, 6))
    
    val ys = Vector(
               List(1, 2, 3),
               List(4, 5, 6)).transpose
    // ys == Vector(
    //         Vector(1, 4),
    //         Vector(2, 5),
    //         Vector(3, 6))
    B

    the type of the elements of each iterable collection.

    asIterable

    an implicit conversion which asserts that the element type of this iterable collection is an Iterable.

    returns

    a two-dimensional iterable collection of iterable collections which has as nth row the nth column of this iterable collection.

    Definition Classes
    IterableOps
    Exceptions thrown

    IllegalArgumentException if all collections in this iterable collection are not of the same size.

  142. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Converts this iterable collection of pairs into two collections of the first and second half of each pair.

    Converts this iterable collection of pairs into two collections of the first and second half of each pair.

    val xs = Iterable(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (Iterable(1, 2, 3),
    //        Iterable(one, two, three))
    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

    an implicit conversion which asserts that the element type of this iterable collection is a pair.

    returns

    a pair of iterable collections, containing the first, respectively second half of each element pair of this iterable collection.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  143. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.

    Converts this iterable collection of triples into three collections of the first, second, and third element of each triple.

    val xs = Iterable(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (Iterable(1, 2, 3),
    //        Iterable(one, two, three),
    //        Iterable(1, 2, 3))
    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

    an implicit conversion which asserts that the element type of this iterable collection is a triple.

    returns

    a triple of iterable collections, containing the first, second, respectively third member of each element triple of this iterable collection.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  144. final def updated(key: K, value: V): Map[K, V]

    [use case] Creates a new map obtained by updating this map with a given key/value pair.

    [use case]

    Creates a new map obtained by updating this map with a given key/value pair.

    key

    the key

    value

    the value

    returns

    A new map with the new key/value mapping added to this map.

    Definition Classes
    HashMapMapOps
    Full Signature

    final def updated[V1 >: V](key: K, value: V1): HashMap[K, V1]

  145. def values: collection.Iterable[V]

    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
    MapOps
  146. def valuesIterator(): Iterator[V]

    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
    MapOps
  147. def view: MapView[K, V]

    A view over the elements of this collection.

    A view over the elements of this collection.

    Definition Classes
    MapOpsIterableOps
  148. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  149. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  150. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  151. def withDefault[V1 >: V](d: (K) ⇒ V1): WithDefault[K, V1]

    The same map with a given default function.

    The same map with a given default function. Note: The default is only used for apply. Other methods like 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
  152. def withDefaultValue[V1 >: V](d: V1): WithDefault[K, V1]

    The same map with a given default value.

    The same map with a given default value. Note: The default is only used for apply. Other methods like get, contains, iterator, keys, etc. are not affected by withDefaultValue.

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

    d

    default value used for non-present keys

    returns

    a wrapper of the map with a default value

    Definition Classes
    Map
  153. def withFilter(p: ((K, V)) ⇒ Boolean): MapWithFilter

    Creates a non-strict filter of this map.

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

    Definition Classes
    MapOpsIterableOps
  154. def zip[B](that: collection.Iterable[B]): Iterable[((K, V), B)]

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

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  155. def zipAll[A1 >: (K, V), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]

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

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

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    Definition Classes
    IterableOps
  156. def zipWithIndex: Iterable[((K, V), Int)]

    Zips this iterable collection with its indices.

    Zips this iterable collection with its indices.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Example:
    1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))

    Note

    Reuse: $consumesAndProducesIterator

  157. def [B](y: B): (HashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to ArrowAssoc[HashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to any2stringadd[HashMap[K, V]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: any2stringadd[HashMap[K, V]]).+(other)
    Definition Classes
    any2stringadd
  2. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, HashMap[K, V]]

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

    val xs = List(1, 2, 3)
    val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
    // res == List(4, 8, 12)
    B

    the type of the second element in each eventual pair

    that

    the iterable providing the second element of each eventual pair

    returns

    a decorator LazyZip2 that allows strict operations to be performed on the lazily evaluated pairs or chained calls to lazyZip. Implicit conversion to Iterable[(A, B)] is also supported.

    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to LazyZipOps[(K, V), HashMap[K, V]] performed by method toLazyZipOps in scala.collection.Map.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (hashMap: LazyZipOps[(K, V), HashMap[K, V]]).lazyZip(that)
    Definition Classes
    LazyZipOps
  3. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, Iterable[(K, V)]]

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

    val xs = List(1, 2, 3)
    val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
    // res == List(4, 8, 12)
    B

    the type of the second element in each eventual pair

    that

    the iterable providing the second element of each eventual pair

    returns

    a decorator LazyZip2 that allows strict operations to be performed on the lazily evaluated pairs or chained calls to lazyZip. Implicit conversion to Iterable[(A, B)] is also supported.

    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to LazyZipOps[(K, V), Iterable[(K, V)]] performed by method toLazyZipOps in scala.collection.Iterable.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (hashMap: LazyZipOps[(K, V), Iterable[(K, V)]]).lazyZip(that)
    Definition Classes
    LazyZipOps
  4. val this: HashMap[K, V]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to LazyZipOps[(K, V), HashMap[K, V]] performed by method toLazyZipOps in scala.collection.Map.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (hashMap: LazyZipOps[(K, V), HashMap[K, V]]).this
    Definition Classes
    LazyZipOps
  5. val this: Iterable[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to LazyZipOps[(K, V), Iterable[(K, V)]] performed by method toLazyZipOps in scala.collection.Iterable.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (hashMap: LazyZipOps[(K, V), Iterable[(K, V)]]).this
    Definition Classes
    LazyZipOps

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator().foldLeft instead of /: on IterableOnce

  2. final def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  3. def :\[B](z: B)(op: ((K, V), B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator().foldRight instead of :\ on IterableOnce

  4. final def :\[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  5. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().find instead of .find on IterableOnce

  6. def flatMap[B](f: ((K, V)) ⇒ IterableOnce[B]): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().flatMap instead of .flatMap on IterableOnce or consider requiring an Iterable

  7. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator().foldLeft instead of .foldLeft on IterableOnce

  8. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator().foldRight instead of .foldLeft on IterableOnce

  9. def foreach[U](f: ((K, V)) ⇒ U): Unit
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator().foreach(...) instead of .foreach(...) on IterableOnce

  10. final def hasDefiniteSize: Boolean
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .knownSize >=0 instead of .hasDefiniteSize

  11. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().isEmpty instead of .isEmpty on IterableOnce

  12. def map[B](f: ((K, V)) ⇒ B): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().map instead of .map on IterableOnce or consider requiring an Iterable

  13. def mkString: String
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce

  14. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce

  15. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce

  16. def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().sameElements for sameElements on Iterable or IterableOnce

  17. final def stringPrefix: String
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use className instead of stringPrefix

  18. def to[C1](factory: Factory[(K, V), C1]): C1
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use factory.from(it) instead of it.to(factory) for IterableOnce

  19. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it).toArray

  20. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer

  21. final def toBuffer[B >: (K, V)]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer

  22. final def toIterable: collection.Iterable[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Iterable.from(it) instead of it.toIterable

  23. def toIterator: Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) toIterator has been renamed to iterator()

  24. final def toIterator: Iterator[(K, V)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator() instead of .toIterator

  25. def toList: List[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use List.from(it) instead of it.toList

  26. def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use Map.from(it) instead of it.toVector on IterableOnce

  27. def toSeq: Seq[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Seq.from(it) instead of it.toSeq

  28. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Set.from(it) instead of it.toSet

  29. def toStream: Stream[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Stream.from(it) instead of it.toStream

  30. final def toStream: Stream[(K, V)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Stream.from(it) instead of it.toStream

  31. def toVector: Vector[(K, V)]
    Implicit
    This member is added by an implicit conversion from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (hashMap: IterableOnceExtensionMethods[(K, V)]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Vector.from(it) instead of it.toVector on IterableOnce

  32. final def view(from: Int, until: Int): View[(K, V)]

    A view over a slice of the elements of this collection.

    A view over a slice of the elements of this collection.

    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from StrictOptimizedIterableOps[(K, V), Iterable, HashMap[K, V]]

Inherited from Map[K, V]

Inherited from MapOps[K, V, HashMap, HashMap[K, V]]

Inherited from collection.Map[K, V]

Inherited from Equals

Inherited from collection.MapOps[K, V, HashMap, HashMap[K, V]]

Inherited from PartialFunction[K, V]

Inherited from (K) ⇒ V

Inherited from Iterable[(K, V)]

Inherited from collection.Iterable[(K, V)]

Inherited from IterableOps[(K, V), Iterable, HashMap[K, V]]

Inherited from IterableOnceOps[(K, V), Iterable, HashMap[K, V]]

Inherited from IterableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods from HashMap[K, V] to IterableOnceExtensionMethods[(K, V)]

Inherited by implicit conversion toLazyZipOps from HashMap[K, V] to LazyZipOps[(K, V), HashMap[K, V]]

Inherited by implicit conversion toLazyZipOps from HashMap[K, V] to LazyZipOps[(K, V), Iterable[(K, V)]]

Inherited by implicit conversion any2stringadd from HashMap[K, V] to any2stringadd[HashMap[K, V]]

Inherited by implicit conversion StringFormat from HashMap[K, V] to StringFormat[HashMap[K, V]]

Inherited by implicit conversion Ensuring from HashMap[K, V] to Ensuring[HashMap[K, V]]

Inherited by implicit conversion ArrowAssoc from HashMap[K, V] to ArrowAssoc[HashMap[K, V]]

Ungrouped