Packages

class BiMap[K, V] extends HashMap[K, V]

The BiMap class maps keys to values and values to keys.

K

the key type

V

the value type

Linear Supertypes
HashMap[K, V], Serializable, Serializable, CustomParallelizable[(K, V), ParHashMap[K, V]], HashTable[K, DefaultEntry[K, V]], HashUtils[K], AbstractMap[K, V], Map[K, V], MapLike[K, V, HashMap[K, V]], Cloneable[HashMap[K, V]], Cloneable, Cloneable, Shrinkable[K], Builder[(K, V), HashMap[K, V]], Growable[(K, V)], Clearable, Iterable[(K, V)], Traversable[(K, V)], Mutable, AbstractMap[K, V], Map[K, V], MapLike[K, V, HashMap[K, V]], Subtractable[K, HashMap[K, V]], PartialFunction[K, V], (K) ⇒ V, GenMap[K, V], GenMapLike[K, V, HashMap[K, V]], AbstractIterable[(K, V)], Iterable[(K, V)], IterableLike[(K, V), HashMap[K, V]], Equals, GenIterable[(K, V)], GenIterableLike[(K, V), HashMap[K, V]], AbstractTraversable[(K, V)], Traversable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), Iterable], TraversableLike[(K, V), HashMap[K, V]], GenTraversableLike[(K, V), HashMap[K, V]], Parallelizable[(K, V), ParHashMap[K, V]], TraversableOnce[(K, V)], GenTraversableOnce[(K, V)], FilterMonadic[(K, V), HashMap[K, V]], HasNewBuilder[(K, V), HashMap[K, V]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BiMap
  2. HashMap
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. HashTable
  7. HashUtils
  8. AbstractMap
  9. Map
  10. MapLike
  11. Cloneable
  12. Cloneable
  13. Cloneable
  14. Shrinkable
  15. Builder
  16. Growable
  17. Clearable
  18. Iterable
  19. Traversable
  20. Mutable
  21. AbstractMap
  22. Map
  23. MapLike
  24. Subtractable
  25. PartialFunction
  26. Function1
  27. GenMap
  28. GenMapLike
  29. AbstractIterable
  30. Iterable
  31. IterableLike
  32. Equals
  33. GenIterable
  34. GenIterableLike
  35. AbstractTraversable
  36. Traversable
  37. GenTraversable
  38. GenericTraversableTemplate
  39. TraversableLike
  40. GenTraversableLike
  41. Parallelizable
  42. TraversableOnce
  43. GenTraversableOnce
  44. FilterMonadic
  45. HasNewBuilder
  46. AnyRef
  47. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BiMap()

Type Members

  1. type Entry = DefaultEntry[K, V]
    Definition Classes
    HashMap
  2. 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[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++=(xs: TraversableOnce[(K, V)]): BiMap.this.type
    Definition Classes
    Growable
  8. def +=(kv: (K, V)): BiMap.this.type
    Definition Classes
    HashMap → MapLike → Builder → Growable
  9. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): BiMap.this.type
    Definition Classes
    Growable
  10. def -(elem1: K, elem2: K, elems: K*): HashMap[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): HashMap[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]): HashMap[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]): BiMap.this.type
    Definition Classes
    Shrinkable
  14. def -=(key: K): BiMap.this.type
    Definition Classes
    HashMap → MapLike → Shrinkable
  15. def -=(elem1: K, elem2: K, elems: K*): BiMap.this.type
    Definition Classes
    Shrinkable
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  17. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  18. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  19. def aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
    Definition Classes
    PartialFunction → Function1
  21. def apply(key: K): V
    Definition Classes
    HashMap → MapLike → Function1 → GenMapLike
  22. def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  23. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  24. def clear(): Unit
    Definition Classes
    HashMap → MapLike → Builder → Growable → Clearable
  25. def clone(): HashMap[K, V]
    Definition Classes
    MapLike → Cloneable → AnyRef
  26. def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
    Definition Classes
    TraversableOnce
  28. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  29. def compose[A](g: (A) ⇒ K): (A) ⇒ V
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  30. def contains(key: K): Boolean
    Definition Classes
    HashMap → MapLike → GenMapLike
  31. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: (K, V)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  35. def count(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def default(key: K): V
    Definition Classes
    MapLike → GenMapLike
  37. def drop(n: Int): HashMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  38. def dropRight(n: Int): HashMap[K, V]
    Definition Classes
    IterableLike
  39. def dropWhile(p: ((K, V)) ⇒ Boolean): HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def empty: HashMap[K, V]
    Definition Classes
    HashMap → Map → Map → MapLike
  41. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  42. def exists(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def filter(p: ((K, V)) ⇒ Boolean): HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def filterKeys(p: (K) ⇒ Boolean): Map[K, V]
    Definition Classes
    MapLike → GenMapLike
  45. def filterNot(p: ((K, V)) ⇒ Boolean): HashMap[K, V]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  46. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  47. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  48. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  49. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  52. def forall(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def foreach[U](f: ((K, V)) ⇒ U): Unit
    Definition Classes
    HashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  54. def from(v: V): K

    Given the a value 'v', return the most recent key it was entered with.

    Given the a value 'v', return the most recent key it was entered with. If values are unqiue, keys and values will be one-to-one correspondence. Note, if all keys are needed should use a MultiMap.

    v

    the value whose key is sought

  55. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  56. def get(key: K): Option[V]
    Definition Classes
    HashMap → MapLike → GenMapLike
  57. def getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  58. def getOrElseUpdate(key: K, defaultValue: ⇒ V): V
    Definition Classes
    HashMap → MapLike
  59. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, HashMap[K, V]]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def grouped(size: Int): Iterator[HashMap[K, V]]
    Definition Classes
    IterableLike
  61. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  62. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  63. def head: (K, V)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  64. def headOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def init: HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def inits: Iterator[HashMap[K, V]]
    Definition Classes
    TraversableLike
  67. def isDefinedAt(key: K): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  68. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  69. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  70. def iterator: Iterator[(K, V)]
    Definition Classes
    HashMap → MapLike → IterableLike → GenIterableLike
  71. def keySet: Set[K]
    Definition Classes
    HashMap → MapLike → GenMapLike
  72. 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].

  73. def keysIterator: Iterator[K]
    Definition Classes
    HashMap → MapLike → GenMapLike
  74. def last: (K, V)
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def lastOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def lift: (K) ⇒ Option[V]
    Definition Classes
    PartialFunction
  77. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  78. def mapResult[NewTo](f: (HashMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
    Definition Classes
    Builder
  79. def mapValues[W](f: (V) ⇒ W): Map[K, W]
    Definition Classes
    MapLike → GenMapLike
  80. def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  89. def par: ParHashMap[K, V]
    Definition Classes
    HashMap → CustomParallelizable → Parallelizable
  90. def partition(p: ((K, V)) ⇒ Boolean): (HashMap[K, V], HashMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def product[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def put(kv: (K, V)): BiMap.this.type

    Put the (key, value) to the map.

    Put the (key, value) to the map.

    kv

    the key-value pair

  93. def put(key: K, value: V): Option[V]
    Definition Classes
    HashMap → MapLike
  94. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce
  96. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  99. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def remove(key: K): Option[V]
    Definition Classes
    HashMap → MapLike
  101. def repr: HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def result(): HashMap[K, V]
    Definition Classes
    MapLike → Builder
  103. def retain(p: (K, V) ⇒ Boolean): BiMap.this.type
    Definition Classes
    MapLike
  104. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
    Definition Classes
    PartialFunction
  105. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  106. def scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[HashMap[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.

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

  143. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  144. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  145. def update(key: K, value: V): Unit
    Definition Classes
    HashMap → MapLike
  146. def updated[V1 >: V](key: K, value: V1): Map[K, V1]
    Definition Classes
    MapLike → MapLike
  147. def useSizeMap(t: Boolean): Unit
    Definition Classes
    HashMap
  148. def values: Iterable[V]
    Definition Classes
    HashMap → MapLike → GenMapLike
  149. def valuesIterator: Iterator[V]
    Definition Classes
    HashMap → MapLike → GenMapLike
  150. def view(from: Int, until: Int): IterableView[(K, V), HashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  151. def view: IterableView[(K, V), HashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  152. def withDefault(d: (K) ⇒ V): Map[K, V]
    Definition Classes
    Map
  153. def withDefaultValue(d: V): Map[K, V]
    Definition Classes
    Map
  154. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), HashMap[K, V]]
    Definition Classes
    TraversableLike → FilterMonadic
  155. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  156. def zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  157. def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[HashMap[K, V], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

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

    (Since version 2.12.10) Use foldLeft instead of /:

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

    (Since version 2.12.10) Use foldRight instead of :\