scala.collection.mutable

WeakHashMap

class WeakHashMap [A, B] extends JMapWrapper[A, B] with JMapWrapperLike[A, B, WeakHashMap[A, B]]

A hash map with references to entries which are weakly reachable. Entries are removed from this map when the key is no longer (strongly) referenced. This class wraps java.util.WeakHashMap.

A

type of keys contained in this map

B

type of values associated with the keys

Source
WeakHashMap.scala
Since

2.8

Linear Supertypes
JMapWrapper[A, B], Serializable, Serializable, Product, JMapWrapperLike[A, B, WeakHashMap[A, B]], Map[A, B], MapLike[A, B, WeakHashMap[A, B]], Cloneable[WeakHashMap[A, B]], Shrinkable[A], Builder[(A, B), WeakHashMap[A, B]], Growable[(A, B)], Map[A, B], MapLike[A, B, WeakHashMap[A, B]], Subtractable[A, WeakHashMap[A, B]], PartialFunction[A, B], (A) ⇒ B, GenMap[A, B], GenMapLike[A, B, WeakHashMap[A, B]], Iterable[(A, B)], Iterable[(A, B)], IterableLike[(A, B), WeakHashMap[A, B]], Equals, GenIterable[(A, B)], GenIterableLike[(A, B), WeakHashMap[A, B]], Traversable[(A, B)], Mutable, Traversable[(A, B)], GenTraversable[(A, B)], GenericTraversableTemplate[(A, B), Iterable], TraversableLike[(A, B), WeakHashMap[A, B]], GenTraversableLike[(A, B), WeakHashMap[A, B]], Parallelizable[(A, B), ParMap[A, B]], TraversableOnce[(A, B)], GenTraversableOnce[(A, B)], FilterMonadic[(A, B), WeakHashMap[A, B]], HasNewBuilder[(A, B), WeakHashMap[A, B]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. WeakHashMap
  2. JMapWrapper
  3. Serializable
  4. Serializable
  5. Product
  6. JMapWrapperLike
  7. Map
  8. MapLike
  9. Cloneable
  10. Shrinkable
  11. Builder
  12. Growable
  13. Map
  14. MapLike
  15. Subtractable
  16. PartialFunction
  17. Function1
  18. GenMap
  19. GenMapLike
  20. Iterable
  21. Iterable
  22. IterableLike
  23. Equals
  24. GenIterable
  25. GenIterableLike
  26. Traversable
  27. Mutable
  28. Traversable
  29. GenTraversable
  30. GenericTraversableTemplate
  31. TraversableLike
  32. GenTraversableLike
  33. Parallelizable
  34. TraversableOnce
  35. GenTraversableOnce
  36. FilterMonadic
  37. HasNewBuilder
  38. AnyRef
  39. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WeakHashMap ()

Type Members

  1. class DefaultKeySet extends Set[A]

    The implementation class of the set returned by keySet.

  2. class DefaultValuesIterable extends Iterable[B]

    The implementation class of the iterable returned by values.

  3. type Self = WeakHashMap[A, B]

    The type implementing this traversable

    The type implementing this traversable

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

    A class supporting filtered operations.

Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

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

    Equivalent to x.hashCode except for boxed numeric types.

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

    returns

    a hash value consistent with ==

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

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

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

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

    B1

    the type of the added values

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

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

    Definition Classes
    MapLikeMapLike
    Annotations
    @migration
    Migration

    "As of 2.8, this operation creates a new map. To add an element as a\n"+ "side effect to an existing map and return that map itself, use +=."

  5. def + [B1 >: B] (kv: (A, B1)): Map[A, B1]

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

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

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

    B1

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

    kv

    the key/value mapping to be added

    returns

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

    Definition Classes
    MapLikeMapLike → GenMapLike
    Annotations
    @migration
    Migration

    "As of 2.8, this operation creates a new map. To add an element as a\n"+ "side effect to an existing map and return that map itself, use +=."

  6. def ++ [B1 >: B] (xs: GenTraversableOnce[(A, B1)]): Map[A, B1]

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

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

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

    B1

    the type of the added values

    xs

    the traversable object.

    returns

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

    Definition Classes
    MapLikeMapLike
    Annotations
    @migration
    Migration

    "As of 2.8, this operation creates a new map. To add the elements as a\n"+ "side effect to an existing map and return that map itself, use ++=."

  7. def ++ [B1 >: B] (xs: TraversableOnce[(A, B1)]): Map[A, B1]

    Definition Classes
    MapLike
    Annotations
    @bridge()
  8. def ++ [B >: (A, B), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[WeakHashMap[A, B], B, That]): That

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

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

    [use case]

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

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always WeakHashMap[A, B] if the elements contained in the resulting collection are pairs of type (A, B). This is because an implicit of type CanBuildFrom[WeakHashMap, (A, B), WeakHashMap[A, B]] is defined in object WeakHashMap. Otherwise, That resolves to the most specific type that doesn't have to contain pairs of type (A, B), which is Iterable.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object WeakHashMap.

    returns

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

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

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

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

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

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

    [use case]

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

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always WeakHashMap[A, B] if the elements contained in the resulting collection are pairs of type (A, B). This is because an implicit of type CanBuildFrom[WeakHashMap, (A, B), WeakHashMap[A, B]] is defined in object WeakHashMap. Otherwise, That resolves to the most specific type that doesn't have to contain pairs of type (A, B), which is Iterable.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object WeakHashMap.

    returns

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

    Definition Classes
    TraversableLike
  14. def ++= (xs: TraversableOnce[(A, B)]): WeakHashMap.this.type

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

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

    returns

    the weak hash map itself.

    Definition Classes
    Growable
  15. def += (kv: (A, B)): WeakHashMap.this.type

    Adds a new key/value pair to this map.

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

    kv

    the key/value pair.

    returns

    the map itself

    Definition Classes
    JMapWrapperLikeMapLikeBuilderGrowable
  16. def += (elem1: (A, B), elem2: (A, B), elems: (A, B)*): WeakHashMap.this.type

    adds two or more elements to this weak hash map.

    adds two or more elements to this weak hash map.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the weak hash map itself

    Definition Classes
    Growable
  17. def - (elem1: A, elem2: A, elems: A*): WeakHashMap[A, B]

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

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

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

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

    Definition Classes
    MapLikeSubtractable
    Annotations
    @migration
    Migration

    "As of 2.8, this operation creates a new map. To remove an element as a\n"+ "side effect to an existing map and return that map itself, use -=."

  18. def - (key: A): WeakHashMap[A, B]

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

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

    key

    the key to be removed

    returns

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

    Definition Classes
    MapLikeMapLikeSubtractable → GenMapLike
    Annotations
    @migration
    Migration

    "As of 2.8, this operation creates a new map. To remove an element as a\n"+ "side effect to an existing map and return that map itself, use -=."

  19. def -- (xs: GenTraversableOnce[A]): WeakHashMap[A, B]

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

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

    xs

    the traversable object.

    returns

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

    Definition Classes
    MapLikeSubtractable
    Annotations
    @migration
    Migration

    "As of 2.8, this operation creates a new map. To remove the elements as a\n"+ "side effect to an existing map and return that map itself, use --=."

  20. def -- (xs: TraversableOnce[A]): WeakHashMap[A, B]

    Definition Classes
    Subtractable
    Annotations
    @bridge()
  21. def --= (xs: TraversableOnce[A]): WeakHashMap.this.type

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

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

    returns

    the weak hash map itself

    Definition Classes
    Shrinkable
  22. def -= (key: A): WeakHashMap.this.type

    Removes a key from this map.

    Removes a key from this map.

    key

    the key to be removed

    returns

    the map itself.

    Definition Classes
    JMapWrapperLikeMapLikeShrinkable
  23. def -= (elem1: A, elem2: A, elems: A*): WeakHashMap.this.type

    Removes two or more elements from this weak hash map.

    Removes two or more elements from this weak hash map.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the weak hash map itself

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

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

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def /:\ [A1 >: (A, B)] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

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

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

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

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

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

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

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def == (arg0: AnyRef): Boolean

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

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  29. def addString (b: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

    Appends all bindings of this map to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations of all bindings of this map in the form of key -> value are separated by the string sep.

    b

    the builder to which strings are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    MapLikeTraversableOnce
  30. def addString (b: StringBuilder): StringBuilder

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

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

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

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

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

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

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

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

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    z

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

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def andThen [C] (k: (B) ⇒ C): PartialFunction[A, C]

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

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

    Retrieves the value which is associated with the given key.

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

    key

    the key

    returns

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

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

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

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

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

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

    that

    The object with which this weak hash map should be compared

    returns

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

    Definition Classes
    IterableLikeEquals
  37. def clear (): Unit

    Removes all bindings from the map.

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

    Definition Classes
    JMapWrapperLikeMapLikeBuilderGrowable
  38. def clone (): WeakHashMap[A, B]

    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
    MapLikeCloneable → AnyRef
  39. def collect [B] (pf: PartialFunction[(A, B), B]): WeakHashMap[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

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

    returns

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

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always WeakHashMap[A, B] if the elements contained in the resulting collection are pairs of type (A, B). This is because an implicit of type CanBuildFrom[WeakHashMap, (A, B), WeakHashMap[A, B]] is defined in object WeakHashMap. Otherwise, That resolves to the most specific type that doesn't have to contain pairs of type (A, B), which is Iterable.

    pf

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

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object WeakHashMap.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  41. def collectFirst [B] (pf: PartialFunction[(A, B), B]): Option[B]

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

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

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

    pf

    the partial function

    returns

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

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

  42. def companion : GenericCompanion[Iterable]

    The factory companion object that builds instances of class WeakHashMap.

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

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

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

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

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

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

    Definition Classes
    Function1
  44. def contains (key: A): Boolean

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key.

    key

    the key

    returns

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

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

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

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

    Copies elements of this weak hash map to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnce → GenTraversableOnce
  47. def copyToArray (xs: Array[(A, B)]): Unit

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

    [use case]

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

    xs

    the array to fill.

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

    Copies values of this weak hash map to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def copyToArray (xs: Array[(A, B)], start: Int): Unit

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

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

    Copies values of this weak hash map to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def copyToBuffer [B >: (A, B)] (dest: Buffer[B]): Unit

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

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

    dest

    The buffer to which elements are copied.

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

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def default (key: A): B

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

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

    key

    the given key value for which a binding is missing.

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

    Selects all elements except first n ones.

    Selects all elements except first n ones.

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

    n

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

    returns

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

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

    Selects all elements except last n ones.

    Selects all elements except last n ones.

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

    n

    The number of elements to take

    returns

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

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

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

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

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  57. def empty : WeakHashMap[A, B]

    The empty map of the same type as this map

    The empty map of the same type as this map

    returns

    an empty map of type This.

    Definition Classes
    WeakHashMapJMapWrapperJMapWrapperLikeMapMapMapLike
  58. def eq (arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  59. def equals (that: Any): Boolean

    Compares two maps structurally; i.

    Compares two maps structurally; i.e. checks if all mappings contained in this map are also contained in the other map, and vice versa.

    that

    the other map

    returns

    true if both maps contain exactly the same mappings, false otherwise.

    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  60. def exists (p: ((A, B)) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeTraversableOnce → GenTraversableOnce
  61. def filter (p: ((A, B)) ⇒ Boolean): WeakHashMap[A, B]

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

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

    p

    the predicate used to test elements.

    returns

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

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

    Filters this map by retaining only keys satisfying a predicate.

    Filters this map by retaining only keys satisfying a predicate.

    p

    the predicate used to test keys

    returns

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

    Definition Classes
    MapLike
  63. def filterNot (p: ((A, B)) ⇒ Boolean): WeakHashMap[A, B]

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

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

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

    p

    A predicate over key-value pairs

    returns

    A new map containing elements not satisfying the predicate.

    Definition Classes
    MapLikeTraversableLike → GenTraversableLike
  64. def finalize (): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  65. def find (p: ((A, B)) ⇒ Boolean): Option[(A, B)]

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

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

    Definition Classes
    IterableLikeTraversableLikeTraversableOnce → GenTraversableOnce
  66. def flatMap [B] (f: ((A, B)) ⇒ GenTraversableOnce[B]): WeakHashMap[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always WeakHashMap[A, B] if the elements contained in the resulting collection are pairs of type (A, B). This is because an implicit of type CanBuildFrom[WeakHashMap, (A, B), WeakHashMap[A, B]] is defined in object WeakHashMap. Otherwise, That resolves to the most specific type that doesn't have to contain pairs of type (A, B), which is Iterable.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object WeakHashMap.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  68. def flatten [B] : WeakHashMap[B]

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

    [use case]

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

    B

    the type of the elements of each traversable collection.

    returns

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

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

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

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

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

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

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

    z

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

    op

    a binary operator that must be associative

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def foldLeft [B] (z: B)(op: (B, (A, B)) ⇒ B): B

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def foldRight [B] (z: B)(op: ((A, B), B) ⇒ B): B

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

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

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

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

    Definition Classes
    IterableLikeTraversableOnce → GenTraversableOnce
  73. def forall (p: ((A, B)) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeTraversableOnce → GenTraversableOnce
  74. def foreach (f: ((A, B)) ⇒ Unit): Unit

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

    [use case]

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

    f

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

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

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

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

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

    U

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

    f

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

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  76. def genericBuilder [B] : Builder[B, Iterable[B]]

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

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

    Definition Classes
    GenericTraversableTemplate
  77. def get (k: A): Option[B]

    Optionally returns the value associated with a key.

    Optionally returns the value associated with a key.

    returns

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

    Definition Classes
    JMapWrapperLikeMapLike → GenMapLike
  78. def getClass (): java.lang.Class[_ <: java.lang.Object]

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

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

    The nature of the representation is platform dependent.

    returns

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

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

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

    [use case]

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

    key

    the key.

    default

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

    returns

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

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

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

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

    B1

    the result type of the default computation.

    key

    the key.

    default

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

    returns

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

    Definition Classes
    MapLike
  81. def getOrElseUpdate (key: A, op: ⇒ B): B

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

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

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

    key

    the key to test

    op

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

    returns

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

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

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

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

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new weak hash map.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to weak hash maps such that the following invariant holds:

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

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

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

    Partitions elements in fixed size weak hash maps.

    Partitions elements in fixed size weak hash maps.

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableLike
    See also

    Iterator#grouped

  84. def hasDefiniteSize : Boolean

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

    Tests whether this weak hash map is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

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

    Definition Classes
    TraversableLikeTraversableOnce → GenTraversableOnce
  85. def hashCode (): Int

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    GenMapLike → AnyRef → Any
  86. def head : (A, B)

    Selects the first element of this weak hash map.

    Selects the first element of this weak hash map.

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

    returns

    the first element of this weak hash map.

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

    Optionally selects the first element.

    Optionally selects the first element.

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

    returns

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

    Definition Classes
    TraversableLike
  88. def init : WeakHashMap[A, B]

    Selects all elements except the last.

    Selects all elements except the last.

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

    returns

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

    Definition Classes
    TraversableLike
  89. def inits : Iterator[WeakHashMap[A, B]]

    Iterates over the inits of this weak hash map.

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

    returns

    an iterator over all the inits of this weak hash map

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

  90. def isDefinedAt (key: A): Boolean

    Tests whether this map contains a binding for a key.

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

    key

    the key

    returns

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

    Definition Classes
    MapLikePartialFunction
  91. def isEmpty : Boolean

    Tests whether the map is empty.

    Tests whether the map is empty.

    returns

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

    Definition Classes
    MapLikeIterableLike → GenIterableLike → TraversableLikeTraversableOnce → GenTraversableOnce
  92. def isInstanceOf [T0] : Boolean

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

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

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

    returns

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

    Attributes
    final
    Definition Classes
    Any
  93. def isTraversableAgain : Boolean

    Tests whether this weak hash map can be repeatedly traversed.

    Tests whether this weak hash map can be repeatedly traversed.

    returns

    true

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

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

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

    returns

    the new iterator

    Definition Classes
    JMapWrapperLikeMapLikeIterableLike → GenIterableLike
  95. def keySet : Set[A]

    Collects all keys of this map in a set.

    Collects all keys of this map in a set.

    returns

    a set containing all keys of this map.

    Definition Classes
    MapLike
  96. def keys : Iterable[A]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    MapLike
    Annotations
    @migration
    Migration

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

  97. def keysIterator : Iterator[A]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

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

    Selects the last element.

    Selects the last element.

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

    returns

    The last element of this weak hash map.

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

    Optionally selects the last element.

    Optionally selects the last element.

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

    returns

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

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

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

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

    returns

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

    Definition Classes
    PartialFunction
    See also

    Function.unlift

  101. def map [B] (f: ((A, B)) ⇒ B): WeakHashMap[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this weak hash map and collecting the results.

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

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always WeakHashMap[A, B] if the elements contained in the resulting collection are pairs of type (A, B). This is because an implicit of type CanBuildFrom[WeakHashMap, (A, B), WeakHashMap[A, B]] is defined in object WeakHashMap. Otherwise, That resolves to the most specific type that doesn't have to contain pairs of type (A, B), which is Iterable.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object WeakHashMap.

    returns

    a new collection of type That resulting from applying the given function f to each element of this weak hash map and collecting the results.

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  103. def mapResult [NewTo] (f: (WeakHashMap[A, B]) ⇒ NewTo): Builder[(A, B), NewTo]

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

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

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

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

    Definition Classes
    Builder
  104. def mapValues [C] (f: (B) ⇒ C): Map[A, C]

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

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

    f

    the function used to transform values of this map.

    returns

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

    Definition Classes
    MapLike
  105. def max : (A, B)

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

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

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

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def maxBy [B] (f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def min : (A, B)

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

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

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

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def minBy [B] (f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def mkString : String

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

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

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def mkString (sep: String): String

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

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

    sep

    the separator string.

    returns

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

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

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

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this weak 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 weak hash map are separated by the string sep.

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

  114. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

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

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

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

    Overrides MapLike implementation for better efficiency.

    Attributes
    protected[this]
    Definition Classes
    MapLikeMapLikeTraversableLikeHasNewBuilder
  116. def nonEmpty : Boolean

    Tests whether the weak hash map is not empty.

    Tests whether the weak hash map is not empty.

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def notify (): Unit

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

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

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

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

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

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

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

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

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

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

    Definition Classes
    PartialFunction
  120. def par : ParMap[A, B]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

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

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

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    Parallelizable
  121. def parCombiner : Combiner[(A, B), ParMap[A, B]]

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    MapLikeMapLikeTraversableLikeParallelizable
  122. def partition (p: ((A, B)) ⇒ Boolean): (WeakHashMap[A, B], WeakHashMap[A, B])

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

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

    p

    the predicate on which to partition.

    returns

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

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

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

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  124. def product [B >: (A, B)] (implicit num: Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

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

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def productArity : Int

    The size of this product.

    The size of this product.

    returns

    for a product A(x_1, ..., x_k), returns k

    Definition Classes
    JMapWrapperProduct
  126. def productElement (arg0: Int): Any

    The nth element of this product, 0-based.

    The nth element of this product, 0-based. In other words, for a product A(x_1, ..., x_k), returns x_(n+1) where 0 < n < k.

    returns

    the element n elements after the first element

    Definition Classes
    JMapWrapperProduct
  127. def productIterator : Iterator[Any]

    An iterator over all the elements of this product.

    An iterator over all the elements of this product.

    returns

    in the default implementation, an Iterator[Any]

    Definition Classes
    Product
  128. def productPrefix : String

    A string used in the toString methods of derived classes.

    A string used in the toString methods of derived classes. Implementations may override this method to prepend a string prefix to the result of toString methods.

    returns

    in the default implementation, the empty string

    Definition Classes
    JMapWrapperProduct
  129. def put (k: A, v: B): Option[B]

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

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

    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
    JMapWrapperLikeMapLike
  130. def reduce [A1 >: (A, B)] (op: (A1, A1) ⇒ A1): A1

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduceLeft [B >: (A, B)] (op: (B, (A, B)) ⇒ B): B

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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this weak hash map is nonempty, None otherwise.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceOption [A1 >: (A, B)] (op: (A1, A1) ⇒ A1): Option[A1]

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def reduceRight [B >: (A, B)] (op: ((A, B), B) ⇒ B): B

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

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

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

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

    Definition Classes
    IterableLikeTraversableOnce → GenTraversableOnce
  135. def reduceRightOption [B >: (A, B)] (op: ((A, B), B) ⇒ B): Option[B]

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this weak hash map is nonempty, None otherwise.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def remove (k: A): Option[B]

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

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

    returns

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

    Definition Classes
    JMapWrapperLikeMapLike
  137. def repr : WeakHashMap[A, B]

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  138. def result (): WeakHashMap[A, B]

    The result when this map is used as a builder

    The result when this map is used as a builder

    returns

    the map representation itself.

    Definition Classes
    MapLikeBuilder
  139. def retain (p: (A, B) ⇒ Boolean): WeakHashMap.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
    MapLike
  140. def reversed : List[(A, B)]

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

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

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

    [use case]

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

    that

    the collection to compare with.

    returns

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

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

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

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

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  144. def scan [B >: (A, B), That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[WeakHashMap[A, B], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

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

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

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

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

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

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object WeakHashMap.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLike → GenTraversableLike
  146. def scanRight [B, That] (z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[WeakHashMap[A, B], B, That]): That

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

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

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

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object WeakHashMap.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  147. def seq : Map[A, B]

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

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

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

    returns

    a sequential view of the collection.

    Definition Classes
    MapMapGenMap → GenMapLike → IterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnce → GenTraversableOnce
  148. def size : Int

    The size of this weak hash map.

    The size of this weak hash map.

    returns

    the number of elements in this weak hash map.

    Definition Classes
    JMapWrapperLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  149. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

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

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

    coll

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

    delta

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

    Definition Classes
    Builder
  150. def sizeHint (size: Int): Unit

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

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

    size

    the hint how many elements will be added.

    Definition Classes
    Builder
  151. def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

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

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

    size

    the hint how many elements will be added.

    boundingColl

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

    Definition Classes
    Builder
  152. def slice (from: Int, until: Int): WeakHashMap[A, B]

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    

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

    from

    the lowest index to include from this weak hash map.

    until

    the highest index to EXCLUDE from this weak hash map.

    returns

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

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

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

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

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

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableLike
    See also

    Iterator#sliding

  155. def span (p: ((A, B)) ⇒ Boolean): (WeakHashMap[A, B], WeakHashMap[A, B])

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  156. def splitAt (n: Int): (WeakHashMap[A, B], WeakHashMap[A, B])

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

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

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

    n

    the position at which to split.

    returns

    a pair of weak hash maps consisting of the first n elements of this weak hash map, and the other elements.

    Definition Classes
    TraversableLike → GenTraversableLike
  157. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this weak hash map. Unless overridden in subclasses, the string prefix of every map is "Map".

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

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

    [use case]

    Sums up the elements of this collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  159. def sum [B >: (A, B)] (implicit num: Numeric[B]): B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

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

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  161. def tail : WeakHashMap[A, B]

    Selects all elements except the first.

    Selects all elements except the first.

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

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  162. def tails : Iterator[WeakHashMap[A, B]]

    Iterates over the tails of this weak hash map.

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

    returns

    an iterator over all the tails of this weak hash map

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

  163. def take (n: Int): WeakHashMap[A, B]

    Selects first n elements.

    Selects first n elements.

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

    n

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

    returns

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

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

    Selects last n elements.

    Selects last n elements.

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

    n

    the number of elements to take

    returns

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

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

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

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

    p

    The predicate used to test elements.

    returns

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

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

    The underlying collection seen as an instance of WeakHashMap.

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

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

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

    [use case]

    Converts this weak hash map to an array.

    returns

    an array containing all elements of this weak hash map.

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

    Converts this weak hash map to an array.

    Converts this weak hash map to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this weak hash map.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toBuffer [C >: (A, B)] : Buffer[C]

    Converts this weak hash map to a mutable buffer.

    Converts this weak hash map to a mutable buffer.

    returns

    a buffer containing all elements of this weak hash map.

    Definition Classes
    MapLikeTraversableOnce → GenTraversableOnce
  170. def toCollection (repr: WeakHashMap[A, B]): Iterable[(A, B)]

    A conversion from collections of type Repr to WeakHashMap objects.

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

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

    Converts this weak hash map to an indexed sequence.

    Converts this weak hash map to an indexed sequence.

    returns

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def toIterable : Iterable[(A, B)]

    Converts this weak hash map to an iterable collection.

    Converts this weak hash map to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this weak hash map.

    Definition Classes
    IterableLikeTraversableOnce → GenTraversableOnce
  173. def toIterator : Iterator[(A, B)]

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

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

    returns

    an Iterator containing all elements of this weak hash map.

    Definition Classes
    TraversableLike → GenTraversableOnce
  174. def toList : List[(A, B)]

    Converts this weak hash map to a list.

    Converts this weak hash map to a list.

    returns

    a list containing all elements of this weak hash map.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toMap [T, U] : Map[T, U]

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

    [use case]

    Converts this weak hash map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this weak hash map.

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

    Converts this weak hash map to a map.

    Converts this weak hash map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this weak hash map.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toSeq : Seq[(A, B)]

    Overridden for efficiency.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this weak hash map.

    Definition Classes
    MapLikeTraversableOnce → GenTraversableOnce
  178. def toSet [B >: (A, B)] : Set[B]

    Converts this weak hash map to a set.

    Converts this weak hash map to a set.

    returns

    a set containing all elements of this weak hash map.

    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. def toStream : Stream[(A, B)]

    Converts this weak hash map to a stream.

    Converts this weak hash map to a stream.

    returns

    a stream containing all elements of this weak hash map.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableOnce
  180. def toString (): String

    Converts this weak hash map to a string.

    Converts this weak hash map to a string.

    returns

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

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

    Converts this weak hash map to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this weak hash map.

    Definition Classes
    TraversableLikeTraversableOnce → GenTraversableOnce
  182. def transform (f: (A, B) ⇒ B): WeakHashMap.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
    MapLike
  183. def transpose [B] (implicit asTraversable: ((A, B)) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  184. val underlying : Map[A, B]

    Definition Classes
    JMapWrapperJMapWrapperLike
  185. def unzip [A1, A2] (implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

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

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

    asPair

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

    returns

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

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

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

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  187. def update (k: A, v: B): Unit

    Adds a new key/value pair to this map.

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

    Definition Classes
    JMapWrapperLikeMapLike
  188. def updated [B1 >: B] (key: A, value: B1): Map[A, B1]

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

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

    B1

    the type of the added value

    key

    The key to add

    value

    The new value

    returns

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

    Definition Classes
    MapLikeMapLike
  189. def values : Iterable[B]

    Collects all values of this map in an iterable collection.

    Collects all values of this map in an iterable collection.

    returns

    the values of this map as an iterable.

    Definition Classes
    MapLike
    Annotations
    @migration
    Migration

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

  190. def valuesIterator : Iterator[B]

    Creates an iterator for all values in this map.

    Creates an iterator for all values in this map.

    returns

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

    Definition Classes
    MapLike
  191. def view (from: Int, until: Int): IterableView[(A, B), WeakHashMap[A, B]]

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

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

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

    Note: view(from, to) is equivalent to view.slice(from, to)

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

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this weak hash map, starting at index from and extending up to (but not including) index until.

    Definition Classes
    IterableLikeTraversableLike
  192. def view : IterableView[(A, B), WeakHashMap[A, B]]

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

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

    returns

    a non-strict view of this weak hash map.

    Definition Classes
    IterableLikeTraversableLike
  193. def wait (): Unit

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

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

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

    The same map with a given default function.

    The same map with a given default function.

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

    d

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

    returns

    a wrapper of the map with a default value

    Definition Classes
    Map
  197. def withDefaultValue (d: B): Map[A, B]

    The same map with a given default value.

    The same map with a given default value.

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

    d

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

    returns

    a wrapper of the map with a default value

    Definition Classes
    Map
  198. def withFilter (p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), WeakHashMap[A, B]]

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

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

    Definition Classes
    TraversableLikeFilterMonadic
  199. def zip [A1 >: (A, B), B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[WeakHashMap[A, B], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  200. def zip [B] (that: GenIterable[B]): WeakHashMap[((A, B), B)]

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

    [use case]

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this weak hash map and that. The length of the returned collection is the minimum of the lengths of this weak hash map and that.

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

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

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

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

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

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this weak hash map and that. The length of the returned collection is the minimum of the lengths of this weak hash map and that.

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

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

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

    [use case]

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

    thatElem

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

    returns

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

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

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

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

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

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  205. def zipWithIndex : WeakHashMap[((A, B), Int)]

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

    [use case]

    Zips this weak hash map with its indices.

    returns

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

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

    Zips this weak hash map with its indices.

    Zips this weak hash map with its indices.

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

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

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

    returns

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

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

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  208. def first : (A, B)

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

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

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

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

    Definition Classes
    MapLike
    Annotations
    @deprecated
    Deprecated

    use mapValues' instead

  211. def productElements : Iterator[Any]

    Definition Classes
    Product
    Annotations
    @deprecated
    Deprecated

    use productIterator instead

  212. def projection : IterableView[(A, B), WeakHashMap[A, B]]

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

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

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

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

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

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

    key

    the key to be removed

    Definition Classes
    MapLike
    Annotations
    @deprecated
    Deprecated

    Use remove' instead

Inherited from JMapWrapper[A, B]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from JMapWrapperLike[A, B, WeakHashMap[A, B]]

Inherited from Map[A, B]

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

Inherited from Cloneable[WeakHashMap[A, B]]

Inherited from Shrinkable[A]

Inherited from Builder[(A, B), WeakHashMap[A, B]]

Inherited from Growable[(A, B)]

Inherited from Map[A, B]

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

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

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from GenMap[A, B]

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

Inherited from Iterable[(A, B)]

Inherited from Iterable[(A, B)]

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

Inherited from Equals

Inherited from GenIterable[(A, B)]

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

Inherited from Traversable[(A, B)]

Inherited from Mutable

Inherited from Traversable[(A, B)]

Inherited from GenTraversable[(A, B)]

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

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

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

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

Inherited from TraversableOnce[(A, B)]

Inherited from GenTraversableOnce[(A, B)]

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

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

Inherited from AnyRef

Inherited from Any