The implementation class of the set returned by keySet
.
The implementation class of the iterable returned by values
.
The type implementing this traversable
A class supporting filtered operations.
o != arg0
is the same as !(o == (arg0))
.
o != arg0
is the same as !(o == (arg0))
.
the object to compare against this object for dis-equality.
false
if the receiver object is equivalent to the argument; true
otherwise.
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.
the type of the added values
the first element to add.
the second element to add.
the remaining elements to add.
a new map containing mappings of this map and two or more specified mappings.
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.
the type of the value in the key/value pair.
the key/value mapping to be added
a new map containing mappings of this map and the mapping kv
.
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.
the type of the added values
the traversable object.
a new map containing mappings of this map and those provided by xs
.
[use case] Concatenates this weak hash map with the elements of a traversable collection.
Concatenates this weak hash map with the elements of a traversable collection.
the traversable to append.
a new weak hash map which contains all elements of this weak hash map
followed by all elements of 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.
the element type of the returned collection.
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
.
the traversable to append.
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
a new collection of type That
which contains all elements of this weak hash map
followed by all elements of that
.
adds all elements produced by a TraversableOnce to this weak hash map.
adds all elements produced by a TraversableOnce to this weak hash map.
the weak hash map itself.
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.
the key/value pair.
the map itself
adds two or more elements to this weak hash map.
adds two or more elements to this weak hash map.
the first element to add.
the second element to add.
the remaining elements to add.
the weak hash map itself
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.
the first element to remove.
the second element to remove.
the remaining elements to remove.
a new map containing all the mappings of this map except mappings
with a key equal to elem1
, elem2
or any of elems
.
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.
the key to be removed
a new map with all the mappings of this map except that with a key key
.
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.
the traversable object.
a new map with all the key/value mappings of this map except mappings
with a key equal to a key from xs
.
Removes all elements produced by an iterator from this weak hash map.
Removes all elements produced by an iterator from this weak hash map.
the weak hash map itself
Removes a key from this map.
Removes a key from this map.
the key to be removed
the map itself.
Removes two or more elements from this weak hash map.
Removes two or more elements from this weak hash map.
the first element to remove.
the second element to remove.
the remaining elements to remove.
the weak hash map itself
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.
the result type of the binary operator.
the start value.
the binary operator.
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.
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.
the result type of the binary operator.
the start value
the binary operator
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.
o == arg0
is the same as if (o eq null) arg0 eq null else o.equals(arg0)
.
o == arg0
is the same as if (o eq null) arg0 eq null else o.equals(arg0)
.
the object to compare against this object for equality.
true
if the receiver object is equivalent to the argument; false
otherwise.
o == arg0
is the same as o.equals(arg0)
.
o == arg0
is the same as o.equals(arg0)
.
the object to compare against this object for equality.
true
if the receiver object is equivalent to the argument; false
otherwise.
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
.
the builder to which strings are appended.
the starting string.
the separator string.
the ending string.
the string builder b
to which elements were appended.
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.
the string builder to which elements are appended.
the string builder b
to which elements were appended.
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
.
the string builder to which elements are appended.
the separator string.
the string builder b
to which elements were appended.
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.
the result type of the transformation function.
the transformation function
a partial function with the same domain as this partial function, which maps
arguments x
to k(this(x))
.
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
.
the key
the value associated with the given key, or the result of the
map's default
method, if none exists.
This method is used to cast the receiver object to be of type T0
.
This method is used to 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 expression1.asInstanceOf[String]
will throw a ClassCastException
at runtime, while the expressionList(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 typed.
the receiver object.
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.
The object with which this weak hash map should be compared
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.
Removes all bindings from the map.
Removes all bindings from the map. After this operation has completed, the map will be empty.
This method creates and returns a copy of the receiver object.
[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.
Builds a new collection by applying a partial function to all elements of this weak hash map on which the function is defined.
the element type of the returned collection.
the partial function which filters and maps the weak hash map.
a new weak hash map resulting from applying the given partial function
pf
to each element on which it is defined and collecting the results.
The order of the elements is preserved.
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.
the element type of the returned collection.
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
.
the partial function which filters and maps the weak hash map.
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
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.
The factory companion object that builds instances of class WeakHashMap.
The factory companion object that builds instances of class WeakHashMap.
(f compose g)(x) == f(g(x))
(f compose g)(x) == f(g(x))
Tests whether this map contains a binding for a key.
Tests whether this map contains a binding for a key.
the key
true
if there is a binding for key
in this map, false
otherwise.
[use case] 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.
the array to fill.
the starting index.
the maximal number of elements to copy.
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.
the type of the elements of the array.
the array to fill.
the starting index.
the maximal number of elements to copy.
[use case] 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.
the array to fill.
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.
the type of the elements of the array.
the array to fill.
[use case] 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, after skipping start
values.
Copying will stop once either the end of the current weak hash map is reached,
or the end of the array is reached.
the array to fill.
the starting index.
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, after skipping start
values.
Copying will stop once either the end of the current weak hash map is reached,
or the end of the array is reached.
the type of the elements of the array.
the array to fill.
the starting index.
Copies all elements of this weak hash map to a buffer.
Copies all elements of this weak hash map to a buffer.
The buffer to which elements are copied.
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.
the predicate used to test elements.
the number of elements satisfying the predicate p
.
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.
the given key value for which a binding is missing.
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.
the number of elements to drop from this weak hash map.
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.
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.
The number of elements to take
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.
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.
The predicate used to test elements.
the longest suffix of this weak hash map whose first element
does not satisfy the predicate p
.
use iterator' instead
The empty map of the same type as this map
The empty map of the same type as this map
an empty map of type This
.
This method is used to test whether the argument (arg0
) is a reference to the
receiver object (this
).
This method is used to test whether the argument (arg0
) is a reference to the
receiver object (this
).
The eq
method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on
non-null instances of AnyRef
:
* It is reflexive: for any non-null instance x
of type AnyRef
, x.eq(x)
returns true
.
* It is symmetric: for any non-null instances x
and y
of type AnyRef
, x.eq(y)
returns true
if and
only if y.eq(x)
returns true
.
* It is transitive: for any non-null instances x
, y
, and z
of type AnyRef
if x.eq(y)
returns true
and y.eq(z)
returns true
, then x.eq(z)
returns true
.
Additionally, the eq
method has three other 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
).
the object to compare against this object for reference equality.
true
if the argument is a reference to the receiver object; false
otherwise.
Compares two maps structurally; i.
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.
the predicate used to test elements.
true
if the given predicate p
holds for some of the elements
of this weak hash map, otherwise false
.
Selects all elements of this weak hash map which satisfy a predicate.
Selects all elements of this weak hash map which satisfy a predicate.
the predicate used to test elements.
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.
Filters this map by retaining only keys satisfying a predicate.
Filters this map by retaining only keys satisfying a predicate.
the predicate used to test keys
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.
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.
A predicate over key-value pairs
A new map containing elements not satisfying the predicate.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize
method are invoked, as well as the interaction between finalize
and non-local returns and exceptions, are all platform dependent.
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.
the predicate used to test elements.
an option value containing the first element in the weak hash map
that satisfies p
, or None
if none exists.
use head' instead
None
if iterable is empty.
[use case] 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.
the element type of the returned collection.
the function to apply to each element.
a new weak hash map resulting from applying the given collection-valued function
f
to each element 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.
Builds a new collection by applying a function to all elements of this weak hash map and concatenating the results.
the element type of the returned collection.
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
.
the function to apply to each element.
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
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.
[use case] 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.
the type of the elements of each traversable collection.
a new weak hash map resulting from concatenating all element weak hash maps.
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.
the type of the elements of each traversable collection.
an implicit conversion which asserts that the element type of this
weak hash map is a Traversable
.
a new weak hash map resulting from concatenating all element weak hash maps.
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.
the result type of the binary operator.
the start value.
the binary operator.
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.
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.
the result type of the binary operator.
the start value.
the binary operator.
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.
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.
the predicate used to test elements.
true
if the given predicate p
holds for all elements
of this weak hash map, otherwise false
.
[use case] Applies a function f
to all elements of this weak hash map.
Applies a function f
to all elements of this weak hash map.
the function that is applied for its side-effect to every element.
The result of function f
is discarded.
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.
the type parameter describing the result of function f
.
This result will always be ignored. Typically U
is Unit
,
but this is not necessary.
the function that is applied for its side-effect to every element.
The result of function f
is discarded.
The generic builder that builds instances of WeakHashMap at arbitrary element types.
The generic builder that builds instances of WeakHashMap at arbitrary element types.
Optionally returns the value associated with a key.
Optionally returns the value associated with a key.
an option value containing the value associated with key
in this map,
or None
if none exists.
Returns a representation that corresponds to the dynamic class of the receiver object.
Returns a representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object.
[use case] 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.
the key.
a computation that yields a default value in case no binding for key
is
found in the map.
the value associated with key
if it exists,
otherwise the result of the default
computation.
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.
the result type of the default computation.
the key.
a computation that yields a default value in case no binding for key
is
found in the map.
the value associated with key
if it exists,
otherwise the result of the default
computation.
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.
the key to test
the computation yielding the value to associate with key
, if
key
is previously unbound.
the value associated with key (either previously or as a result of executing the method).
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.
the type of keys returned by the discriminator function.
the discriminator function.
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
.
Partitions elements in fixed size weak hash maps.
Partitions elements in fixed size weak hash maps.
the number of elements per group
An iterator producing weak hash maps of size size
, except the
last will be truncated if the elements don't divide evenly.
Iterator#grouped
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.
true
if this collection is known to have finite size, false
otherwise.
Returns a hash code value for the object.
Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)
) yet
not be equal (o1.equals(o2)
returns false
). A degenerate implementation could always return 0
.
However, it is required that if two objects are equal (o1.equals(o2)
returns true
) that they have
identical hash codes (o1.hashCode.equals(o2.hashCode)
). Therefore, when overriding this method, be sure
to verify that the behavior is consistent with the equals
method.
the hash code value for the object.
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.
the first element of this weak hash map.
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.
the first element of this weak hash map if it is nonempty, None
if it is empty.
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.
a weak hash map consisting of all elements of this weak hash map except the last one.
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
.
the key
true
if there is a binding for key
in this map, false
otherwise.
Tests whether the map is empty.
Tests whether the map is empty.
true
if the map does not contain any key/value binding, false
otherwise.
This method is used to test whether the dynamic type of the receiver object is T0
.
This method is used to test whether the dynamic type of the receiver object is T0
.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.
true
if the receiver object is an instance of erasure of type T0
; false
otherwise.
Tests whether this weak hash map can be repeatedly traversed.
Tests whether this weak hash map can be repeatedly traversed.
true
Creates a new iterator over all key/value pairs of this map
Creates a new iterator over all key/value pairs of this map
the new iterator
Collects all keys of this map in a set.
Collects all keys of this map in a set.
a set containing all keys of this map.
Creates an iterator for all keys.
Creates an iterator for all keys.
Selects the last element.
Selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the first element of this weak hash map.
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.
the last element of this weak hash map$ if it is nonempty, None
if it is empty.
Turns this partial function into an plain function returning an Option
result.
Turns this partial function into an plain function returning an Option
result.
a function that takes an argument x
to Some(this(x))
if this
is defined for x
, and to None
otherwise.
[use case] 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.
the element type of the returned collection.
the function to apply to each element.
a new weak hash map resulting from applying the given function
f
to each element of this weak hash map and collecting the results.
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.
the element type of the returned collection.
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
.
the function to apply to each element.
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
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.
use mapValues' instead
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.
the type of collection returned by f
.
the transformation function.
a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.
Transforms this map by applying a function to every retrieved value.
Transforms this map by applying a function to every retrieved value.
the function used to transform values of this map.
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.
[use case] Finds the largest element.
Finds the largest element.
the largest element of this weak hash map.
Finds the largest element.
Finds the largest element.
The type over which the ordering is defined.
An ordering to be used for comparing elements.
the largest element of this weak hash map with respect to the ordering cmp
.
[use case] Finds the smallest element.
Finds the smallest element.
the smallest element of this weak hash map
Finds the smallest element.
Finds the smallest element.
The type over which the ordering is defined.
An ordering to be used for comparing elements.
the smallest element of this weak hash map with respect to the ordering cmp
.
Displays all elements of this weak hash map in a string.
Displays all elements of this weak hash map in a string.
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.
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.
the separator string.
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
.
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.
the starting string.
the separator string.
the ending string.
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
.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
the object to compare against this object for reference dis-equality.
false
if the argument is not a reference to the receiver object; true
otherwise.
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.
Tests whether the weak hash map is not empty.
Tests whether the weak hash map is not empty.
true
if the weak hash map contains at least one element, false
otherwise.
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.
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.
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.
the argument type of the fallback function
the result type of the fallback function
the fallback function
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.
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.
the predicate on which to partition.
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.
[use case] Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the product of all elements in this weak hash map of numbers of type Int
.
Instead of Int
, any other type T
with an implicit Numeric[T]
implementation
can be used as element type of the weak hash map and as result type of product
.
Examples of such types are: Long
, Float
, Double
, BigInt
.
Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the result type of the *
operator.
an implicit parameter defining a set of numeric operations
which includes the *
operator to be used in forming the product.
the product of all elements of this weak hash map with respect to the *
operator in num
.
return k for a product A(x_1,.
return k for a product A(x_1,...,x_k)
definition classes: JMapWrapper → Product
def
productElement(arg0: Int): Any
For a product A(x_1,.
For a product A(x_1,...,x_k)
, returns x_(n+1)
for 0 <= n < k
- returns
The element n
elements after the first element
definition classes: JMapWrapper → Product
def
productElements: Iterator[Any]
definition classes: Product
deprecated:
use productIterator instead
def
productIterator: Iterator[Any]
An iterator that returns all fields of this product
An iterator that returns all fields of this product
definition classes: Product
def
productPrefix: String
By default the empty string.
By default the empty string. Implementations may override this
method in order to prepend a string prefix to the result of the
toString methods.
definition classes: JMapWrapper → Product
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
deprecated:
use view' instead
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: JMapWrapperLike → MapLike
def
reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B
Applies a binary operator to all elements of this weak hash map, going left to right.
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
the result of inserting op
between consecutive elements of this weak hash map,
going left to right:
op(...(op(x_{1}, x_{2}), ... ) , x_{n})
where x,,1,,, ..., x,,n,,
are the elements of this weak hash map.
definition classes: TraversableOnce
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
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: IterableLike → TraversableOnce
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
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: JMapWrapperLike → MapLike
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
deprecated:
Use remove' instead
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
def
result(): WeakHashMap[A, B]
The result when this map is used as a builder
def
retain(p: (A, B) ⇒ Boolean): MapLike[A, B, WeakHashMap[A, B]]
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
def
reversed: List[(A, B)]
attributes: protected[this]
definition classes: TraversableOnce
def
sameElements(that: Iterable[(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: IterableLike
def
sameElements[B >: (A, B)](that: Iterable[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
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
and the new element type B
.
- returns
collection with intermediate results
definition classes: TraversableLike
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.
Note: might return different results for different runs, unless the underlying collection type is ordered.
- B
the type of the elements in the resulting collection
- That
the actual type of the resulting collection
- z
the initial value
- op
the binary operator applied to the intermediate result and the element
- bf
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
- returns
collection with intermediate results
definition classes: TraversableLike
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 → TraversableOnce
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 ot 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
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
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
def
slice(from: Int, until: Int): WeakHashMap[A, B]
Selects an interval of elements.
Selects an interval of elements.
Note: c.slice(from, to)
is equivalent to (but possibly more efficient than)
c.drop(from).take(to - from)
Note: might return different results for different runs, unless the underlying collection type is ordered.
- from
the index of the first returned element in this weak hash map.
- until
the index one past the last returned element in this weak hash map.
- returns
a weak hash map containing the elements starting at index from
and extending up to (but not including) index until
of this weak hash map.
definition classes: IterableLike → TraversableLike
def
sliding[B >: (A, B)](size: Int, step: Int): Iterator[WeakHashMap[A, B]]
definition classes: IterableLike
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 will be truncated if the elements don't divide evenly.
definition classes: IterableLike
see also:
Iterator#sliding
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
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
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: MapLike → TraversableLike
def
sum: Int
[use case] Sums up the elements of this collection.
[use case] Sums up the elements of this collection.
- returns
the sum of all elements in this weak hash map of numbers of type Int
.
Instead of Int
, any other type T
with an implicit Numeric[T]
implementation
can be used as element type of the weak hash map and as result type of sum
.
Examples of such types are: Long
, Float
, Double
, BigInt
.
attributes: abstract
definition classes: TraversableOnce
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
def
synchronized[T0](arg0: T0): T0
attributes: final
definition classes: AnyRef
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
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: IterableLike → TraversableLike
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
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: IterableLike → TraversableLike
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: IterableLike → TraversableLike
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.
A ClassManifest
must be available for the element type of this weak hash map.
attributes: abstract
definition classes: TraversableOnce
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
def
toBuffer[B >: (A, B)]: Buffer[B]
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: TraversableOnce
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: IterableLike → TraversableLike
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
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: IterableLike → TraversableOnce
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 → TraversableOnce
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
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 ((K, V)) 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
def
toSeq: Seq[(A, B)]
Converts this weak hash map to a sequence.
Converts this weak hash map to a sequence.
- returns
a sequence containing all the elements of this weak hash map.
definition classes: IterableLike → TraversableOnce
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
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.
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.
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: TraversableLike → TraversableOnce
def
transform(f: (A, B) ⇒ B): MapLike[A, B, WeakHashMap[A, B]]
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
def
transpose[B](implicit asTraversable: ((A, B)) ⇒ Traversable[B]): Iterable[Iterable[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: GenericTraversableTemplate
val
underlying: Map[A, B]
definition classes: JMapWrapper → JMapWrapperLike
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
halfs of each pair.
Converts this weak hash map of pairs into two collections of the first and second
halfs 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
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: JMapWrapperLike → MapLike
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.
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
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
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: IterableLike → TraversableLike
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: IterableLike → TraversableLike
def
wait(): Unit
attributes: final
definition classes: AnyRef
def
wait(arg0: Long, arg1: Int): Unit
attributes: final
definition classes: AnyRef
def
wait(arg0: Long): Unit
attributes: final
definition classes: AnyRef
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: TraversableLike → FilterMonadic
def
zip[B](that: Iterable[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 weak hash map 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: IterableLike
def
zip[A1 >: (A, B), B, That](that: Iterable[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
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.
- B
the type of the second half of the returned pairs
- 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 weak hash map 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: IterableLike
def
zipAll[B, A1 >: (A, B), That](that: Iterable[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
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 weak hash map containing pairs consisting of all elements of this
weak hash map paired with their index. Indices start at 0
.
@example
List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
attributes: abstract
definition classes: IterableLike
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
A hash map with references to entries which are weakly reachable.
type of keys contained in this map
type of values associated with the keys
since
2.8