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], AbstractMap[K, Set[V]], 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])], Clearable, Iterable[(K, Set[V])], Traversable[(K, Set[V])], Mutable, AbstractMap[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]]], AbstractIterable[(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]]], AbstractTraversable[(K, Set[V])], 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. MultiHashMap
  2. HashMap
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. HashTable
  7. HashUtils
  8. AbstractMap
  9. Map
  10. MapLike
  11. Cloneable
  12. Shrinkable
  13. Builder
  14. Growable
  15. Clearable
  16. Iterable
  17. Traversable
  18. Mutable
  19. AbstractMap
  20. Map
  21. MapLike
  22. Subtractable
  23. PartialFunction
  24. Function1
  25. GenMap
  26. GenMapLike
  27. AbstractIterable
  28. Iterable
  29. IterableLike
  30. Equals
  31. GenIterable
  32. GenIterableLike
  33. AbstractTraversable
  34. Traversable
  35. GenTraversable
  36. GenericTraversableTemplate
  37. TraversableLike
  38. GenTraversableLike
  39. Parallelizable
  40. TraversableOnce
  41. GenTraversableOnce
  42. FilterMonadic
  43. HasNewBuilder
  44. AnyRef
  45. Any
Implicitly
  1. by MonadOps
  2. by traversable2ops
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
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. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    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

    (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 +[B1 >: Set[V]](kv: (K, B1)): Map[K, B1]

    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.

  6. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

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

    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.

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    Growable

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

    Definition Classes
    HashMap → MapLike → Builder → Growable

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

    Definition Classes
    Growable

  14. def -(elem1: K, elem2: K, elems: K*): HashMap[K, Set[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 -(key: K): HashMap[K, Set[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.

  16. def --(xs: GenTraversableOnce[K]): HashMap[K, Set[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.

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

    Definition Classes
    Shrinkable

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

    Definition Classes
    HashMap → MapLike → Shrinkable

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

    Definition Classes
    Shrinkable

  20. def ->[B](y: B): (MultiHashMap[K, V], B)

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to ArrowAssoc[MultiHashMap[K, V]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  24. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  25. var _loadFactor: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    MapLike → TraversableOnce

  28. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  31. def alwaysInitSizeMap: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    PartialFunction → Function1

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

    Definition Classes
    HashMap → MapLike → Function1 → GenMapLike

  34. def applyOrElse[A1 <: K, B1 >: Set[V]](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction

  35. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  36. def asParIterable: ParIterable[(K, Set[V])]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to TraversableOps[(K, Set[V])] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  37. def asParSeq: ParSeq[(K, Set[V])]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to TraversableOps[(K, Set[V])] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  38. def calcSizeMapSize(tableLength: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable

  39. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  40. def clear(): Unit

    Definition Classes
    HashMap → MapLike → Builder → Growable → Clearable

  41. def clearTable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    MapLike → Cloneable → AnyRef

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce

  45. def companion: GenericCompanion[Iterable]

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

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

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  47. def contains(key: K): Boolean

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MultiHashMap → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  58. def elemHashCode(key: K): Int

    Attributes
    protected
    Definition Classes
    HashUtils

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

    Definition Classes
    HashMap → Map → Map → MapLike

  60. def ensuring(cond: (MultiHashMap[K, V]) ⇒ Boolean, msg: ⇒ Any): MultiHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to Ensuring[MultiHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  61. def ensuring(cond: (MultiHashMap[K, V]) ⇒ Boolean): MultiHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to Ensuring[MultiHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  62. def ensuring(cond: Boolean, msg: ⇒ Any): MultiHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to Ensuring[MultiHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  63. def ensuring(cond: Boolean): MultiHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to Ensuring[MultiHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Attributes
    protected
    Definition Classes
    HashTable

  65. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  66. def equals(that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  71. def finalize(): Unit

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Attributes
    protected
    Definition Classes
    HashTable

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

  75. def flatMap[B](f: ((K, Set[V])) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to MonadOps[(K, Set[V])] performed by method MonadOps in scala.collection.TraversableOnce.
    Definition Classes
    MonadOps

  76. def flatten[B](implicit asTraversable: ((K, Set[V])) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

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

    Attributes
    protected
    Definition Classes
    HashTable

  83. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    HashMap → MapLike → GenMapLike

  86. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    MapLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

  91. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  92. def hashCode(): Int

    Definition Classes
    GenMapLike → AnyRef → Any

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  95. def ifParSeq[R](isbody: (ParSeq[(K, Set[V])]) ⇒ R): Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to TraversableOps[(K, Set[V])] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  96. final def improve(hcode: Int, seed: Int): Int

    Attributes
    protected
    Definition Classes
    HashUtils

  97. final def index(hcode: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  100. def initialSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike

  102. def isDefinedAt(key: K): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction

  103. def isEmpty: Boolean

    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  104. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  105. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to TraversableOps[(K, Set[V])] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  106. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to TraversableOps[(K, Set[V])] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  107. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to TraversableOps[(K, Set[V])] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  108. def isSizeMapDefined: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  109. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike → IterableLike → GenIterableLike

  111. def keySet: Set[K]

    Definition Classes
    HashMap → MapLike → GenMapLike

  112. def keys: Iterable[K]

    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  113. def keysIterator: Iterator[K]

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  118. def map[B](f: ((K, Set[V])) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to MonadOps[(K, Set[V])] performed by method MonadOps in scala.collection.TraversableOnce.
    Definition Classes
    MonadOps

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

    Definition Classes
    Builder

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  125. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  126. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  128. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

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

  130. def nnSizeMapAdd(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  131. def nnSizeMapRemove(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  132. def nnSizeMapReset(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  133. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  134. final def notify(): Unit

    Definition Classes
    AnyRef

  135. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    HashMap → CustomParallelizable → Parallelizable

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

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike → Builder

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

    Definition Classes
    MapLike

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

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  154. def run[U](x: K)(action: (Set[V]) ⇒ U): Boolean

    Definition Classes
    PartialFunction

  155. def runWith[U](action: (Set[V]) ⇒ U): (K) ⇒ Boolean

    Definition Classes
    PartialFunction

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

    Definition Classes
    IterableLike → GenIterableLike

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

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

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

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  160. var seedvalue: Int

    Definition Classes
    HashTable

  161. val self: Any

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  162. val self: Any

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat

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

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

  164. def size: Int

    Definition Classes
    HashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    Builder

  166. def sizeHint(size: Int): Unit

    Definition Classes
    Builder

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

    Definition Classes
    Builder

  168. final def sizeMapBucketBitSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  169. final def sizeMapBucketSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  170. def sizeMapDisable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  171. def sizeMapInit(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  172. def sizeMapInitAndRebuild(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  173. var sizemap: Array[Int]

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  179. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  181. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

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

    Attributes
    protected
    Definition Classes
    HashTable

  183. var tableSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

  184. def tableSizeSeed: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  191. var threshold: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  195. def toIndexedSeq: IndexedSeq[(K, Set[V])]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  200. def toParArray: ParArray[(K, Set[V])]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to TraversableOps[(K, Set[V])] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  204. def toString(): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike

  207. def transpose[B](implicit asTraversable: ((K, Set[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.

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    HashMap → MapLike

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

    Definition Classes
    MapLike → MapLike

  212. def useSizeMap(t: Boolean): Unit

    Definition Classes
    HashMap

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike

  217. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  219. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    Map

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

    Definition Classes
    Map

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

    Definition Classes
    TraversableLike → FilterMonadic

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

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

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

    Definition Classes
    IterableLike → GenIterableLike

  226. def →[B](y: B): (MultiHashMap[K, V], B)

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to ArrowAssoc[MultiHashMap[K, V]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: MultiHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to ArrowAssoc[MultiHashMap[K, V]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: MultiHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from MultiHashMap[K, V] to Ensuring[MultiHashMap[K, V]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring 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 AbstractMap[K, Set[V]]

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 Clearable

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

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

Inherited from Mutable

Inherited from AbstractMap[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 AbstractIterable[(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 AbstractTraversable[(K, Set[V])]

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

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

Inherited by implicit conversion traversable2ops from MultiHashMap[K, V] to TraversableOps[(K, Set[V])]

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

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

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

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