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
  7. by alternateImplicit
  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 ++[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.

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    Growable

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

    Definition Classes
    HashMap → MapLike → Builder → Growable

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

    Definition Classes
    Growable

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

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

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

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

    Definition Classes
    Shrinkable

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

    Definition Classes
    HashMap → MapLike → Shrinkable

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

    Definition Classes
    Shrinkable

  19. 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()

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  24. var _loadFactor: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    MapLike → TraversableOnce

  27. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  30. def alwaysInitSizeMap: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    PartialFunction → Function1

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

    Definition Classes
    HashMap → MapLike → Function1 → GenMapLike

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

    Definition Classes
    PartialFunction

  34. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

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

  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 → Clearable

  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
    Annotations
    @unspecialized()

  46. def contains(key: K): Boolean

    Definition Classes
    HashMap → MapLike → GenMapLike

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

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

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

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

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    AnyRef

  65. def equals(that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  70. def finalize(): Unit

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Attributes
    protected
    Definition Classes
    HashTable

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

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

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

    Attributes
    protected
    Definition Classes
    HashTable

  81. 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()

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    MapLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

  89. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  90. def hashCode(): Int

    Definition Classes
    GenMapLike → AnyRef → Any

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

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

    Attributes
    protected
    Definition Classes
    HashUtils

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  98. def initialSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike

  100. def isDefinedAt(key: K): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction

  101. def isEmpty: Boolean

    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  102. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

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

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

  106. def isSizeMapDefined: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  107. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike → IterableLike → GenIterableLike

  109. def keySet: Set[K]

    Definition Classes
    HashMap → MapLike → GenMapLike

  110. 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].

  111. def keysIterator: Iterator[K]

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    Builder

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

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

  127. def nnSizeMapAdd(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  128. def nnSizeMapRemove(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  129. def nnSizeMapReset(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  130. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  131. final def notify(): Unit

    Definition Classes
    AnyRef

  132. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    HashMap → CustomParallelizable → Parallelizable

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

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike → Builder

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

    Definition Classes
    MapLike

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

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    IterableLike → GenIterableLike

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

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

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

  157. var seedvalue: Int

    Definition Classes
    HashTable

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

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

  159. def size: Int

    Definition Classes
    HashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    Builder

  161. def sizeHint(size: Int): Unit

    Definition Classes
    Builder

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

    Definition Classes
    Builder

  163. final def sizeMapBucketBitSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  164. final def sizeMapBucketSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  165. def sizeMapDisable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  166. def sizeMapInit(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  167. def sizeMapInitAndRebuild(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  168. var sizemap: Array[Int]

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  174. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Attributes
    protected
    Definition Classes
    HashTable

  178. var tableSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

  179. def tableSizeSeed: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  186. var threshold: Int

    Attributes
    protected
    Definition Classes
    HashTable

  187. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, Set[V]), Col[(K, Set[V])]]): Col[(K, Set[V])]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  200. def toString(): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  202. def toVector: Vector[(K, Set[V])]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike

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

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    HashMap → MapLike

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

    Definition Classes
    MapLike → MapLike

  209. def useSizeMap(t: Boolean): Unit

    Definition Classes
    HashMap

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike

  214. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    Map

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

    Definition Classes
    Map

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

    Definition Classes
    TraversableLike → FilterMonadic

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

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

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

    Definition Classes
    IterableLike → GenIterableLike

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

Shadowed Implict Value Members

  1. 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.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiHashMap: StringAdd).+(other)
    Definition Classes
    StringAdd

  2. def filter(p: ((K, Set[V])) ⇒ Boolean): TraversableOnce[(K, Set[V])]

    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.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiHashMap: MonadOps[(K, Set[V])]).filter(p)
    Definition Classes
    MonadOps

  3. 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.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiHashMap: MonadOps[(K, Set[V])]).flatMap(f)
    Definition Classes
    MonadOps

  4. 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.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiHashMap: MonadOps[(K, Set[V])]).map(f)
    Definition Classes
    MonadOps

  5. 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.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (multiHashMap: StringAdd).self
    Definition Classes
    StringAdd

  6. 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.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (multiHashMap: StringFormat).self
    Definition Classes
    StringFormat

  7. def withFilter(p: ((K, Set[V])) ⇒ Boolean): Iterator[(K, Set[V])]

    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.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiHashMap: MonadOps[(K, Set[V])]).withFilter(p)
    Definition Classes
    MonadOps

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.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (multiHashMap: ArrowAssoc[MultiHashMap[K, V]]).x
    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.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (multiHashMap: Ensuring[MultiHashMap[K, V]]).x
    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]]

Inherited by implicit conversion alternateImplicit from MultiHashMap[K, V] to ForceImplicitAmbiguity