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. class DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
    Annotations
    @SerialVersionUID()
  2. class DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
  3. type Entry = DefaultEntry[K, V]
    Definition Classes
    HashMap
  4. class FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
    Attributes
    protected
    Definition Classes
    MapLike
  5. class MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
    Attributes
    protected
    Definition Classes
    MapLike
  6. type Self = HashMap[K, V]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  7. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +[V1 >: 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[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  8. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike
  9. def ++=(xs: TraversableOnce[(K, V)]): BiMap.this.type
    Definition Classes
    Growable
  10. def +=(kv: (K, V)): BiMap.this.type
    Definition Classes
    HashMap → MapLike → Builder → Growable
  11. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): BiMap.this.type
    Definition Classes
    Growable
  12. 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.

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

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

  15. def --=(xs: TraversableOnce[K]): BiMap.this.type
    Definition Classes
    Shrinkable
  16. def -=(key: K): BiMap.this.type
    Definition Classes
    HashMap → MapLike → Shrinkable
  17. def -=(elem1: K, elem2: K, elems: K*): BiMap.this.type
    Definition Classes
    Shrinkable
  18. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. val _loadFactor: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  20. def addEntry(e: DefaultEntry[K, V]): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  21. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  22. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  23. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  24. def aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def alwaysInitSizeMap: Boolean
    Attributes
    protected
    Definition Classes
    HashTable
  26. def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
    Definition Classes
    PartialFunction → Function1
  27. def apply(key: K): V
    Definition Classes
    HashMap → MapLike → Function1 → GenMapLike
  28. def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  29. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  30. def calcSizeMapSize(tableLength: Int): Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  31. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  32. def clear(): Unit
    Definition Classes
    HashMap → MapLike → Builder → Growable → Clearable
  33. def clearTable(): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  34. def clone(): HashMap[K, V]
    Definition Classes
    MapLike → Cloneable → AnyRef
  35. def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[HashMap[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. def contains(key: K): Boolean
    Definition Classes
    HashMap → MapLike → GenMapLike
  40. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  41. def copyToArray[B >: (K, V)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  44. def count(p: ((K, V)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def createNewEntry[B1](key: K, value: B1): Entry
    Attributes
    protected
    Definition Classes
    HashMap → HashTable
  46. def default(key: K): V
    Definition Classes
    MapLike → GenMapLike
  47. def drop(n: Int): HashMap[K, V]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  48. def dropRight(n: Int): HashMap[K, V]
    Definition Classes
    IterableLike
  49. def dropWhile(p: ((K, V)) ⇒ Boolean): HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def elemEquals(key1: K, key2: K): Boolean
    Attributes
    protected
    Definition Classes
    HashTable
  51. def elemHashCode(key: K): Int
    Attributes
    protected
    Definition Classes
    HashUtils
  52. def empty: HashMap[K, V]
    Definition Classes
    HashMap → Map → Map → MapLike
  53. def entriesIterator: Iterator[DefaultEntry[K, V]]
    Attributes
    protected
    Definition Classes
    HashTable
  54. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  55. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  56. def exists(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def filter(p: ((K, V)) ⇒ Boolean): HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def filterKeys(p: (K) ⇒ Boolean): Map[K, V]
    Definition Classes
    MapLike → GenMapLike
  59. def filterNot(p: ((K, V)) ⇒ Boolean): HashMap[K, V]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  60. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def findEntry(key: K): DefaultEntry[K, V]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  62. def findOrAddEntry[B](key: K, value: B): DefaultEntry[K, V]
    Attributes
    protected
    Definition Classes
    HashTable
  63. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  64. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  65. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  68. def forall(p: ((K, V)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  69. def foreach[U](f: ((K, V)) ⇒ U): Unit
    Definition Classes
    HashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  70. def foreachEntry[U](f: (DefaultEntry[K, V]) ⇒ U): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  71. 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

  72. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  73. def get(key: K): Option[V]
    Definition Classes
    HashMap → MapLike → GenMapLike
  74. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  75. def getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  76. def getOrElseUpdate(key: K, defaultValue: ⇒ V): V
    Definition Classes
    HashMap → MapLike
  77. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, HashMap[K, V]]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def grouped(size: Int): Iterator[HashMap[K, V]]
    Definition Classes
    IterableLike
  79. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  80. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  81. def head: (K, V)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  82. def headOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  83. final def improve(hcode: Int, seed: Int): Int
    Attributes
    protected
    Definition Classes
    HashUtils
  84. final def index(hcode: Int): Int
    Attributes
    protected
    Definition Classes
    HashTable
  85. def init: HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def initWithContents(c: Contents[K, DefaultEntry[K, V]]): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  87. def initialSize: Int
    Attributes
    protected
    Definition Classes
    HashTable
  88. def inits: Iterator[HashMap[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. def isSizeMapDefined: Boolean
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  93. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  94. def iterator: Iterator[(K, V)]
    Definition Classes
    HashMap → MapLike → IterableLike → GenIterableLike
  95. def keySet: Set[K]
    Definition Classes
    HashMap → MapLike → GenMapLike
  96. 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].

  97. def keysIterator: Iterator[K]
    Definition Classes
    HashMap → MapLike → GenMapLike
  98. def last: (K, V)
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def lastOption: Option[(K, V)]
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def lift: (K) ⇒ Option[V]
    Definition Classes
    PartialFunction
  101. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  102. def mapResult[NewTo](f: (HashMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
    Definition Classes
    Builder
  103. def mapValues[W](f: (V) ⇒ W): Map[K, W]
    Definition Classes
    MapLike → GenMapLike
  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. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  112. def newBuilder: Builder[(K, V), HashMap[K, V]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → HasNewBuilder
  113. def nnSizeMapAdd(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  114. def nnSizeMapRemove(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  115. def nnSizeMapReset(tableLength: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  116. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  118. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  119. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  120. def par: ParHashMap[K, V]
    Definition Classes
    HashMap → CustomParallelizable → Parallelizable
  121. def parCombiner: Combiner[(K, V), ParHashMap[K, V]]
    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable
  122. def partition(p: ((K, V)) ⇒ Boolean): (HashMap[K, V], HashMap[K, V])
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def product[B >: (K, V)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. 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

  125. def put(key: K, value: V): Option[V]
    Definition Classes
    HashMap → MapLike
  126. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
    Definition Classes
    TraversableOnce
  128. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  131. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def remove(key: K): Option[V]
    Definition Classes
    HashMap → MapLike
  133. def removeEntry(key: K): DefaultEntry[K, V]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  134. def repr: HashMap[K, V]
    Definition Classes
    TraversableLike → GenTraversableLike
  135. def result(): HashMap[K, V]
    Definition Classes
    MapLike → Builder
  136. def retain(p: (K, V) ⇒ Boolean): BiMap.this.type
    Definition Classes
    MapLike
  137. def reversed: List[(K, V)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  138. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
    Definition Classes
    PartialFunction
  139. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  140. 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
  141. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[K, V], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  142. 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.

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

  192. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  193. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  194. def update(key: K, value: V): Unit
    Definition Classes
    HashMap → MapLike
  195. def updated[V1 >: V](key: K, value: V1): Map[K, V1]
    Definition Classes
    MapLike → MapLike
  196. def useSizeMap(t: Boolean): Unit
    Definition Classes
    HashMap
  197. def values: Iterable[V]
    Definition Classes
    HashMap → MapLike → GenMapLike
  198. def valuesIterator: Iterator[V]
    Definition Classes
    HashMap → MapLike → GenMapLike
  199. def view(from: Int, until: Int): IterableView[(K, V), HashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  200. def view: IterableView[(K, V), HashMap[K, V]]
    Definition Classes
    IterableLike → TraversableLike
  201. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  202. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  203. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  204. def withDefault(d: (K) ⇒ V): Map[K, V]
    Definition Classes
    Map
  205. def withDefaultValue(d: V): Map[K, V]
    Definition Classes
    Map
  206. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), HashMap[K, V]]
    Definition Classes
    TraversableLike → FilterMonadic
  207. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[K, V], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  208. 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
  209. 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 :\

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

Inherited from HashMap[K, V]

Inherited from Serializable

Inherited from Serializable

Inherited from CustomParallelizable[(K, V), ParHashMap[K, V]]

Inherited from HashTable[K, DefaultEntry[K, V]]

Inherited from HashUtils[K]

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

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

Inherited from Cloneable[HashMap[K, V]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[K]

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

Inherited from Growable[(K, V)]

Inherited from Clearable

Inherited from Iterable[(K, V)]

Inherited from Traversable[(K, V)]

Inherited from Mutable

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

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

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

Inherited from PartialFunction[K, V]

Inherited from (K) ⇒ V

Inherited from GenMap[K, V]

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

Inherited from AbstractIterable[(K, V)]

Inherited from Iterable[(K, V)]

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

Inherited from Equals

Inherited from GenIterable[(K, V)]

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

Inherited from AbstractTraversable[(K, V)]

Inherited from Traversable[(K, V)]

Inherited from GenTraversable[(K, V)]

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

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

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

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

Inherited from TraversableOnce[(K, V)]

Inherited from GenTraversableOnce[(K, V)]

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped