A class supporting filtered operations.
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 a new key/value mapping 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.
[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.
adds all elements produced by a TraversableOnce to this linked hash map.
Adds a new key/value pair to this map.
adds two or more elements to this linked hash map.
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 the key/value mapping with the specified key.
Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of those provided by the specified traversable object.
Removes all elements produced by an iterator from this linked hash map.
Removes a key from this map.
Removes two or more elements from this linked hash map.
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 all elements of this linked hash map and a start value, going right to left.
Appends all bindings of this map to a string builder using start, end, and separator strings.
Appends all elements of this linked hash map to a string builder.
Appends all elements of this linked hash map to a string builder using a separator string.
Composes this partial function with a transformation function that gets applied to results of this partial function.
Retrieves the value which is associated with the given key.
Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
Removes all bindings from the map.
This method creates and returns a copy of the receiver object.
[use case] Builds a new collection by applying a partial function to all elements of this 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 factory companion object that builds instances of class LinkedHashMap.
(f compose g)(x) == f(g(x))
Tests whether this map contains a binding for a key.
[use case] Copies elements of this linked hash map to an array.
Copies elements of this linked hash map to an array.
[use case] Copies values of this linked hash map to an array.
Copies values of this linked hash map to an array.
[use case] Copies values of this linked hash map to an array.
Copies values of this linked hash map to an array.
Copies all elements of this linked hash map to a buffer.
Counts the number of elements in the linked hash map which satisfy a predicate.
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 last n ones.
Drops longest prefix of elements that satisfy a predicate.
The empty map of the same type as this map
Compares two maps structurally; i.
Tests whether a predicate holds for some of the elements of this linked hash map.
Selects all elements of this linked hash map which satisfy a predicate.
Filters this map by retaining only keys satisfying a predicate.
Returns a new map with all key/value pairs for which the predicate
p
returns true
.
Finds the first element of the linked hash map satisfying a predicate, if any.
None
if iterable is empty.
[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.
[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.
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 all elements of this linked hash map and a start value, going right to left.
Tests whether a predicate holds for all elements of this linked hash map.
[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 generic builder that builds instances of LinkedHashMap at arbitrary element types.
Optionally returns the value associated with a key.
[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.
If given key is already in this map, returns associated value.
Partitions this linked hash map into a map of linked hash maps according to some discriminator function.
Partitions elements in fixed size linked hash maps.
Tests whether this linked hash map is known to have a finite size.
Returns a hash code value for the object.
Selects the first element of this linked hash map.
Optionally selects the first element.
Selects all elements except the last.
Tests whether this map contains a binding for a key.
Tests whether the map is empty.
Tests whether this linked hash map can be repeatedly traversed.
Creates a new iterator over all key/value pairs of this map
Collects all keys of this map in a set.
Creates an iterator for all keys.
Creates an iterator for all keys.
Selects the last element.
Optionally selects the last element.
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 linked hash map.
Builds a new collection by applying a function to all elements of this linked hash map.
Creates a new builder by applying a transformation function to the results of this builder.
Transforms this map by applying a function to every retrieved value.
[use case] Finds the largest element.
Finds the largest element.
[use case] Finds the smallest element.
Finds the smallest element.
Displays all elements of this linked hash map in a 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 start, end, and separator strings.
Tests whether the linked hash map is not empty.
Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.
Partitions this linked hash map in two linked hash maps according to a predicate.
[use case] Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
returns a projection that can be used to call non-strict filter
,map
, and flatMap
methods that build projections
of the collection.
Adds a new key/value pair to this map and optionally returns previously bound value.
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.
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.
Removes a key from this map, returning the value associated previously with that key as an option.
If given key is defined in this map, remove it and return associated value as an Option.
The collection of type linked hash map underlying this TraversableLike
object.
The result when this map is used as a builder
Retains only those mappings for which the predicate
p
returns true
.
[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.
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 right to left.
The size of 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 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, together with an upper bound
given by the size of some other collection.
Selects an interval of elements.
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.
Splits this linked hash map into a prefix/suffix pair according to a predicate.
Splits this linked hash map into two at a given position.
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.
Selects all elements except the first.
Selects first n elements.
Selects last n elements.
Takes longest prefix of elements that satisfy a predicate.
[use case] Converts this linked hash map to an array.
Converts this linked hash map to an array.
Converts this linked hash map to a mutable buffer.
Converts this linked hash map to an indexed sequence.
Converts this linked hash map to an iterable collection.
Returns an Iterator over the elements in this linked hash map.
Converts this linked hash map to a list.
Converts this linked hash map to a map.
Converts this linked hash map to a sequence.
Converts this linked hash map to a set.
Converts this linked hash map to a stream.
Converts this linked hash map to a string.
Converts this linked hash map to an unspecified Traversable.
Applies a transformation function to all values contained in this map.
Transposes this linked hash map of traversable collections into a linked hash map of linked hash maps.
Converts this linked hash map of pairs into two collections of the first and second halfs of each pair.
Adds a new key/value pair to this map.
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.
Creates an iterator for all values in this map.
Creates a non-strict view of a slice of this linked hash map.
Creates a non-strict view of this linked hash map.
Creates a non-strict filter of this linked hash map.
[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.
[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.
[use case] Zips this linked hash map with its indices.
Zips this linked hash map with its indices.
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.