Packages

class LinkedHashMap[K, V] extends AbstractMap[K, V] with SeqMap[K, V] with MapOps[K, V, LinkedHashMap, LinkedHashMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, LinkedHashMap[K, V]] with StrictOptimizedMapOps[K, V, LinkedHashMap, LinkedHashMap[K, V]] with MapFactoryDefaults[K, V, LinkedHashMap, Iterable] with DefaultSerializable

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.

K

the type of the keys contained in this hash map.

V

the type of the values assigned to keys in this hash map.

Source
LinkedHashMap.scala
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinkedHashMap
  2. DefaultSerializable
  3. Serializable
  4. StrictOptimizedMapOps
  5. StrictOptimizedIterableOps
  6. SeqMap
  7. SeqMap
  8. AbstractMap
  9. Map
  10. MapOps
  11. Shrinkable
  12. Builder
  13. Growable
  14. Clearable
  15. Cloneable
  16. Cloneable
  17. Iterable
  18. AbstractMap
  19. Map
  20. Equals
  21. MapFactoryDefaults
  22. MapOps
  23. PartialFunction
  24. Function1
  25. AbstractIterable
  26. Iterable
  27. IterableFactoryDefaults
  28. IterableOps
  29. IterableOnceOps
  30. IterableOnce
  31. AnyRef
  32. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new LinkedHashMap()

Type Members

  1. trait GenKeySet extends AnyRef

    A generic trait that is reused by keyset implementations

    A generic trait that is reused by keyset implementations

    Attributes
    protected
    Definition Classes
    MapOps
  2. class KeySet extends AbstractSet[K] with GenKeySet with DefaultSerializable

    The implementation class of the set returned by keySet.

    The implementation class of the set returned by keySet.

    Attributes
    protected
    Definition Classes
    MapOps
  3. class LinkedKeySet extends KeySet
    Attributes
    protected

Value Members

  1. final def !=(arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    AnyRef → Any
  2. final def ##: Int

    Equivalent to x.hashCode except for boxed numeric types and null.

    Equivalent to x.hashCode except for boxed numeric types and null. 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. For null returns a hashcode where null.hashCode throws a NullPointerException.

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  3. def ++[V2 >: V](xs: IterableOnce[(K, V2)]): LinkedHashMap[K, V2]

    Alias for concat

    Alias for concat

    Definition Classes
    MapOps
  4. final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. final def ++=(xs: IterableOnce[(K, V)]): LinkedHashMap.this.type

    Alias for addAll

    Alias for addAll

    Definition Classes
    Growable
    Annotations
    @inline()
  6. final def +=(elem: (K, V)): LinkedHashMap.this.type

    Alias for addOne

    Alias for addOne

    Definition Classes
    Growable
    Annotations
    @inline()
  7. final def --=(xs: IterableOnce[K]): LinkedHashMap.this.type

    Alias for subtractAll

    Alias for subtractAll

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  8. final def -=(elem: K): LinkedHashMap.this.type

    Alias for subtractOne

    Alias for subtractOne

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  9. def ->[B](y: B): (LinkedHashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toArrowAssoc[LinkedHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if V is a subclass of Option[Nothing] (V <: Option[Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  10. final def ==(arg0: Any): Boolean

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

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

    Definition Classes
    AnyRef → Any
  11. def addAll(xs: IterableOnce[(K, V)]): LinkedHashMap.this.type

    Adds all elements produced by an IterableOnce to this linked hash map.

    Adds all elements produced by an IterableOnce to this linked hash map.

    xs

    the IterableOnce producing the elements to add.

    returns

    the linked hash map itself.

    Definition Classes
    Growable
  12. def addOne(kv: (K, V)): LinkedHashMap.this.type

    Adds a single element to this linked hash map.

    Adds a single element to this linked hash map.

    returns

    the linked hash map itself

    Definition Classes
    LinkedHashMapGrowable
  13. def addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

    Appends all elements of this linked hash 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 (w.r.t. the method toString) of all elements of this linked hash map are separated by the string sep.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b , "List(" , ", " , ")")
    res5: StringBuilder = List(1, 2, 3, 4)
    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    MapOpsIterableOnceOps
  14. final def addString(b: StringBuilder): StringBuilder

    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.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    h: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  15. final def addString(b: StringBuilder, sep: String): StringBuilder

    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.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  16. def andThen[C](k: PartialFunction[V, C]): PartialFunction[K, C]

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

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

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. It is highly recommended to call applyOrElse instead of isDefinedAt / apply for efficiency.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of this partial function narrowed by other partial function, which maps arguments x to k(this(x)).

    Definition Classes
    PartialFunction
  17. def andThen[C](k: (V) => C): PartialFunction[K, C]

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

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

    If the runtime type of the function is a PartialFunction then the other andThen method is used (note its cautions).

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of this partial function, possibly narrowed by the specified function, which maps arguments x to k(this(x)).

    Definition Classes
    PartialFunctionFunction1
  18. def apply(key: K): V

    Retrieves the value which is associated with the given key.

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

    key

    the key

    returns

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

    Definition Classes
    MapOpsFunction1
    Annotations
    @throws(cause = scala.this.throws.<init>$default$1[NoSuchElementException])
  19. def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) => V1): V1

    Applies this partial function to the given argument when it is contained in the function domain.

    Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.

    Note that expression pf.applyOrElse(x, default) is equivalent to

    if(pf isDefinedAt x) pf(x) else default(x)

    except that applyOrElse method can be implemented more efficiently. For all partial function literals the compiler generates an applyOrElse implementation which avoids double evaluation of pattern matchers and guards. This makes applyOrElse the basis for the efficient implementation for many operations and scenarios, such as:

    • combining partial functions into orElse/andThen chains does not lead to excessive apply/isDefinedAt evaluation
    • lift and unlift do not evaluate source functions twice on each invocation
    • runWith allows efficient imperative-style combining of partial functions with conditionally applied actions

    For non-literal partial function classes with nontrivial isDefinedAt method it is recommended to override applyOrElse with custom implementation that avoids double isDefinedAt evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.

    x

    the function argument

    default

    the fallback function

    returns

    the result of this function or fallback function application.

    Definition Classes
    MapOpsPartialFunction
  20. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown

    ClassCastException if the receiver object is not an instance of the erasure of type T0.

  21. def canEqual(that: Any): Boolean

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass.

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

    that

    the value being probed for possible equality

    returns

    true if this instance can possibly equal that, otherwise false

    Definition Classes
    MapEquals
  22. def className: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for ListMap this method should return "ListMap", not "Map" (the supertype) or "Node" (an implementation subclass).

    The default implementation returns "Iterable". It is overridden for the basic collection kinds "Seq", "IndexedSeq", "LinearSeq", "Buffer", "Set", "Map", "SortedSet", "SortedMap" and "View".

    returns

    a string representation which starts the result of toString applied to this linked hash map. By default the string prefix is the simple name of the collection class linked hash map.

    Attributes
    protected[this]
    Definition Classes
    Iterable
  23. def clear(): Unit

    Clears the contents of this builder.

    Clears the contents of this builder. After execution of this method the builder will contain no elements.

    Definition Classes
    LinkedHashMapMapOpsBuilderClearable
  24. def clone(): LinkedHashMap[K, V]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Definition Classes
    MapOpsCloneable → AnyRef
    Note

    not specified by SLS as a member of AnyRef

  25. final def coll: LinkedHashMap.this.type

    returns

    This collection as a C.

    Attributes
    protected
    Definition Classes
    IterableIterableOps
  26. def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): LinkedHashMap[K2, V2]

    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.

    K2

    the key type of the returned linked hash map.

    V2

    the value type of the returned linked hash map.

    pf

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

    returns

    a new linked hash map resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    StrictOptimizedMapOpsMapOps
  27. def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]

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

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

    B

    the element type of the returned linked hash map.

    pf

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

    returns

    a new linked hash map resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  28. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

    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.

    pf

    the partial function

    returns

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

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

  29. def compose[R](k: PartialFunction[R, K]): PartialFunction[R, V]

    Composes another partial function k with this partial function so that this partial function gets applied to results of k.

    Composes another partial function k with this partial function so that this partial function gets applied to results of k.

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. It is highly recommended to call applyOrElse instead of isDefinedAt / apply for efficiency.

    R

    the parameter type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of other partial function narrowed by this partial function, which maps arguments x to this(k(x)).

    Definition Classes
    PartialFunction
  30. def compose[A](g: (A) => K): (A) => V

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

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

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

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

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. def concat[V2 >: V](suffix: IterableOnce[(K, V2)]): LinkedHashMap[K, V2]

    Returns a new linked hash map containing the elements from the left hand operand followed by the elements from the right hand operand.

    Returns a new linked hash map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the linked hash map is the most specific superclass encompassing the element types of the two operands.

    suffix

    the traversable to append.

    returns

    a new linked hash map which contains all elements of this linked hash map followed by all elements of suffix.

    Definition Classes
    StrictOptimizedMapOpsMapOps
  32. def concat[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]

    Returns a new linked hash map containing the elements from the left hand operand followed by the elements from the right hand operand.

    Returns a new linked hash map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the linked hash map is the most specific superclass encompassing the element types of the two operands.

    B

    the element type of the returned collection.

    suffix

    the traversable to append.

    returns

    a new linked hash map which contains all elements of this linked hash map followed by all elements of suffix.

    Definition Classes
    IterableOps
  33. def contains(key: K): Boolean

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key.

    key

    the key

    returns

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

    Definition Classes
    LinkedHashMapMapOps
  34. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with at most len elements of this linked hash map.

    Copying will stop once either all the elements of this linked hash map have been copied, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index of xs.

    len

    the maximal number of elements to copy.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

  35. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with values of this linked hash map.

    Copying will stop once either all the elements of this linked hash map have been copied, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index of xs.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

  36. def copyToArray[B >: (K, V)](xs: Array[B]): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with values of this linked hash map.

    Copying will stop once either all the elements of this linked hash map have been copied, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

  37. def corresponds[B](that: IterableOnce[B])(p: ((K, V), B) => Boolean): Boolean

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    B

    the type of the elements of that

    that

    the other collection

    p

    the test predicate, which relates elements from both collections

    returns

    true if both collections have the same length and p(x, y) is true for all corresponding elements x of this iterator and y of that, otherwise false

    Definition Classes
    IterableOnceOps
  38. def count(p: ((K, V)) => Boolean): Int

    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.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOnceOps
  39. def default(key: K): V

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

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

    key

    the given key value for which a binding is missing.

    Definition Classes
    MapOps
    Annotations
    @throws(cause = scala.this.throws.<init>$default$1[NoSuchElementException])
    Exceptions thrown
  40. def drop(n: Int): LinkedHashMap[K, V]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

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

    returns

    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. If n is negative, don't drop any elements.

    Definition Classes
    IterableOpsIterableOnceOps
  41. def dropRight(n: Int): LinkedHashMap[K, V]

    The rest of the collection without its n last elements.

    The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    n

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

    returns

    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. If n is negative, don't drop any elements.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  42. def dropWhile(p: ((K, V)) => Boolean): LinkedHashMap[K, V]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
  43. def elementWise: ElementWiseExtractor[K, V]

    Returns an extractor object with a unapplySeq method, which extracts each element of a sequence data.

    Returns an extractor object with a unapplySeq method, which extracts each element of a sequence data.

    Definition Classes
    PartialFunction
    Example:
    1. val firstChar: String => Option[Char] = _.headOption
      
      Seq("foo", "bar", "baz") match {
        case firstChar.unlift.elementWise(c0, c1, c2) =>
          println(s"$c0, $c1, $c2") // Output: f, b, b
      }
  44. def empty: LinkedHashMap[K, V]

    The empty iterable of the same type as this iterable

    The empty iterable of the same type as this iterable

    returns

    an empty iterable of type C.

    Definition Classes
    MapFactoryDefaultsIterableOps
  45. def ensuring(cond: (LinkedHashMap[K, V]) => Boolean, msg: => Any): LinkedHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toEnsuring[LinkedHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: (LinkedHashMap[K, V]) => Boolean): LinkedHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toEnsuring[LinkedHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. def ensuring(cond: Boolean, msg: => Any): LinkedHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toEnsuring[LinkedHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. def ensuring(cond: Boolean): LinkedHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toEnsuring[LinkedHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  49. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Definition Classes
    AnyRef
  50. def equals(o: Any): Boolean

    The universal equality method defined in AnyRef.

    The universal equality method defined in AnyRef.

    Definition Classes
    MapEquals → AnyRef → Any
  51. def exists(p: ((K, V)) => Boolean): Boolean

    Tests whether a predicate holds for at least one element of this linked hash map.

    Tests whether a predicate holds for at least one element of this linked hash map.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p is satisfied by at least one element of this linked hash map, otherwise false

    Definition Classes
    IterableOnceOps
  52. def filter(pred: ((K, V)) => Boolean): LinkedHashMap[K, V]

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

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

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  53. def filterImpl(pred: ((K, V)) => Boolean, isFlipped: Boolean): LinkedHashMap[K, V]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  54. def filterInPlace(p: (K, V) => Boolean): LinkedHashMap.this.type

    Retains only those mappings for which the predicate p returns true.

    Retains only those mappings for which the predicate p returns true.

    p

    The test predicate

    Definition Classes
    MapOps
  55. def filterNot(pred: ((K, V)) => Boolean): LinkedHashMap[K, V]

    Selects all elements of this linked hash map which do not satisfy a predicate.

    Selects all elements of this linked hash map which do not satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

    a new linked hash map consisting of all elements of this linked hash map that do not satisfy the given predicate pred. Their order may not be preserved.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  56. def finalize(): Unit

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

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

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

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
    Note

    not specified by SLS as a member of AnyRef

  57. def find(p: ((K, V)) => Boolean): Option[(K, V)]

    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.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the linked hash map that satisfies p, or None if none exists.

    Definition Classes
    IterableOnceOps
  58. var firstEntry: Entry
    Attributes
    protected
  59. def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): LinkedHashMap[K2, V2]

    Builds a new map by applying a function to all elements of this linked hash map and using the elements of the resulting collections.

    Builds a new map by applying a function to all elements of this linked hash map and using the elements of the resulting collections.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedMapOpsMapOps
  60. def flatMap[B](f: ((K, V)) => IterableOnce[B]): Iterable[B]

    Builds a new linked hash map by applying a function to all elements of this linked hash map and using the elements of the resulting collections.

    Builds a new linked hash map by applying a function to all elements of this linked hash map and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of linked hash map. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  61. def flatten[B](implicit toIterableOnce: ((K, V)) => IterableOnce[B]): Iterable[B]

    Converts this linked hash map of traversable collections into a linked hash map formed by the elements of these traversable collections.

    Converts this linked hash map of traversable collections into a linked hash map formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the type of linked hash map. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(1, 2, 3)
             ).flatten
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(
               List(1, 2, 3),
               List(3, 2, 1)
             ).flatten
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  62. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1

    Folds the elements of this linked hash map using the specified associative binary operator.

    Folds the elements of this linked hash map using the specified associative binary operator. The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.

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

    A1

    a type parameter for the binary operator, a supertype of A.

    z

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

    op

    a binary operator that must be associative.

    returns

    the result of applying the fold operator op between all the elements and z, or z if this linked hash map is empty.

    Definition Classes
    IterableOnceOps
  63. def foldLeft[B](z: B)(op: (B, (K, V)) => B): B

    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.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash map, going left to right with the start value z on the left: op(...op(z, x1), x2, ..., xn) where x1, ..., xn are the elements of this linked hash map. Returns z if this linked hash map is empty.

    Definition Classes
    IterableOnceOps
  64. def foldRight[B](z: B)(op: ((K, V), B) => B): B

    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.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash map, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x1, ..., xn are the elements of this linked hash map. Returns z if this linked hash map is empty.

    Definition Classes
    IterableOnceOps
  65. def forall(p: ((K, V)) => Boolean): Boolean

    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.

    p

    the predicate used to test elements.

    returns

    true if this linked hash map is empty or the given predicate p holds for all elements of this linked hash map, otherwise false.

    Definition Classes
    IterableOnceOps
  66. def foreach[U](f: ((K, V)) => U): Unit

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
    LinkedHashMapIterableOnceOps
  67. def foreachEntry[U](f: (K, V) => U): Unit

    Apply f to each key/value pair for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply f to each key/value pair for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
    LinkedHashMapMapOps
  68. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toStringFormat[LinkedHashMap[K, V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  69. def fromSpecific(coll: IterableOnce[(K, V)]): LinkedHashMap[K, V]

    Defines how to turn a given Iterable[A] into a collection of type C.

    Defines how to turn a given Iterable[A] into a collection of type C.

    This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.

    Attributes
    protected
    Definition Classes
    MapFactoryDefaultsIterableOps
    Note

    When implementing a custom collection type and refining C to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where C =:= CC[A], this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

    ,

    As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as it is called with an Iterable[A] obtained from this collection (as it is the case in the implementations of operations where we use a View[A]), it is safe.

  70. def get(key: K): Option[V]

    Optionally returns the value associated with a key.

    Optionally returns the value associated with a key.

    key

    the key value

    returns

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

    Definition Classes
    LinkedHashMapMapOps
  71. final def getClass(): Class[_ <: AnyRef]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  72. def getOrElse[V1 >: V](key: K, default: => V1): V1

    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.

    V1

    the result type of the default computation.

    key

    the key.

    default

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

    returns

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

    Definition Classes
    MapOps
  73. def getOrElseUpdate(key: K, op: => V): V

    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.

    Concurrent map implementations may evaluate the expression op multiple times, or may evaluate op without inserting the result.

    key

    the key to test

    op

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

    returns

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

    Definition Classes
    MapOps
  74. def groupBy[K](f: ((K, V)) => K): immutable.Map[K, LinkedHashMap[K, V]]

    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: Even when applied to a view or a lazy collection it will always force the elements.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    (xs groupBy 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.

    Definition Classes
    IterableOps
  75. def groupMap[K, B](key: ((K, V)) => K)(f: ((K, V)) => B): immutable.Map[K, Iterable[B]]

    Partitions this linked hash map into a map of linked hash maps according to a discriminator function key.

    Partitions this linked hash map into a map of linked hash maps according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

    It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.

    case class User(name: String, age: Int)
    
    def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
      users.groupMap(_.age)(_.name)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    K

    the type of keys returned by the discriminator function

    B

    the type of values returned by the transformation function

    key

    the discriminator function

    f

    the element transformation function

    Definition Classes
    IterableOps
  76. def groupMapReduce[K, B](key: ((K, V)) => K)(f: ((K, V)) => B)(reduce: (B, B) => B): immutable.Map[K, B]

    Partitions this linked hash map into a map according to a discriminator function key.

    Partitions this linked hash map into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the f function and then reduced into a single value with the reduce function.

    It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.

    def occurrences[A](as: Seq[A]): Map[A, Int] =
      as.groupMapReduce(identity)(_ => 1)(_ + _)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
    IterableOps
  77. def grouped(size: Int): Iterator[LinkedHashMap[K, V]]

    Partitions elements in fixed size linked hash maps.

    Partitions elements in fixed size linked hash maps.

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableOps
    See also

    scala.collection.Iterator, method grouped

  78. def hashCode(): Int

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    Map → AnyRef → Any
  79. def head: (K, V)

    Selects the first element of this linked hash map.

    Selects the first element of this linked hash map.

    returns

    the first element of this linked hash map.

    Definition Classes
    LinkedHashMapIterableOps
    Exceptions thrown

    NoSuchElementException if the linked hash map is empty.

  80. def headOption: Option[(K, V)]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    Definition Classes
    LinkedHashMapIterableOps
  81. def init: LinkedHashMap[K, V]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
    IterableOps
  82. def inits: Iterator[LinkedHashMap[K, V]]

    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.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

    an iterator over all the inits of this linked hash map

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

  83. def isDefinedAt(key: K): Boolean

    Tests whether this map contains a binding for a key.

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

    key

    the key

    returns

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

    Definition Classes
    MapOpsPartialFunction
  84. def isEmpty: Boolean

    Tests whether the linked hash map is empty.

    Tests whether the linked hash map is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.

    returns

    true if the linked hash map contains no elements, false otherwise.

    Definition Classes
    LinkedHashMapIterableOnceOps
  85. final def isInstanceOf[T0]: Boolean

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

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

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

    returns

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

    Definition Classes
    Any
  86. def isTraversableAgain: Boolean

    Tests whether this linked hash map can be repeatedly traversed.

    Tests whether this linked hash map can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.

    returns

    true if it is repeatedly traversable, false otherwise.

    Definition Classes
    IterableOpsIterableOnceOps
  87. def iterableFactory: IterableFactory[Iterable]

    The companion object of this linked hash map, providing various factory methods.

    The companion object of this linked hash map, providing various factory methods.

    Definition Classes
    IterableIterableIterableOps
    Note

    When implementing a custom collection type and refining CC to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

  88. def iterator: Iterator[(K, V)]

    Iterator can be used only once

    Iterator can be used only once

    Definition Classes
    LinkedHashMapIterableOnce
  89. def keySet: collection.Set[K]

    Collects all keys of this map in a set.

    Collects all keys of this map in a set.

    returns

    a set containing all keys of this map.

    Definition Classes
    LinkedHashMapMapOps
  90. def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S

    Returns a Stepper for the keys of this map.

    Returns a Stepper for the keys of this map. See method stepper.

    Definition Classes
    MapOps
  91. def keys: collection.Iterable[K]

    Collects all keys of this map in an iterable collection.

    Collects all keys of this map in an iterable collection.

    returns

    the keys of this map as an iterable.

    Definition Classes
    MapOps
  92. def keysIterator: Iterator[K]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    LinkedHashMapMapOps
  93. def knownSize: Int

    returns

    The number of elements in the collection under construction, if it can be cheaply computed, -1 otherwise. The default implementation always returns -1.

    Definition Classes
    LinkedHashMapMapOpsGrowableIterableOnce
  94. def last: (K, V)

    Selects the last element.

    Selects the last element.

    returns

    The last element of this linked hash map.

    Definition Classes
    LinkedHashMapIterableOps
    Exceptions thrown

    NoSuchElementException If the linked hash map is empty.

  95. var lastEntry: Entry
    Attributes
    protected
  96. def lastOption: Option[(K, V)]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    Definition Classes
    LinkedHashMapIterableOps
  97. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, LinkedHashMap.this.type]

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

    val xs = List(1, 2, 3)
    val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
    // res == List(4, 8, 12)
    B

    the type of the second element in each eventual pair

    that

    the iterable providing the second element of each eventual pair

    returns

    a decorator LazyZip2 that allows strict operations to be performed on the lazily evaluated pairs or chained calls to lazyZip. Implicit conversion to Iterable[(A, B)] is also supported.

    Definition Classes
    Iterable
  98. def lift: (K) => Option[V]

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

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

    returns

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

    Definition Classes
    PartialFunction
    See also

    Function.unlift

  99. def map[K2, V2](f: ((K, V)) => (K2, V2)): LinkedHashMap[K2, V2]

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

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

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedMapOpsMapOps
  100. def map[B](f: ((K, V)) => B): Iterable[B]

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

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

    B

    the element type of the returned linked hash map.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  101. def mapFactory: MapFactory[LinkedHashMap]

    The companion object of this map, providing various factory methods.

    The companion object of this map, providing various factory methods.

    Definition Classes
    LinkedHashMapSeqMapSeqMapMapMapMapOps
    Note

    When implementing a custom collection type and refining CC to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

  102. final def mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): LinkedHashMap[K2, V2]

    Similar to fromIterable, but returns a Map collection type.

    Similar to fromIterable, but returns a Map collection type. Note that the return type is now CC[K2, V2].

    Attributes
    protected
    Definition Classes
    MapOps
    Annotations
    @inline()
  103. def mapResult[NewTo](f: (LinkedHashMap[K, V]) => NewTo): Builder[(K, V), NewTo]

    A builder resulting from this builder my mapping the result using f.

    A builder resulting from this builder my mapping the result using f.

    Definition Classes
    Builder
  104. def mapValuesInPlace(f: (K, V) => V): LinkedHashMap.this.type

    Applies a transformation function to all values contained in this map.

    Applies a transformation function to all values contained in this map. The transformation function produces new values from existing keys associated values.

    f

    the transformation to apply

    returns

    the map itself.

    Definition Classes
    MapOps
  105. def max[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    the largest element of this linked hash map with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this linked hash map is empty.

  106. def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)

    Finds the first element which yields the largest value measured by function f.

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    cmp

    An ordering to be used for comparing elements.

    returns

    the first element of this linked hash map with the largest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this linked hash map is empty.

  107. def maxByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]

    Finds the first element which yields the largest value measured by function f.

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    cmp

    An ordering to be used for comparing elements.

    returns

    an option value containing the first element of this linked hash map with the largest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
  108. def maxOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    an option value containing the largest element of this linked hash map with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  109. def min[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    the smallest element of this linked hash map with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this linked hash map is empty.

  110. def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)

    Finds the first element which yields the smallest value measured by function f.

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    cmp

    An ordering to be used for comparing elements.

    returns

    the first element of this linked hash map with the smallest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this linked hash map is empty.

  111. def minByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]

    Finds the first element which yields the smallest value measured by function f.

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    cmp

    An ordering to be used for comparing elements.

    returns

    an option value containing the first element of this linked hash map with the smallest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
  112. def minOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    an option value containing the smallest element of this linked hash map with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  113. final def mkString: String

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

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

    Delegates to addString, which can be overridden.

    returns

    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.

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  114. final def mkString(sep: String): 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.

    Delegates to addString, which can be overridden.

    sep

    the separator string.

    returns

    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.

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  115. final def mkString(start: String, sep: String, end: String): String

    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.

    Delegates to addString, which can be overridden.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    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.

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

  116. final def ne(arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Definition Classes
    AnyRef
  117. def newSpecificBuilder: Builder[(K, V), LinkedHashMap[K, V]]

    returns

    a strict builder for the same collection type. Note that in the case of lazy collections (e.g. scala.collection.View or scala.collection.immutable.LazyList), it is possible to implement this method but the resulting Builder will break laziness. As a consequence, operations should preferably be implemented with fromSpecific instead of this method.

    Attributes
    protected
    Definition Classes
    MapFactoryDefaultsIterableOps
    Note

    When implementing a custom collection type and refining C to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where C =:= CC[A], this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

    ,

    As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as the returned builder is only fed with A values taken from this instance, it is safe.

  118. def nonEmpty: Boolean

    Tests whether the linked hash map is not empty.

    Tests whether the linked hash map is not empty.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
  119. final def notify(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  120. final def notifyAll(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  121. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

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

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

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

    Definition Classes
    PartialFunction
  122. def partition(p: ((K, V)) => Boolean): (LinkedHashMap[K, V], LinkedHashMap[K, V])

    A pair of, first, all elements that satisfy predicate p and, second, all elements that do not.

    A pair of, first, all elements that satisfy predicate p and, second, all elements that do not. Interesting because it splits a collection in two.

    The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of partition in StrictOptimizedIterableOps, which requires only a single traversal.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  123. def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])

    Applies a function f to each element of the linked hash map and returns a pair of linked hash maps: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Applies a function f to each element of the linked hash map and returns a pair of linked hash maps: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Example:

    val xs = `LinkedHashMap`(1, "one", 2, "two", 3, "three") partitionMap {
     case i: Int => Left(i)
     case s: String => Right(s)
    }
    // xs == (`LinkedHashMap`(1, 2, 3),
    //        `LinkedHashMap`(one, two, three))
    A1

    the element type of the first resulting collection

    A2

    the element type of the second resulting collection

    f

    the 'split function' mapping the elements of this linked hash map to an scala.util.Either

    returns

    a pair of linked hash maps: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  124. def product[B >: (K, V)](implicit num: math.Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

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

    returns

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

    Definition Classes
    IterableOnceOps
  125. def put(key: K, value: V): Option[V]

    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.

    key

    the key to update

    value

    the new value

    returns

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

    Definition Classes
    LinkedHashMapMapOps
  126. def reduce[B >: (K, V)](op: (B, B) => B): B

    Reduces the elements of this linked hash map using the specified associative binary operator.

    Reduces the elements of this linked hash map using the specified associative binary operator.

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

    B

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the linked hash map is nonempty.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this linked hash map is empty.

  127. def reduceLeft[B >: (K, V)](op: (B, (K, V)) => B): B

    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 left to right.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash map, going left to right: op( op( ... op(x1, x2) ..., xn-1), xn) where x1, ..., xn are the elements of this linked hash map.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this linked hash map is empty.

  128. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) => B): Option[B]

    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.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    Definition Classes
    IterableOnceOps
  129. def reduceOption[B >: (K, V)](op: (B, B) => B): Option[B]

    Reduces the elements of this linked hash map, if any, using the specified associative binary operator.

    Reduces the elements of this linked hash map, if any, using the specified associative binary operator.

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

    B

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    IterableOnceOps
  130. def reduceRight[B >: (K, V)](op: ((K, V), B) => B): B

    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.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked hash map, going right to left: op(x1, op(x2, ..., op(xn-1, xn)...)) where x1, ..., xn are the elements of this linked hash map.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this linked hash map is empty.

  131. def reduceRightOption[B >: (K, V)](op: ((K, V), B) => B): Option[B]

    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.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    Definition Classes
    IterableOnceOps
  132. def remove(key: K): Option[V]

    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.

    key

    the key to be removed

    returns

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

    Definition Classes
    LinkedHashMapMapOps
  133. def result(): LinkedHashMap[K, V]

    Result collection consisting of all elements appended so far.

    Result collection consisting of all elements appended so far.

    Definition Classes
    MapOpsBuilder
  134. def reversed: collection.Iterable[(K, V)]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  135. def runWith[U](action: (V) => U): (K) => Boolean

    Composes this partial function with an action function which gets applied to results of this partial function.

    Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.

    Note that expression pf.runWith(action)(x) is equivalent to

    if(pf isDefinedAt x) { action(pf(x)); true } else false

    except that runWith is implemented via applyOrElse and thus potentially more efficient. Using runWith avoids double evaluation of pattern matchers and guards for partial function literals.

    action

    the action function

    returns

    a function which maps arguments x to isDefinedAt(x). The resulting function runs action(this(x)) where this is defined.

    Definition Classes
    PartialFunction
    See also

    applyOrElse.

  136. def scan[B >: (K, V)](z: B)(op: (B, B) => B): Iterable[B]

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

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

    B

    element type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

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

    Definition Classes
    IterableOps
  137. def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]

    Produces a linked hash map containing cumulative results of applying the operator going left to right, including the initial value.

    Produces a linked hash map containing cumulative results of applying the operator going left to right, including the initial value.

    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  138. def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]

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

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

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Example:

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

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOps
  139. def size: Int

    The size of this linked hash map.

    The size of this linked hash map.

    returns

    the number of elements in this linked hash map.

    Definition Classes
    LinkedHashMapIterableOnceOps
  140. def sizeCompare(that: collection.Iterable[_]): Int

    Compares the size of this linked hash map to the size of another Iterable.

    Compares the size of this linked hash map to the size of another Iterable.

    that

    the Iterable whose size is compared with this linked hash map's size.

    returns

    A value x where

    x <  0       if this.size <  that.size
    x == 0       if this.size == that.size
    x >  0       if this.size >  that.size

    The method as implemented here does not call size directly; its running time is O(this.size min that.size) instead of O(this.size + that.size). The method should be overridden if computing size is cheap and knownSize returns -1.

    Definition Classes
    IterableOps
  141. def sizeCompare(otherSize: Int): Int

    Compares the size of this linked hash map to a test value.

    Compares the size of this linked hash map to a test value.

    otherSize

    the test value that gets compared with the size.

    returns

    A value x where

    x <  0       if this.size <  otherSize
    x == 0       if this.size == otherSize
    x >  0       if this.size >  otherSize

    The method as implemented here does not call size directly; its running time is O(size min otherSize) instead of O(size). The method should be overridden if computing size is cheap and knownSize returns -1.

    Definition Classes
    IterableOps
    See also

    sizeIs

  142. final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit

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

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

    coll

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

    delta

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

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

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

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

    size

    the hint how many elements will be added.

    Definition Classes
    Builder
  144. final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit

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

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

    size

    the hint how many elements will be added.

    boundingColl

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

    Definition Classes
    Builder
  145. final def sizeIs: SizeCompareOps

    Returns a value class containing operations for comparing the size of this linked hash map to a test value.

    Returns a value class containing operations for comparing the size of this linked hash map to a test value.

    These operations are implemented in terms of sizeCompare(Int), and allow the following more readable usages:

    this.sizeIs < size     // this.sizeCompare(size) < 0
    this.sizeIs <= size    // this.sizeCompare(size) <= 0
    this.sizeIs == size    // this.sizeCompare(size) == 0
    this.sizeIs != size    // this.sizeCompare(size) != 0
    this.sizeIs >= size    // this.sizeCompare(size) >= 0
    this.sizeIs > size     // this.sizeCompare(size) > 0
    Definition Classes
    IterableOps
    Annotations
    @inline()
  146. def slice(from: Int, until: Int): LinkedHashMap[K, V]

    Selects an interval of elements.

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

    from <= indexOf(x) < until
    from

    the lowest index to include from this linked hash map.

    until

    the lowest index to EXCLUDE from this linked hash map.

    returns

    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.

    Definition Classes
    IterableOpsIterableOnceOps
  147. def sliding(size: Int, step: Int): Iterator[LinkedHashMap[K, V]]

    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 returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

    size

    the number of elements per group

    step

    the distance between the first elements of successive groups

    returns

    An iterator producing linked hash maps of size size, except the last element (which may be the only element) will be smaller if there are fewer than size elements remaining to be grouped.

    Definition Classes
    IterableOps
    Examples:
    1. List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5))

    2. ,
    3. List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))

    See also

    scala.collection.Iterator, method sliding

  148. def sliding(size: Int): Iterator[LinkedHashMap[K, V]]

    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.)

    An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

    size

    the number of elements per group

    returns

    An iterator producing linked hash maps of size size, except for a non-empty collection with less than size elements, which returns an iterator that produces the source collection itself as its only element.

    Definition Classes
    IterableOps
    Examples:
    1. List().sliding(2) = empty iterator

    2. ,
    3. List(1).sliding(2) = Iterator(List(1))

    4. ,
    5. List(1, 2).sliding(2) = Iterator(List(1, 2))

    6. ,
    7. List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))

    See also

    scala.collection.Iterator, method sliding

  149. def span(p: ((K, V)) => Boolean): (LinkedHashMap[K, V], LinkedHashMap[K, V])

    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.

    p

    the test predicate

    returns

    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.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  150. def splitAt(n: Int): (LinkedHashMap[K, V], LinkedHashMap[K, V])

    Splits this linked hash map into a prefix/suffix pair at a given position.

    Splits this linked hash map into a prefix/suffix pair at a given position.

    Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
  151. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S

    Returns a scala.collection.Stepper for the elements of this collection.

    Returns a scala.collection.Stepper for the elements of this collection.

    The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.

    The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.

    Note that this method is overridden in subclasses and the return type is refined to S with EfficientSplit, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.

    Definition Classes
    IterableOnce
  152. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[(K, V), B]): C2

    B

    Type of elements of the resulting collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[String])

    b

    Builder to use to build the resulting collection

    pf

    Element transformation partial function

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  153. final def strictOptimizedConcat[B >: (K, V), C2](that: IterableOnce[B], b: Builder[B, C2]): C2

    B

    Type of elements of the resulting collections (e.g. Int)

    C2

    Type of the resulting collection (e.g. List[Int])

    that

    Elements to concatenate to this collection

    b

    Builder to use to build the resulting collection

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  154. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: ((K, V)) => IterableOnce[B]): C2

    B

    Type of elements of the resulting collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[String])

    b

    Builder to use to build the resulting collection

    f

    Element transformation function

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  155. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: ((K, V)) => IterableOnce[B]): C2

    B

    Type of elements of the resulting collection (e.g. Int)

    C2

    Type of the resulting collection (e.g. List[Int])

    b

    Builder to use to build the resulting collection

    toIterableOnce

    Evidence that A can be seen as an IterableOnce[B]

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  156. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: ((K, V)) => B): C2

    B

    Type of elements of the resulting collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[String])

    b

    Builder to use to build the resulting collection

    f

    Element transformation function

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  157. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[((K, V), B), C2]): C2

    B

    Type of elements of the second collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[(Int, String)])

    that

    Collection to zip with this collection

    b

    Builder to use to build the resulting collection

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  158. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    LinkedHashMapSeqMapMapIterable
    Annotations
    @nowarn()
  159. def subtractAll(xs: IterableOnce[K]): LinkedHashMap.this.type

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

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

    xs

    the iterator producing the elements to remove.

    returns

    the linked hash map itself

    Definition Classes
    Shrinkable
  160. def subtractOne(key: K): LinkedHashMap.this.type

    Removes a single element from this linked hash map.

    Removes a single element from this linked hash map.

    returns

    the linked hash map itself

    Definition Classes
    LinkedHashMapShrinkable
  161. def sum[B >: (K, V)](implicit num: math.Numeric[B]): B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

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

    returns

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

    Definition Classes
    IterableOnceOps
  162. final def synchronized[T0](arg0: => T0): T0

    Executes the code in body with an exclusive lock on this.

    Executes the code in body with an exclusive lock on this.

    returns

    the result of body

    Definition Classes
    AnyRef
  163. def tail: LinkedHashMap[K, V]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableOps
  164. def tails: Iterator[LinkedHashMap[K, V]]

    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.

    returns

    an iterator over all the tails of this linked hash map

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

  165. def take(n: Int): LinkedHashMap[K, V]

    Selects the first n elements.

    Selects the first n elements.

    n

    the number of elements to take from this linked hash map.

    returns

    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. If n is negative, returns an empty linked hash map.

    Definition Classes
    IterableOpsIterableOnceOps
  166. def takeRight(n: Int): LinkedHashMap[K, V]

    A collection containing the last n elements of this collection.

    A collection containing the last n elements of this collection.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    n

    the number of elements to take from this linked hash map.

    returns

    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. If n is negative, returns an empty linked hash map.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  167. def takeWhile(p: ((K, V)) => Boolean): LinkedHashMap[K, V]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    IterableOpsIterableOnceOps
  168. def tapEach[U](f: ((K, V)) => U): LinkedHashMap[K, V]

    Applies a side-effecting function to each element in this collection.

    Applies a side-effecting function to each element in this collection. Strict collections will apply f to their elements immediately, while lazy collections like Views and LazyLists will only apply f on each element if and when that element is evaluated, and each time that element is evaluated.

    U

    the return type of f

    f

    a function to apply to each element in this linked hash map

    returns

    The same logical collection as this

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  169. def to[C1](factory: Factory[(K, V), C1]): C1

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A.

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A. Example uses:

    xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]

    Definition Classes
    IterableOnceOps
  170. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Implementation note: DO NOT call Array.from from this method.

    Definition Classes
    IterableOnceOps
  171. final def toBuffer[B >: (K, V)]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  172. def toIndexedSeq: immutable.IndexedSeq[(K, V)]
    Definition Classes
    IterableOnceOps
  173. final def toIterable: LinkedHashMap.this.type

    returns

    This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

    Definition Classes
    IterableIterableOps
  174. def toList: immutable.List[(K, V)]
    Definition Classes
    IterableOnceOps
  175. def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
    Definition Classes
    IterableOnceOps
  176. def toSeq: immutable.Seq[(K, V)]

    returns

    This collection as a Seq[A]. This is equivalent to to(Seq) but might be faster.

    Definition Classes
    IterableOnceOps
  177. def toSet[B >: (K, V)]: immutable.Set[B]
    Definition Classes
    IterableOnceOps
  178. def toString(): String

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

    a String representation of the object.

    Definition Classes
    MapFunction1Iterable → AnyRef → Any
  179. def toVector: immutable.Vector[(K, V)]
    Definition Classes
    IterableOnceOps
  180. def transpose[B](implicit asIterable: ((K, V)) => collection.Iterable[B]): Iterable[Iterable[B]]

    Transposes this linked hash map of iterable collections into a linked hash map of linked hash maps.

    Transposes this linked hash map of iterable collections into a linked hash map of linked hash maps.

    The resulting collection's type will be guided by the static type of linked hash map. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(4, 5, 6)).transpose
    // xs == List(
    //         List(1, 4),
    //         List(2, 5),
    //         List(3, 6))
    
    val ys = Vector(
               List(1, 2, 3),
               List(4, 5, 6)).transpose
    // ys == Vector(
    //         Vector(1, 4),
    //         Vector(2, 5),
    //         Vector(3, 6))

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    B

    the type of the elements of each iterable collection.

    asIterable

    an implicit conversion which asserts that the element type of this linked hash map is an Iterable.

    returns

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

    Definition Classes
    IterableOps
    Exceptions thrown

    IllegalArgumentException if all collections in this linked hash map are not of the same size.

  181. def unapply(a: K): Option[V]

    Tries to extract a B from an A in a pattern matching expression.

    Tries to extract a B from an A in a pattern matching expression.

    Definition Classes
    PartialFunction
  182. def unlift: PartialFunction[K, B]

    Converts an optional function to a partial function.

    Converts an optional function to a partial function.

    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toUnliftOps[K, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if V is a subclass of Option[B] (V <: Option[B]).
    Definition Classes
    UnliftOps
    Example:
    1. Unlike Function.unlift, this UnliftOps.unlift method can be used in extractors.

      val of: Int => Option[String] = { i =>
        if (i == 2) {
          Some("matched by an optional function")
        } else {
          None
        }
      }
      
      util.Random.nextInt(4) match {
        case of.unlift(m) => // Convert an optional function to a pattern
          println(m)
        case _ =>
          println("Not matched")
      }
  183. def unzip[A1, A2](implicit asPair: ((K, V)) => (A1, A2)): (Iterable[A1], Iterable[A2])

    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.

    val xs = `LinkedHashMap`(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (`LinkedHashMap`(1, 2, 3),
    //        `LinkedHashMap`(one, two, three))
    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

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

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  184. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    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.

    val xs = `LinkedHashMap`(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (`LinkedHashMap`(1, 2, 3),
    //        `LinkedHashMap`(one, two, three),
    //        `LinkedHashMap`(1, 2, 3))
    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

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

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  185. def update(key: K, value: V): Unit

    Adds a new key/value pair to this map.

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

    key

    The key to update

    value

    The new value

    Definition Classes
    LinkedHashMapMapOps
  186. def updateWith(key: K)(remappingFunction: (Option[V]) => Option[V]): Option[V]

    Update a mapping for the specified key and its current optionally-mapped value (Some if there is current mapping, None if not).

    Update a mapping for the specified key and its current optionally-mapped value (Some if there is current mapping, None if not).

    If the remapping function returns Some(v), the mapping is updated with the new value v. If the remapping function returns None, the mapping is removed (or remains absent if initially absent). If the function itself throws an exception, the exception is rethrown, and the current mapping is left unchanged.

    key

    the key value

    remappingFunction

    a partial function that receives current optionally-mapped value and return a new mapping

    returns

    the new value associated with the specified key

    Definition Classes
    LinkedHashMapMapOps
  187. def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S

    Returns a Stepper for the values of this map.

    Returns a Stepper for the values of this map. See method stepper.

    Definition Classes
    MapOps
  188. def values: collection.Iterable[V]

    Collects all values of this map in an iterable collection.

    Collects all values of this map in an iterable collection.

    returns

    the values of this map as an iterable.

    Definition Classes
    MapOps
  189. def valuesIterator: Iterator[V]

    Creates an iterator for all values in this map.

    Creates an iterator for all values in this map.

    returns

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

    Definition Classes
    LinkedHashMapMapOps
  190. def view: MapView[K, V]

    A view over the elements of this collection.

    A view over the elements of this collection.

    Definition Classes
    MapOpsIterableOps
  191. final def wait(): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
    Note

    not specified by SLS as a member of AnyRef

  192. final def wait(arg0: Long, arg1: Int): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
    Note

    not specified by SLS as a member of AnyRef

  193. final def wait(arg0: Long): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
    Note

    not specified by SLS as a member of AnyRef

  194. def withDefault(d: (K) => V): Map[K, V]

    The same map with a given default function.

    The same map with a given default function. Note: The default is only used for apply. Other methods like get, contains, iterator, keys, etc. are not affected by withDefaultValue.

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

    d

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

    returns

    a wrapper of the map with a default value

    Definition Classes
    Map
  195. def withDefaultValue(d: V): Map[K, V]

    The same map with a given default value.

    The same map with a given default value. Note: The default is only used for apply. Other methods like get, contains, iterator, keys, etc. are not affected by withDefaultValue.

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

    d

    default value used for non-present keys

    returns

    a wrapper of the map with a default value

    Definition Classes
    Map
  196. def withFilter(p: ((K, V)) => Boolean): MapOps.WithFilter[K, V, [x]Iterable[x], [x, y]LinkedHashMap[x, y]]

    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.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this linked hash map which satisfy the predicate p.

    Definition Classes
    MapFactoryDefaultsIterableOps
  197. def writeReplace(): AnyRef
    Attributes
    protected[this]
    Definition Classes
    DefaultSerializable
  198. def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]

    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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new linked hash map 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.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  199. def zipAll[A1 >: (K, V), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]

    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.

    that

    the iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

    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.

    Definition Classes
    IterableOps
  200. def zipWithIndex: Iterable[((K, V), Int)]

    Zips this linked hash map with its indices.

    Zips this linked hash map with its indices.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Example:
    1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toany2stringadd[LinkedHashMap[K, V]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: any2stringadd[LinkedHashMap[K, V]]).+(other)
    Definition Classes
    any2stringadd

Deprecated Value Members

  1. def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): LinkedHashMap[K, V1]
    Definition Classes
    StrictOptimizedMapOpsMapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

  2. def +[V1 >: V](kv: (K, V1)): LinkedHashMap[K, V1]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Map or fall back to Map.concat.

  3. def ++:[V1 >: V](that: IterableOnce[(K, V1)]): LinkedHashMap[K, V1]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  4. def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  5. final def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): LinkedHashMap.this.type

    Adds two or more elements to this linked hash map.

    Adds two or more elements to this linked hash map.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the linked hash map itself

    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= aka addAll instead of varargs +=; infix operations with an operand of multiple args will be deprecated

  6. final def -(key1: K, key2: K, keys: K*): LinkedHashMap[K, V]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -- or removeAll on an immutable Map

  7. final def -(key: K): LinkedHashMap[K, V]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use - or remove on an immutable Map

  8. def --(keys: IterableOnce[K]): LinkedHashMap[K, V]
    Definition Classes
    MapOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Consider requiring an immutable Map.

  9. def -=(elem1: K, elem2: K, elems: K*): LinkedHashMap.this.type

    Removes two or more elements from this linked hash map.

    Removes two or more elements from this linked hash map.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the linked hash map itself

    Definition Classes
    Shrinkable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.3) Use --= aka subtractAll instead of varargs -=; infix operations with an operand of multiple args will be deprecated

  10. def /:[B](z: B)(op: (B, (K, V)) => B): B
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  11. final def /:[B](z: B)(op: (B, (K, V)) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  12. def :\[B](z: B)(op: ((K, V), B) => B): B
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  13. final def :\[B](z: B)(op: ((K, V), B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  14. def aggregate[B](z: => B)(seqop: (B, (K, V)) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  15. def collectFirst[B](f: PartialFunction[(K, V), B]): Option[B]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  16. def companion: IterableFactory[[_]Iterable[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  17. def copyToBuffer(dest: Buffer[(K, V)]): Unit
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  18. final def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  19. def count(f: ((K, V)) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  20. def exists(f: ((K, V)) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  21. def filter(f: ((K, V)) => Boolean): Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  22. def filterKeys(p: (K) => Boolean): MapView[K, V]

    Filters this map by retaining only keys satisfying a predicate.

    Filters this map by retaining only keys satisfying a predicate.

    p

    the predicate used to test keys

    returns

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

    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.filterKeys(f). A future version will include a strict version of this method (for now, .view.filterKeys(p).toMap).

  23. def find(p: ((K, V)) => Boolean): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  24. def flatMap[B](f: ((K, V)) => IterableOnce[B]): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  25. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  26. def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  27. def foldRight[B](z: B)(op: ((K, V), B) => B): B
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  28. def forall(f: ((K, V)) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  29. def foreach[U](f: ((K, V)) => U): Unit
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  30. def hasDefiniteSize: Boolean

    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. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

    method knownSize for a more useful alternative

  31. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  32. def map[B](f: ((K, V)) => B): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  33. def mapValues[W](f: (V) => W): MapView[K, W]

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

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

    f

    the function used to transform values of this map.

    returns

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

    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.mapValues(f). A future version will include a strict version of this method (for now, .view.mapValues(f).toMap).

  34. def max(implicit ord: math.Ordering[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  35. def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  36. def min(implicit ord: math.Ordering[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  37. def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  38. def mkString: String
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  39. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  40. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  41. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  42. def product(implicit num: math.Numeric[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  43. def reduce(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  44. def reduceLeft(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  45. def reduceLeftOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  46. def reduceOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  47. def reduceRight(f: ((K, V), (K, V)) => (K, V)): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  48. def reduceRightOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  49. final def repr: LinkedHashMap[K, V]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  50. final def retain(p: (K, V) => Boolean): LinkedHashMap.this.type
    Definition Classes
    MapOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use filterInPlace instead

  51. def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  52. def seq: LinkedHashMap.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  53. def size: Int
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  54. def sum(implicit num: math.Numeric[(K, V)]): (K, V)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  55. def to[C1](factory: Factory[(K, V), C1]): C1
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  56. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  57. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  58. def toIndexedSeq: collection.IndexedSeq[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  59. final def toIterable: collection.Iterable[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  60. def toIterator: Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  61. final def toIterator: Iterator[(K, V)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  62. def toList: immutable.List[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  63. def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  64. def toSeq: immutable.Seq[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  65. def toSet[B >: A]: immutable.Set[B]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  66. def toStream: immutable.Stream[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  67. final def toStream: immutable.Stream[(K, V)]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  68. final def toTraversable: collection.Traversable[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  69. final def toTraversable: collection.Traversable[(K, V)]

    Converts this linked hash map to an unspecified Iterable.

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

    returns

    An Iterable containing all elements of this linked hash map.

    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  70. def toVector: immutable.Vector[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  71. final def transform(f: (K, V) => V): LinkedHashMap.this.type
    Definition Classes
    MapOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapValuesInPlace instead

  72. def updated[V1 >: V](key: K, value: V1): LinkedHashMap[K, V1]
    Definition Classes
    MapOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use m.clone().addOne((k,v)) instead of m.updated(k, v)

  73. def view(from: Int, until: Int): View[(K, V)]

    A view over a slice of the elements of this collection.

    A view over a slice of the elements of this collection.

    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  74. def withFilter(f: ((K, V)) => Boolean): Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toIterableOnceExtensionMethods[(K, V)] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (linkedHashMap: IterableOnceExtensionMethods[(K, V)]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  75. def [B](y: B): (LinkedHashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from LinkedHashMap[K, V] toArrowAssoc[LinkedHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if V is a subclass of Option[Nothing] (V <: Option[Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from DefaultSerializable

Inherited from java.io.Serializable

Inherited from StrictOptimizedIterableOps[(K, V), [_]Iterable[_], LinkedHashMap[K, V]]

Inherited from SeqMap[K, V]

Inherited from collection.SeqMap[K, V]

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

Inherited from MapOps[K, V, [X, Y]LinkedHashMap[X, Y], LinkedHashMap[K, V]]

Inherited from Shrinkable[K]

Inherited from Builder[(K, V), LinkedHashMap[K, V]]

Inherited from Growable[(K, V)]

Inherited from Clearable

Inherited from Cloneable[LinkedHashMap[K, V]]

Inherited from java.lang.Cloneable

Inherited from Iterable[(K, V)]

Inherited from collection.AbstractMap[K, V]

Inherited from collection.Map[K, V]

Inherited from Equals

Inherited from MapFactoryDefaults[K, V, [x, y]LinkedHashMap[x, y], [x]Iterable[x]]

Inherited from collection.MapOps[K, V, [_, _]LinkedHashMap[_, _], LinkedHashMap[K, V]]

Inherited from PartialFunction[K, V]

Inherited from (K) => V

Inherited from collection.AbstractIterable[(K, V)]

Inherited from collection.Iterable[(K, V)]

Inherited from IterableFactoryDefaults[(K, V), [x]Iterable[x]]

Inherited from IterableOps[(K, V), [_]Iterable[_], LinkedHashMap[K, V]]

Inherited from IterableOnceOps[(K, V), [_]Iterable[_], LinkedHashMap[K, V]]

Inherited from IterableOnce[(K, V)]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromLinkedHashMap[K, V] to UnliftOps[K, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromLinkedHashMap[K, V] to IterableOnceExtensionMethods[(K, V)]

Inherited by implicit conversion any2stringadd fromLinkedHashMap[K, V] to any2stringadd[LinkedHashMap[K, V]]

Inherited by implicit conversion StringFormat fromLinkedHashMap[K, V] to StringFormat[LinkedHashMap[K, V]]

Inherited by implicit conversion Ensuring fromLinkedHashMap[K, V] to Ensuring[LinkedHashMap[K, V]]

Inherited by implicit conversion ArrowAssoc fromLinkedHashMap[K, V] to ArrowAssoc[LinkedHashMap[K, V]]

Ungrouped