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. class DefaultKeySet extends scala.collection.mutable.LinkedHashMap.DefaultKeySet
    Attributes
    protected
    Definition Classes
    LinkedHashMap
  2. class DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] 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 +[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.

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

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

  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. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  20. val _loadFactor: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  21. def addEntry(e: LinkedEntry[A, B]): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  22. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  23. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  24. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  25. def aggregate[B](z: ⇒ B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def alwaysInitSizeMap: Boolean
    Attributes
    protected
    Definition Classes
    HashTable
  27. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]
    Definition Classes
    PartialFunction → Function1
  28. def apply(key: A): B
    Definition Classes
    MapLike → GenMapLike → Function1
  29. def applyOrElse[K1 <: A, V1 >: B](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  30. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  31. def calcSizeMapSize(tableLength: Int): Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  32. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  33. def clear(): Unit
    Definition Classes
    LinkedHashMap → MapLike → Builder → Growable → Clearable
  34. def clearTable(): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  35. def clone(): LinkedHashMap[A, B]
    Definition Classes
    MapLike → Cloneable → AnyRef
  36. def collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]
    Definition Classes
    TraversableOnce
  38. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  39. 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

  40. def compose[A](g: (A) ⇒ A): (A) ⇒ B
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  41. def contains(key: A): Boolean
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  42. def copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def copyToArray[B >: (A, B)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  46. def count(p: ((A, B)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def createNewEntry[B1](key: A, value: B1): Entry
    Attributes
    protected
    Definition Classes
    LinkedHashMap → HashTable
  48. def default(key: A): B
    Definition Classes
    MapLike → GenMapLike
  49. def drop(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  50. def dropRight(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike
  51. def dropWhile(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def elemEquals(key1: A, key2: A): Boolean
    Attributes
    protected
    Definition Classes
    HashTable
  53. def elemHashCode(key: A): Int
    Attributes
    protected
    Definition Classes
    HashUtils
  54. def empty: LinkedHashMap[A, B]
    Definition Classes
    LinkedHashMap → Map → Map → MapLike
  55. def entriesIterator: Iterator[LinkedEntry[A, B]]
    Attributes
    protected
    Definition Classes
    HashTable
  56. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  57. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  58. def exists(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def filter(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def filterKeys(p: (A) ⇒ Boolean): Map[A, B]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  61. def filterNot(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  62. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  63. def findEntry(key: A): LinkedEntry[A, B]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  64. def findOrAddEntry[B](key: A, value: B): LinkedEntry[A, B]
    Attributes
    protected
    Definition Classes
    HashTable
  65. var firstEntry: Entry
    Attributes
    protected
    Definition Classes
    LinkedHashMap
  66. def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  67. def flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  68. def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  71. def forall(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  72. def foreach[U](f: ((A, B)) ⇒ U): Unit
    Definition Classes
    LinkedHashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  73. def foreachEntry[U](f: (Entry) ⇒ U): Unit
    Attributes
    protected
    Definition Classes
    LinkedHashMap → HashTable
  74. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  75. def get(key: A): Option[B]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  76. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  77. def getFirstEntry(): Entry

    Get the first entry in the SortedLinkedHashMap.

  78. def getOrElse[V1 >: B](key: A, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  79. def getOrElseUpdate(key: A, op: ⇒ B): B
    Definition Classes
    MapLike
  80. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def grouped(size: Int): Iterator[LinkedHashMap[A, B]]
    Definition Classes
    IterableLike
  82. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  83. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  84. def head: (A, B)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  85. def headOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  86. final def improve(hcode: Int, seed: Int): Int
    Attributes
    protected
    Definition Classes
    HashUtils
  87. final def index(hcode: Int): Int
    Attributes
    protected
    Definition Classes
    HashTable
  88. def init: LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def initWithContents(c: Contents[A, LinkedEntry[A, B]]): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  90. def initialSize: Int
    Attributes
    protected
    Definition Classes
    HashTable
  91. def inits: Iterator[LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike
  92. def isDefinedAt(key: A): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  93. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  94. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  95. def isSizeMapDefined: Boolean
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  96. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  97. def iterator: Iterator[(A, B)]
    Definition Classes
    LinkedHashMap → MapLike → IterableLike → GenIterableLike
  98. def keySet: Set[A]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  99. 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].

  100. def keysIterator: Iterator[A]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  101. def last: (A, B)
    Definition Classes
    TraversableLike → GenTraversableLike
  102. var lastEntry: Entry
    Attributes
    protected
    Definition Classes
    LinkedHashMap
  103. def lastOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def lift: (A) ⇒ Option[B]
    Definition Classes
    PartialFunction
  105. def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  106. def mapResult[NewTo](f: (LinkedHashMap[A, B]) ⇒ NewTo): Builder[(A, B), NewTo]
    Definition Classes
    Builder
  107. def mapValues[C](f: (B) ⇒ C): Map[A, C]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  108. def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  116. def newBuilder: Builder[(A, B), LinkedHashMap[A, B]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → HasNewBuilder
  117. def nnSizeMapAdd(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  118. def nnSizeMapRemove(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  119. def nnSizeMapReset(tableLength: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  120. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  122. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  123. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  124. implicit val ordering: Ordering[A]
  125. def par: ParMap[A, B]
    Definition Classes
    Parallelizable
  126. def parCombiner: Combiner[(A, B), ParMap[A, B]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable
  127. def partition(p: ((A, B)) ⇒ Boolean): (LinkedHashMap[A, B], LinkedHashMap[A, B])
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def product[B >: (A, B)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. 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
  130. def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce
  132. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  135. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def remove(key: A): Option[B]
    Definition Classes
    LinkedHashMap → MapLike
  137. def removeEntry(key: A): LinkedEntry[A, B]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  138. def repr: LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  139. def result(): LinkedHashMap[A, B]
    Definition Classes
    MapLike → Builder
  140. def retain(p: (A, B) ⇒ Boolean): SortedLinkedHashMap.this.type
    Definition Classes
    MapLike
  141. def reversed: List[(A, B)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  142. def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean
    Definition Classes
    PartialFunction
  143. def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  144. 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
  145. def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  146. 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.

  147. val seedvalue: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  148. def seq: Map[A, B]
    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  149. def size: Int
    Definition Classes
    LinkedHashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce
  150. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  151. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  152. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  153. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  154. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  155. final def sizeMapBucketBitSize: Int
    Attributes
    protected
    Definition Classes
    HashUtils
  156. final def sizeMapBucketSize: Int
    Attributes
    protected
    Definition Classes
    HashUtils
  157. def sizeMapDisable(): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  158. def sizeMapInit(tableLength: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  159. def sizeMapInitAndRebuild(): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  160. val sizemap: Array[Int]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  161. def slice(from: Int, until: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  162. def sliding(size: Int, step: Int): Iterator[LinkedHashMap[A, B]]
    Definition Classes
    IterableLike
  163. def sliding(size: Int): Iterator[LinkedHashMap[A, B]]
    Definition Classes
    IterableLike
  164. def span(p: ((A, B)) ⇒ Boolean): (LinkedHashMap[A, B], LinkedHashMap[A, B])
    Definition Classes
    TraversableLike → GenTraversableLike
  165. def splitAt(n: Int): (LinkedHashMap[A, B], LinkedHashMap[A, B])
    Definition Classes
    TraversableLike → GenTraversableLike
  166. def stringPrefix: String
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  167. def sum[B >: (A, B)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  169. val table: Array[HashEntry[A, LinkedEntry[A, B]]]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  170. val tableSize: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  171. def tableSizeSeed: Int
    Attributes
    protected
    Definition Classes
    HashTable
  172. def tail: LinkedHashMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  173. def tails: Iterator[LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike
  174. def take(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  175. def takeRight(n: Int): LinkedHashMap[A, B]
    Definition Classes
    IterableLike
  176. def takeWhile(p: ((A, B)) ⇒ Boolean): LinkedHashMap[A, B]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  177. def thisCollection: Iterable[(A, B)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  178. val threshold: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  179. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  180. def toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toBuffer[E >: (A, B)]: Buffer[E]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  182. def toCollection(repr: LinkedHashMap[A, B]): Iterable[(A, B)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  183. def toIndexedSeq: IndexedSeq[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toIterable: Iterable[(A, B)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  185. def toIterator: Iterator[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  186. def toList: List[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def toSeq: Seq[(A, B)]
    Definition Classes
    MapLike → MapLike → TraversableOnce → GenTraversableOnce
  189. def toSet[B >: (A, B)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def toStream: Stream[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  191. def toString(): String
    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any
  192. def toTraversable: Traversable[(A, B)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  193. def toVector: Vector[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. def transform(f: (A, B) ⇒ B): SortedLinkedHashMap.this.type
    Definition Classes
    MapLike
  195. 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.

  196. def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  197. def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  198. def update(key: A, value: B): Unit
    Definition Classes
    MapLike
  199. def updated[V1 >: B](key: A, value: V1): Map[A, V1]
    Definition Classes
    MapLike → MapLike
  200. 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].

  201. def valuesIterator: Iterator[B]
    Definition Classes
    LinkedHashMap → MapLike → GenMapLike
  202. def view(from: Int, until: Int): IterableView[(A, B), LinkedHashMap[A, B]]
    Definition Classes
    IterableLike → TraversableLike
  203. def view: IterableView[(A, B), LinkedHashMap[A, B]]
    Definition Classes
    IterableLike → TraversableLike
  204. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  205. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  206. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  207. def withDefault(d: (A) ⇒ B): Map[A, B]
    Definition Classes
    Map
  208. def withDefaultValue(d: B): Map[A, B]
    Definition Classes
    Map
  209. def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), LinkedHashMap[A, B]]
    Definition Classes
    TraversableLike → FilterMonadic
  210. def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[LinkedHashMap[A, B], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  211. 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
  212. def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[LinkedHashMap[A, B], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  3. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

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