Packages

c

info.kwarc.mmt.api.utils

HashMapToSet

class HashMapToSet[A, B] extends HashMap[A, HashSet[B]]

This implements a relation on A and B as a mutable total map from A to the power set of B.

Source
HashRelation.scala
Linear Supertypes
HashMap[A, HashSet[B]], Serializable, Serializable, CustomParallelizable[(A, HashSet[B]), ParHashMap[A, HashSet[B]]], HashTable[A, DefaultEntry[A, HashSet[B]]], HashUtils[A], AbstractMap[A, HashSet[B]], Map[A, HashSet[B]], MapLike[A, HashSet[B], HashMap[A, HashSet[B]]], Cloneable[HashMap[A, HashSet[B]]], Cloneable, Cloneable, Shrinkable[A], Builder[(A, HashSet[B]), HashMap[A, HashSet[B]]], Growable[(A, HashSet[B])], Clearable, Iterable[(A, HashSet[B])], Traversable[(A, HashSet[B])], Mutable, AbstractMap[A, HashSet[B]], Map[A, HashSet[B]], MapLike[A, HashSet[B], HashMap[A, HashSet[B]]], Subtractable[A, HashMap[A, HashSet[B]]], PartialFunction[A, HashSet[B]], (A) ⇒ HashSet[B], GenMap[A, HashSet[B]], GenMapLike[A, HashSet[B], HashMap[A, HashSet[B]]], AbstractIterable[(A, HashSet[B])], Iterable[(A, HashSet[B])], IterableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]], Equals, GenIterable[(A, HashSet[B])], GenIterableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]], AbstractTraversable[(A, HashSet[B])], Traversable[(A, HashSet[B])], GenTraversable[(A, HashSet[B])], GenericTraversableTemplate[(A, HashSet[B]), Iterable], TraversableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]], GenTraversableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]], Parallelizable[(A, HashSet[B]), ParHashMap[A, HashSet[B]]], TraversableOnce[(A, HashSet[B])], GenTraversableOnce[(A, HashSet[B])], FilterMonadic[(A, HashSet[B]), HashMap[A, HashSet[B]]], HasNewBuilder[(A, HashSet[B]), HashMap[A, HashSet[B]]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HashMapToSet
  2. HashMap
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. HashTable
  7. HashUtils
  8. AbstractMap
  9. Map
  10. MapLike
  11. Cloneable
  12. Cloneable
  13. Cloneable
  14. Shrinkable
  15. Builder
  16. Growable
  17. Clearable
  18. Iterable
  19. Traversable
  20. Mutable
  21. AbstractMap
  22. Map
  23. MapLike
  24. Subtractable
  25. PartialFunction
  26. Function1
  27. GenMap
  28. GenMapLike
  29. AbstractIterable
  30. Iterable
  31. IterableLike
  32. Equals
  33. GenIterable
  34. GenIterableLike
  35. AbstractTraversable
  36. Traversable
  37. GenTraversable
  38. GenericTraversableTemplate
  39. TraversableLike
  40. GenTraversableLike
  41. Parallelizable
  42. TraversableOnce
  43. GenTraversableOnce
  44. FilterMonadic
  45. HasNewBuilder
  46. AnyRef
  47. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HashMapToSet()

Type Members

  1. class DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
  2. class DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] with Serializable
    Attributes
    protected
    Definition Classes
    MapLike
  3. type Entry = DefaultEntry[A, HashSet[B]]
    Definition Classes
    HashMap
  4. class FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
    Attributes
    protected
    Definition Classes
    MapLike
  5. class MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
    Attributes
    protected
    Definition Classes
    MapLike
  6. type Self = HashMap[A, HashSet[B]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  7. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +[V1 >: HashSet[B]](elem1: (A, V1), elem2: (A, V1), elems: (A, V1)*): Map[A, V1]
    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  4. def +[V1 >: HashSet[B]](kv: (A, V1)): Map[A, V1]
    Definition Classes
    MapLike → MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  5. def ++[V1 >: HashSet[B]](xs: GenTraversableOnce[(A, V1)]): Map[A, V1]
    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new map. Use ++= to add an element to this map and return that map itself.

  6. def ++[B >: (A, HashSet[B]), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++:[B >: (A, HashSet[B]), That](that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike
  8. def ++:[B >: (A, HashSet[B]), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike
  9. def ++=(xs: TraversableOnce[(A, HashSet[B])]): HashMapToSet.this.type
    Definition Classes
    Growable
  10. def +=(a: A, b: B): Unit

    add a pair to the relation

  11. def +=(kv: (A, HashSet[B])): HashMapToSet.this.type
    Definition Classes
    HashMap → MapLike → Builder → Growable
  12. def +=(elem1: (A, HashSet[B]), elem2: (A, HashSet[B]), elems: (A, HashSet[B])*): HashMapToSet.this.type
    Definition Classes
    Growable
  13. def -(elem1: A, elem2: A, elems: A*): HashMap[A, HashSet[B]]
    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: A): HashMap[A, HashSet[B]]
    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[A]): HashMap[A, HashSet[B]]
    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[A]): HashMapToSet.this.type
    Definition Classes
    Shrinkable
  17. def -=(a: A, b: B): Unit

    remove a pair from the relation

  18. def -=(key: A): HashMapToSet.this.type
    Definition Classes
    HashMap → MapLike → Shrinkable
  19. def -=(elem1: A, elem2: A, elems: A*): HashMapToSet.this.type
    Definition Classes
    Shrinkable
  20. def /:[B](z: B)(op: (B, (A, HashSet[B])) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def :\[B](z: B)(op: ((A, HashSet[B]), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  23. val _loadFactor: Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @transient()
  24. def addEntry(e: DefaultEntry[A, HashSet[B]]): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  25. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  26. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  27. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  28. def aggregate[B](z: ⇒ B)(seqop: (B, (A, HashSet[B])) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def alwaysInitSizeMap: Boolean
    Attributes
    protected
    Definition Classes
    HashTable
  30. def andThen[C](k: (HashSet[B]) ⇒ C): PartialFunction[A, C]
    Definition Classes
    PartialFunction → Function1
  31. def apply(a: A): HashSet[B]

    returns the set of b such that (a,b) in this (returned as a mutable object) It returns the empty set by default.

    returns the set of b such that (a,b) in this (returned as a mutable object) It returns the empty set by default.

    Definition Classes
    HashMapToSet → HashMap → MapLike → Function1 → GenMapLike
  32. def applyOrElse[K1 <: A, V1 >: HashSet[B]](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  33. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  34. def calcSizeMapSize(tableLength: Int): Int
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  35. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  36. def cleanup(a: A): Unit

    remove the entry for a if there are no b such (a,b) is in the relation

  37. def clear(): Unit
    Definition Classes
    HashMap → MapLike → Builder → Growable → Clearable
  38. def clearTable(): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  39. def clone(): HashMap[A, HashSet[B]]
    Definition Classes
    MapLike → Cloneable → AnyRef
  40. def collect[B, That](pf: PartialFunction[(A, HashSet[B]), B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def collectFirst[B](pf: PartialFunction[(A, HashSet[B]), B]): Option[B]
    Definition Classes
    TraversableOnce
  42. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  43. def compose[A](g: (A) ⇒ A): (A) ⇒ HashSet[B]
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  44. def contains(key: A): Boolean
    Definition Classes
    HashMap → MapLike → GenMapLike
  45. def copyToArray[B >: (A, HashSet[B])](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def copyToArray[B >: (A, HashSet[B])](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def copyToArray[B >: (A, HashSet[B])](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def copyToBuffer[B >: (A, HashSet[B])](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  49. def count(p: ((A, HashSet[B])) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def createNewEntry[B1](key: A, value: B1): Entry
    Attributes
    protected
    Definition Classes
    HashMap → HashTable
  51. def default(key: A): HashSet[B]
    Definition Classes
    MapLike → GenMapLike
  52. def drop(n: Int): HashMap[A, HashSet[B]]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  53. def dropRight(n: Int): HashMap[A, HashSet[B]]
    Definition Classes
    IterableLike
  54. def dropWhile(p: ((A, HashSet[B])) ⇒ Boolean): HashMap[A, HashSet[B]]
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def elemEquals(key1: A, key2: A): Boolean
    Attributes
    protected
    Definition Classes
    HashTable
  56. def elemHashCode(key: A): Int
    Attributes
    protected
    Definition Classes
    HashUtils
  57. def empty: HashMap[A, HashSet[B]]
    Definition Classes
    HashMap → Map → Map → MapLike
  58. def entriesIterator: Iterator[DefaultEntry[A, HashSet[B]]]
    Attributes
    protected
    Definition Classes
    HashTable
  59. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  60. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  61. def exists(p: ((A, HashSet[B])) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  62. def filter(p: ((A, HashSet[B])) ⇒ Boolean): HashMap[A, HashSet[B]]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def filterKeys(p: (A) ⇒ Boolean): Map[A, HashSet[B]]
    Definition Classes
    MapLike → GenMapLike
  64. def filterNot(p: ((A, HashSet[B])) ⇒ Boolean): HashMap[A, HashSet[B]]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  65. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  66. def find(p: ((A, HashSet[B])) ⇒ Boolean): Option[(A, HashSet[B])]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  67. def findEntry(key: A): DefaultEntry[A, HashSet[B]]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  68. def findOrAddEntry[B](key: A, value: B): DefaultEntry[A, HashSet[B]]
    Attributes
    protected
    Definition Classes
    HashTable
  69. def flatMap[B, That](f: ((A, HashSet[B])) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  70. def flatten[B](implicit asTraversable: ((A, HashSet[B])) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  71. def fold[A1 >: (A, HashSet[B])](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def foldLeft[B](z: B)(op: (B, (A, HashSet[B])) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def foldRight[B](z: B)(op: ((A, HashSet[B]), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  74. def forall(p: ((A, HashSet[B])) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  75. def foreach[U](f: ((A, HashSet[B])) ⇒ U): Unit
    Definition Classes
    HashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  76. def foreachEntry[U](f: (DefaultEntry[A, HashSet[B]]) ⇒ U): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  77. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  78. def get(key: A): Option[HashSet[B]]
    Definition Classes
    HashMap → MapLike → GenMapLike
  79. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  80. def getOrElse[V1 >: HashSet[B]](key: A, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  81. def getOrElseUpdate(key: A, defaultValue: ⇒ HashSet[B]): HashSet[B]
    Definition Classes
    HashMap → MapLike
  82. def getOrEmpty(a: A): HashSet[B]
  83. def groupBy[K](f: ((A, HashSet[B])) ⇒ K): Map[K, HashMap[A, HashSet[B]]]
    Definition Classes
    TraversableLike → GenTraversableLike
  84. def grouped(size: Int): Iterator[HashMap[A, HashSet[B]]]
    Definition Classes
    IterableLike
  85. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  86. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  87. def head: (A, HashSet[B])
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  88. def headOption: Option[(A, HashSet[B])]
    Definition Classes
    TraversableLike → GenTraversableLike
  89. final def improve(hcode: Int, seed: Int): Int
    Attributes
    protected
    Definition Classes
    HashUtils
  90. final def index(hcode: Int): Int
    Attributes
    protected
    Definition Classes
    HashTable
  91. def init: HashMap[A, HashSet[B]]
    Definition Classes
    TraversableLike → GenTraversableLike
  92. def initWithContents(c: Contents[A, DefaultEntry[A, HashSet[B]]]): Unit
    Attributes
    protected
    Definition Classes
    HashTable
  93. def initialSize: Int
    Attributes
    protected
    Definition Classes
    HashTable
  94. def inits: Iterator[HashMap[A, HashSet[B]]]
    Definition Classes
    TraversableLike
  95. def isDefinedAt(key: A): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  96. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  97. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  98. def isSizeMapDefined: Boolean
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  99. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  100. def iterator: Iterator[(A, HashSet[B])]
    Definition Classes
    HashMap → MapLike → IterableLike → GenIterableLike
  101. def keySet: Set[A]
    Definition Classes
    HashMap → MapLike → GenMapLike
  102. def keys: Iterable[A]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  103. def keysIterator: Iterator[A]
    Definition Classes
    HashMap → MapLike → GenMapLike
  104. def last: (A, HashSet[B])
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def lastOption: Option[(A, HashSet[B])]
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def lift: (A) ⇒ Option[HashSet[B]]
    Definition Classes
    PartialFunction
  107. def map[B, That](f: ((A, HashSet[B])) ⇒ B)(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  108. def mapResult[NewTo](f: (HashMap[A, HashSet[B]]) ⇒ NewTo): Builder[(A, HashSet[B]), NewTo]
    Definition Classes
    Builder
  109. def mapValues[W](f: (HashSet[B]) ⇒ W): Map[A, W]
    Definition Classes
    MapLike → GenMapLike
  110. def max[B >: (A, HashSet[B])](implicit cmp: Ordering[B]): (A, HashSet[B])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def maxBy[B](f: ((A, HashSet[B])) ⇒ B)(implicit cmp: Ordering[B]): (A, HashSet[B])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def min[B >: (A, HashSet[B])](implicit cmp: Ordering[B]): (A, HashSet[B])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def minBy[B](f: ((A, HashSet[B])) ⇒ B)(implicit cmp: Ordering[B]): (A, HashSet[B])
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  118. def newBuilder: Builder[(A, HashSet[B]), HashMap[A, HashSet[B]]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → HasNewBuilder
  119. def nnSizeMapAdd(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  120. def nnSizeMapRemove(h: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  121. def nnSizeMapReset(tableLength: Int): Unit
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  122. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  124. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  125. def orElse[A1 <: A, B1 >: HashSet[B]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  126. def pairs: Iterator[(A, B)]

    get an iterator over all pairs

  127. def par: ParHashMap[A, HashSet[B]]
    Definition Classes
    HashMap → CustomParallelizable → Parallelizable
  128. def parCombiner: Combiner[(A, HashSet[B]), ParHashMap[A, HashSet[B]]]
    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable
  129. def partition(p: ((A, HashSet[B])) ⇒ Boolean): (HashMap[A, HashSet[B]], HashMap[A, HashSet[B]])
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def product[B >: (A, HashSet[B])](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def put(key: A, value: HashSet[B]): Option[HashSet[B]]
    Definition Classes
    HashMap → MapLike
  132. def reduce[A1 >: (A, HashSet[B])](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceLeft[B >: (A, HashSet[B])](op: (B, (A, HashSet[B])) ⇒ B): B
    Definition Classes
    TraversableOnce
  134. def reduceLeftOption[B >: (A, HashSet[B])](op: (B, (A, HashSet[B])) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def reduceOption[A1 >: (A, HashSet[B])](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def reduceRight[B >: (A, HashSet[B])](op: ((A, HashSet[B]), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  137. def reduceRightOption[B >: (A, HashSet[B])](op: ((A, HashSet[B]), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def remove(key: A): Option[HashSet[B]]
    Definition Classes
    HashMap → MapLike
  139. def removeEntry(key: A): DefaultEntry[A, HashSet[B]]
    Attributes
    protected
    Definition Classes
    HashTable
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  140. def repr: HashMap[A, HashSet[B]]
    Definition Classes
    TraversableLike → GenTraversableLike
  141. def result(): HashMap[A, HashSet[B]]
    Definition Classes
    MapLike → Builder
  142. def retain(p: (A, HashSet[B]) ⇒ Boolean): HashMapToSet.this.type
    Definition Classes
    MapLike
  143. def reversed: List[(A, HashSet[B])]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  144. def runWith[U](action: (HashSet[B]) ⇒ U): (A) ⇒ Boolean
    Definition Classes
    PartialFunction
  145. def sameElements[B >: (A, HashSet[B])](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  146. def scan[B >: (A, HashSet[B]), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  147. def scanLeft[B, That](z: B)(op: (B, (A, HashSet[B])) ⇒ B)(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def scanRight[B, That](z: B)(op: ((A, HashSet[B]), B) ⇒ B)(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], 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.

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

  198. def unzip[A1, A2](implicit asPair: ((A, HashSet[B])) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  199. def unzip3[A1, A2, A3](implicit asTriple: ((A, HashSet[B])) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  200. def update(key: A, value: HashSet[B]): Unit
    Definition Classes
    HashMap → MapLike
  201. def updated[V1 >: HashSet[B]](key: A, value: V1): Map[A, V1]
    Definition Classes
    MapLike → MapLike
  202. def useSizeMap(t: Boolean): Unit
    Definition Classes
    HashMap
  203. def values: Iterable[HashSet[B]]
    Definition Classes
    HashMap → MapLike → GenMapLike
  204. def valuesIterator: Iterator[HashSet[B]]
    Definition Classes
    HashMap → MapLike → GenMapLike
  205. def view(from: Int, until: Int): IterableView[(A, HashSet[B]), HashMap[A, HashSet[B]]]
    Definition Classes
    IterableLike → TraversableLike
  206. def view: IterableView[(A, HashSet[B]), HashMap[A, HashSet[B]]]
    Definition Classes
    IterableLike → TraversableLike
  207. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  208. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  209. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  210. def withDefault(d: (A) ⇒ HashSet[B]): Map[A, HashSet[B]]
    Definition Classes
    Map
  211. def withDefaultValue(d: HashSet[B]): Map[A, HashSet[B]]
    Definition Classes
    Map
  212. def withFilter(p: ((A, HashSet[B])) ⇒ Boolean): FilterMonadic[(A, HashSet[B]), HashMap[A, HashSet[B]]]
    Definition Classes
    TraversableLike → FilterMonadic
  213. def zip[A1 >: (A, HashSet[B]), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  214. def zipAll[B, A1 >: (A, HashSet[B]), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  215. def zipWithIndex[A1 >: (A, HashSet[B]), That](implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Inherited from HashMap[A, HashSet[B]]

Inherited from Serializable

Inherited from Serializable

Inherited from CustomParallelizable[(A, HashSet[B]), ParHashMap[A, HashSet[B]]]

Inherited from HashTable[A, DefaultEntry[A, HashSet[B]]]

Inherited from HashUtils[A]

Inherited from AbstractMap[A, HashSet[B]]

Inherited from Map[A, HashSet[B]]

Inherited from MapLike[A, HashSet[B], HashMap[A, HashSet[B]]]

Inherited from Cloneable[HashMap[A, HashSet[B]]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[A]

Inherited from Builder[(A, HashSet[B]), HashMap[A, HashSet[B]]]

Inherited from Growable[(A, HashSet[B])]

Inherited from Clearable

Inherited from Iterable[(A, HashSet[B])]

Inherited from Traversable[(A, HashSet[B])]

Inherited from Mutable

Inherited from AbstractMap[A, HashSet[B]]

Inherited from Map[A, HashSet[B]]

Inherited from MapLike[A, HashSet[B], HashMap[A, HashSet[B]]]

Inherited from Subtractable[A, HashMap[A, HashSet[B]]]

Inherited from PartialFunction[A, HashSet[B]]

Inherited from (A) ⇒ HashSet[B]

Inherited from GenMap[A, HashSet[B]]

Inherited from GenMapLike[A, HashSet[B], HashMap[A, HashSet[B]]]

Inherited from AbstractIterable[(A, HashSet[B])]

Inherited from Iterable[(A, HashSet[B])]

Inherited from IterableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]]

Inherited from Equals

Inherited from GenIterable[(A, HashSet[B])]

Inherited from GenIterableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]]

Inherited from AbstractTraversable[(A, HashSet[B])]

Inherited from Traversable[(A, HashSet[B])]

Inherited from GenTraversable[(A, HashSet[B])]

Inherited from GenericTraversableTemplate[(A, HashSet[B]), Iterable]

Inherited from TraversableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]]

Inherited from GenTraversableLike[(A, HashSet[B]), HashMap[A, HashSet[B]]]

Inherited from Parallelizable[(A, HashSet[B]), ParHashMap[A, HashSet[B]]]

Inherited from TraversableOnce[(A, HashSet[B])]

Inherited from GenTraversableOnce[(A, HashSet[B])]

Inherited from FilterMonadic[(A, HashSet[B]), HashMap[A, HashSet[B]]]

Inherited from HasNewBuilder[(A, HashSet[B]), HashMap[A, HashSet[B]]]

Inherited from AnyRef

Inherited from Any

Ungrouped