Packages

class EqHashMap[K <: AnyRef, V] extends Map[K, V] with MapLike[K, V, EqHashMap[K, V]] with EqHash[(K, V), EqHashMap[K, V]]

Linear Supertypes
EqHash[(K, V), EqHashMap[K, V]], Map[K, V], MapLike[K, V, EqHashMap[K, V]], Cloneable[EqHashMap[K, V]], Cloneable, Cloneable, Shrinkable[K], Builder[(K, V), EqHashMap[K, V]], Growable[(K, V)], Clearable, Map[K, V], MapLike[K, V, EqHashMap[K, V]], Subtractable[K, EqHashMap[K, V]], PartialFunction[K, V], (K) ⇒ V, GenMap[K, V], GenMapLike[K, V, EqHashMap[K, V]], Iterable[(K, V)], Iterable[(K, V)], IterableLike[(K, V), EqHashMap[K, V]], Equals, GenIterable[(K, V)], GenIterableLike[(K, V), EqHashMap[K, V]], Traversable[(K, V)], Mutable, Traversable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), Iterable], TraversableLike[(K, V), EqHashMap[K, V]], GenTraversableLike[(K, V), EqHashMap[K, V]], Parallelizable[(K, V), ParMap[K, V]], TraversableOnce[(K, V)], GenTraversableOnce[(K, V)], FilterMonadic[(K, V), EqHashMap[K, V]], HasNewBuilder[(K, V), EqHashMap[K, V]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EqHashMap
  2. EqHash
  3. Map
  4. MapLike
  5. Cloneable
  6. Cloneable
  7. Cloneable
  8. Shrinkable
  9. Builder
  10. Growable
  11. Clearable
  12. Map
  13. MapLike
  14. Subtractable
  15. PartialFunction
  16. Function1
  17. GenMap
  18. GenMapLike
  19. Iterable
  20. Iterable
  21. IterableLike
  22. Equals
  23. GenIterable
  24. GenIterableLike
  25. Traversable
  26. Mutable
  27. Traversable
  28. GenTraversable
  29. GenericTraversableTemplate
  30. TraversableLike
  31. GenTraversableLike
  32. Parallelizable
  33. TraversableOnce
  34. GenTraversableOnce
  35. FilterMonadic
  36. HasNewBuilder
  37. AnyRef
  38. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  7. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EqHashMap(other: EqHashMap[K, V])
  2. new EqHashMap(_sizeHint: Int = EqHash.defCapacity)

Type Members

  1. abstract class EqHashIterator[A] extends Iterator[A]
    Attributes
    protected
    Definition Classes
    EqHash
  2. class KeyIndexIterator extends (EqHash.this)#EqHashIterator[Int]
    Attributes
    protected
    Definition Classes
    EqHash
  3. class DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
  4. class DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
  5. class EntryIterator extends EqHashIterator[(K, V)]
    Attributes
    protected
  6. class FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
    Attributes
    protected
    Definition Classes
    MapLike
  7. class KeyIterator extends EqHashIterator[K]
    Attributes
    protected
  8. class MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
    Attributes
    protected
    Definition Classes
    MapLike
  9. type Self = EqHashMap[K, V]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  10. class ValueIterator extends EqHashIterator[V]
    Attributes
    protected
  11. 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 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): Map[K, 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 >: V](kv: (K, V1)): Map[K, 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 >: V](xs: GenTraversableOnce[(K, V1)]): Map[K, 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 >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  8. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  9. def ++=(xs: TraversableOnce[(K, V)]): EqHashMap.this.type
    Definition Classes
    Growable
  10. def +=(kv: (K, V)): EqHashMap.this.type
    Definition Classes
    EqHashMap → MapLike → Builder → Growable
  11. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): EqHashMap.this.type
    Definition Classes
    Growable
  12. def -(elem1: K, elem2: K, elems: K*): EqHashMap[K, V]
    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.

  13. def -(key: K): EqHashMap[K, V]
    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.

  14. def --(xs: GenTraversableOnce[K]): EqHashMap[K, V]
    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 --=(xs: TraversableOnce[K]): EqHashMap.this.type
    Definition Classes
    Shrinkable
  16. def -=(key: K): EqHashMap.this.type
    Definition Classes
    EqHashMap → MapLike → Shrinkable
  17. def -=(elem1: K, elem2: K, elems: K*): EqHashMap.this.type
    Definition Classes
    Shrinkable
  18. def ->[B](y: B): (EqHashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to ArrowAssoc[EqHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  19. def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def :\[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  22. val _size: Int
    Attributes
    protected
    Definition Classes
    EqHash
  23. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  24. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  26. def aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
    Definition Classes
    PartialFunction → Function1
  28. final def apply(key: K): V
    Definition Classes
    EqHashMap → MapLike → Function1 → GenMapLike
    Annotations
    @inline()
  29. def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  30. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  31. def canEqual(other: Any): Boolean
    Definition Classes
    EqHashMap → IterableLike → Equals
  32. def clear: Unit
    Definition Classes
    EqHash
  33. def clone(): EqHashMap[K, V]
    Definition Classes
    EqHashMap → MapLike → Cloneable → AnyRef
  34. final def closeDeletion(index: Int): Unit
    Attributes
    protected
    Definition Classes
    EqHash
  35. def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
    Definition Classes
    TraversableOnce
  37. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  38. def compose[A](g: (A) ⇒ K): (A) ⇒ V
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  39. final def contains(key: K): Boolean
    Definition Classes
    EqHashMap → MapLike → GenMapLike
    Annotations
    @inline()
  40. def containsElem(elem: (K, V)): Boolean
    Definition Classes
    EqHashMap → EqHash
  41. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  42. def copyToArray[B >: (K, V)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  45. def count(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def default(key: K): V
    Definition Classes
    MapLike → GenMapLike
  47. def drop(n: Int): EqHashMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  48. def dropRight(n: Int): EqHashMap[K, V]
    Definition Classes
    IterableLike
  49. def dropWhile(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def elemHashCode: (Array[AnyRef], Int) ⇒ Int
    Attributes
    protected
    Definition Classes
    EqHashMap → EqHash
  51. def empty: EqHashMap[K, V]
    Definition Classes
    EqHashMap → Map → Map → MapLike
  52. def ensuring(cond: (EqHashMap[K, V]) ⇒ Boolean, msg: ⇒ Any): EqHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  53. def ensuring(cond: (EqHashMap[K, V]) ⇒ Boolean): EqHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  54. def ensuring(cond: Boolean, msg: ⇒ Any): EqHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. def ensuring(cond: Boolean): EqHashMap[K, V]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  56. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  57. def equals(other: Any): Boolean
    Definition Classes
    EqHash → AnyRef → Any
  58. def exists(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def filter(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def filterKeys(p: (K) ⇒ Boolean): Map[K, V]
    Definition Classes
    MapLike → GenMapLike
  61. def filterNot(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  62. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  63. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  64. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  65. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  66. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  69. def forall(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  70. def foreach[U](f: ((K, V)) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  71. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to StringFormat[EqHashMap[K, V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  72. def from(other: EqHashMap[K, V]): Unit
    Definition Classes
    EqHash
  73. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  74. final def get(key: K): Option[V]
    Definition Classes
    EqHashMap → MapLike → GenMapLike
    Annotations
    @inline()
  75. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  76. def getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  77. def getOrElseUpdate(key: K, op: ⇒ V): V
    Definition Classes
    MapLike
  78. def getOrNull(key: K): AnyRef
  79. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, EqHashMap[K, V]]
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def grouped(size: Int): Iterator[EqHashMap[K, V]]
    Definition Classes
    IterableLike
  81. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  82. def hashCode(): Int
    Definition Classes
    EqHash → AnyRef → Any
  83. def head: (K, V)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  84. def headOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  85. final def index(key: AnyRef): Int
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  86. def index(maskedKey: AnyRef, keyHash: Int, tabLength: Int): Int
    Attributes
    protected
    Definition Classes
    EqHash
  87. def init: EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  88. def inits: Iterator[EqHashMap[K, V]]
    Definition Classes
    TraversableLike
  89. def isDefinedAt(key: K): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  90. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  91. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  92. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  93. def iterator: Iterator[(K, V)]
    Definition Classes
    EqHashMap → MapLike → IterableLike → GenIterableLike
  94. def keySet: Set[K]
    Definition Classes
    MapLike → GenMapLike
  95. def keys: Iterable[K]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  96. def keysIterator: Iterator[K]
    Definition Classes
    EqHashMap → MapLike → GenMapLike
  97. def last: (K, V)
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def lastOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def lift: (K) ⇒ Option[V]
    Definition Classes
    PartialFunction
  100. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  101. def mapResult[NewTo](f: (EqHashMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
    Definition Classes
    Builder
  102. def mapValues[W](f: (V) ⇒ W): Map[K, W]
    Definition Classes
    MapLike → GenMapLike
  103. final def maskNull(key: AnyRef): AnyRef
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  104. def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. final def maxCapacity: Int
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  107. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def move(oldTable: Array[AnyRef], oldLength: Int, newTable: Array[AnyRef], newLength: Int): Unit
    Attributes
    protected
    Definition Classes
    EqHashMap → EqHash
  113. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  114. def newBuilder: Builder[(K, V), EqHashMap[K, V]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → HasNewBuilder
  115. final def nextKeyIndex(i: Int, len: Int): Int
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  116. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  118. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  119. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  120. def par: ParMap[K, V]
    Definition Classes
    Parallelizable
  121. def parCombiner: Combiner[(K, V), ParMap[K, V]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable
  122. def partition(p: ((K, V)) ⇒ Boolean): (EqHashMap[K, V], EqHashMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def product[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. def put(key: K, value: V): Option[V]
    Definition Classes
    EqHashMap → MapLike
  125. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce
  127. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  130. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def remove(key: K): Option[V]
    Definition Classes
    EqHashMap → MapLike
  132. def repr: EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def resize: Unit
    Attributes
    protected
    Definition Classes
    EqHash
  134. def result(): EqHashMap[K, V]
    Definition Classes
    MapLike → Builder
  135. def retain(p: (K, V) ⇒ Boolean): EqHashMap.this.type
    Definition Classes
    MapLike
  136. def reversed: List[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  137. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
    Definition Classes
    PartialFunction
  138. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  139. def scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  140. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  141. def scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], 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.

  142. def seq: Map[K, V]
    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  143. final def size: Int
    Definition Classes
    EqHash
    Annotations
    @inline()
  144. final def sizeHint: Int
    Attributes
    protected
    Definition Classes
    EqHashMap → EqHash
  145. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  146. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  147. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  148. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  149. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  150. def slice(from: Int, until: Int): EqHashMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  151. def sliding(size: Int, step: Int): Iterator[EqHashMap[K, V]]
    Definition Classes
    IterableLike
  152. def sliding(size: Int): Iterator[EqHashMap[K, V]]
    Definition Classes
    IterableLike
  153. def span(p: ((K, V)) ⇒ Boolean): (EqHashMap[K, V], EqHashMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def splitAt(n: Int): (EqHashMap[K, V], EqHashMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  155. final def step: Int
    Attributes
    protected
    Definition Classes
    EqHashMap → EqHash
  156. def stringPrefix: String
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  157. def sum[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  159. val table: Array[AnyRef]
    Attributes
    protected
    Definition Classes
    EqHash
  160. def tail: EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  161. def tails: Iterator[EqHashMap[K, V]]
    Definition Classes
    TraversableLike
  162. def take(n: Int): EqHashMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  163. def takeRight(n: Int): EqHashMap[K, V]
    Definition Classes
    IterableLike
  164. def takeWhile(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  165. def thisCollection: Iterable[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  166. val threshold: Int
    Attributes
    protected
    Definition Classes
    EqHash
  167. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  168. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toBuffer[E >: (K, V)]: Buffer[E]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  170. def toCollection(repr: EqHashMap[K, V]): Iterable[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  171. def toIndexedSeq: IndexedSeq[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def toIterable: Iterable[(K, V)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  173. def toIterator: Iterator[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  174. def toList: List[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  176. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to CollectionsHaveToParArray[EqHashMap[K, V], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (EqHashMap[K, V]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  177. def toSeq: Seq[(K, V)]
    Definition Classes
    MapLike → MapLike → TraversableOnce → GenTraversableOnce
  178. def toSet[B >: (K, V)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. def toStream: Stream[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  180. def toString(): String
    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any
  181. def toTraversable: Traversable[(K, V)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  182. def toVector: Vector[(K, V)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  183. def transform(f: (K, V) ⇒ V): EqHashMap.this.type
    Definition Classes
    MapLike
  184. def transpose[B](implicit asTraversable: ((K, V)) ⇒ 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.

  185. final def unmaskNull(key: AnyRef): AnyRef
    Attributes
    protected
    Definition Classes
    EqHash
    Annotations
    @inline()
  186. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  187. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  188. def update(key: K, value: V): Unit
    Definition Classes
    MapLike
  189. def updated[V1 >: V](key: K, value: V1): Map[K, V1]
    Definition Classes
    MapLike → MapLike
  190. def values: Iterable[V]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  191. def valuesIterator: Iterator[V]
    Definition Classes
    EqHashMap → MapLike → GenMapLike
  192. def view(from: Int, until: Int): IterableView[(K, V), EqHashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  193. def view: IterableView[(K, V), EqHashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  194. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  195. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  196. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  197. def withDefault(d: (K) ⇒ V): Map[K, V]
    Definition Classes
    Map
  198. def withDefaultValue(d: V): Map[K, V]
    Definition Classes
    Map
  199. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), EqHashMap[K, V]]
    Definition Classes
    TraversableLike → FilterMonadic
  200. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  201. def zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  202. def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  203. def →[B](y: B): (EqHashMap[K, V], B)
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to ArrowAssoc[EqHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to any2stringadd[EqHashMap[K, V]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: any2stringadd[EqHashMap[K, V]]).+(other)
    Definition Classes
    any2stringadd
  2. def filter(p: ((K, V)) ⇒ Boolean): TraversableOnce[(K, V)]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).filter(p)
    Definition Classes
    MonadOps
  3. def flatMap[B](f: ((K, V)) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).flatMap(f)
    Definition Classes
    MonadOps
  4. def map[B](f: ((K, V)) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).map(f)
    Definition Classes
    MonadOps
  5. def withFilter(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
    Implicit
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from EqHash[(K, V), EqHashMap[K, V]]

Inherited from Map[K, V]

Inherited from MapLike[K, V, EqHashMap[K, V]]

Inherited from Cloneable[EqHashMap[K, V]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[K]

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

Inherited from Growable[(K, V)]

Inherited from Clearable

Inherited from Map[K, V]

Inherited from MapLike[K, V, EqHashMap[K, V]]

Inherited from Subtractable[K, EqHashMap[K, V]]

Inherited from PartialFunction[K, V]

Inherited from (K) ⇒ V

Inherited from GenMap[K, V]

Inherited from GenMapLike[K, V, EqHashMap[K, V]]

Inherited from Iterable[(K, V)]

Inherited from Iterable[(K, V)]

Inherited from IterableLike[(K, V), EqHashMap[K, V]]

Inherited from Equals

Inherited from GenIterable[(K, V)]

Inherited from GenIterableLike[(K, V), EqHashMap[K, V]]

Inherited from Traversable[(K, V)]

Inherited from Mutable

Inherited from Traversable[(K, V)]

Inherited from GenTraversable[(K, V)]

Inherited from GenericTraversableTemplate[(K, V), Iterable]

Inherited from TraversableLike[(K, V), EqHashMap[K, V]]

Inherited from GenTraversableLike[(K, V), EqHashMap[K, V]]

Inherited from Parallelizable[(K, V), ParMap[K, V]]

Inherited from TraversableOnce[(K, V)]

Inherited from GenTraversableOnce[(K, V)]

Inherited from FilterMonadic[(K, V), EqHashMap[K, V]]

Inherited from HasNewBuilder[(K, V), EqHashMap[K, V]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray from EqHashMap[K, V] to CollectionsHaveToParArray[EqHashMap[K, V], T]

Inherited by implicit conversion MonadOps from EqHashMap[K, V] to MonadOps[(K, V)]

Inherited by implicit conversion any2stringadd from EqHashMap[K, V] to any2stringadd[EqHashMap[K, V]]

Inherited by implicit conversion StringFormat from EqHashMap[K, V] to StringFormat[EqHashMap[K, V]]

Inherited by implicit conversion Ensuring from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]]

Inherited by implicit conversion ArrowAssoc from EqHashMap[K, V] to ArrowAssoc[EqHashMap[K, V]]

Inherited by implicit conversion alternateImplicit from EqHashMap[K, V] to ForceImplicitAmbiguity

Ungrouped