The implementation class of the set returned by keySet.
The implementation class of the iterable returned by values.
The type implementing this traversable
The type implementing this traversable
A class supporting filtered operations.
Test two objects for inequality.
Test two objects for inequality.
true if !(this == that), false otherwise.
Equivalent to x.hashCode except for boxed numeric types.
Equivalent to x.hashCode except for boxed numeric types.
For numerics, it returns a hash value which is consistent
with value equality: if two value type instances compare
as true, then ## will produce the same hash value for each
of them.
a hash value consistent with ==
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 linked hash map with the elements of a traversable collection.
Concatenates this linked hash map with the elements of a traversable collection.
the element type of the returned collection.
the traversable to append.
a new collection of type That which contains all elements
of this linked hash map followed by all elements of that.
Concatenates this linked hash map with the elements of a traversable collection.
Concatenates this linked 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 LinkedHashMap[A, B] if the elements contained in the resulting collection are
pairs of type (A, B). This is because an implicit of type CanBuildFrom[LinkedHashMap, (A, B), LinkedHashMap[A, B]]
is defined in object LinkedHashMap. 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 the new element type B. This is usually the canBuildFrom value
defined in object LinkedHashMap.
a new collection of type That which contains all elements
of this linked hash map followed by all elements of that.
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.
[use case] Concatenates this linked hash map with the elements of a traversable collection.
Concatenates this linked hash map with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.
the element type of the returned collection.
the traversable to append.
a new collection of type That which contains all elements
of this linked hash map followed by all elements of that.
Concatenates this linked hash map with the elements of a traversable collection.
Concatenates this linked hash map with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.
the element type of the returned collection.
the class of the returned collection. In the standard library configuration,
That is always LinkedHashMap[A, B] if the elements contained in the resulting collection are
pairs of type (A, B). This is because an implicit of type CanBuildFrom[LinkedHashMap, (A, B), LinkedHashMap[A, B]]
is defined in object LinkedHashMap. 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 the new element type B. This is usually the canBuildFrom value
defined in object LinkedHashMap.
a new collection of type That which contains all elements
of this linked hash map followed by all elements of that.
adds all elements produced by a TraversableOnce to this linked hash map.
adds all elements produced by a TraversableOnce to this linked hash map.
the linked 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 linked hash map.
adds two or more elements to this linked hash map.
the first element to add.
the second element to add.
the remaining elements to add.
the linked 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.
"As of 2.8, this operation creates a new map. To remove an element as a\n"+ "side effect to an existing map and return that map itself, use -=."
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.
"As of 2.8, this operation creates a new map. To remove an element as a\n"+ "side effect to an existing map and return that map itself, use -=."
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.
"As of 2.8, this operation creates a new map. To remove the elements as a\n"+ "side effect to an existing map and return that map itself, use --=."
Removes all elements produced by an iterator from this linked hash map.
Removes all elements produced by an iterator from this linked hash map.
the linked 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 linked hash map.
Removes two or more elements from this linked hash map.
the first element to remove.
the second element to remove.
the remaining elements to remove.
the linked hash map itself
Applies a binary operator to a start value and all elements of this linked hash map, going left to right.
Applies a binary operator to a start value and all elements of this linked hash map, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as
xs foldLeft z.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op between consecutive elements of this linked 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 linked hash map.
A syntactic sugar for out of order folding.
A syntactic sugar for out of order folding. See fold.
Applies a binary operator to all elements of this linked hash map and a start value, going right to left.
Applies a binary operator to all elements of this linked 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.
the result type of the binary operator.
the start value
the binary operator
the result of inserting op between consecutive elements of this linked 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 linked hash map.
Test two objects for equality.
Test two objects for equality.
true if the receiver object is equivalent to the argument; false otherwise.
Add entry to table pre: no entry with same key exists
Add entry to table pre: no entry with same key exists
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 linked hash map to a string builder.
Appends all elements of this linked 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 linked 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 linked hash map to a string builder using a separator string.
Appends all elements of this linked 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 linked 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.
Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold and reduce. It has similar semantics, but does
not require the result to be a supertype of the element type. It traverses the elements in
different partitions sequentially, using seqop to update the result, and then
applies combop to results from different partitions. The implementation of this
operation may operate on an arbitrary number of collection partitions, so combop
may be invoked arbitrary number of times.
For example, one might want to process some elements and then produce a Set. In this
case, seqop would process an element and append it to the list, while combop
would concatenate two lists from different partitions together. The initial value
z would be an empty set.
pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).
the initial value for the accumulated result of the partition - this
will typically be the neutral element for the seqop operator (e.g.
Nil for list concatenation or 0 for summation)
an operator used to accumulate results within a partition
an associative operator used to combine results from different partitions
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.
Cast the receiver object to be of type T0.
Cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics.
Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at
runtime, while the expression List(1).asInstanceOf[List[String]] will not.
In the latter example, because the type argument is erased as part of compilation it is
not possible to check whether the contents of the list are of the requested type.
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 linked hash map should be compared
true, if this linked 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.
Remove all entries from table
Remove all entries from table
Create a copy of the receiver object.
[use case] Builds a new collection by applying a partial function to all elements of this linked hash map on which the function is defined.
Builds a new collection by applying a partial function to all elements of this linked hash map on which the function is defined.
the element type of the returned collection.
the partial function which filters and maps the linked hash map.
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.
Builds a new collection by applying a partial function to all elements of this linked hash map on which the function is defined.
Builds a new collection by applying a partial function to all elements of this linked 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 LinkedHashMap[A, B] if the elements contained in the resulting collection are
pairs of type (A, B). This is because an implicit of type CanBuildFrom[LinkedHashMap, (A, B), LinkedHashMap[A, B]]
is defined in object LinkedHashMap. 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 linked hash map.
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B. This is usually the canBuildFrom value
defined in object LinkedHashMap.
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.
Finds the first element of the linked hash map for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the linked hash map for which the given partial function is defined, and applies the partial function to it.
the partial function
an option value containing pf applied to the first
value for which it is defined, or None if none exists.
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
The factory companion object that builds instances of class LinkedHashMap.
The factory companion object that builds instances of class LinkedHashMap.
(or its Iterable superclass where class LinkedHashMap is not a Seq.)
Composes two instances of Function1 in a new Function1, with this function applied last.
Composes two instances of Function1 in a new Function1, with this function applied last.
the type to which function g can be applied
a function A => T1
a new function f such that f(x) == apply(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 linked hash map to an array.
Copies elements of this linked hash map to an array.
Fills the given array xs with at most len elements of
this linked hash map, starting at position start.
Copying will stop once either the end of the current linked 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 linked hash map to an array.
Copies elements of this linked hash map to an array.
Fills the given array xs with at most len elements of
this linked hash map, starting at position start.
Copying will stop once either the end of the current linked 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 linked hash map to an array.
Copies values of this linked hash map to an array.
Fills the given array xs with values of this linked hash map.
Copying will stop once either the end of the current linked hash map is reached,
or the end of the array is reached.
the array to fill.
Copies values of this linked hash map to an array.
Copies values of this linked hash map to an array.
Fills the given array xs with values of this linked hash map.
Copying will stop once either the end of the current linked 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 linked hash map to an array.
Copies values of this linked hash map to an array.
Fills the given array xs with values of this linked hash map, beginning at index start.
Copying will stop once either the end of the current linked hash map is reached,
or the end of the array is reached.
the array to fill.
the starting index.
Copies values of this linked hash map to an array.
Copies values of this linked hash map to an array.
Fills the given array xs with values of this linked hash map, beginning at index start.
Copying will stop once either the end of the current linked 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 linked hash map to a buffer.
Copies all elements of this linked hash map to a buffer.
The buffer to which elements are copied.
Counts the number of elements in the linked hash map which satisfy a predicate.
Counts the number of elements in the linked 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.
the number of elements to drop from this linked hash map.
a linked hash map consisting of all elements of this linked hash map except the first n ones, or else the
empty linked hash map, if this linked hash map has less than n elements.
Selects all elements except last n ones.
Selects all elements except last n ones.
The number of elements to take
a linked hash map consisting of all elements of this linked hash map except the last n ones, or else the
empty linked hash map, if this linked 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.
The predicate used to test elements.
the longest suffix of this linked hash map whose first element
does not satisfy the predicate p.
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.
An iterator returning all entries.
An iterator returning all entries.
Tests whether the argument (arg0) is a reference to the receiver object (this).
Tests whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an equivalence relation on
non-null instances of AnyRef, and has three additional properties:
x and y of type AnyRef, multiple invocations of
x.eq(y) consistently returns true or consistently returns false.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).
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 linked hash map.
Tests whether a predicate holds for some of the elements of this linked hash map.
the predicate used to test elements.
true if the given predicate p holds for some of the
elements of this linked hash map, otherwise false.
Selects all elements of this linked hash map which satisfy a predicate.
Selects all elements of this linked hash map which satisfy a predicate.
the predicate used to test elements.
a new linked hash map consisting of all elements of this linked 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.
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize method is invoked, as
well as the interaction between finalize and non-local returns
and exceptions, are all platform dependent.
Finds the first element of the linked hash map satisfying a predicate, if any.
Finds the first element of the linked hash map satisfying a predicate, if any.
the predicate used to test elements.
an option value containing the first element in the linked hash map
that satisfies p, or None if none exists.
Find entry with given key in table, null if not found.
Find entry with given key in table, null if not found.
[use case] Builds a new collection by applying a function to all elements of this linked hash map and concatenating the results.
Builds a new collection by applying a function to all elements of this linked hash map and concatenating the results.
the element type of the returned collection.
the function to apply to each element.
a new collection of type That resulting from applying the given collection-valued function
f to each element of this linked hash map and concatenating the results.
Builds a new collection by applying a function to all elements of this linked hash map and concatenating the results.
Builds a new collection by applying a function to all elements of this linked 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 LinkedHashMap[A, B] if the elements contained in the resulting collection are
pairs of type (A, B). This is because an implicit of type CanBuildFrom[LinkedHashMap, (A, B), LinkedHashMap[A, B]]
is defined in object LinkedHashMap. 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 the new element type B. This is usually the canBuildFrom value
defined in object LinkedHashMap.
a new collection of type That resulting from applying the given collection-valued function
f to each element of this linked hash map and concatenating the results.
[use case] Converts this linked hash map of traversable collections into a linked hash map in which all element collections are concatenated.
Converts this linked hash map of traversable collections into a linked hash map in which all element collections are concatenated.
the type of the elements of each traversable collection.
a new linked hash map resulting from concatenating all element linked hash maps.
Converts this linked hash map of traversable collections into a linked hash map in which all element collections are concatenated.
Converts this linked hash map of traversable collections into a linked 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 linked hash map is a Traversable.
a new linked hash map resulting from concatenating all element linked hash maps.
Folds the elements of this sequence using the specified associative binary operator.
Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.
Note this method has a different signature than the foldLeft
and foldRight methods of the trait Traversable.
The result of folding may only be a supertype of this parallel collection's
type parameter T.
a neutral element for the fold operation, it may be added to the result
an arbitrary number of times, not changing the result (e.g. Nil for list concatenation,
0 for addition, or 1 for multiplication)
a binary operator that must be associative
the result of applying fold operator op between all the elements and z
Applies a binary operator to a start value and all elements of this linked hash map, going left to right.
Applies a binary operator to a start value and all elements of this linked hash map, going left to right.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op between consecutive elements of this linked 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 linked hash map.
Applies a binary operator to all elements of this linked hash map and a start value, going right to left.
Applies a binary operator to all elements of this linked hash map and a start value, going right to left.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op between consecutive elements of this linked 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 linked hash map.
Tests whether a predicate holds for all elements of this linked hash map.
Tests whether a predicate holds for all elements of this linked hash map.
the predicate used to test elements.
true if the given predicate p holds for all elements
of this linked hash map, otherwise false.
[use case] Applies a function f to all elements of this linked hash map.
Applies a function f to all elements of this linked 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 linked hash map.
Applies a function f to all elements of this linked 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 LinkedHashMap at arbitrary element types.
The generic builder that builds instances of LinkedHashMap at arbitrary element types.
Optionally returns the value associated with a key.
Optionally returns the value associated with a key.
the key value
an option value containing the value associated with key in this map,
or None if none exists.
A representation that corresponds to the dynamic class of the receiver object.
A representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
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 linked hash map into a map of linked hash maps according to some discriminator function.
Partitions this linked hash map into a map of linked 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 linked hash map.
the type of keys returned by the discriminator function.
the discriminator function.
A map from keys to linked 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 linked hash map of those elements x
for which f(x) equals k.
Partitions elements in fixed size linked hash maps.
Partitions elements in fixed size linked hash maps.
the number of elements per group
An iterator producing linked hash maps of size size, except the
last will be truncated if the elements don't divide evenly.
Iterator#grouped
Tests whether this linked hash map is known to have a finite size.
Tests whether this linked 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.
The hashCode method for reference types.
Selects the first element of this linked hash map.
Selects the first element of this linked hash map.
the first element of this linked hash map.
Optionally selects the first element.
Optionally selects the first element.
the first element of this linked hash map if it is nonempty, None if it is empty.
Selects all elements except the last.
Selects all elements except the last.
a linked hash map consisting of all elements of this linked hash map except the last one.
Iterates over the inits of this linked hash map.
Iterates over the inits of this linked hash map. The first value will be this
linked hash map and the final one will be an empty linked hash map, with the intervening
values the results of successive applications of init.
an iterator over all the inits of this linked hash map
List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
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.
Test whether the dynamic type of the receiver object is T0.
Test whether the dynamic type of the receiver object is T0.
Note that the result of the test is modulo Scala's erasure semantics.
Therefore the expression 1.isInstanceOf[String] will return false, while the
expression List(1).isInstanceOf[List[String]] will return true.
In the latter example, because the type argument is erased as part of compilation it is
not possible to check whether the contents of the list are of the specified type.
true if the receiver object is an instance of erasure of type T0; false otherwise.
Tests whether this linked hash map can be repeatedly traversed.
Tests whether this linked 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.
an iterator over all keys.
"As of 2.8, keys returns Iterable[A] rather than Iterator[A]."
Creates an iterator for all keys.
Creates an iterator for all keys.
an iterator over all keys.
Selects the last element.
Selects the last element.
The last element of this linked hash map.
Optionally selects the last element.
Optionally selects the last element.
the last element of this linked 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.
Function.unlift
[use case] Builds a new collection by applying a function to all elements of this linked hash map.
Builds a new collection by applying a function to all elements of this linked hash map.
the element type of the returned collection.
the function to apply to each element.
a new collection of type That resulting from applying the given function
f to each element of this linked hash map and collecting the results.
Builds a new collection by applying a function to all elements of this linked hash map.
Builds a new collection by applying a function to all elements of this linked hash map.
the element type of the returned collection.
the class of the returned collection. In the standard library configuration,
That is always LinkedHashMap[A, B] if the elements contained in the resulting collection are
pairs of type (A, B). This is because an implicit of type CanBuildFrom[LinkedHashMap, (A, B), LinkedHashMap[A, B]]
is defined in object LinkedHashMap. 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 the new element type B. This is usually the canBuildFrom value
defined in object LinkedHashMap.
a new collection of type That resulting from applying the given function
f to each element of this linked hash map and collecting the results.
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 linked hash map with respect to the ordering cmp.
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 linked hash map with respect to the ordering cmp.
[use case] Finds the smallest element.
Finds the smallest element.
the smallest element of this linked hash map with respect to the ordering cmp.
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 linked hash map with respect to the ordering cmp.
Displays all elements of this linked hash map in a string.
Displays all elements of this linked hash map in a string.
a string representation of this linked hash map. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this linked hash map follow each other without any
separator string.
Displays all elements of this linked hash map in a string using a separator string.
Displays all elements of this linked hash map in a string using a separator string.
the separator string.
a string representation of this linked hash map. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this linked hash map are separated by the string sep.
List(1, 2, 3).mkString("|") = "1|2|3"
Displays all elements of this linked hash map in a string using start, end, and separator strings.
Displays all elements of this linked 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 linked 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 linked hash map are separated by
the string sep.
List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
Equivalent to !(this eq that).
Equivalent to !(this eq that).
true if the argument is not a reference to the receiver object; false 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 linked hash map is not empty.
Tests whether the linked hash map is not empty.
true if the linked 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.
Returns a parallel implementation of this collection.
Returns a parallel implementation of this collection.
For most collection types, this method creates a new parallel collection by copying
all the elements. For these collection, par takes linear time. Mutable collections
in this category do not produce a mutable parallel collection that has the same
underlying dataset, so changes in one collection will not be reflected in the other one.
Specific collections (e.g. ParArray or mutable.ParHashMap) override this default
behaviour by creating a parallel collection which shares the same underlying dataset.
For these collections, par takes constant or sublinear time.
All parallel collections return a reference to themselves.
a parallel implementation of this collection
The default par implementation uses the combiner provided by this method
to create a new parallel collection.
The default par implementation uses the combiner provided by this method
to create a new parallel collection.
a combiner for the parallel collection of type ParRepr
Partitions this linked hash map in two linked hash maps according to a predicate.
Partitions this linked hash map in two linked hash maps according to a predicate.
the predicate on which to partition.
a pair of linked hash maps: the first linked hash map consists of all elements that
satisfy the predicate p and the second linked hash map consists of all elements
that don't. The relative order of the elements in the resulting linked hash maps
is the same as in the original linked hash map.
[use case] Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the product of all elements of this linked hash map with respect to the * operator in num.
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 linked hash map with respect to the * operator in num.
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.
the key to update
the new value
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.
Reduces the elements of this sequence using the specified associative binary operator.
Reduces the elements of this sequence using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
Note this method has a different signature than the reduceLeft
and reduceRight methods of the trait Traversable.
The result of reducing may only be a supertype of this parallel collection's
type parameter T.
A binary operator that must be associative.
The result of applying reduce operator op between all the elements if the collection is nonempty.
Optionally applies a binary operator to all elements of this linked hash map, going left to right.
Optionally applies a binary operator to all elements of this linked hash map, going left to right.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceLeft(op) is this linked hash map is nonempty,
None otherwise.
Optionally reduces the elements of this sequence using the specified associative binary operator.
Optionally reduces the elements of this sequence using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
Note this method has a different signature than the reduceLeftOption
and reduceRightOption methods of the trait Traversable.
The result of reducing may only be a supertype of this parallel collection's
type parameter T.
A binary operator that must be associative.
An option value containing result of applying reduce operator op between all
the elements if the collection is nonempty, and None otherwise.
Applies a binary operator to all elements of this linked hash map, going right to left.
Applies a binary operator to all elements of this linked hash map, going right to left.
the result type of the binary operator.
the binary operator.
the result of inserting op between consecutive elements of this linked 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 linked hash map.
Optionally applies a binary operator to all elements of this linked hash map, going right to left.
Optionally applies a binary operator to all elements of this linked hash map, going right to left.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceRight(op) is this linked hash map is nonempty,
None otherwise.
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.
the key to be removed
an option value containing the value associated previously with key,
or None if key was not defined in the map before.
Remove entry from table if present.
Remove entry from table if present.
The collection of type linked hash map underlying this TraversableLike object.
The collection of type linked hash map underlying this TraversableLike object.
By default this is implemented as the TraversableLike object itself,
but this can be overridden.
The result when this map is used as a builder
Retains only those mappings for which the predicate
p returns true.
Retains only those mappings for which the predicate
p returns true.
The test predicate
[use case] Checks if the other iterable collection contains the same elements in the same order as this linked hash map.
Checks if the other iterable collection contains the same elements in the same order as this linked hash 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 linked hash map.
Checks if the other iterable collection contains the same elements in the same order as this linked hash map.
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.
Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element z may be applied more than once.
element type of the resulting collection
type of the resulting collection
neutral element for the operator op
the associative operator for the scan
combiner factory which provides a combiner
a new linked hash map containing the prefix scan of the elements in this linked hash map
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.
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B. This is usually the canBuildFrom value
defined in object LinkedHashMap.
collection with intermediate results
Produces a collection containing cummulative results of applying the operator going right to left.
Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.
Example:
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr
and the new element type B. This is usually the canBuildFrom value
defined in object LinkedHashMap.
collection with intermediate results
"This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."
A version of this collection with all of the operations implemented sequentially (i.
A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).
This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.
a sequential view of the collection.
The size of this linked hash map.
The size of this linked hash map.
the number of elements in this linked hash map.
Gives a hint that one expects the result of this builder
to have the same size as the given collection, plus some delta.
Gives a hint that one expects the result of this builder
to have the same size as the given collection, plus some delta. This will
provide a hint only if the collection is known to have a cheap
size method. Currently this is assumed to be the case if and only if
the collection is of type IndexedSeqLike.
Some builder classes
will optimize their representation based on the hint. However,
builder implementations are still required to work correctly even if the hint is
wrong, i.e. a different number of elements is added.
the collection which serves as a hint for the result's size.
a correction to add to the coll.size to produce the size hint.
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.
the hint how many elements will be added.
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.
the hint how many elements will be added.
the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.
The array keeping track of the number of elements in 32 element blocks.
The array keeping track of the number of elements in 32 element blocks.
Selects an interval of elements.
Selects an interval of elements. The returned collection is made up
of all elements x which satisfy the invariant:
from <= indexOf(x) < until
the lowest index to include from this linked hash map.
the highest index to EXCLUDE from this linked hash map.
a linked hash map containing the elements greater than or equal to
index from extending up to (but not including) index until
of this linked hash 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 linked hash maps of size size, except the
last and the only element will be truncated if there are
fewer elements than size.
Iterator#sliding
Splits this linked hash map into a prefix/suffix pair according to a predicate.
Splits this linked 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.
the test predicate
a pair consisting of the longest prefix of this linked hash map whose
elements all satisfy p, and the rest of this linked hash map.
Splits this linked hash map into two at a given position.
Splits this linked 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).
the position at which to split.
a pair of linked hash maps consisting of the first n
elements of this linked hash map, and the other elements.
Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
a string representation which starts the result of toString applied to this linked hash map.
Unless overridden in subclasses, the string prefix of every map is "Map".
[use case] Sums up the elements of this collection.
Sums up the elements of this collection.
the sum of all elements of this linked hash map with respect to the + operator in num.
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 linked hash map with respect to the + operator in num.
The actual hash table.
The actual hash table.
The number of mappings contained in this hash table.
The number of mappings contained in this hash table.
Selects all elements except the first.
Selects all elements except the first.
a linked hash map consisting of all elements of this linked hash map except the first one.
Iterates over the tails of this linked hash map.
Iterates over the tails of this linked hash map. The first value will be this
linked hash map and the final one will be an empty linked hash map, with the intervening
values the results of successive applications of tail.
an iterator over all the tails of this linked hash map
List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
Selects first n elements.
Selects first n elements.
Tt number of elements to take from this linked hash map.
a linked hash map consisting only of the first n elements of this linked hash map,
or else the whole linked hash map, if it has less than n elements.
Selects last n elements.
Selects last n elements.
the number of elements to take
a linked hash map consisting only of the last n elements of this linked hash map, or else the
whole linked hash 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.
The predicate used to test elements.
the longest prefix of this linked hash map whose elements all satisfy
the predicate p.
The underlying collection seen as an instance of LinkedHashMap.
The underlying collection seen as an instance of LinkedHashMap.
By default this is implemented as the current collection object itself,
but this can be overridden.
The next size value at which to resize (capacity * load factor).
The next size value at which to resize (capacity * load factor).
[use case] Converts this linked hash map to an array.
Converts this linked hash map to an array.
an array containing all elements of this linked hash map.
Converts this linked hash map to an array.
Converts this linked hash 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 linked hash map.
Converts this linked hash map to a mutable buffer.
Converts this linked hash map to a mutable buffer.
a buffer containing all elements of this linked hash map.
A conversion from collections of type Repr to LinkedHashMap objects.
A conversion from collections of type Repr to LinkedHashMap objects.
By default this is implemented as just a cast, but this can be overridden.
Converts this linked hash map to an indexed sequence.
Converts this linked hash map to an indexed sequence.
an indexed sequence containing all elements of this linked hash map.
Converts this linked hash map to an iterable collection.
Converts this linked 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).
an Iterable containing all elements of this linked hash map.
Returns an Iterator over the elements in this linked hash map.
Returns an Iterator over the elements in this linked hash map. Will return the same Iterator if this instance is already an Iterator.
an Iterator containing all elements of this linked hash map.
Converts this linked hash map to a list.
Converts this linked hash map to a list.
a list containing all elements of this linked hash map.
[use case] Converts this linked hash map to a map.
Converts this linked hash map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
a map containing all elements of this linked hash map.
Converts this linked hash map to a map.
Converts this linked hash map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
a map containing all elements of this linked hash map.
Overridden for efficiency.
Overridden for efficiency.
a sequence containing all elements of this linked hash map.
Converts this linked hash map to a set.
Converts this linked hash map to a set.
a set containing all elements of this linked hash map.
Converts this linked hash map to a stream.
Converts this linked hash map to a stream.
a stream containing all elements of this linked hash map.
Converts this linked hash map to a string.
Converts this linked hash map to a string.
a string representation of this collection. By default this
string consists of the stringPrefix of this linked hash map,
followed by all elements separated by commas and enclosed in parentheses.
Converts this linked hash map to an unspecified Traversable.
Converts this linked hash map to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
a Traversable containing all elements of this linked hash map.
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.
the transformation to apply
the map itself.
Transposes this linked hash map of traversable collections into a linked hash map of linked hash maps.
Transposes this linked hash map of traversable collections into a linked hash map of linked hash maps.
the type of the elements of each traversable collection.
an implicit conversion which asserts that the
element type of this linked hash map is a Traversable.
a two-dimensional linked hash map of linked hash maps which has as nth row the nth column of this linked hash map.
Converts this linked hash map of pairs into two collections of the first and second half of each pair.
Converts this linked hash map of pairs into two collections of the first and second half of each pair.
an implicit conversion which asserts that the element type of this linked hash map is a pair.
a pair linked hash maps, containing the first, respectively second half of each element pair of this linked hash map.
Converts this linked hash map of triples into three collections of the first, second, and third element of each triple.
Converts this linked hash map of triples into three collections of the first, second, and third element of each triple.
a triple linked hash maps, containing the first, second, respectively third member of each element triple of this linked hash map.
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 to update
The new value
Creates a new map consisting of all key/value pairs of the current map plus a new pair of a given key and value.
Collects all values of this map in an iterable collection.
Collects all values of this map in an iterable collection.
the values of this map as an iterable.
"As of 2.8, values returns Iterable[B] rather than Iterator[B]."
Creates an iterator for all values in this map.
Creates an iterator for all values in this map.
an iterator over all values that are associated with some key in this map.
Creates a non-strict view of a slice of this linked hash map.
Creates a non-strict view of a slice of this linked hash map.
Note: the difference between view and slice is that view produces
a view of the current linked hash map, whereas slice produces a new linked hash map.
Note: view(from, to) is equivalent to view.slice(from, to)
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 linked hash map, starting at index from
and extending up to (but not including) index until.
Creates a non-strict view of this linked hash map.
Creates a non-strict view of this linked hash map.
a non-strict view of this linked hash map.
The same map with a given default function.
The same map with a given default function.
Invoking transformer methods (e.g. map) will not preserve the default value.
the function mapping keys to values, used for non-present keys
a wrapper of the map with a default value
The same map with a given default value.
The same map with a given default value.
Invoking transformer methods (e.g. map) will not preserve the default value.
the function mapping keys to values, used for non-present keys
a wrapper of the map with a default value
Creates a non-strict filter of this linked hash map.
Creates a non-strict filter of this linked 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.
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 linked hash map which
satisfy the predicate p.
[use case] Returns a linked hash map formed from this linked hash map and another iterable collection by combining corresponding elements in pairs.
Returns a linked hash map formed from this linked 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
a new collection of type That containing pairs consisting of
corresponding elements of this linked hash map and that. The length
of the returned collection is the minimum of the lengths of this linked hash map and that.
Returns a linked hash map formed from this linked hash map and another iterable collection by combining corresponding elements in pairs.
Returns a linked hash map formed from this linked 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.
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 linked hash map and that. The length
of the returned collection is the minimum of the lengths of this linked hash map and that.
[use case] Returns a linked hash map formed from this linked hash map and another iterable collection by combining corresponding elements in pairs.
Returns a linked hash map formed from this linked 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.
the iterable providing the second half of each result pair
the element to be used to fill up the result if this linked hash map is shorter than that.
the element to be used to fill up the result if that is shorter than this linked hash map.
a new collection of type That containing pairs consisting of
corresponding elements of this linked hash map and that. The length
of the returned collection is the maximum of the lengths of this linked hash map and that.
If this linked hash map is shorter than that, thisElem values are used to pad the result.
If that is shorter than this linked hash map, thatElem values are used to pad the result.
Returns a linked hash map formed from this linked hash map and another iterable collection by combining corresponding elements in pairs.
Returns a linked hash map formed from this linked 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.
the iterable providing the second half of each result pair
the element to be used to fill up the result if this linked hash map is shorter than that.
the element to be used to fill up the result if that is shorter than this linked hash map.
a new collection of type That containing pairs consisting of
corresponding elements of this linked hash map and that. The length
of the returned collection is the maximum of the lengths of this linked hash map and that.
If this linked hash map is shorter than that, thisElem values are used to pad the result.
If that is shorter than this linked hash map, thatElem values are used to pad the result.
[use case] Zips this linked hash map with its indices.
Zips this linked hash map with its indices.
A new collection of type That containing pairs consisting of all elements of this
linked hash map paired with their index. Indices start at 0.
Zips this linked hash map with its indices.
Zips this linked hash map with its indices.
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
linked hash map paired with their index. Indices start at 0.
use iterator' instead
An iterator returning all entries
An iterator returning all entries
use entriesIterator instead
use head' instead
None if iterable is empty.
None if iterable is empty.
use headOption' instead
use mapValues' instead
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.
use view' instead
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.
the key to be removed
Use remove' instead
This class implements mutable maps using a hashtable. The iterator and all traversal methods of this class visit elements in the order they were inserted.
the type of the keys contained in this hash map.
the type of the values assigned to keys in this hash map.