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. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

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

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

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

  4. def ++[B >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++=(xs: TraversableOnce[(K, V)]): EqHashMap.this.type
    Definition Classes
    Growable
  8. def +=(kv: (K, V)): EqHashMap.this.type
    Definition Classes
    EqHashMap → MapLike → Builder → Growable
  9. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): EqHashMap.this.type
    Definition Classes
    Growable
  10. 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.

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

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

  13. def --=(xs: TraversableOnce[K]): EqHashMap.this.type
    Definition Classes
    Shrinkable
  14. def -=(key: K): EqHashMap.this.type
    Definition Classes
    EqHashMap → MapLike → Shrinkable
  15. def -=(elem1: K, elem2: K, elems: K*): EqHashMap.this.type
    Definition Classes
    Shrinkable
  16. def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. def :\[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  19. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  20. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  21. def aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
    Definition Classes
    PartialFunction → Function1
  23. final def apply(key: K): V
    Definition Classes
    EqHashMap → MapLike → Function1 → GenMapLike
    Annotations
    @inline()
  24. def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  25. def canEqual(other: Any): Boolean
    Definition Classes
    EqHashMap → IterableLike → Equals
  26. def clear: Unit
    Definition Classes
    EqHash
  27. def clone(): EqHashMap[K, V]
    Definition Classes
    EqHashMap → MapLike → Cloneable → AnyRef
  28. def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  29. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
    Definition Classes
    TraversableOnce
  30. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  31. def compose[A](g: (A) ⇒ K): (A) ⇒ V
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  32. final def contains(key: K): Boolean
    Definition Classes
    EqHashMap → MapLike → GenMapLike
    Annotations
    @inline()
  33. def containsElem(elem: (K, V)): Boolean
    Definition Classes
    EqHashMapEqHash
  34. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  35. def copyToArray[B >: (K, V)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  38. def count(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def default(key: K): V
    Definition Classes
    MapLike → GenMapLike
  40. def drop(n: Int): EqHashMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  41. def dropRight(n: Int): EqHashMap[K, V]
    Definition Classes
    IterableLike
  42. def dropWhile(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  43. def empty: EqHashMap[K, V]
    Definition Classes
    EqHashMap → Map → Map → MapLike
  44. def equals(other: Any): Boolean
    Definition Classes
    EqHash → AnyRef → Any
  45. def exists(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def filter(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def filterKeys(p: (K) ⇒ Boolean): Map[K, V]
    Definition Classes
    MapLike → GenMapLike
  48. def filterNot(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  49. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  51. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  52. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  55. def forall(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def foreach[U](f: ((K, V)) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  57. def from(other: EqHashMap[K, V]): Unit
    Definition Classes
    EqHash
  58. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  59. final def get(key: K): Option[V]
    Definition Classes
    EqHashMap → MapLike → GenMapLike
    Annotations
    @inline()
  60. def getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  61. def getOrElseUpdate(key: K, op: ⇒ V): V
    Definition Classes
    MapLike
  62. def getOrNull(key: K): AnyRef
  63. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, EqHashMap[K, V]]
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def grouped(size: Int): Iterator[EqHashMap[K, V]]
    Definition Classes
    IterableLike
  65. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  66. def hashCode(): Int
    Definition Classes
    EqHash → AnyRef → Any
  67. def head: (K, V)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  68. def headOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def init: EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def inits: Iterator[EqHashMap[K, V]]
    Definition Classes
    TraversableLike
  71. def isDefinedAt(key: K): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  72. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  73. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  74. def iterator: Iterator[(K, V)]
    Definition Classes
    EqHashMap → MapLike → IterableLike → GenIterableLike
  75. def keySet: Set[K]
    Definition Classes
    MapLike → GenMapLike
  76. 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].

  77. def keysIterator: Iterator[K]
    Definition Classes
    EqHashMap → MapLike → GenMapLike
  78. def last: (K, V)
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def lastOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def lift: (K) ⇒ Option[V]
    Definition Classes
    PartialFunction
  81. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  82. def mapResult[NewTo](f: (EqHashMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
    Definition Classes
    Builder
  83. def mapValues[W](f: (V) ⇒ W): Map[K, W]
    Definition Classes
    MapLike → GenMapLike
  84. def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  93. def par: ParMap[K, V]
    Definition Classes
    Parallelizable
  94. def partition(p: ((K, V)) ⇒ Boolean): (EqHashMap[K, V], EqHashMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def product[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def put(key: K, value: V): Option[V]
    Definition Classes
    EqHashMap → MapLike
  97. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce
  99. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  102. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def remove(key: K): Option[V]
    Definition Classes
    EqHashMap → MapLike
  104. def repr: EqHashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def result(): EqHashMap[K, V]
    Definition Classes
    MapLike → Builder
  106. def retain(p: (K, V) ⇒ Boolean): EqHashMap.this.type
    Definition Classes
    MapLike
  107. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
    Definition Classes
    PartialFunction
  108. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  109. 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
  110. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  111. 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.

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

  147. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  148. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  149. def update(key: K, value: V): Unit
    Definition Classes
    MapLike
  150. def updated[V1 >: V](key: K, value: V1): Map[K, V1]
    Definition Classes
    MapLike → MapLike
  151. 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].

  152. def valuesIterator: Iterator[V]
    Definition Classes
    EqHashMap → MapLike → GenMapLike
  153. def view(from: Int, until: Int): IterableView[(K, V), EqHashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  154. def view: IterableView[(K, V), EqHashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  155. def withDefault(d: (K) ⇒ V): Map[K, V]
    Definition Classes
    Map
  156. def withDefaultValue(d: V): Map[K, V]
    Definition Classes
    Map
  157. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), EqHashMap[K, V]]
    Definition Classes
    TraversableLike → FilterMonadic
  158. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  159. 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
  160. def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Shadowed Implicit Value Members

  1. 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
  2. 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
  3. 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
  4. 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