Packages

c

scalation.util

SortedLinkedHashMap

class SortedLinkedHashMap[A, B] extends LinkedHashMap[A, B] with Serializable

The SortedLinkedHashMap class extends the scala LinkedHashMap class. It maintains the keys (type A) in order, so when you iterate the entry set, the entries are in key order. This is useful for merge algorithms, such as those used for sparse matrices.

Linear Supertypes
LinkedHashMap[A, B], Serializable, Serializable, HashTable[A, LinkedEntry[A, B]], HashUtils[A], AbstractMap[A, B], Map[A, B], MapLike[A, B, LinkedHashMap[A, B]], Cloneable[LinkedHashMap[A, B]], Cloneable, Cloneable, Shrinkable[A], Builder[(A, B), LinkedHashMap[A, B]], Growable[(A, B)], Clearable, Iterable[(A, B)], Traversable[(A, B)], Mutable, AbstractMap[A, B], Map[A, B], MapLike[A, B, LinkedHashMap[A, B]], Subtractable[A, LinkedHashMap[A, B]], PartialFunction[A, B], (A) ⇒ B, GenMap[A, B], GenMapLike[A, B, LinkedHashMap[A, B]], AbstractIterable[(A, B)], Iterable[(A, B)], IterableLike[(A, B), LinkedHashMap[A, B]], Equals, GenIterable[(A, B)], GenIterableLike[(A, B), LinkedHashMap[A, B]], AbstractTraversable[(A, B)], Traversable[(A, B)], GenTraversable[(A, B)], GenericTraversableTemplate[(A, B), Iterable], TraversableLike[(A, B), LinkedHashMap[A, B]], GenTraversableLike[(A, B), LinkedHashMap[A, B]], Parallelizable[(A, B), ParMap[A, B]], TraversableOnce[(A, B)], GenTraversableOnce[(A, B)], FilterMonadic[(A, B), LinkedHashMap[A, B]], HasNewBuilder[(A, B), LinkedHashMap[A, B]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SortedLinkedHashMap
  2. LinkedHashMap
  3. Serializable
  4. Serializable
  5. HashTable
  6. HashUtils
  7. AbstractMap
  8. Map
  9. MapLike
  10. Cloneable
  11. Cloneable
  12. Cloneable
  13. Shrinkable
  14. Builder
  15. Growable
  16. Clearable
  17. Iterable
  18. Traversable
  19. Mutable
  20. AbstractMap
  21. Map
  22. MapLike
  23. Subtractable
  24. PartialFunction
  25. Function1
  26. GenMap
  27. GenMapLike
  28. AbstractIterable
  29. Iterable
  30. IterableLike
  31. Equals
  32. GenIterable
  33. GenIterableLike
  34. AbstractTraversable
  35. Traversable
  36. GenTraversable
  37. GenericTraversableTemplate
  38. TraversableLike
  39. GenTraversableLike
  40. Parallelizable
  41. TraversableOnce
  42. GenTraversableOnce
  43. FilterMonadic
  44. HasNewBuilder
  45. AnyRef
  46. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SortedLinkedHashMap(pairs: (A, B)*)(implicit ordering: Ordering[A])

    Construct a SortedLinkedHashMap and put all (key, value) pairs into this map.

    Construct a SortedLinkedHashMap and put all (key, value) pairs into this map.

    pairs

    the (key, value) pairs to put in this map

  2. new SortedLinkedHashMap(pairs: List[(A, B)])(implicit ordering: Ordering[A])

    Construct a SortedLinkedHashMap and put all (key, value) pairs into this map.

    Construct a SortedLinkedHashMap and put all (key, value) pairs into this map.

    pairs

    the (key, value) pairs to put in this map

  3. new SortedLinkedHashMap()(implicit ordering: Ordering[A])

Type Members

  1. type Entry = LinkedEntry[A, B]
    Definition Classes
    LinkedHashMap
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. def +[V1 >: B](elem1: (A, V1), elem2: (A, V1), elems: (A, V1)*): Map[A, V1]
    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  2. def +[V1 >: B](kv: (A, V1)): Map[A, V1]
    Definition Classes
    MapLike → MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  3. def ++[V1 >: B](xs: GenTraversableOnce[(A, V1)]): Map[A, V1]
    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new map. Use ++= to add an element to this map and return that map itself.

  4. def ++[B >: (A, B), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (A, B), That](that: Traversable[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (A, B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++=(xs: TraversableOnce[(A, B)]): SortedLinkedHashMap.this.type
    Definition Classes
    Growable
  8. def +=(pairs: List[(A, B)]): Unit

    Put all (key, value) pairs into this map.

    Put all (key, value) pairs into this map.

    pairs

    the (key, value) pairs to put in this map

  9. def +=(kv: (A, B)): SortedLinkedHashMap.this.type
    Definition Classes
    LinkedHashMap → MapLike → Builder → Growable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  10. def +=(elem1: (A, B), elem2: (A, B), elems: (A, B)*): SortedLinkedHashMap.this.type
    Definition Classes
    Growable
  11. def -(elem1: A, elem2: A, elems: A*): LinkedHashMap[A, B]
    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new map. Use -= to remove an element from this map and return that map itself.

  12. def -(key: A): LinkedHashMap[A, B]
    Definition Classes
    MapLike → MapLike → Subtractable → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new map. Use -= to remove an element from this map and return that map itself.

  13. def --(xs: GenTraversableOnce[A]): LinkedHashMap[A, B]
    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new map. Use --= to remove an element from this map and return that map itself.

  14. def --=(xs: TraversableOnce[A]): SortedLinkedHashMap.this.type
    Definition Classes
    Shrinkable
  15. def -=(key: A): SortedLinkedHashMap.this.type
    Definition Classes
    LinkedHashMap → MapLike → Shrinkable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  16. def -=(elem1: A, elem2: A, elems: A*): SortedLinkedHashMap.this.type
    Definition Classes
    Shrinkable
  17. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  19. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  20. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  21. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  22. def aggregate[B](z: ⇒ B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]
    Definition Classes
    PartialFunction → Function1
  24. def apply(key: A): B
    Definition Classes
    MapLike → GenMapLike → Function1
  25. def applyOrElse[K1 <: A, V1 >: B](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  26. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  27. def clear(): Unit
    Definition Classes
    LinkedHashMap → MapLike → Builder → Growable → Clearable
  28. def clone(): LinkedHashMap[A, B]
    Definition Classes
    MapLike → Cloneable → AnyRef
  29. def collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  30. def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]
    Definition Classes
    TraversableOnce
  31. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  32. def compare(k0: A, k1: A): Int

    Compare the two keys (to establish the correct ordering).

    Compare the two keys (to establish the correct ordering).

    k0

    the first key

    k1

    the second key

  33. def compose[A](g: (A) ⇒ A): (A) ⇒ B
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  34. def contains(key: A): Boolean
    Definition Classes
    MapLike → GenMapLike
  35. def copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  36. def copyToArray[B >: (A, B)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  38. def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  39. def count(p: ((A, B)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def default(key: A): B
    Definition Classes
    MapLike → GenMapLike
  41. def drop(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  42. def dropRight(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike
  43. def dropWhile(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def empty: LinkedHashMap[A, B]
    Definition Classes
    LinkedHashMap → Map → Map → MapLike
  45. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  46. def exists(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  47. def filter(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def filterKeys(p: (A) ⇒ Boolean): Map[A, B]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  49. def filterNot(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  50. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  52. def flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  53. def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  56. def forall(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def foreach[U](f: ((A, B)) ⇒ U): Unit
    Definition Classes
    LinkedHashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  58. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  59. def get(key: A): Option[B]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  60. def getFirstEntry(): Entry

    Get the first entry in the SortedLinkedHashMap.

  61. def getOrElse[V1 >: B](key: A, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  62. def getOrElseUpdate(key: A, op: ⇒ B): B
    Definition Classes
    MapLike
  63. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def grouped(size: Int): Iterator[LinkedHashMap[A, B]]
    Definition Classes
    IterableLike
  65. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  66. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  67. def head: (A, B)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  68. def headOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def init: LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def inits: Iterator[LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike
  71. def isDefinedAt(key: A): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  72. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  73. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  74. def iterator: Iterator[(A, B)]
    Definition Classes
    LinkedHashMap → MapLike → IterableLike → GenIterableLike
  75. def keySet: Set[A]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  76. def keys: Iterable[A]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) keys returns Iterable[K] rather than Iterator[K].

  77. def keysIterator: Iterator[A]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  78. def last: (A, B)
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def lastOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def lift: (A) ⇒ Option[B]
    Definition Classes
    PartialFunction
  81. def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  82. def mapResult[NewTo](f: (LinkedHashMap[A, B]) ⇒ NewTo): Builder[(A, B), NewTo]
    Definition Classes
    Builder
  83. def mapValues[C](f: (B) ⇒ C): Map[A, C]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  84. def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  93. implicit val ordering: Ordering[A]
  94. def par: ParMap[A, B]
    Definition Classes
    Parallelizable
  95. def partition(p: ((A, B)) ⇒ Boolean): (LinkedHashMap[A, B], LinkedHashMap[A, B])
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def product[B >: (A, B)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def put(key: A, value: B): Option[B]

    Put (key, value) pair into this map.

    Put (key, value) pair into this map.

    key

    the key for the map entry

    value

    the value for the map entry

    Definition Classes
    SortedLinkedHashMap → LinkedHashMap → MapLike
  98. def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce
  100. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  103. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def remove(key: A): Option[B]
    Definition Classes
    LinkedHashMap → MapLike
  105. def repr: LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def result(): LinkedHashMap[A, B]
    Definition Classes
    MapLike → Builder
  107. def retain(p: (A, B) ⇒ Boolean): SortedLinkedHashMap.this.type
    Definition Classes
    MapLike
  108. def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean
    Definition Classes
    PartialFunction
  109. def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  110. def scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  112. def scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  113. def seq: Map[A, B]
    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  114. def size: Int
    Definition Classes
    LinkedHashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce
  115. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  116. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  117. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  118. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  119. def slice(from: Int, until: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  120. def sliding(size: Int, step: Int): Iterator[LinkedHashMap[A, B]]
    Definition Classes
    IterableLike
  121. def sliding(size: Int): Iterator[LinkedHashMap[A, B]]
    Definition Classes
    IterableLike
  122. def span(p: ((A, B)) ⇒ Boolean): (LinkedHashMap[A, B], LinkedHashMap[A, B])
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def splitAt(n: Int): (LinkedHashMap[A, B], LinkedHashMap[A, B])
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def stringPrefix: String
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  125. def sum[B >: (A, B)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def tail: LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def tails: Iterator[LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike
  128. def take(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  129. def takeRight(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike
  130. def takeWhile(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  131. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  132. def toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def toBuffer[E >: (A, B)]: Buffer[E]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  134. def toIndexedSeq: IndexedSeq[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def toIterable: Iterable[(A, B)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  136. def toIterator: Iterator[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  137. def toList: List[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toSeq: Seq[(A, B)]
    Definition Classes
    MapLike → MapLike → TraversableOnce → GenTraversableOnce
  140. def toSet[B >: (A, B)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toStream: Stream[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  142. def toString(): String
    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any
  143. def toTraversable: Traversable[(A, B)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  144. def toVector: Vector[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def transform(f: (A, B) ⇒ B): SortedLinkedHashMap.this.type
    Definition Classes
    MapLike
  146. def transpose[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  147. def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  148. def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  149. def update(key: A, value: B): Unit
    Definition Classes
    MapLike
  150. def updated[V1 >: B](key: A, value: V1): Map[A, V1]
    Definition Classes
    MapLike → MapLike
  151. def values: Iterable[B]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) values returns Iterable[V] rather than Iterator[V].

  152. def valuesIterator: Iterator[B]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  153. def view(from: Int, until: Int): IterableView[(A, B), LinkedHashMap[A, B]]
    Definition Classes
    IterableLike → TraversableLike
  154. def view: IterableView[(A, B), LinkedHashMap[A, B]]
    Definition Classes
    IterableLike → TraversableLike
  155. def withDefault(d: (A) ⇒ B): Map[A, B]
    Definition Classes
    Map
  156. def withDefaultValue(d: B): Map[A, B]
    Definition Classes
    Map
  157. def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike → FilterMonadic
  158. def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  159. def zipAll[B, A1 >: (A, B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  160. def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[LinkedHashMap[A, B], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike