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], Map[A, B], MapLike[A, B, LinkedHashMap[A, B]], Cloneable[LinkedHashMap[A, B]], Shrinkable[A], Builder[(A, B), LinkedHashMap[A, B]], Growable[(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]], Iterable[(A, B)], Iterable[(A, B)], IterableLike[(A, B), LinkedHashMap[A, B]], Equals, GenIterable[(A, B)], GenIterableLike[(A, B), LinkedHashMap[A, B]], Traversable[(A, B)], Mutable, 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. Hide All
  2. Show all
  1. SortedLinkedHashMap
  2. LinkedHashMap
  3. Serializable
  4. Serializable
  5. HashTable
  6. HashUtils
  7. Map
  8. MapLike
  9. Cloneable
  10. Shrinkable
  11. Builder
  12. Growable
  13. Map
  14. MapLike
  15. Subtractable
  16. PartialFunction
  17. Function1
  18. GenMap
  19. GenMapLike
  20. Iterable
  21. Iterable
  22. IterableLike
  23. Equals
  24. GenIterable
  25. GenIterableLike
  26. Traversable
  27. Mutable
  28. Traversable
  29. GenTraversable
  30. GenericTraversableTemplate
  31. TraversableLike
  32. GenTraversableLike
  33. Parallelizable
  34. TraversableOnce
  35. GenTraversableOnce
  36. FilterMonadic
  37. HasNewBuilder
  38. AnyRef
  39. Any
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. type Self = LinkedHashMap[A, B]

    Attributes
    protected
    Definition Classes
    TraversableLike

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    Growable

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

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

    Definition Classes
    LinkedHashMap → MapLike → Builder → Growable

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

    Definition Classes
    Growable

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

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

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

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

    Definition Classes
    Shrinkable

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

    Definition Classes
    LinkedHashMap → MapLike → Shrinkable

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

    Definition Classes
    Shrinkable

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  21. def /:\[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  25. var _loadFactor: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    MapLike → TraversableOnce

  28. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  31. def alwaysInitSizeMap: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    PartialFunction → Function1

  33. def apply(key: A): B

    Definition Classes
    MapLike → GenMapLike → Function1

  34. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  35. def calcSizeMapSize(tableLength: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable

  36. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  37. def clear(): Unit

    Definition Classes
    LinkedHashMap → MapLike → Builder → Growable

  38. def clearTable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    MapLike → Cloneable → AnyRef

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce

  42. def companion: GenericCompanion[Iterable]

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

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

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

    Definition Classes
    Function1

  45. def contains(key: A): Boolean

    Definition Classes
    MapLike

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  51. def default(key: A): B

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  56. def elemHashCode(key: A): Int

    Attributes
    protected
    Definition Classes
    HashUtils

  57. def empty: LinkedHashMap[A, B]

    Definition Classes
    LinkedHashMap → Map → Map → MapLike

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    AnyRef

  60. def equals(that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike

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

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  65. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  67. def findEntry(key: A): 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 fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

  75. final def foreachEntry[C](f: (LinkedEntry[A, B]) ⇒ C): Unit

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    LinkedHashMap → MapLike → GenMapLike

  78. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any

  79. def getFirstEntry(): Entry

    Get the first entry in the SortedLinkedHashMap.

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

    Definition Classes
    MapLike

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

    Definition Classes
    MapLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

  84. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  85. def hashCode(): Int

    Definition Classes
    GenMapLike → AnyRef → Any

  86. def head: (A, B)

    Definition Classes
    IterableLike → GenIterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

  88. final def improve(hcode: Int): Int

    Attributes
    protected
    Definition Classes
    HashUtils

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

    Attributes
    protected
    Definition Classes
    HashTable

  90. def init: LinkedHashMap[A, B]

    Definition Classes
    TraversableLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  92. def initialSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike

  94. def isDefinedAt(key: A): Boolean

    Definition Classes
    MapLike → PartialFunction

  95. def isEmpty: Boolean

    Definition Classes
    MapLike → IterableLike → GenIterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  96. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  97. def isSizeMapDefined: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  98. final def isTraversableAgain: Boolean

    Definition Classes
    GenTraversableLike → GenTraversableOnce

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

    Definition Classes
    LinkedHashMap → MapLike → IterableLike → GenIterableLike

  100. def keySet: Set[A]

    Definition Classes
    MapLike

  101. def keys: Iterable[A]

    Definition Classes
    MapLike
    Annotations
    @migration
    Migration

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

  102. def keysIterator: Iterator[A]

    Definition Classes
    LinkedHashMap → MapLike

  103. def last: (A, B)

    Definition Classes
    TraversableLike

  104. var lastEntry: Entry

    Attributes
    protected
    Definition Classes
    LinkedHashMap

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    Builder

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

    Definition Classes
    MapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

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

  119. def nnSizeMapAdd(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  120. def nnSizeMapRemove(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  121. def nnSizeMapReset(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  122. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. final def notify(): Unit

    Definition Classes
    AnyRef

  124. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    PartialFunction

  126. implicit val ordering: Ordering[A]

  127. def par: ParMap[A, B]

    Definition Classes
    Parallelizable

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    LinkedHashMap → MapLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  140. def repr: LinkedHashMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike → Builder

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

    Definition Classes
    MapLike

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

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Definition Classes
    IterableLike → GenIterableLike

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

  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: scala.collection.TraversableLike[_, _], delta: Int): Unit

    Definition Classes
    Builder

  151. def sizeHint(size: Int): Unit

    Definition Classes
    Builder

  152. def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

    Definition Classes
    Builder

  153. final def sizeMapBucketBitSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  154. final def sizeMapBucketSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  155. def sizeMapDisable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  156. def sizeMapInit(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  157. def sizeMapInitAndRebuild(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  158. var sizemap: Array[Int]

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  164. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Attributes
    protected
    Definition Classes
    HashTable

  168. var tableSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

  169. def tail: LinkedHashMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  175. var threshold: Int

    Attributes
    protected
    Definition Classes
    HashTable

  176. def toArray[B >: (A, B)](implicit arg0: ClassManifest[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  187. def toString(): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike

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

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    MapLike

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

    Definition Classes
    MapLike → MapLike

  195. def values: Iterable[B]

    Definition Classes
    MapLike
    Annotations
    @migration
    Migration

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

  196. def valuesIterator: Iterator[B]

    Definition Classes
    LinkedHashMap → MapLike

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

    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike

  199. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    Map

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

    Definition Classes
    Map

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

    Definition Classes
    TraversableLike → FilterMonadic

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

    Definition Classes
    IterableLike → GenIterableLike

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

  207. 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 elements: Iterator[(A, B)]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use iterator' instead

  2. def entries: Iterator[LinkedEntry[A, B]]

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use entriesIterator instead

  3. def first: (A, B)

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use head' instead

  4. def firstOption: Option[(A, B)]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use headOption' instead

  5. def mapElements[C](f: (B) ⇒ C): Map[A, C]

    Definition Classes
    MapLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use mapValues' instead

  6. def projection: IterableView[(A, B), LinkedHashMap[A, B]]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) use view' instead

  7. def removeKey(key: A): Option[B]

    Definition Classes
    MapLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.8.0) Use remove' instead

Inherited from LinkedHashMap[A, B]

Inherited from Serializable

Inherited from Serializable

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

Inherited from HashUtils[A]

Inherited from Map[A, B]

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

Inherited from Cloneable[LinkedHashMap[A, B]]

Inherited from Shrinkable[A]

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

Inherited from Growable[(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 Iterable[(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 Traversable[(A, B)]

Inherited from Mutable

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