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])], 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. Hide All
  2. Show all
  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. Iterable
  16. Traversable
  17. Mutable
  18. AbstractMap
  19. Map
  20. MapLike
  21. Subtractable
  22. PartialFunction
  23. Function1
  24. GenMap
  25. GenMapLike
  26. AbstractIterable
  27. Iterable
  28. IterableLike
  29. Equals
  30. GenIterable
  31. GenIterableLike
  32. AbstractTraversable
  33. Traversable
  34. GenTraversable
  35. GenericTraversableTemplate
  36. TraversableLike
  37. GenTraversableLike
  38. Parallelizable
  39. TraversableOnce
  40. GenTraversableOnce
  41. FilterMonadic
  42. HasNewBuilder
  43. AnyRef
  44. 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. 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](z: B)(op: (B, (K, Set[V])) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  34. def calcSizeMapSize(tableLength: Int): Int

    Attributes
    protected
    Definition Classes
    HashTable

  35. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  36. def clear(): Unit

    Definition Classes
    HashMap → MapLike → Builder → Growable

  37. def clearTable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    MapLike → Cloneable → AnyRef

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce

  41. def companion: GenericCompanion[Iterable]

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

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

    Definition Classes
    Function1

  43. def contains(key: K): Boolean

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MultiHashMap → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  54. def elemHashCode(key: K): Int

    Attributes
    protected
    Definition Classes
    HashUtils

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

    Definition Classes
    HashMap → Map → Map → MapLike

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    AnyRef

  58. def equals(that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  63. def finalize(): Unit

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Attributes
    protected
    Definition Classes
    HashTable

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    MapLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

  80. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  81. def hashCode(): Int

    Definition Classes
    GenMapLike → AnyRef → Any

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

    Definition Classes
    IterableLike → GenIterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Attributes
    protected
    Definition Classes
    HashUtils

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike

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

    Attributes
    protected
    Definition Classes
    HashTable

  88. def initialSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike

  90. def isDefinedAt(key: K): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction

  91. def isEmpty: Boolean

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

  92. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  93. def isSizeMapDefined: Boolean

    Attributes
    protected
    Definition Classes
    HashTable

  94. final def isTraversableAgain: Boolean

    Definition Classes
    GenTraversableLike → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike → IterableLike → GenIterableLike

  96. def keySet: Set[K]

    Definition Classes
    HashMap → MapLike → GenMapLike

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

  98. def keysIterator: Iterator[K]

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    Builder

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

    Definition Classes
    MapLike → GenMapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  109. def missingCase(x: K): Set[V]

    Attributes
    protected
    Definition Classes
    PartialFunction

  110. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  111. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

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

  115. def nnSizeMapAdd(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  116. def nnSizeMapRemove(h: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  117. def nnSizeMapReset(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  118. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  119. final def notify(): Unit

    Definition Classes
    AnyRef

  120. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    PartialFunction

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

    Definition Classes
    HashMap → CustomParallelizable → Parallelizable

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

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    HashMap → MapLike

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

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    MapLike → Builder

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

    Definition Classes
    MapLike

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

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Definition Classes
    IterableLike → GenIterableLike

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

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

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

  144. var seedvalue: Int

    Definition Classes
    HashTable

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

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

  146. def size: Int

    Definition Classes
    HashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    Builder

  148. def sizeHint(size: Int): Unit

    Definition Classes
    Builder

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

    Definition Classes
    Builder

  150. final def sizeMapBucketBitSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  151. final def sizeMapBucketSize: Int

    Attributes
    protected
    Definition Classes
    HashUtils

  152. def sizeMapDisable(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  153. def sizeMapInit(tableLength: Int): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  154. def sizeMapInitAndRebuild(): Unit

    Attributes
    protected
    Definition Classes
    HashTable

  155. var sizemap: Array[Int]

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  161. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Attributes
    protected
    Definition Classes
    HashTable

  165. var tableSize: Int

    Attributes
    protected
    Definition Classes
    HashTable

  166. def tableSizeSeed: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  173. var threshold: Int

    Attributes
    protected
    Definition Classes
    HashTable

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  185. def toString(): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    MapLike

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    HashMap → MapLike

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

    Definition Classes
    MapLike → MapLike

  192. def useSizeMap(t: Boolean): Unit

    Definition Classes
    HashMap

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    HashMap → MapLike → GenMapLike

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

    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike

  197. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    Map

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

    Definition Classes
    Map

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

    Definition Classes
    TraversableLike → FilterMonadic

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

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

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

    Definition Classes
    IterableLike → GenIterableLike

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