scala.tools.nsc.util

MultiHashMap

class MultiHashMap [K, V] extends HashMap[K, Set[V]]

A hashmap with set-valued values, and an empty set as default value

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

Instance Constructors

  1. new MultiHashMap ()

Type Members

  1. type Entry = DefaultEntry[K, Set[V]]

    Definition Classes
    HashMap

  2. type Self = HashMap[K, Set[V]]

    Attributes
    protected
    Definition Classes
    TraversableLike

Value Members

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

    Attributes
    final
    Definition Classes
    AnyRef

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

    Attributes
    final
    Definition Classes
    Any

  3. def ## (): Int

    Attributes
    final
    Definition Classes
    AnyRef → Any

  4. def + [B1 >: Set[V]] (elem1: (K, B1), elem2: (K, B1), elems: (K, B1)*): Map[K, B1]

    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

  5. def + [B1 >: Set[V]] (kv: (K, B1)): Map[K, B1]

    Definition Classes
    MapLike → MapLike → GenMapLike
    Annotations
    @migration
    Migration

  6. def ++ [B1 >: Set[V]] (xs: TraversableOnce[(K, B1)]): Map[K, B1]

    Definition Classes
    MapLike → MapLike
    Annotations
    @bridge()

  7. def ++ [B1 >: Set[V]] (xs: GenTraversableOnce[(K, B1)]): Map[K, B1]

    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

  8. def ++ [B >: (K, Set[V]), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()

  9. def ++ [B >: (K, Set[V]), That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  10. def ++: [B >: (K, Set[V]), That] (that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike

  11. def ++: [B >: (K, Set[V]), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike

  12. def ++= (xs: TraversableOnce[(K, Set[V])]): MultiHashMap.this.type

    Definition Classes
    Growable

  13. def += (kv: (K, Set[V])): MultiHashMap.this.type

    Definition Classes
    HashMap → MapLike → Builder → Growable

  14. def += (elem1: (K, Set[V]), elem2: (K, Set[V]), elems: (K, Set[V])*): MultiHashMap.this.type

    Definition Classes
    Growable

  15. def - (elem1: K, elem2: K, elems: K*): HashMap[K, Set[V]]

    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

  16. def - (key: K): HashMap[K, Set[V]]

    Definition Classes
    MapLike → MapLike → Subtractable → GenMapLike
    Annotations
    @migration
    Migration

  17. def -- (xs: TraversableOnce[K]): HashMap[K, Set[V]]

    Definition Classes
    MapLike → Subtractable
    Annotations
    @bridge()

  18. def -- (xs: GenTraversableOnce[K]): HashMap[K, Set[V]]

    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

  19. def --= (xs: TraversableOnce[K]): MultiHashMap.this.type

    Definition Classes
    Shrinkable

  20. def -= (key: K): MultiHashMap.this.type

    Definition Classes
    HashMap → MapLike → Shrinkable

  21. def -= (elem1: K, elem2: K, elems: K*): MultiHashMap.this.type

    Definition Classes
    Shrinkable

  22. def /: [B] (z: B)(op: (B, (K, Set[V])) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. def /:\ [A1 >: (K, Set[V])] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce

  24. def :\ [B] (z: B)(op: ((K, Set[V]), B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  25. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  26. def == (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  27. var _loadFactor : Int

    Attributes
    protected
    Definition Classes
    HashTable

  28. def addEntry (e: DefaultEntry[K, Set[V]]): Unit

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    MapLike → TraversableOnce

  30. def addString (b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

  32. def aggregate [B] (z: B)(seqop: (B, (K, Set[V])) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  33. def alwaysInitSizeMap : Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  34. def andThen [C] (k: (Set[V]) ⇒ C): PartialFunction[K, C]

    Definition Classes
    PartialFunction → Function1

  35. def apply (key: K): Set[V]

    Definition Classes
    MapLike → GenMapLike → Function1

  36. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  37. def calcSizeMapSize (tableLength: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable

  38. def canEqual (that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  39. def clear (): Unit

    Definition Classes
    HashMap → MapLike → Builder → Growable

  40. def clearTable (): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  41. def clone (): HashMap[K, Set[V]]

    Definition Classes
    MapLike → Cloneable → AnyRef

  42. def collect [B, That] (pf: PartialFunction[(K, Set[V]), B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  43. def collectFirst [B] (pf: PartialFunction[(K, Set[V]), B]): Option[B]

    Definition Classes
    TraversableOnce

  44. def companion : GenericCompanion[Iterable]

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

  45. def compose [A] (g: (A) ⇒ K): (A) ⇒ Set[V]

    Definition Classes
    Function1

  46. def contains (key: K): Boolean

    Definition Classes
    MapLike

  47. def copyToArray [B >: (K, Set[V])] (xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  48. def copyToArray [B >: (K, Set[V])] (xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  49. def copyToArray [B >: (K, Set[V])] (xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  50. def copyToBuffer [B >: (K, Set[V])] (dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  51. def count (p: ((K, Set[V])) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  52. def default (key: K): Set[V]

    Definition Classes
    MultiHashMap → MapLike → GenMapLike

  53. def drop (n: Int): HashMap[K, Set[V]]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  54. def dropRight (n: Int): HashMap[K, Set[V]]

    Definition Classes
    IterableLike

  55. def dropWhile (p: ((K, Set[V])) ⇒ Boolean): HashMap[K, Set[V]]

    Definition Classes
    TraversableLike → GenTraversableLike

  56. def elemEquals (key1: K, key2: K): Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  57. def elemHashCode (key: K): Int

    Attributes
    protected
    Definition Classes
    HashUtils

  58. def empty : HashMap[K, Set[V]]

    Definition Classes
    HashMap → Map → Map → MapLike

  59. def entriesIterator : Iterator[DefaultEntry[K, Set[V]]]

    Attributes
    protected
    Definition Classes
    HashTable

  60. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  61. def equals (that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any

  62. def exists (p: ((K, Set[V])) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  63. def filter (p: ((K, Set[V])) ⇒ Boolean): HashMap[K, Set[V]]

    Definition Classes
    TraversableLike → GenTraversableLike

  64. def filterKeys (p: (K) ⇒ Boolean): Map[K, Set[V]]

    Definition Classes
    MapLike

  65. def filterNot (p: ((K, Set[V])) ⇒ Boolean): HashMap[K, Set[V]]

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  66. def finalize (): Unit

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

  67. def find (p: ((K, Set[V])) ⇒ Boolean): Option[(K, Set[V])]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  68. def findEntry (key: K): DefaultEntry[K, Set[V]]

    Attributes
    protected
    Definition Classes
    HashTable

  69. def flatMap [B, That] (f: ((K, Set[V])) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  70. def flatten [B] (implicit asTraversable: ((K, Set[V])) ⇒ TraversableOnce[B]): Traversable[B]

    Definition Classes
    Traversable → GenericTraversableTemplate
    Annotations
    @bridge()

  71. def fold [A1 >: (K, Set[V])] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def foldLeft [B] (z: B)(op: (B, (K, Set[V])) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def foldRight [B] (z: B)(op: ((K, Set[V]), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  74. def forall (p: ((K, Set[V])) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  75. def foreach [C] (f: ((K, Set[V])) ⇒ C): Unit

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

  76. def foreachEntry [C] (f: (DefaultEntry[K, Set[V]]) ⇒ C): Unit

    Attributes
    protected final
    Definition Classes
    HashTable

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

    Definition Classes
    GenericTraversableTemplate

  78. def get (key: K): Option[Set[V]]

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Attributes
    final
    Definition Classes
    AnyRef → Any

  80. def getOrElse [B1 >: Set[V]] (key: K, default: ⇒ B1): B1

    Definition Classes
    MapLike

  81. def getOrElseUpdate (key: K, op: ⇒ Set[V]): Set[V]

    Definition Classes
    MapLike

  82. def groupBy [K] (f: ((K, Set[V])) ⇒ K): Map[K, HashMap[K, Set[V]]]

    Definition Classes
    TraversableLike → GenTraversableLike

  83. def grouped (size: Int): Iterator[HashMap[K, Set[V]]]

    Definition Classes
    IterableLike

  84. def hasDefiniteSize : Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  85. def hashCode (): Int

    Definition Classes
    GenMapLike → AnyRef → Any

  86. def head : (K, Set[V])

    Definition Classes
    IterableLike → GenIterableLike → TraversableLike → GenTraversableLike

  87. def headOption : Option[(K, Set[V])]

    Definition Classes
    TraversableLike

  88. def improve (hcode: Int): Int

    Attributes
    protected final
    Definition Classes
    HashUtils

  89. def index (hcode: Int): Int

    Attributes
    protected final
    Definition Classes
    HashTable

  90. def init : HashMap[K, Set[V]]

    Definition Classes
    TraversableLike

  91. def initWithContents (c: Contents[K, DefaultEntry[K, Set[V]]]): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  92. def initialSize : Int

    Attributes
    protected
    Definition Classes
    HashTable

  93. def inits : Iterator[HashMap[K, Set[V]]]

    Definition Classes
    TraversableLike

  94. def isDefinedAt (key: K): Boolean

    Definition Classes
    MapLike → PartialFunction

  95. def isEmpty : Boolean

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

  96. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  97. def isSizeMapDefined : Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  98. def isTraversableAgain : Boolean

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce

  99. def iterator : Iterator[(K, Set[V])]

    Definition Classes
    HashMap → MapLike → IterableLike → GenIterableLike

  100. def keySet : Set[K]

    Definition Classes
    HashMap → MapLike

  101. def keys : Iterable[K]

    Definition Classes
    MapLike
    Annotations
    @migration
    Migration

  102. def keysIterator : Iterator[K]

    Definition Classes
    HashMap → MapLike

  103. def last : (K, Set[V])

    Definition Classes
    TraversableLike

  104. def lastOption : Option[(K, Set[V])]

    Definition Classes
    TraversableLike

  105. def lift : (K) ⇒ Option[Set[V]]

    Definition Classes
    PartialFunction

  106. def map [B, That] (f: ((K, Set[V])) ⇒ B)(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  107. def mapResult [NewTo] (f: (HashMap[K, Set[V]]) ⇒ NewTo): Builder[(K, Set[V]), NewTo]

    Definition Classes
    Builder

  108. def mapValues [C] (f: (Set[V]) ⇒ C): Map[K, C]

    Definition Classes
    MapLike

  109. def max [B >: (K, Set[V])] (implicit cmp: Ordering[B]): (K, Set[V])

    Definition Classes
    TraversableOnce → GenTraversableOnce

  110. def maxBy [B] (f: ((K, Set[V])) ⇒ B)(implicit cmp: Ordering[B]): (K, Set[V])

    Definition Classes
    TraversableOnce → GenTraversableOnce

  111. def min [B >: (K, Set[V])] (implicit cmp: Ordering[B]): (K, Set[V])

    Definition Classes
    TraversableOnce → GenTraversableOnce

  112. def minBy [B] (f: ((K, Set[V])) ⇒ B)(implicit cmp: Ordering[B]): (K, Set[V])

    Definition Classes
    TraversableOnce → GenTraversableOnce

  113. def mkString : String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def mkString (sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  117. def newBuilder : Builder[(K, Set[V]), HashMap[K, Set[V]]]

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

  118. def nnSizeMapAdd (h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  119. def nnSizeMapRemove (h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  120. def nnSizeMapReset (tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  121. def nonEmpty : Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  123. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  124. def orElse [A1 <: K, B1 >: Set[V]] (that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction

  125. def par : ParHashMap[K, Set[V]]

    Definition Classes
    HashMap → CustomParallelizable → Parallelizable

  126. def parCombiner : Combiner[(K, Set[V]), ParHashMap[K, Set[V]]]

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable

  127. def partition (p: ((K, Set[V])) ⇒ Boolean): (HashMap[K, Set[V]], HashMap[K, Set[V]])

    Definition Classes
    TraversableLike → GenTraversableLike

  128. def product [B >: (K, Set[V])] (implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  129. def put (key: K, value: Set[V]): Option[Set[V]]

    Definition Classes
    HashMap → MapLike

  130. def reduce [A1 >: (K, Set[V])] (op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  131. def reduceLeft [B >: (K, Set[V])] (op: (B, (K, Set[V])) ⇒ B): B

    Definition Classes
    TraversableOnce

  132. def reduceLeftOption [B >: (K, Set[V])] (op: (B, (K, Set[V])) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  133. def reduceOption [A1 >: (K, Set[V])] (op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  134. def reduceRight [B >: (K, Set[V])] (op: ((K, Set[V]), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  135. def reduceRightOption [B >: (K, Set[V])] (op: ((K, Set[V]), B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  136. def remove (key: K): Option[Set[V]]

    Definition Classes
    HashMap → MapLike

  137. def removeEntry (key: K): DefaultEntry[K, Set[V]]

    Attributes
    protected
    Definition Classes
    HashTable

  138. def repr : HashMap[K, Set[V]]

    Definition Classes
    TraversableLike → GenTraversableLike

  139. def result (): HashMap[K, Set[V]]

    Definition Classes
    MapLike → Builder

  140. def retain (p: (K, Set[V]) ⇒ Boolean): MultiHashMap.this.type

    Definition Classes
    MapLike

  141. def reversed : List[(K, Set[V])]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  142. def sameElements [B >: (K, Set[V])] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()

  143. def sameElements [B >: (K, Set[V])] (that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

  144. def scan [B >: (K, Set[V]), That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  145. def scanLeft [B, That] (z: B)(op: (B, (K, Set[V])) ⇒ B)(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  146. def scanRight [B, That] (z: B)(op: ((K, Set[V]), B) ⇒ B)(implicit bf: CanBuildFrom[HashMap[K, Set[V]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

  147. def seq : Map[K, Set[V]]

    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  148. def size : Int

    Definition Classes
    HashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce

  149. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int): Unit

    Definition Classes
    Builder

  150. def sizeHint (size: Int): Unit

    Definition Classes
    Builder

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

    Definition Classes
    Builder

  152. def sizeMapBucketBitSize : Int

    Attributes
    protected final
    Definition Classes
    HashUtils

  153. def sizeMapBucketSize : Int

    Attributes
    protected final
    Definition Classes
    HashUtils

  154. def sizeMapDisable (): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  155. def sizeMapInit (tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  156. def sizeMapInitAndRebuild (): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  157. var sizemap : Array[Int]

    Attributes
    protected
    Definition Classes
    HashTable

  158. def slice (from: Int, until: Int): HashMap[K, Set[V]]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  159. def sliding [B >: (K, Set[V])] (size: Int, step: Int): Iterator[HashMap[K, Set[V]]]

    Definition Classes
    IterableLike

  160. def sliding [B >: (K, Set[V])] (size: Int): Iterator[HashMap[K, Set[V]]]

    Definition Classes
    IterableLike

  161. def span (p: ((K, Set[V])) ⇒ Boolean): (HashMap[K, Set[V]], HashMap[K, Set[V]])

    Definition Classes
    TraversableLike → GenTraversableLike

  162. def splitAt (n: Int): (HashMap[K, Set[V]], HashMap[K, Set[V]])

    Definition Classes
    TraversableLike → GenTraversableLike

  163. def stringPrefix : String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  164. def sum [B >: (K, Set[V])] (implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  165. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef

  166. var table : Array[HashEntry[K, DefaultEntry[K, Set[V]]]]

    Attributes
    protected
    Definition Classes
    HashTable

  167. var tableSize : Int

    Attributes
    protected
    Definition Classes
    HashTable

  168. def tail : HashMap[K, Set[V]]

    Definition Classes
    TraversableLike → GenTraversableLike

  169. def tails : Iterator[HashMap[K, Set[V]]]

    Definition Classes
    TraversableLike

  170. def take (n: Int): HashMap[K, Set[V]]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  171. def takeRight (n: Int): HashMap[K, Set[V]]

    Definition Classes
    IterableLike

  172. def takeWhile (p: ((K, Set[V])) ⇒ Boolean): HashMap[K, Set[V]]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  173. def thisCollection : Iterable[(K, Set[V])]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  174. var threshold : Int

    Attributes
    protected
    Definition Classes
    HashTable

  175. def toArray [B >: (K, Set[V])] (implicit arg0: ClassManifest[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  176. def toBuffer [C >: (K, Set[V])] : Buffer[C]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

  177. def toCollection (repr: HashMap[K, Set[V]]): Iterable[(K, Set[V])]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  178. def toIndexedSeq [B >: (K, Set[V])] : IndexedSeq[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  179. def toIterable : Iterable[(K, Set[V])]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  180. def toIterator : Iterator[(K, Set[V])]

    Definition Classes
    TraversableLike → GenTraversableOnce

  181. def toList : List[(K, Set[V])]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  182. def toMap [T, U] (implicit ev: <:<[(K, Set[V]), (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  183. def toSeq : Seq[(K, Set[V])]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

  184. def toSet [B >: (K, Set[V])] : Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  185. def toStream : Stream[(K, Set[V])]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  186. def toString (): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any

  187. def toTraversable : Traversable[(K, Set[V])]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  188. def transform (f: (K, Set[V]) ⇒ Set[V]): MultiHashMap.this.type

    Definition Classes
    MapLike

  189. def transpose [B] (implicit asTraversable: ((K, Set[V])) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

    Definition Classes
    Traversable → GenericTraversableTemplate
    Annotations
    @bridge()

  190. def unzip [A1, A2] (implicit asPair: ((K, Set[V])) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate

  191. def unzip3 [A1, A2, A3] (implicit asTriple: ((K, Set[V])) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate

  192. def update (key: K, value: Set[V]): Unit

    Definition Classes
    HashMap → MapLike

  193. def updated [B1 >: Set[V]] (key: K, value: B1): Map[K, B1]

    Definition Classes
    MapLike → MapLike

  194. def useSizeMap (t: Boolean): Unit

    Definition Classes
    HashMap

  195. def values : Iterable[Set[V]]

    Definition Classes
    HashMap → MapLike

  196. def valuesIterator : Iterator[Set[V]]

    Definition Classes
    HashMap → MapLike

  197. def view (from: Int, until: Int): IterableView[(K, Set[V]), HashMap[K, Set[V]]]

    Definition Classes
    IterableLike → TraversableLike

  198. def view : IterableView[(K, Set[V]), HashMap[K, Set[V]]]

    Definition Classes
    IterableLike → TraversableLike

  199. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  201. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  202. def withDefault (d: (K) ⇒ Set[V]): Map[K, Set[V]]

    Definition Classes
    Map

  203. def withDefaultValue (d: Set[V]): Map[K, Set[V]]

    Definition Classes
    Map

  204. def withFilter (p: ((K, Set[V])) ⇒ Boolean): FilterMonadic[(K, Set[V]), HashMap[K, Set[V]]]

    Definition Classes
    TraversableLike → FilterMonadic

  205. def zip [A1 >: (K, Set[V]), B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()

  206. def zip [A1 >: (K, Set[V]), B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[K, Set[V]], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  207. def zipAll [B, A1 >: (K, Set[V]), That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[K, Set[V]], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()

  208. def zipAll [B, A1 >: (K, Set[V]), That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[K, Set[V]], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  209. def zipWithIndex [A1 >: (K, Set[V]), That] (implicit bf: CanBuildFrom[HashMap[K, Set[V]], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def elements : Iterator[(K, Set[V])]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  2. def entries : Iterator[DefaultEntry[K, Set[V]]]

    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecated
    Deprecated

    use entriesIterator instead

  3. def first : (K, Set[V])

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  4. def firstOption : Option[(K, Set[V])]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  5. def mapElements [C] (f: (Set[V]) ⇒ C): Map[K, C]

    Definition Classes
    MapLike
    Annotations
    @deprecated
    Deprecated

    use mapValues' instead

  6. def projection : IterableView[(K, Set[V]), HashMap[K, Set[V]]]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

  7. def removeKey (key: K): Option[Set[V]]

    Definition Classes
    MapLike
    Annotations
    @deprecated
    Deprecated

    Use remove' instead

Inherited from HashMap[K, Set[V]]

Inherited from Serializable

Inherited from Serializable

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

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

Inherited from HashUtils[K]

Inherited from Map[K, Set[V]]

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

Inherited from Cloneable[HashMap[K, Set[V]]]

Inherited from Shrinkable[K]

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

Inherited from Growable[(K, Set[V])]

Inherited from Map[K, Set[V]]

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

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

Inherited from PartialFunction[K, Set[V]]

Inherited from (K) ⇒ Set[V]

Inherited from GenMap[K, Set[V]]

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

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

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

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

Inherited from Equals

Inherited from GenIterable[(K, Set[V])]

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

Inherited from Traversable[(K, Set[V])]

Inherited from Mutable

Inherited from Traversable[(K, Set[V])]

Inherited from GenTraversable[(K, Set[V])]

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

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

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

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

Inherited from TraversableOnce[(K, Set[V])]

Inherited from GenTraversableOnce[(K, Set[V])]

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

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

Inherited from AnyRef

Inherited from Any