Packages

final class CollisionProofHashMap[K, V] extends AbstractMap[K, V] with MapOps[K, V, Map, CollisionProofHashMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, CollisionProofHashMap[K, V]] with StrictOptimizedMapOps[K, V, Map, CollisionProofHashMap[K, V]]

This class implements mutable maps using a hashtable with red-black trees in the buckets for good worst-case performance on hash collisions. An Ordering is required for the element type. Equality as determined by the Ordering has to be consistent with equals and hashCode. Universal equality of numeric types is not supported (similar to AnyRefMap).

Source
CollisionProofHashMap.scala
See also

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

Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CollisionProofHashMap
  2. StrictOptimizedMapOps
  3. StrictOptimizedIterableOps
  4. AbstractMap
  5. Map
  6. MapOps
  7. Shrinkable
  8. Builder
  9. Growable
  10. Clearable
  11. Cloneable
  12. Cloneable
  13. Iterable
  14. AbstractMap
  15. Map
  16. Equals
  17. MapFactoryDefaults
  18. MapOps
  19. PartialFunction
  20. Function1
  21. AbstractIterable
  22. Iterable
  23. IterableFactoryDefaults
  24. IterableOps
  25. IterableOnceOps
  26. IterableOnce
  27. AnyRef
  28. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new CollisionProofHashMap()(implicit ordering: Ordering[K])
  2. new CollisionProofHashMap(initialCapacity: Int, loadFactor: Double)(implicit ordering: Ordering[K])

Value Members

  1. final def ++[V2 >: V](xs: IterableOnce[(K, V2)]): CollisionProofHashMap[K, V2]

    Alias for concat

    Alias for concat

    Definition Classes
    CollisionProofHashMapMapOps
    Annotations
    @inline()
  2. final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  3. final def ++=(xs: IterableOnce[(K, V)]): CollisionProofHashMap.this.type

    Alias for addAll

    Alias for addAll

    Definition Classes
    Growable
    Annotations
    @inline()
  4. final def +=(elem: (K, V)): CollisionProofHashMap.this.type

    Alias for addOne

    Alias for addOne

    Definition Classes
    Growable
    Annotations
    @inline()
  5. final def --=(xs: IterableOnce[K]): CollisionProofHashMap.this.type

    Alias for subtractAll

    Alias for subtractAll

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  6. final def -=(elem: K): CollisionProofHashMap.this.type

    Alias for subtractOne

    Alias for subtractOne

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  7. def addAll(xs: IterableOnce[(K, V)]): CollisionProofHashMap.this.type

    Adds all elements produced by an IterableOnce to this mutable collision-proof hash map.

    Adds all elements produced by an IterableOnce to this mutable collision-proof hash map.

    xs

    the IterableOnce producing the elements to add.

    returns

    the mutable collision-proof hash map itself.

    Definition Classes
    CollisionProofHashMapGrowable
  8. def addOne(elem: (K, V)): CollisionProofHashMap.this.type

    Adds a single element to this mutable collision-proof hash map.

    Adds a single element to this mutable collision-proof hash map.

    elem

    the element to add.

    returns

    the mutable collision-proof hash map itself

    Definition Classes
    CollisionProofHashMapGrowable
  9. def addString(sb: StringBuilder, start: String, sep: String, end: String): sb.type

    Appends all elements of this mutable collision-proof hash map to a string builder using start, end, and separator strings.

    Appends all elements of this mutable collision-proof hash map to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this mutable collision-proof hash map 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)
    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    MapOpsIterableOnceOps
  10. final def addString(b: StringBuilder): b.type

    Appends all elements of this mutable collision-proof hash map to a string builder.

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

    Appends all elements of this mutable collision-proof hash map to a string builder using a separator string.

    Appends all elements of this mutable collision-proof hash map to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this mutable collision-proof hash map, 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
    Annotations
    @inline()
  12. def andThen[C](k: PartialFunction[V, C]): PartialFunction[K, C]

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

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

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of this partial function narrowed by other partial function, which maps arguments x to k(this(x)).

    Definition Classes
    PartialFunction
  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.

    If the runtime type of the function is a PartialFunction then the other andThen method is used (note its cautions).

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of this partial function, possibly narrowed by the specified 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
    CollisionProofHashMapMapOpsFunction1
    Annotations
    @throws(cause = scala.this.throws.<init>$default$1[NoSuchElementException])
  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
  16. 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
  17. def clear(): Unit

    Clears the contents of this builder.

    Clears the contents of this builder. After execution of this method the builder will contain no elements.

    Definition Classes
    CollisionProofHashMapMapOpsBuilderClearable
  18. def clone(): CollisionProofHashMap[K, V]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Definition Classes
    MapOpsCloneable → AnyRef
    Note

    not specified by SLS as a member of AnyRef

  19. def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)])(implicit ordering: Ordering[K2]): CollisionProofHashMap[K2, V2]

    Builds a new sorted map by applying a partial function to all elements of this mutable collision-proof hash map on which the function is defined.

    Builds a new sorted map by applying a partial function to all elements of this mutable collision-proof hash map on which the function is defined.

    pf

    the partial function which filters and maps the mutable collision-proof hash map.

    returns

    a new mutable collision-proof hash 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.

  20. def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): Map[K2, V2]

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

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

    K2

    the key type of the returned mutable collision-proof hash map.

    V2

    the value type of the returned mutable collision-proof hash map.

    pf

    the partial function which filters and maps the mutable collision-proof hash map.

    returns

    a new mutable collision-proof hash 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
    StrictOptimizedMapOpsMapOps
  21. def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]

    Builds a new mutable collision-proof hash map by applying a partial function to all elements of this mutable collision-proof hash map on which the function is defined.

    Builds a new mutable collision-proof hash map by applying a partial function to all elements of this mutable collision-proof hash map on which the function is defined.

    B

    the element type of the returned mutable collision-proof hash map.

    pf

    the partial function which filters and maps the mutable collision-proof hash map.

    returns

    a new mutable collision-proof hash 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
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  22. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

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

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

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

    pf

    the partial function

    returns

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

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

  23. def compose[R](k: PartialFunction[R, K]): PartialFunction[R, V]

    Composes another partial function k with this partial function so that this partial function gets applied to results of k.

    Composes another partial function k with this partial function so that this partial function gets applied to results of k.

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    R

    the parameter type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of other partial function narrowed by this partial function, which maps arguments x to this(k(x)).

    Definition Classes
    PartialFunction
  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[V2 >: V](suffix: IterableOnce[(K, V2)]): CollisionProofHashMap[K, V2]

    Returns a new mutable collision-proof hash map containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    suffix

    the iterable to append.

    returns

    a new mutable collision-proof hash map which contains all elements of this mutable collision-proof hash map followed by all elements of suffix.

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

    Returns a new mutable collision-proof hash map containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    B

    the element type of the returned collection.

    suffix

    the iterable to append.

    returns

    a new mutable collision-proof hash map which contains all elements of this mutable collision-proof hash map followed by all elements of suffix.

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

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with at most len elements of this mutable collision-proof hash map.

    Copying will stop once either all the elements of this mutable collision-proof hash map have been copied, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index of xs.

    len

    the maximal number of elements to copy.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

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

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with values of this mutable collision-proof hash map.

    Copying will stop once either all the elements of this mutable collision-proof hash map have been copied, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index of xs.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

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

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with values of this mutable collision-proof hash map.

    Copying will stop once either all the elements of this mutable collision-proof hash map have been copied, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

  31. def corresponds[B](that: IterableOnce[B])(p: ((K, V), B) => Boolean): Boolean

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    B

    the type of the elements of that

    that

    the other collection

    p

    the test predicate, which relates elements from both collections

    returns

    true if both collections have the same length and p(x, y) is true for all corresponding elements x of this iterator and y of that, otherwise false

    Definition Classes
    IterableOnceOps
  32. def count(p: ((K, V)) => Boolean): Int

    Counts the number of elements in the mutable collision-proof hash map which satisfy a predicate.

    Counts the number of elements in the mutable collision-proof hash map which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOnceOps
  33. 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 = scala.this.throws.<init>$default$1[NoSuchElementException])
    Exceptions thrown
  34. def drop(n: Int): CollisionProofHashMap[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 mutable collision-proof hash map.

    returns

    a mutable collision-proof hash map consisting of all elements of this mutable collision-proof hash map except the first n ones, or else the empty mutable collision-proof hash map, if this mutable collision-proof hash map has less than n elements. If n is negative, don't drop any elements.

    Definition Classes
    IterableOpsIterableOnceOps
  35. def dropRight(n: Int): CollisionProofHashMap[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.

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

    n

    the number of elements to drop from this mutable collision-proof hash map.

    returns

    a mutable collision-proof hash map consisting of all elements of this mutable collision-proof hash map except the last n ones, or else the empty mutable collision-proof hash map, if this mutable collision-proof hash map has less than n elements. If n is negative, don't drop any elements.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  36. def dropWhile(p: ((K, V)) => Boolean): CollisionProofHashMap[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 mutable collision-proof hash map whose first element does not satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
  37. def elementWise: ElementWiseExtractor[K, V]

    Returns an extractor object with a unapplySeq method, which extracts each element of a sequence data.

    Returns an extractor object with a unapplySeq method, which extracts each element of a sequence data.

    Definition Classes
    PartialFunction
    Example:
    1. val firstChar: String => Option[Char] = _.headOption
      
      Seq("foo", "bar", "baz") match {
        case firstChar.unlift.elementWise(c0, c1, c2) =>
          println(s"$c0, $c1, $c2") // Output: f, b, b
      }
  38. def empty: CollisionProofHashMap[K, V]

    The empty iterable of the same type as this iterable

    The empty iterable of the same type as this iterable

    returns

    an empty iterable of type C.

    Definition Classes
    CollisionProofHashMapMapFactoryDefaultsIterableFactoryDefaultsIterableOps
  39. def equals(o: Any): Boolean

    Equality of maps is implemented using the lookup method get.

    Equality of maps is implemented using the lookup method get. This method returns true if

    • the argument o is a Map,
    • the two maps have the same size, and
    • for every (key, value) pair in this map, other.get(key) == Some(value).

    The implementation of equals checks the canEqual method, so subclasses of Map can narrow down the equality to specific map types. The Map implementations in the standard library can all be compared, their canEqual methods return true.

    Note: The equals method only respects the equality laws (symmetry, transitivity) if the two maps use the same key equivalence function in their lookup operation. For example, the key equivalence operation in a scala.collection.immutable.TreeMap is defined by its ordering. Comparing a TreeMap with a HashMap leads to unexpected results if ordering.equiv(k1, k2) (used for lookup in TreeMap) is different from k1 == k2 (used for lookup in HashMap).

    scala> import scala.collection.immutable._
    scala> val ord: Ordering[String] = _ compareToIgnoreCase _
    
    scala> TreeMap("A" -> 1)(ord) == HashMap("a" -> 1)
    val res0: Boolean = false
    
    scala> HashMap("a" -> 1) == TreeMap("A" -> 1)(ord)
    val res1: Boolean = true
    o

    The map to which this map is compared

    returns

    true if the two maps are equal according to the description

    Definition Classes
    MapEquals → AnyRef → Any
  40. def exists(p: ((K, V)) => Boolean): Boolean

    Tests whether a predicate holds for at least one element of this mutable collision-proof hash map.

    Tests whether a predicate holds for at least one element of this mutable collision-proof hash map.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p is satisfied by at least one element of this mutable collision-proof hash map, otherwise false

    Definition Classes
    IterableOnceOps
  41. def filter(pred: ((K, V)) => Boolean): CollisionProofHashMap[K, V]

    Selects all elements of this mutable collision-proof hash map which satisfy a predicate.

    Selects all elements of this mutable collision-proof hash map which satisfy a predicate.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  42. def filterInPlace(p: (K, V) => Boolean): CollisionProofHashMap.this.type

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

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

    p

    The test predicate

    Definition Classes
    MapOps
  43. def filterNot(pred: ((K, V)) => Boolean): CollisionProofHashMap[K, V]

    Selects all elements of this mutable collision-proof hash map which do not satisfy a predicate.

    Selects all elements of this mutable collision-proof hash map which do not satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  44. def find(p: ((K, V)) => Boolean): Option[(K, V)]

    Finds the first element of the mutable collision-proof hash map satisfying a predicate, if any.

    Finds the first element of the mutable collision-proof hash map satisfying a predicate, if any.

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

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the mutable collision-proof hash map that satisfies p, or None if none exists.

    Definition Classes
    IterableOnceOps
  45. def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): CollisionProofHashMap[K2, V2]

    Builds a new CollisionProofHashMap by applying a function to all elements of this mutable collision-proof hash map and using the elements of the resulting collections.

    Builds a new CollisionProofHashMap by applying a function to all elements of this mutable collision-proof hash map and using the elements of the resulting collections.

    f

    the function to apply to each element.

    returns

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

  46. def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): Map[K2, V2]

    Builds a new map by applying a function to all elements of this mutable collision-proof hash map and using the elements of the resulting collections.

    Builds a new map by applying a function to all elements of this mutable collision-proof hash map and using the elements of the resulting collections.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedMapOpsMapOps
  47. def flatMap[B](f: ((K, V)) => IterableOnce[B]): Iterable[B]

    Builds a new mutable collision-proof hash map by applying a function to all elements of this mutable collision-proof hash map and using the elements of the resulting collections.

    Builds a new mutable collision-proof hash map by applying a function to all elements of this mutable collision-proof hash map and using the elements of the resulting collections.

    For example:

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

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

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => 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 mutable collision-proof hash map resulting from applying the given collection-valued function f to each element of this mutable collision-proof hash map and concatenating the results.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  48. def flatten[B](implicit toIterableOnce: ((K, V)) => IterableOnce[B]): Iterable[B]

    Converts this mutable collision-proof hash map of iterable collections into a mutable collision-proof hash map formed by the elements of these iterable collections.

    Converts this mutable collision-proof hash map of iterable collections into a mutable collision-proof hash map formed by the elements of these iterable collections.

    The resulting collection's type will be guided by the type of mutable collision-proof hash map. 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 iterable collection.

    returns

    a new mutable collision-proof hash map resulting from concatenating all element mutable collision-proof hash maps.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  49. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1

    Folds the elements of this mutable collision-proof hash map using the specified associative binary operator.

    Folds the elements of this mutable collision-proof hash map using the specified associative binary operator. The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.

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

    A1

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

    z

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

    op

    a binary operator that must be associative.

    returns

    the result of applying the fold operator op between all the elements and z, or z if this mutable collision-proof hash map is empty.

    Definition Classes
    IterableOnceOps
  50. def foldLeft[B](z: B)(op: (B, (K, V)) => B): B

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable collision-proof hash map, going left to right with the start value z on the left: op(...op(z, x1), x2, ..., xn) where x1, ..., xn are the elements of this mutable collision-proof hash map. Returns z if this mutable collision-proof hash map is empty.

    Definition Classes
    IterableOnceOps
  51. def foldRight[B](z: B)(op: ((K, V), B) => B): B

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable collision-proof hash map, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x1, ..., xn are the elements of this mutable collision-proof hash map. Returns z if this mutable collision-proof hash map is empty.

    Definition Classes
    IterableOnceOps
  52. def forall(p: ((K, V)) => Boolean): Boolean

    Tests whether a predicate holds for all elements of this mutable collision-proof hash map.

    Tests whether a predicate holds for all elements of this mutable collision-proof hash map.

    p

    the predicate used to test elements.

    returns

    true if this mutable collision-proof hash map is empty or the given predicate p holds for all elements of this mutable collision-proof hash map, otherwise false.

    Definition Classes
    IterableOnceOps
  53. 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
    CollisionProofHashMapIterableOnceOps
  54. def foreachEntry[U](f: (K, V) => U): Unit

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

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

    Definition Classes
    CollisionProofHashMapMapOps
  55. def fromNodes(xs: Iterator[Node], size: Int): RBNode
  56. 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
    CollisionProofHashMapMapOps
  57. def getOrElse[V1 >: V](key: K, default: => V1): V1

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

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

    V1

    the result type of the default computation.

    key

    the key.

    default

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

    returns

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

    Definition Classes
    CollisionProofHashMapMapOps
  58. def getOrElseUpdate(key: K, defaultValue: => V): V

    If given key is already in this map, returns associated value.

    If given key is already in this map, returns associated value.

    Otherwise, computes value from given expression op, stores with key in map and returns that value.

    Concurrent map implementations may evaluate the expression op multiple times, or may evaluate op without inserting the result.

    key

    the key to test

    returns

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

    Definition Classes
    CollisionProofHashMapMapOps
  59. def groupBy[K](f: ((K, V)) => K): immutable.Map[K, CollisionProofHashMap[K, V]]

    Partitions this mutable collision-proof hash map into a map of mutable collision-proof hash maps according to some discriminator function.

    Partitions this mutable collision-proof hash map into a map of mutable collision-proof hash maps according to some discriminator function.

    Note: Even 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 mutable collision-proof hash maps 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 mutable collision-proof hash map of those elements x for which f(x) equals k.

    Definition Classes
    IterableOps
  60. def groupMap[K, B](key: ((K, V)) => K)(f: ((K, V)) => B): immutable.Map[K, Iterable[B]]

    Partitions this mutable collision-proof hash map into a map of mutable collision-proof hash maps according to a discriminator function key.

    Partitions this mutable collision-proof hash map into a map of mutable collision-proof hash maps 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)

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

    B

    the type of values returned by the transformation function

    key

    the discriminator function

    f

    the element transformation function

    Definition Classes
    IterableOps
  61. def groupMapReduce[K, B](key: ((K, V)) => K)(f: ((K, V)) => B)(reduce: (B, B) => B): immutable.Map[K, B]

    Partitions this mutable collision-proof hash map into a map according to a discriminator function key.

    Partitions this mutable collision-proof hash map into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the f 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)(_ + _)

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

    Definition Classes
    IterableOps
  62. def grouped(size: Int): Iterator[CollisionProofHashMap[K, V]]

    Partitions elements in fixed size mutable collision-proof hash maps.

    Partitions elements in fixed size mutable collision-proof hash maps.

    size

    the number of elements per group

    returns

    An iterator producing mutable collision-proof hash maps 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

  63. 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
  64. def head: (K, V)

    Selects the first element of this mutable collision-proof hash map.

    Selects the first element of this mutable collision-proof hash map.

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

    returns

    the first element of this mutable collision-proof hash map.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException if the mutable collision-proof hash map is empty.

  65. 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 mutable collision-proof hash map if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  66. def init: CollisionProofHashMap[K, V]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

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

    Definition Classes
    IterableOps
  67. def inits: Iterator[CollisionProofHashMap[K, V]]

    Iterates over the inits of this mutable collision-proof hash map.

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

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

    returns

    an iterator over all the inits of this mutable collision-proof hash map

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

  68. 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
  69. def isEmpty: Boolean

    Tests whether the mutable collision-proof hash map is empty.

    Tests whether the mutable collision-proof hash map is empty.

    Note: The default implementation creates and discards an iterator.

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

    returns

    true if the mutable collision-proof hash map contains no elements, false otherwise.

    Definition Classes
    CollisionProofHashMapIterableOnceOps
  70. def isTraversableAgain: Boolean

    Tests whether this mutable collision-proof hash map can be repeatedly traversed.

    Tests whether this mutable collision-proof hash map can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.

    returns

    true if it is repeatedly traversable, false otherwise.

    Definition Classes
    IterableOpsIterableOnceOps
  71. def iterableFactory: IterableFactory[Iterable]

    The companion object of this mutable collision-proof hash map, providing various factory methods.

    The companion object of this mutable collision-proof hash map, providing various factory methods.

    Definition Classes
    IterableIterableIterableOps
    Note

    When implementing a custom collection type and refining CC to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

  72. def iterator: Iterator[(K, V)]

    Iterator can be used only once

    Iterator can be used only once

    Definition Classes
    CollisionProofHashMapIterableOnce
  73. def keySet: collection.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
    MapOps
  74. def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S

    Returns a Stepper for the keys of this map.

    Returns a Stepper for the keys of this map. See method stepper.

    Definition Classes
    MapOps
  75. 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
  76. def keysIterator: Iterator[K]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    CollisionProofHashMapMapOps
  77. def knownSize: Int

    returns

    The number of elements in the collection under construction, if it can be cheaply computed, -1 otherwise. The default implementation always returns -1.

    Definition Classes
    CollisionProofHashMapMapOpsGrowableIterableOnce
  78. 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 mutable collision-proof hash map.

    Definition Classes
    IterableOps
    Exceptions thrown

    NoSuchElementException If the mutable collision-proof hash map is empty.

  79. 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 mutable collision-proof hash map$ if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  80. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, CollisionProofHashMap.this.type]

    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.

    Definition Classes
    Iterable
  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[K2, V2](f: ((K, V)) => (K2, V2))(implicit ordering: Ordering[K2]): CollisionProofHashMap[K2, V2]

    Builds a new CollisionProofHashMap by applying a function to all elements of this mutable collision-proof hash map.

    Builds a new CollisionProofHashMap by applying a function to all elements of this mutable collision-proof hash map.

    f

    the function to apply to each element.

    returns

    a new mutable collision-proof hash map resulting from applying the given function f to each element of this mutable collision-proof hash map and collecting the results.

  83. def map[K2, V2](f: ((K, V)) => (K2, V2)): Map[K2, V2]

    Builds a new map by applying a function to all elements of this mutable collision-proof hash map.

    Builds a new map by applying a function to all elements of this mutable collision-proof hash map.

    f

    the function to apply to each element.

    returns

    a new mutable collision-proof hash map resulting from applying the given function f to each element of this mutable collision-proof hash map and collecting the results.

    Definition Classes
    StrictOptimizedMapOpsMapOps
  84. def map[B](f: ((K, V)) => B): Iterable[B]

    Builds a new mutable collision-proof hash map by applying a function to all elements of this mutable collision-proof hash map.

    Builds a new mutable collision-proof hash map by applying a function to all elements of this mutable collision-proof hash map.

    B

    the element type of the returned mutable collision-proof hash map.

    f

    the function to apply to each element.

    returns

    a new mutable collision-proof hash map resulting from applying the given function f to each element of this mutable collision-proof hash map and collecting the results.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  85. def mapFactory: MapFactory[Map]

    The companion object of this map, providing various factory methods.

    The companion object of this map, providing various factory methods.

    Definition Classes
    MapMapMapOps
    Note

    When implementing a custom collection type and refining CC to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

  86. def mapResult[NewTo](f: (CollisionProofHashMap[K, V]) => NewTo): Builder[(K, V), NewTo]

    A builder resulting from this builder my mapping the result using f.

    A builder resulting from this builder my mapping the result using f.

    Definition Classes
    Builder
  87. def mapValuesInPlace(f: (K, V) => V): CollisionProofHashMap.this.type

    Applies a transformation function to all values contained in this map.

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

    f

    the transformation to apply

    returns

    the map itself.

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

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    the largest element of this mutable collision-proof hash map with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this mutable collision-proof hash map is empty.

  89. def maxBy[B](f: ((K, V)) => B)(implicit ord: math.Ordering[B]): (K, V)

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

    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 mutable collision-proof hash map with the largest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this mutable collision-proof hash map is empty.

  90. def maxByOption[B](f: ((K, V)) => B)(implicit ord: math.Ordering[B]): Option[(K, V)]

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

    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

    an option value containing the first element of this mutable collision-proof hash map with the largest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
  91. def maxOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    an option value containing the largest element of this mutable collision-proof hash map with respect to the ordering ord.

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

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    the smallest element of this mutable collision-proof hash map with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this mutable collision-proof hash map is empty.

  93. def minBy[B](f: ((K, V)) => B)(implicit ord: math.Ordering[B]): (K, V)

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

    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 mutable collision-proof hash map with the smallest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this mutable collision-proof hash map is empty.

  94. def minByOption[B](f: ((K, V)) => B)(implicit ord: math.Ordering[B]): Option[(K, V)]

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

    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

    an option value containing the first element of this mutable collision-proof hash map with the smallest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
  95. def minOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    an option value containing the smallest element of this mutable collision-proof hash map with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  96. final def mkString: String

    Displays all elements of this mutable collision-proof hash map in a string.

    Displays all elements of this mutable collision-proof hash map in a string.

    Delegates to addString, which can be overridden.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  97. final def mkString(sep: String): String

    Displays all elements of this mutable collision-proof hash map in a string using a separator string.

    Displays all elements of this mutable collision-proof hash map in a string using a separator string.

    Delegates to addString, which can be overridden.

    sep

    the separator string.

    returns

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

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

  98. final def mkString(start: String, sep: String, end: String): String

    Displays all elements of this mutable collision-proof hash map in a string using start, end, and separator strings.

    Displays all elements of this mutable collision-proof hash map in a string using start, end, and separator strings.

    Delegates to addString, which can be overridden.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this mutable collision-proof hash map. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this mutable collision-proof hash map are separated by the string sep.

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

  99. def nonEmpty: Boolean

    Tests whether the mutable collision-proof hash map is not empty.

    Tests whether the mutable collision-proof hash map is not empty.

    returns

    true if the mutable collision-proof hash map contains at least one element, false otherwise.

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  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): (CollisionProofHashMap[K, V], CollisionProofHashMap[K, V])

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

    A pair of, first, all elements that satisfy predicate 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 StrictOptimizedIterableOps, which requires only a single traversal.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  102. def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])

    Applies a function f to each element of the mutable collision-proof hash map and returns a pair of mutable collision-proof hash maps: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Applies a function f to each element of the mutable collision-proof hash map and returns a pair of mutable collision-proof hash maps: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Example:

    val xs = `mutable.CollisionProofHashMap`(1, "one", 2, "two", 3, "three") partitionMap {
     case i: Int => Left(i)
     case s: String => Right(s)
    }
    // xs == (`mutable.CollisionProofHashMap`(1, 2, 3),
    //        `mutable.CollisionProofHashMap`(one, two, three))
    A1

    the element type of the first resulting collection

    A2

    the element type of the second resulting collection

    f

    the 'split function' mapping the elements of this mutable collision-proof hash map to an scala.util.Either

    returns

    a pair of mutable collision-proof hash maps: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

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

    Multiplies together the elements of this collection.

    Multiplies together the elements of this collection.

    The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

    B

    the result type of the * operator.

    num

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

    returns

    the product of all elements of this mutable collision-proof hash map with respect to the * operator in num.

    Definition Classes
    IterableOnceOps
  104. def put(key: K, value: V): Option[V]

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

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

    key

    the key to update

    value

    the new value

    returns

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

    Definition Classes
    CollisionProofHashMapMapOps
  105. def reduce[B >: (K, V)](op: (B, B) => B): B

    Reduces the elements of this mutable collision-proof hash map using the specified associative binary operator.

    Reduces the elements of this mutable collision-proof hash map using the specified associative binary operator.

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

    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 mutable collision-proof hash map is nonempty.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this mutable collision-proof hash map is empty.

  106. def reduceLeft[B >: (K, V)](op: (B, (K, V)) => B): B

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable collision-proof hash map, going left to right: op( op( ... op(x1, x2) ..., xn-1), xn) where x1, ..., xn are the elements of this mutable collision-proof hash map.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this mutable collision-proof hash map is empty.

  107. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) => B): Option[B]

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) if this mutable collision-proof hash map is nonempty, None otherwise.

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

    Reduces the elements of this mutable collision-proof hash map, if any, using the specified associative binary operator.

    Reduces the elements of this mutable collision-proof hash map, if any, using the specified associative binary operator.

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

    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
  109. def reduceRight[B >: (K, V)](op: ((K, V), B) => B): B

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this mutable collision-proof hash map, going right to left: op(x1, op(x2, ..., op(xn-1, xn)...)) where x1, ..., xn are the elements of this mutable collision-proof hash map.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this mutable collision-proof hash map is empty.

  110. def reduceRightOption[B >: (K, V)](op: ((K, V), B) => B): Option[B]

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) if this mutable collision-proof hash map is nonempty, None otherwise.

    Definition Classes
    IterableOnceOps
  111. def remove(key: K): Option[V]

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

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

    key

    the key to be removed

    returns

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

    Definition Classes
    CollisionProofHashMapMapOps
  112. def result(): CollisionProofHashMap[K, V]

    Result collection consisting of all elements appended so far.

    Result collection consisting of all elements appended so far.

    Definition Classes
    MapOpsBuilder
  113. 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
    See also

    applyOrElse.

  114. 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 mutable collision-proof hash map containing the prefix scan of the elements in this mutable collision-proof hash map

    Definition Classes
    IterableOps
  115. def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]

    Produces a mutable collision-proof hash map containing cumulative results of applying the operator going left to right, including the initial value.

    Produces a mutable collision-proof hash map containing cumulative results of applying the operator going left to right, including the initial value.

    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
  116. 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: might return different results for different runs, unless the underlying collection type is ordered.

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

    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
  117. def size: Int

    The size of this mutable collision-proof hash map.

    The size of this mutable collision-proof hash map.

    returns

    the number of elements in this mutable collision-proof hash map.

    Definition Classes
    CollisionProofHashMapIterableOnceOps
  118. def sizeCompare(that: collection.Iterable[_]): Int

    Compares the size of this mutable collision-proof hash map to the size of another Iterable.

    Compares the size of this mutable collision-proof hash map to the size of another Iterable.

    that

    the Iterable whose size is compared with this mutable collision-proof hash map's size.

    returns

    A value x where

    x <  0       if this.size <  that.size
    x == 0       if this.size == that.size
    x >  0       if this.size >  that.size

    The method as implemented here does not call size directly; its running time is O(this.size min that.size) instead of O(this.size + that.size). The method should be overridden if computing size is cheap and knownSize returns -1.

    Definition Classes
    IterableOps
  119. def sizeCompare(otherSize: Int): Int

    Compares the size of this mutable collision-proof hash map to a test value.

    Compares the size of this mutable collision-proof hash map to a test value.

    otherSize

    the test value that gets compared with the size.

    returns

    A value x where

    x <  0       if this.size <  otherSize
    x == 0       if this.size == otherSize
    x >  0       if this.size >  otherSize

    The method as implemented here does not call size directly; its running time is O(size min otherSize) instead of O(size). The method should be overridden if computing size is cheap and knownSize returns -1.

    Definition Classes
    IterableOps
    See also

    sizeIs

  120. def sizeHint(size: Int): Unit

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

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

    size

    the hint how many elements will be added.

    Definition Classes
    CollisionProofHashMapBuilder
  121. final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit

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

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection has a known size Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

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

    delta

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

    Definition Classes
    Builder
  122. final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit

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

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    boundingColl

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

    Definition Classes
    Builder
  123. final def sizeIs: SizeCompareOps

    Returns a value class containing operations for comparing the size of this mutable collision-proof hash map to a test value.

    Returns a value class containing operations for comparing the size of this mutable collision-proof hash map to a test value.

    These operations are implemented in terms of sizeCompare(Int), and allow the following more readable usages:

    this.sizeIs < size     // this.sizeCompare(size) < 0
    this.sizeIs <= size    // this.sizeCompare(size) <= 0
    this.sizeIs == size    // this.sizeCompare(size) == 0
    this.sizeIs != size    // this.sizeCompare(size) != 0
    this.sizeIs >= size    // this.sizeCompare(size) >= 0
    this.sizeIs > size     // this.sizeCompare(size) > 0
    Definition Classes
    IterableOps
    Annotations
    @inline()
  124. def slice(from: Int, until: Int): CollisionProofHashMap[K, V]

    Selects an interval of elements.

    Selects an interval of elements. The returned mutable collision-proof hash map 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 mutable collision-proof hash map.

    until

    the lowest index to EXCLUDE from this mutable collision-proof hash map.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
  125. def sliding(size: Int, step: Int): Iterator[CollisionProofHashMap[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.)

    The returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

    size

    the number of elements per group

    step

    the distance between the first elements of successive groups

    returns

    An iterator producing mutable collision-proof hash maps of size size, except the last element (which may be the only element) will be smaller if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    Examples:
    1. List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5))

    2. ,
    3. List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))

    See also

    scala.collection.Iterator, method sliding

  126. def sliding(size: Int): Iterator[CollisionProofHashMap[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.)

    An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

    size

    the number of elements per group

    returns

    An iterator producing mutable collision-proof hash maps of size size, except for a non-empty collection with less than size elements, which returns an iterator that produces the source collection itself as its only element.

    Definition Classes
    IterableOps
    Examples:
    1. List().sliding(2) = empty iterator

    2. ,
    3. List(1).sliding(2) = Iterator(List(1))

    4. ,
    5. List(1, 2).sliding(2) = Iterator(List(1, 2))

    6. ,
    7. List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))

    See also

    scala.collection.Iterator, method sliding

  127. def span(p: ((K, V)) => Boolean): (CollisionProofHashMap[K, V], CollisionProofHashMap[K, V])

    Splits this mutable collision-proof hash map into a prefix/suffix pair according to a predicate.

    Splits this mutable collision-proof hash map into a prefix/suffix pair according to a predicate.

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

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

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this mutable collision-proof hash map whose elements all satisfy p, and the rest of this mutable collision-proof hash map.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  128. def splitAt(n: Int): (CollisionProofHashMap[K, V], CollisionProofHashMap[K, V])

    Splits this mutable collision-proof hash map into a prefix/suffix pair at a given position.

    Splits this mutable collision-proof hash map into a prefix/suffix pair at a given position.

    Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

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

    n

    the position at which to split.

    returns

    a pair of mutable collision-proof hash maps consisting of the first n elements of this mutable collision-proof hash map, and the other elements.

    Definition Classes
    IterableOpsIterableOnceOps
  129. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S

    Returns a scala.collection.Stepper for the elements of this collection.

    Returns a scala.collection.Stepper for the elements of this collection.

    The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.

    The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.

    Note that this method is overridden in subclasses and the return type is refined to S with EfficientSplit, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.

    Definition Classes
    IterableOnce
  130. def subtractAll(xs: IterableOnce[K]): CollisionProofHashMap.this.type

    Removes all elements produced by an iterator from this mutable collision-proof hash map.

    Removes all elements produced by an iterator from this mutable collision-proof hash map.

    xs

    the iterator producing the elements to remove.

    returns

    the mutable collision-proof hash map itself

    Definition Classes
    Shrinkable
  131. def subtractOne(elem: K): CollisionProofHashMap.this.type

    Removes a single element from this mutable collision-proof hash map.

    Removes a single element from this mutable collision-proof hash map.

    elem

    the element to remove.

    returns

    the mutable collision-proof hash map itself

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

    Sums the elements of this collection.

    Sums the elements of this collection.

    The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

    B

    the result type of the + operator.

    num

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

    returns

    the sum of all elements of this mutable collision-proof hash map with respect to the + operator in num.

    Definition Classes
    IterableOnceOps
  133. def tail: CollisionProofHashMap[K, V]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableOps
  134. def tails: Iterator[CollisionProofHashMap[K, V]]

    Iterates over the tails of this mutable collision-proof hash map.

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

    returns

    an iterator over all the tails of this mutable collision-proof hash map

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

  135. def take(n: Int): CollisionProofHashMap[K, V]

    Selects the first n elements.

    Selects the 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 mutable collision-proof hash map.

    returns

    a mutable collision-proof hash map consisting only of the first n elements of this mutable collision-proof hash map, or else the whole mutable collision-proof hash map, if it has less than n elements. If n is negative, returns an empty mutable collision-proof hash map.

    Definition Classes
    IterableOpsIterableOnceOps
  136. def takeRight(n: Int): CollisionProofHashMap[K, V]

    A collection containing the last n elements of this collection.

    A collection containing the last n elements of this collection.

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

    n

    the number of elements to take from this mutable collision-proof hash map.

    returns

    a mutable collision-proof hash map consisting only of the last n elements of this mutable collision-proof hash map, or else the whole mutable collision-proof hash map, if it has less than n elements. If n is negative, returns an empty mutable collision-proof hash map.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  137. def takeWhile(p: ((K, V)) => Boolean): CollisionProofHashMap[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 mutable collision-proof hash map whose elements all satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
  138. def tapEach[U](f: ((K, V)) => U): CollisionProofHashMap[K, V]

    Applies a side-effecting function to each element in this collection.

    Applies a side-effecting function to each element in this collection. Strict collections will apply f to their elements immediately, while lazy collections like Views and LazyLists will only apply f on each element if and when that element is evaluated, and each time that element is evaluated.

    U

    the return type of f

    f

    a function to apply to each element in this mutable collision-proof hash map

    returns

    The same logical collection as this

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  139. 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
  140. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Implementation note: DO NOT call Array.from from this method.

    Definition Classes
    IterableOnceOps
  141. final def toBuffer[B >: (K, V)]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  142. def toIndexedSeq: immutable.IndexedSeq[(K, V)]
    Definition Classes
    IterableOnceOps
  143. def toList: immutable.List[(K, V)]
    Definition Classes
    IterableOnceOps
  144. def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
    Definition Classes
    IterableOnceOps
  145. def toSeq: immutable.Seq[(K, V)]

    returns

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

    Definition Classes
    IterableOnceOps
  146. def toSet[B >: (K, V)]: immutable.Set[B]
    Definition Classes
    IterableOnceOps
  147. 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
    MapFunction1Iterable → AnyRef → Any
  148. def toVector: immutable.Vector[(K, V)]
    Definition Classes
    IterableOnceOps
  149. def transpose[B](implicit asIterable: ((K, V)) => collection.Iterable[B]): Iterable[Iterable[B]]

    Transposes this mutable collision-proof hash map of iterable collections into a mutable collision-proof hash map of mutable collision-proof hash maps.

    Transposes this mutable collision-proof hash map of iterable collections into a mutable collision-proof hash map of mutable collision-proof hash maps.

    The resulting collection's type will be guided by the static type of mutable collision-proof hash map. 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))

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

    B

    the type of the elements of each iterable collection.

    asIterable

    an implicit conversion which asserts that the element type of this mutable collision-proof hash map is an Iterable.

    returns

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

    Definition Classes
    IterableOps
    Exceptions thrown

    IllegalArgumentException if all collections in this mutable collision-proof hash map are not of the same size.

  150. def unapply(a: K): Option[V]

    Tries to extract a B from an A in a pattern matching expression.

    Tries to extract a B from an A in a pattern matching expression.

    Definition Classes
    PartialFunction
  151. def unlift: PartialFunction[K, B]

    Converts an optional function to a partial function.

    Converts an optional function to a partial function.

    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toUnliftOps[K, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if V is a subclass of Option[B] (V <: Option[B]).
    Definition Classes
    UnliftOps
    Example:
    1. Unlike Function.unlift, this UnliftOps.unlift method can be used in extractors.

      val of: Int => Option[String] = { i =>
        if (i == 2) {
          Some("matched by an optional function")
        } else {
          None
        }
      }
      
      util.Random.nextInt(4) match {
        case of.unlift(m) => // Convert an optional function to a pattern
          println(m)
        case _ =>
          println("Not matched")
      }
  152. def unzip[A1, A2](implicit asPair: ((K, V)) => (A1, A2)): (Iterable[A1], Iterable[A2])

    Converts this mutable collision-proof hash map of pairs into two collections of the first and second half of each pair.

    Converts this mutable collision-proof hash map of pairs into two collections of the first and second half of each pair.

    val xs = `mutable.CollisionProofHashMap`(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (`mutable.CollisionProofHashMap`(1, 2, 3),
    //        `mutable.CollisionProofHashMap`(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 mutable collision-proof hash map is a pair.

    returns

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

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

    Converts this mutable collision-proof hash map of triples into three collections of the first, second, and third element of each triple.

    Converts this mutable collision-proof hash map of triples into three collections of the first, second, and third element of each triple.

    val xs = `mutable.CollisionProofHashMap`(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (`mutable.CollisionProofHashMap`(1, 2, 3),
    //        `mutable.CollisionProofHashMap`(one, two, three),
    //        `mutable.CollisionProofHashMap`(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 mutable collision-proof hash map is a triple.

    returns

    a triple of mutable collision-proof hash maps, containing the first, second, respectively third member of each element triple of this mutable collision-proof hash map.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  154. def update(key: K, value: V): Unit

    Adds a new key/value pair to this map.

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

    key

    The key to update

    value

    The new value

    Definition Classes
    CollisionProofHashMapMapOps
  155. def updateWith(key: K)(remappingFunction: (Option[V]) => Option[V]): Option[V]

    Update a mapping for the specified key and its current optionally-mapped value (Some if there is current mapping, None if not).

    Update a mapping for the specified key and its current optionally-mapped value (Some if there is current mapping, None if not).

    If the remapping function returns Some(v), the mapping is updated with the new value v. If the remapping function returns None, the mapping is removed (or remains absent if initially absent). If the function itself throws an exception, the exception is rethrown, and the current mapping is left unchanged.

    key

    the key value

    remappingFunction

    a partial function that receives current optionally-mapped value and return a new mapping

    returns

    the new value associated with the specified key

    Definition Classes
    MapOps
  156. def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S

    Returns a Stepper for the values of this map.

    Returns a Stepper for the values of this map. See method stepper.

    Definition Classes
    MapOps
  157. 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
  158. 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
  159. def view: MapView[K, V]

    A view over the elements of this collection.

    A view over the elements of this collection.

    Definition Classes
    MapOpsIterableOps
  160. def withDefault(d: (K) => V): Map[K, V]

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

    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
  161. def withDefaultValue(d: V): Map[K, V]

    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
  162. def withFilter(p: ((K, V)) => Boolean): MapOps.WithFilter[K, V, [x]Iterable[x], [x, y]Map[x, y]]

    Creates a non-strict filter of this mutable collision-proof hash map.

    Creates a non-strict filter of this mutable collision-proof hash map.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

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

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this mutable collision-proof hash map which satisfy the predicate p.

    Definition Classes
    MapFactoryDefaultsIterableOps
  163. def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]

    Returns a mutable collision-proof hash map formed from this mutable collision-proof hash map and another iterable collection by combining corresponding elements in pairs.

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new mutable collision-proof hash map containing pairs consisting of corresponding elements of this mutable collision-proof hash map and that. The length of the returned collection is the minimum of the lengths of this mutable collision-proof hash map and that.

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

    Returns a mutable collision-proof hash map formed from this mutable collision-proof hash map and another iterable collection by combining corresponding elements in pairs.

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

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

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

    Zips this mutable collision-proof hash map with its indices.

    Zips this mutable collision-proof hash map with its indices.

    returns

    A new mutable collision-proof hash map containing pairs consisting of all elements of this mutable collision-proof hash map 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))

Deprecated Value Members

  1. def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): CollisionProofHashMap[K, V1]
    Definition Classes
    CollisionProofHashMapStrictOptimizedMapOpsMapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

  2. def +[V1 >: V](kv: (K, V1)): CollisionProofHashMap[K, V1]
    Definition Classes
    CollisionProofHashMapMapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Map or fall back to Map.concat

  3. def ++:[V1 >: V](that: IterableOnce[(K, V1)]): Map[K, V1]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  4. def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  5. final def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): CollisionProofHashMap.this.type

    Adds two or more elements to this mutable collision-proof hash map.

    Adds two or more elements to this mutable collision-proof hash map.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the mutable collision-proof hash map itself

    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= aka addAll instead of varargs +=; infix operations with an operand of multiple args will be deprecated

  6. final def -(key1: K, key2: K, keys: K*): CollisionProofHashMap[K, V]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -- or removeAll on an immutable Map

  7. final def -(key: K): CollisionProofHashMap[K, V]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use - or remove on an immutable Map

  8. def --(keys: IterableOnce[K]): CollisionProofHashMap[K, V]
    Definition Classes
    MapOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Map.

  9. def -=(elem1: K, elem2: K, elems: K*): CollisionProofHashMap.this.type

    Removes two or more elements from this mutable collision-proof hash map.

    Removes two or more elements from this mutable collision-proof hash map.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the mutable collision-proof hash map itself

    Definition Classes
    Shrinkable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.3) Use --= aka subtractAll instead of varargs -=; infix operations with an operand of multiple args will be deprecated

  10. def /:[B](z: B)(op: (B, (K, V)) => B): B
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  11. 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 /:

  12. def :\[B](z: B)(op: ((K, V), B) => B): B
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  13. 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 :\

  14. def aggregate[B](z: => B)(seqop: (B, (K, V)) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  15. def collectFirst[B](f: PartialFunction[(K, V), B]): Option[B]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  16. def companion: IterableFactory[[_]Iterable[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  17. def copyToBuffer(dest: Buffer[(K, V)]): Unit
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  18. final def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  19. def count(f: ((K, V)) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  20. def exists(f: ((K, V)) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  21. def filter(f: ((K, V)) => Boolean): Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

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

    (Since version 2.13.0) Use .view.filterKeys(f). A future version will include a strict version of this method (for now, .view.filterKeys(p).toMap).

  23. def find(p: ((K, V)) => Boolean): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  24. def flatMap[B](f: ((K, V)) => IterableOnce[B]): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

  25. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  26. def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  27. def foldRight[B](z: B)(op: ((K, V), B) => B): B
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  28. def forall(f: ((K, V)) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  29. def foreach[U](f: ((K, V)) => U): Unit
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  30. def hasDefiniteSize: Boolean

    Tests whether this mutable collision-proof hash map is known to have a finite size.

    Tests whether this mutable collision-proof hash map is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

    method knownSize for a more useful alternative

  31. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  32. def map[B](f: ((K, V)) => B): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

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

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

    (Since version 2.13.0) Use .view.mapValues(f). A future version will include a strict version of this method (for now, .view.mapValues(f).toMap).

  34. def max(implicit ord: math.Ordering[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  35. def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  36. def min(implicit ord: math.Ordering[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  37. def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  38. def mkString: String
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  39. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  40. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  41. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  42. def product(implicit num: math.Numeric[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  43. def reduce(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  44. def reduceLeft(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  45. def reduceLeftOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  46. def reduceOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  47. def reduceRight(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  48. def reduceRightOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  49. final def repr: CollisionProofHashMap[K, V]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  50. final def retain(p: (K, V) => Boolean): CollisionProofHashMap.this.type
    Definition Classes
    MapOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use filterInPlace instead

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

    (Since version 2.13.0) Use .iterator.sameElements instead

  52. def seq: CollisionProofHashMap.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  53. def size: Int
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  54. def sum(implicit num: math.Numeric[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  55. def to[C1](factory: Factory[(K, V), C1]): C1
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  56. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  57. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  58. def toIndexedSeq: collection.IndexedSeq[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  59. final def toIterable: collection.Iterable[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  60. final def toIterable: CollisionProofHashMap.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
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  61. def toIterator: Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

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

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

  63. def toList: immutable.List[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  64. def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  65. def toSeq: immutable.Seq[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  66. def toSet[B >: A]: immutable.Set[B]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  67. def toStream: immutable.Stream[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

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

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  69. final def toTraversable: collection.Traversable[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  70. final def toTraversable: collection.Traversable[(K, V)]

    Converts this mutable collision-proof hash map to an unspecified Iterable.

    Converts this mutable collision-proof hash map to an unspecified Iterable. Will return the same collection if this instance is already Iterable.

    returns

    An Iterable containing all elements of this mutable collision-proof hash map.

    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  71. def toVector: immutable.Vector[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  72. final def transform(f: (K, V) => V): CollisionProofHashMap.this.type
    Definition Classes
    MapOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapValuesInPlace instead

  73. def updated[V1 >: V](key: K, value: V1): Map[K, V1]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use m.clone().addOne((k,v)) instead of m.updated(k, v)

  74. 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
    Deprecated

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

  75. def withFilter(f: ((K, V)) => Boolean): Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from CollisionProofHashMap[K, V] toIterableOnceExtensionMethods[(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:
    (collisionProofHashMap: IterableOnceExtensionMethods[(K, V)]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead