A class supporting filtered operations
Add a key/value pair to this map, returning a new map
Add a key/value pair to this map, returning a new map.
the key/value pair
A new map with the new binding added to this map
Adds two or more elements to this collection and returns a new collection
Adds two or more elements to this collection and returns a new collection.
the type of the added values
the first element to add.
the second element to add.
the remaining elements to add.
a new map with the given bindings added to this map
Adds a number of elements provided by an iterator and returns a new collection with the added elements
Adds a number of elements provided by a traversable object and returns a new collection with the added elements
[use case] Concatenates this map with the elements of an iterator
Concatenates this map with the elements of an iterator.
the iterator to append.
a new map which contains all elements of this map
followed by all elements of that.
Concatenates this map with the elements of an iterator
Concatenates this map with the elements of an iterator.
the element type of the returned collection.
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
the iterator 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 map
followed by all elements of that.
[use case] Concatenates this map with the elements of a traversable collection
Concatenates this map with the elements of a traversable collection.
the traversable to append.
a new map which contains all elements of this map
followed by all elements of that.
Concatenates this map with the elements of a traversable collection
Concatenates this map with the elements of a traversable collection.
the element type of the returned collection.
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
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 map
followed by all elements of that.
[use case] Removes a key from this map, returning a new map
Removes a key from this map, returning a new map.
the key to be removed
a new map without a binding for key
Removes a key from this map, returning a new map
Removes a key from this map, returning a new map.
the key to be removed
a new map without a binding for key
Creates a new map from this map with some elements removed
Creates a new map from this map with some elements removed.
This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.
the first element to remove.
the second element to remove.
the remaining elements to remove.
a new map that contains all elements of the current map except one less occurrence of each of the given elements.
Creates a new map from this map by removing all elements produced by an iterator
Creates a new map from this map by removing all elements produced by an iterator.
the iterator producing the removed elements.
a new map that contains all elements of the current map
except one less occurrence of each of the elements produced by iter.
Creates a new map from this map by removing all elements of another collection
Creates a new map from this map by removing all elements of another collection.
the collection containing the removed elements.
a new map that contains all elements of the current map
except one less occurrence of each of the elements of elems.
Applies a binary operator to a start value and all elements of this map, going left to right
Applies a binary operator to a start value and all elements of this 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 map$,
going left to right with the start value z on the left:
{{{
op(...op(op(z, x1), x2), ..., xn)
}}}
where x,,1,,, ..., x,,n,, are the elements of this map.
Applies a binary operator to all elements of this map and a start value, going right to left
Applies a binary operator to all elements of this 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 map$,
going right to left with the start value z on the right:
{{{
op(x1, op(x2, ... op(xn, z)...))
}}}
where x,,1,,, ..., x,,n,, are the elements of this map.
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 map to a string builder
Appends all elements of this map to a string builder.
The written text consists of the string representations (w.r.t. the method toString)
of all elements of this 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 map to a string builder using a separator string
Appends all elements of this 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 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)).
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 map should be compared
true, if this map can possibly equal that, false otherwise. The test
takes into consideration only the run-time types of objects but ignores their elements.
The factory companion object that builds instances of class Map
The factory companion object that builds instances of class Map.
(f compose g)(x) == f(g(x))
Tests whether this map contains a binding for a key
[use case] Copies elements of this map to an array
Copies elements of this map to an array.
Fills the given array xs with at most len elements of
this map, starting at position start.
Copying will stop once either the end of the current 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 map to an array
Copies elements of this map to an array.
Fills the given array xs with at most len elements of
this map, starting at position start.
Copying will stop once either the end of the current 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 elements of this map to an array
Copies elements of this map to an array.
Fills the given array xs with all elements of
this map, starting at position 0.
Copying will stop once either the end of the current map is reached,
or the end of the array is reached.
the array to fill.
Copies elements of this map to an array
Copies elements of this map to an array.
Fills the given array xs with all elements of
this map, starting at position 0.
Copying will stop once either the end of the current 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 elements of this map to an array
Copies elements of this map to an array.
Fills the given array xs with all elements of
this map, starting at position start.
Copying will stop once either the end of the current map is reached,
or the end of the array is reached.
the array to fill.
the starting index.
Copies elements of this map to an array
Copies elements of this map to an array.
Fills the given array xs with all elements of
this map, starting at position start.
Copying will stop once either the end of the current 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 map to a buffer
Copies all elements of this map to a buffer.
The buffer to which elements are copied.
Counts the number of elements in the map which satisfy a predicate
Counts the number of elements in the 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
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 map.
a map consisting of all elements of this map except the first n ones, or else the
empty map, if this map has less than n elements.
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 take
a map consisting of all elements of this map except the first n ones, or else the
empty map, if this 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 map whose first element
does not satisfy the predicate p.
Compares two maps structurally; i
Tests whether a predicate holds for some of the elements of this map
Tests whether a predicate holds for some of the elements of this map.
the predicate used to test elements.
true if the given predicate p holds for some of the elements
of this map, otherwise false.
Selects all elements of this map which satisfy a predicate
Selects all elements of this map which satisfy a predicate.
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.
A predicate over key-value pairs
a new map consisting of all elements of this map that do not satisfy the given
predicate p. The order of the elements is preserved.
Finds the first element of the map satisfying a predicate, if any
Finds the first element of the 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 map
that satisfies p, or None if none exists.
None if iterable is empty
[use case] Builds a new collection by applying a function to all elements of this map and concatenating the results
Builds a new collection by applying a function to all elements of this map and concatenating the results.
the element type of the returned collection.
the function to apply to each element.
a new map resulting from applying the given collection-valued function
f to each element of this map and concatenating the results.
Builds a new collection by applying a function to all elements of this map and concatenating the results
Builds a new collection by applying a function to all elements of this map and concatenating the results.
the element type of the returned collection.
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
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 map and concatenating the results.
[use case] Converts this map of traversable collections into a map in which all element collections are concatenated
Converts this map of traversable collections into a map in which all element collections are concatenated.
the type of the elements of each traversable collection.
a new map resulting from concatenating all element maps.
Converts this map of traversable collections into a map in which all element collections are concatenated
Converts this map of traversable collections into a 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
map is a Traversable.
a new map resulting from concatenating all element maps.
Applies a binary operator to a start value and all elements of this map, going left to right
Applies a binary operator to a start value and all elements of this 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 map$,
going left to right with the start value z on the left:
{{{
op(...op(z, x1), x2, ..., xn)
}}}
where x,,1,,, ..., x,,n,, are the elements of this map.
Applies a binary operator to all elements of this map and a start value, going right to left
Applies a binary operator to all elements of this 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 map$,
going right to left with the start value z on the right:
{{{
op(x1, op(x2, ... op(xn, z)...))
}}}
where x,,1,,, ..., x,,n,, are the elements of this map.
Tests whether a predicate holds for all elements of this map
Tests whether a predicate holds for all elements of this map.
the predicate used to test elements.
true if the given predicate p holds for all elements
of this map, otherwise false.
The generic builder that builds instances of Map at arbitrary element types
The generic builder that builds instances of Map at arbitrary element types.
[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 assocuated with key if it exists,
otherwise the result of the default computation.
Partitions this map into a map of maps according to some discriminator function
Partitions this map into a map of 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 map.
the type of keys returned by the discriminator function.
the discriminator function.
A map from keys to 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 map of those elements x for which f(x) equals k.
Partitions elements in fixed size maps
Partitions elements in fixed size maps.
the number of elements per group
An iterator producing maps of size size, except the
last will be truncated if the elements don't divide evenly.
Tests whether this map is known to have a finite size
Tests whether this 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 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.
Selects the first element of this map
Selects the first element of this map.
Note: might return different results for different runs, unless the underlying collection type is ordered.
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.
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.
Left biased intersection
Left biased intersection. Returns the map that has all the same mappings as this but only for keys which are present in the other map.
The map to intersect with.
Forms the intersection of these two maps with a combinining function
Forms the intersection of these two maps with a combinining function. The resulting map is a map that has only keys present in both maps and has values produced from the original mappings by combining them with f.
The map to intersect with.
The combining function.
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.
Iterator over key, value pairs of the map in unsigned order of the keys
Iterator over key, value pairs of the map in unsigned order of the keys.
Collects all keys of this map in a set
Creates an iterator for all keys
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.
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.
Turns this partial function into an plain function returning an Option result
Turns this partial function into an plain function returning an Option result.
[use case] Builds a new collection by applying a function to all elements of this map
Builds a new collection by applying a function to all elements of this map.
the element type of the returned collection.
the function to apply to each element.
a new map resulting from applying the given function
f to each element of this map and collecting the results.
Builds a new collection by applying a function to all elements of this map
Builds a new collection by applying a function to all elements of this map.
the element type of the returned collection.
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
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 map and collecting the results.
A map view resulting from applying a given function f to each value
associated with a key in this 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 map with respect to the ordering cmp.
[use case] Finds the largest element
[use case] Finds the smallest element
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 map with respect to the ordering cmp.
Displays all elements of this map in a string
Displays all elements of this map in a string using a separator string
Displays all elements of this map in a string using a separator string.
the separator string.
a string representation of this map. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this map are separated by the string sep.
Displays all elements of this map in a string using start, end, and separator strings
Displays all elements of this map in a string using start, end, and separator strings.
the starting string.
the separator string.
the ending string.
a string representation of this map. The resulting string
begins with the string start and ends with the string
end. Inside, the string representations (w.r.t. the method toString)
of all elements of this map are separated by the string sep.
A combined transform and filter function
A combined transform and filter function. Returns an IntMap such that for each (key, value) mapping
in this map, if f(key, value) == None the map contains no mapping for key, and if f(key, value)
The transforming function.
Tests whether the map is not empty
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.
[use case] Builds a new collection by applying a partial function to all elements of this map on which the function is defined
Builds a new collection by applying a partial function to all elements of this map on which the function is defined.
the element type of the returned collection.
the partial function which filters and maps the map.
a new map resulting from applying the given partial function
pf to each element on which it is defined and collecting the results.
The order of the elements is preserved.
Builds a new collection by applying a partial function to all elements of this map on which the function is defined
Builds a new collection by applying a partial function to all elements of this map on which the function is defined.
the element type of the returned collection.
the class of the returned collection. Where possible, That is
the same class as the current collection class Repr, but this
depends on the element type B being admissible for that class,
which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
the partial function which filters and maps the 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.
Partitions this map in two maps according to a predicate
Partitions this map in two maps according to a predicate.
the predicate on which to partition.
a pair of maps: the first map consists of all elements that
satisfy the predicate p and the second map consists of all elements
that don't. The relative order of the elements in the resulting maps
is the same as in the original map.
[use case] Multiplies up the elements of this collection
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 map with respect to the * operator in num.
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.
Applies a binary operator to all elements of this map, going left to right
Applies a binary operator to all elements of this 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 binary operator.
the result of inserting op between consecutive elements of this map$,
going left to right:
{{{
op(...(op(x1, x2), ... ) , xn)
}}}
where x,,1,,, ..., x,,n,, are the elements of this map.
Optionally applies a binary operator to all elements of this map, going left to right
Optionally applies a binary operator to all elements of this 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 binary operator.
an option value containing the result of reduceLeft(op) is this map is nonempty,
None otherwise.
Applies a binary operator to all elements of this map, going right to left
Applies a binary operator to all elements of this 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.
the result type of the binary operator.
the binary operator.
the result of inserting op between consecutive elements of this map$,
going right to left:
{{{
op(x1, op(x2, ..., op(xn-1, xn)...))
}}}
where x,,1,,, ..., x,,n,, are the elements of this map.
Optionally applies a binary operator to all elements of this map, going right to left
Optionally applies a binary operator to all elements of this 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.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceRight(op) is this map is nonempty,
None otherwise.
The collection of type map underlying this TraversableLike object
The collection of type map underlying this TraversableLike object.
By default this is implemented as the TraversableLike object itself, but this can be overridden.
[use case] Checks if the other iterable collection contains the same elements in the same order as this map
Checks if the other iterable collection contains the same elements in the same order as this map.
the collection to compare with.
true, if both collections contain the same elements in the same order, false otherwise.
Checks if the other iterable collection contains the same elements in the same order as this map
Checks if the other iterable collection contains the same elements in the same order as this map.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the type of the elements of collection that.
the collection to compare with.
true, if both collections contain the same elements in the same order, false otherwise.
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.
the index of the first returned element in this map.
the index one past the last returned element in this map.
a map containing the elements starting at index from and extending up to (but not including) index until of this map.
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
the number of elements per group
An iterator producing maps of size size, except the
last will be truncated if the elements don't divide evenly.
Spits this map into a prefix/suffix pair according to a predicate
Spits this 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.
the test predicate
a pair consisting of the longest prefix of this map whose
elements all satisfy p, and the rest of this map.
Splits this map into two at a given position
Splits this 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.
the position at which to split.
a pair of maps consisting of the first n elements of this map, and the other elements.
Defines the prefix of this object's toString representation
Defines the prefix of this object's toString representation.
[use case] Sums up the elements of this collection
Sums up the elements of this collection
Sums 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 sum.
the sum of all elements of this map with respect to the + operator in num.
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.
Selects first n elements
Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Tt number of elements to take from this map.
a map consisting only of the first n elements of this map, or else the
whole map, if it has less than n elements.
Selects last n elements
Selects last n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the number of elements to take
a map consisting only of the last n elements of this map, or else the
whole map, if it has less than n elements.
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.
The predicate used to test elements.
the longest prefix of this map whose elements all satisfy
the predicate p.
[use case] Converts this map to an array
Converts this map to an array
Converts this map to an array.
the type of the elements of the array. A ClassManifest for this type must
be available.
an array containing all elements of this map.
Converts this map to an indexed sequence
Converts this map to an iterable collection
Converts this map to an iterable collection.
Converts this map to a list
Converts this map to a list.
Converts this map to a map
Converts this 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.
Converts this map to a sequence
Converts this map to a set
Converts this map to a stream
Converts this map to a string
Converts this map to a string
This function transforms all the values of mappings contained
in this map with function f
Transposes this map of traversable collections into
Transposes this map of traversable collections into
Forms a union map with that map, using the combining function to resolve conflicts
Forms a union map with that map, using the combining function to resolve conflicts.
the map to form a union with.
the function used to resolve conflicts between two mappings.
Converts this map of pairs into two collections of the first and second halfs of each pair
Converts this map of pairs into two collections of the first and second halfs of each pair.
an implicit conversion which asserts that the element type of this map is a pair.
a pair maps, containing the first, respectively second half of each element pair of this map.
Updates the map, using the provided function to resolve conflicts if the key is already present
Updates the map, using the provided function to resolve conflicts if the key is already present. Equivalent to
this.get(key) match {
case None => this.update(key, value);
case Some(oldvalue) => this.update(key, f(oldvalue, value) }
The key to update
The value to use if there is no conflict
The function used to resolve conflicts.
Add a key/value pair to this map
Add a key/value pair to this map.
the key
the value
A new map with the new binding added to this map
Creates an iterator for all contained values
Collects all values of this map in an iterable collection
Creates an iterator for all values in this map
Creates an iterator for all values in this map.
Creates a non-strict view of a slice of this map
Creates a non-strict view of a slice of this map.
Note: the difference between view and slice is that view produces
a view of the current map, whereas slice produces a new 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.
the index of the first element of the view
the index of the element following the view
a non-strict view of a slice of this map, starting at index from and extending up to (but not including) index until.
Creates a non-strict view of this map
Creates a non-strict view of this map.
The same map with a given default function !!! todo: move to general maps?
The same map with a given default value
Creates a non-strict filter of this map
Creates a non-strict filter of this map.
Note: the difference between c filter p and c withFilter p is that
the former creates a new collection, whereas the latter only restricts
the domain of subsequent map, flatMap, foreach, and withFilter operations.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the predicate used to test elements.
an object of class WithFilter, which supports
map, flatMap, foreach, and withFilter operations.
All these operations apply to those elements of this map which
satify the predicate p.
[use case] Returns a map formed from this map and another iterable collection by combining corresponding elements in pairs
Returns a map formed from this 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
a new map containing pairs consisting of
corresponding elements of this map and that. The length
of the returned collection is the minimum of the lengths of this map$ and that.
Returns a map formed from this map and another iterable collection by combining corresponding elements in pairs
Returns a map formed from this 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.
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A).
the type of the second half of the returned pairs
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.
The iterable providing the second half of each result pair
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).
a new collection of type That containing pairs consisting of
corresponding elements of this map and that. The length
of the returned collection is the minimum of the lengths of this map$ and that.
[use case] Returns a map formed from this map and another iterable collection by combining corresponding elements in pairs
Returns a map formed from this 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
the element to be used to fill up the result if this map is shorter than that.
the element to be used to fill up the result if that is shorter than this map.
a new map containing pairs consisting of
corresponding elements of this map and that. The length
of the returned collection is the maximum of the lengths of this map$ and that.
If this map is shorter than that, thisElem values are used to pad the result.
If that is shorter than this map, thatElem values are used to pad the result.
Returns a map formed from this map and another iterable collection by combining corresponding elements in pairs
Returns a map formed from this 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.
the iterable providing the second half of each result pair
the element to be used to fill up the result if this map is shorter than that.
the element to be used to fill up the result if that is shorter than this map.
a new collection of type That containing pairs consisting of
corresponding elements of this map and that. The length
of the returned collection is the maximum of the lengths of this map$ and that.
If this map is shorter than that, thisElem values are used to pad the result.
If that is shorter than this map, thatElem values are used to pad the result.
[use case] Zips this map with its indices
Zips this map with its indices
Zips this map with its indices.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A).
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.
A new collection of type That containing pairs consisting of all elements of this
map paired with their index. Indices start at 0.
Specialised immutable map structure for integer keys, based on Fast Mergeable Integer Maps by Okasaki and Gill. Essentially a trie based on binary digits of the the integers.