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
Learn more about member selection
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. class DefaultKeySet extends scala.collection.mutable.LinkedHashMap.DefaultKeySet

    Attributes
    protected
    Definition Classes
    LinkedHashMap

  2. class DefaultValuesIterable extends AbstractIterable[B] with Iterable[B] with Serializable

    Attributes
    protected
    Definition Classes
    MapLike

  3. type Entry = LinkedEntry[A, B]

    Definition Classes
    LinkedHashMap

  4. class FilteredKeys extends scala.collection.mutable.LinkedHashMap.FilteredKeys

    Attributes
    protected
    Definition Classes
    LinkedHashMap

  5. class MappedValues[C] extends scala.collection.mutable.LinkedHashMap.MappedValues[C]

    Attributes
    protected
    Definition Classes
    LinkedHashMap

  6. type Self = LinkedHashMap[A, B]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  7. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

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

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. def +[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): Map[A, B1]

    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 +[B1 >: B](kv: (A, B1)): Map[A, B1]

    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.

  5. def ++[B1 >: B](xs: GenTraversableOnce[(A, B1)]): Map[A, B1]

    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.

  6. def ++[B >: (A, B), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  7. def ++:[B >: (A, B), That](that: Traversable[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike

  8. def ++:[B >: (A, B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike

  9. def ++=(xs: TraversableOnce[(A, B)]): SortedLinkedHashMap.this.type

    Definition Classes
    Growable

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

  11. def +=(kv: (A, B)): SortedLinkedHashMap.this.type

    Definition Classes
    LinkedHashMap → MapLike → Builder → Growable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  12. def +=(elem1: (A, B), elem2: (A, B), elems: (A, B)*): SortedLinkedHashMap.this.type

    Definition Classes
    Growable

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

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

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

  16. def --=(xs: TraversableOnce[A]): SortedLinkedHashMap.this.type

    Definition Classes
    Shrinkable

  17. def -=(key: A): SortedLinkedHashMap.this.type

    Definition Classes
    LinkedHashMap → MapLike → Shrinkable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  18. def -=(elem1: A, elem2: A, elems: A*): SortedLinkedHashMap.this.type

    Definition Classes
    Shrinkable

  19. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  20. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  21. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  22. var _loadFactor: Int

    Attributes
    protected
    Definition Classes
    HashTable

  23. def addEntry(e: LinkedEntry[A, B]): Unit

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  24. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    MapLike → TraversableOnce

  25. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  26. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  27. def aggregate[B](z: ⇒ B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  28. def alwaysInitSizeMap: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  29. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]

    Definition Classes
    PartialFunction → Function1

  30. def apply(key: A): B

    Definition Classes
    MapLike → GenMapLike → Function1

  31. def applyOrElse[A1 <: A, B1 >: B](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction

  32. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  33. def calcSizeMapSize(tableLength: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  34. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  35. def clear(): Unit

    Definition Classes
    LinkedHashMap → MapLike → Builder → Growable → Clearable

  36. def clearTable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  37. def clone(): LinkedHashMap[A, B]

    Definition Classes
    MapLike → Cloneable → AnyRef

  38. def collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  39. def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]

    Definition Classes
    TraversableOnce

  40. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate

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

  42. def compose[A](g: (A) ⇒ A): (A) ⇒ B

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  43. def contains(key: A): Boolean

    Definition Classes
    MapLike → GenMapLike

  44. def copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  45. def copyToArray[B >: (A, B)](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  46. def copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  47. def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  48. def count(p: ((A, B)) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  49. def createNewEntry[B1](key: A, value: B1): Entry

    Attributes
    protected
    Definition Classes
    LinkedHashMap → HashTable

  50. def default(key: A): B

    Definition Classes
    MapLike → GenMapLike

  51. def drop(n: Int): LinkedHashMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  52. def dropRight(n: Int): LinkedHashMap[A, B]

    Definition Classes
    IterableLike

  53. def dropWhile(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike

  54. def elemEquals(key1: A, key2: A): Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  55. def elemHashCode(key: A): Int

    Attributes
    protected
    Definition Classes
    HashUtils

  56. def empty: LinkedHashMap[A, B]

    Definition Classes
    LinkedHashMap → Map → Map → MapLike

  57. def entriesIterator: Iterator[LinkedEntry[A, B]]

    Attributes
    protected
    Definition Classes
    HashTable

  58. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  59. def equals(that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any

  60. def exists(p: ((A, B)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  61. def filter(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike

  62. def filterKeys(p: (A) ⇒ Boolean): Map[A, B]

    Definition Classes
    LinkedHashMap → MapLike → GenMapLike

  63. def filterNot(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  64. def finalize(): Unit

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

  65. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  66. def findEntry(key: A): LinkedEntry[A, B]

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  67. def findOrAddEntry[B](key: A, value: B): LinkedEntry[A, B]

    Attributes
    protected
    Definition Classes
    HashTable

  68. var firstEntry: Entry

    Attributes
    protected
    Definition Classes
    LinkedHashMap

  69. def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  70. def flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

  71. def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  74. def forall(p: ((A, B)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  75. def foreach[U](f: ((A, B)) ⇒ U): Unit

    Definition Classes
    LinkedHashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  76. def foreachEntry[U](f: (Entry) ⇒ U): Unit

    Attributes
    protected
    Definition Classes
    LinkedHashMap → HashTable

  77. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate

  78. def get(key: A): Option[B]

    Definition Classes
    LinkedHashMap → MapLike → GenMapLike

  79. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  80. def getFirstEntry(): Entry

    Get the first entry in the SortedLinkedHashMap.

  81. def getOrElse[B1 >: B](key: A, default: ⇒ B1): B1

    Definition Classes
    MapLike → GenMapLike

  82. def getOrElseUpdate(key: A, op: ⇒ B): B

    Definition Classes
    MapLike

  83. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, LinkedHashMap[A, B]]

    Definition Classes
    TraversableLike → GenTraversableLike

  84. def grouped(size: Int): Iterator[LinkedHashMap[A, B]]

    Definition Classes
    IterableLike

  85. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  86. def hashCode(): Int

    Definition Classes
    GenMapLike → AnyRef → Any

  87. def head: (A, B)

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  88. def headOption: Option[(A, B)]

    Definition Classes
    TraversableLike → GenTraversableLike

  89. final def improve(hcode: Int, seed: Int): Int

    Attributes
    protected
    Definition Classes
    HashUtils

  90. final def index(hcode: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable

  91. def init: LinkedHashMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike

  92. def initWithContents(c: Contents[A, LinkedEntry[A, B]]): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  93. def initialSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

  94. def inits: Iterator[LinkedHashMap[A, B]]

    Definition Classes
    TraversableLike

  95. def isDefinedAt(key: A): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction

  96. def isEmpty: Boolean

    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  97. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  98. def isSizeMapDefined: Boolean

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  99. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  100. def iterator: Iterator[(A, B)]

    Definition Classes
    LinkedHashMap → MapLike → IterableLike → GenIterableLike

  101. def keySet: Set[A]

    Definition Classes
    LinkedHashMap → MapLike → GenMapLike

  102. def keys: Iterable[A]

    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  103. def keysIterator: Iterator[A]

    Definition Classes
    LinkedHashMap → MapLike → GenMapLike

  104. def last: (A, B)

    Definition Classes
    TraversableLike → GenTraversableLike

  105. var lastEntry: Entry

    Attributes
    protected
    Definition Classes
    LinkedHashMap

  106. def lastOption: Option[(A, B)]

    Definition Classes
    TraversableLike → GenTraversableLike

  107. def lift: (A) ⇒ Option[B]

    Definition Classes
    PartialFunction

  108. def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  109. def mapResult[NewTo](f: (LinkedHashMap[A, B]) ⇒ NewTo): Builder[(A, B), NewTo]

    Definition Classes
    Builder

  110. def mapValues[C](f: (B) ⇒ C): Map[A, C]

    Definition Classes
    LinkedHashMap → MapLike → GenMapLike

  111. def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  112. def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  113. def min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  117. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  119. def newBuilder: Builder[(A, B), LinkedHashMap[A, B]]

    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → HasNewBuilder

  120. def nnSizeMapAdd(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  121. def nnSizeMapRemove(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  122. def nnSizeMapReset(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  123. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  124. final def notify(): Unit

    Definition Classes
    AnyRef

  125. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  126. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction

  127. implicit val ordering: Ordering[A]

  128. def par: ParMap[A, B]

    Definition Classes
    Parallelizable

  129. def parCombiner: Combiner[(A, B), ParMap[A, B]]

    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable

  130. def partition(p: ((A, B)) ⇒ Boolean): (LinkedHashMap[A, B], LinkedHashMap[A, B])

    Definition Classes
    TraversableLike → GenTraversableLike

  131. def product[B >: (A, B)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

  133. def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  134. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B

    Definition Classes
    TraversableOnce

  135. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  136. def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  137. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  138. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  139. def remove(key: A): Option[B]

    Definition Classes
    LinkedHashMap → MapLike

  140. def removeEntry(key: A): LinkedEntry[A, B]

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  141. def repr: LinkedHashMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike

  142. def result(): LinkedHashMap[A, B]

    Definition Classes
    MapLike → Builder

  143. def retain(p: (A, B) ⇒ Boolean): SortedLinkedHashMap.this.type

    Definition Classes
    MapLike

  144. def reversed: List[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  145. def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean

    Definition Classes
    PartialFunction

  146. def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

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

  148. def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

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

  150. var seedvalue: Int

    Attributes
    protected
    Definition Classes
    HashTable

  151. def seq: Map[A, B]

    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  152. def size: Int

    Definition Classes
    LinkedHashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce

  153. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

    Definition Classes
    Builder

  154. def sizeHint(coll: TraversableLike[_, _]): Unit

    Definition Classes
    Builder

  155. def sizeHint(size: Int): Unit

    Definition Classes
    Builder

  156. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

    Definition Classes
    Builder

  157. final def sizeMapBucketBitSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  158. final def sizeMapBucketSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  159. def sizeMapDisable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  160. def sizeMapInit(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  161. def sizeMapInitAndRebuild(): Unit

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  162. var sizemap: Array[Int]

    Attributes
    protected
    Definition Classes
    HashTable

  163. def slice(from: Int, until: Int): LinkedHashMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  164. def sliding(size: Int, step: Int): Iterator[LinkedHashMap[A, B]]

    Definition Classes
    IterableLike

  165. def sliding(size: Int): Iterator[LinkedHashMap[A, B]]

    Definition Classes
    IterableLike

  166. def span(p: ((A, B)) ⇒ Boolean): (LinkedHashMap[A, B], LinkedHashMap[A, B])

    Definition Classes
    TraversableLike → GenTraversableLike

  167. def splitAt(n: Int): (LinkedHashMap[A, B], LinkedHashMap[A, B])

    Definition Classes
    TraversableLike → GenTraversableLike

  168. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  169. def sum[B >: (A, B)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  170. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  171. var table: Array[HashEntry[A, LinkedEntry[A, B]]]

    Attributes
    protected
    Definition Classes
    HashTable

  172. var tableSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

  173. def tableSizeSeed: Int

    Attributes
    protected
    Definition Classes
    HashTable

  174. def tail: LinkedHashMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike

  175. def tails: Iterator[LinkedHashMap[A, B]]

    Definition Classes
    TraversableLike

  176. def take(n: Int): LinkedHashMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  177. def takeRight(n: Int): LinkedHashMap[A, B]

    Definition Classes
    IterableLike

  178. def takeWhile(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  179. def thisCollection: Iterable[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  180. var threshold: Int

    Attributes
    protected
    Definition Classes
    HashTable

  181. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  182. def toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  183. def toBuffer[C >: (A, B)]: Buffer[C]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

  184. def toCollection(repr: LinkedHashMap[A, B]): Iterable[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  185. def toIndexedSeq: IndexedSeq[(A, B)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  186. def toIterable: Iterable[(A, B)]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  187. def toIterator: Iterator[(A, B)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  188. def toList: List[(A, B)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  189. def toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  190. def toSeq: Seq[(A, B)]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

  191. def toSet[B >: (A, B)]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  192. def toStream: Stream[(A, B)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  193. def toString(): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any

  194. def toTraversable: Traversable[(A, B)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  195. def toVector: Vector[(A, B)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  196. def transform(f: (A, B) ⇒ B): SortedLinkedHashMap.this.type

    Definition Classes
    MapLike

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

  198. def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate

  199. def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate

  200. def update(key: A, value: B): Unit

    Definition Classes
    MapLike

  201. def updated[B1 >: B](key: A, value: B1): Map[A, B1]

    Definition Classes
    MapLike → MapLike

  202. def values: Iterable[B]

    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  203. def valuesIterator: Iterator[B]

    Definition Classes
    LinkedHashMap → MapLike → GenMapLike

  204. def view(from: Int, until: Int): IterableView[(A, B), LinkedHashMap[A, B]]

    Definition Classes
    IterableLike → TraversableLike

  205. def view: IterableView[(A, B), LinkedHashMap[A, B]]

    Definition Classes
    IterableLike → TraversableLike

  206. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  209. def withDefault(d: (A) ⇒ B): Map[A, B]

    Definition Classes
    Map

  210. def withDefaultValue(d: B): Map[A, B]

    Definition Classes
    Map

  211. def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), LinkedHashMap[A, B]]

    Definition Classes
    TraversableLike → FilterMonadic

  212. def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

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

  214. def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[LinkedHashMap[A, B], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

Inherited from LinkedHashMap[A, B]

Inherited from Serializable

Inherited from Serializable

Inherited from HashTable[A, LinkedEntry[A, B]]

Inherited from HashUtils[A]

Inherited from AbstractMap[A, B]

Inherited from Map[A, B]

Inherited from MapLike[A, B, LinkedHashMap[A, B]]

Inherited from Cloneable[LinkedHashMap[A, B]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[(A, B), LinkedHashMap[A, B]]

Inherited from Growable[(A, B)]

Inherited from Clearable

Inherited from Iterable[(A, B)]

Inherited from Traversable[(A, B)]

Inherited from Mutable

Inherited from AbstractMap[A, B]

Inherited from Map[A, B]

Inherited from MapLike[A, B, LinkedHashMap[A, B]]

Inherited from Subtractable[A, LinkedHashMap[A, B]]

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from GenMap[A, B]

Inherited from GenMapLike[A, B, LinkedHashMap[A, B]]

Inherited from AbstractIterable[(A, B)]

Inherited from Iterable[(A, B)]

Inherited from IterableLike[(A, B), LinkedHashMap[A, B]]

Inherited from Equals

Inherited from GenIterable[(A, B)]

Inherited from GenIterableLike[(A, B), LinkedHashMap[A, B]]

Inherited from AbstractTraversable[(A, B)]

Inherited from Traversable[(A, B)]

Inherited from GenTraversable[(A, B)]

Inherited from GenericTraversableTemplate[(A, B), Iterable]

Inherited from TraversableLike[(A, B), LinkedHashMap[A, B]]

Inherited from GenTraversableLike[(A, B), LinkedHashMap[A, B]]

Inherited from Parallelizable[(A, B), ParMap[A, B]]

Inherited from TraversableOnce[(A, B)]

Inherited from GenTraversableOnce[(A, B)]

Inherited from FilterMonadic[(A, B), LinkedHashMap[A, B]]

Inherited from HasNewBuilder[(A, B), LinkedHashMap[A, B]]

Inherited from AnyRef

Inherited from Any

Ungrouped