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
- Alphabetic
- By Inheritance
- HashMapToSet
- HashMap
- Serializable
- Serializable
- CustomParallelizable
- HashTable
- HashUtils
- AbstractMap
- Map
- MapLike
- Cloneable
- Cloneable
- Cloneable
- Shrinkable
- Builder
- Growable
- Clearable
- Iterable
- Traversable
- Mutable
- AbstractMap
- Map
- MapLike
- Subtractable
- PartialFunction
- Function1
- GenMap
- GenMapLike
- AbstractIterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- AbstractTraversable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new HashMapToSet()
Type Members
-
class
DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
- Attributes
- protected
- Definition Classes
- MapLike
-
class
DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] with Serializable
- Attributes
- protected
- Definition Classes
- MapLike
-
type
Entry = DefaultEntry[A, HashSet[B]]
- Definition Classes
- HashMap
-
class
FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
- Attributes
- protected
- Definition Classes
- MapLike
-
class
MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
- Attributes
- protected
- Definition Classes
- MapLike
-
type
Self = HashMap[A, HashSet[B]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
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.
-
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.
-
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.
-
def
++[B >: (A, HashSet[B]), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: (A, HashSet[B]), That](that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: (A, HashSet[B]), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: TraversableOnce[(A, HashSet[B])]): HashMapToSet.this.type
- Definition Classes
- Growable
-
def
+=(a: A, b: B): Unit
add a pair to the relation
-
def
+=(kv: (A, HashSet[B])): HashMapToSet.this.type
- Definition Classes
- HashMap → MapLike → Builder → Growable
-
def
+=(elem1: (A, HashSet[B]), elem2: (A, HashSet[B]), elems: (A, HashSet[B])*): HashMapToSet.this.type
- Definition Classes
- Growable
-
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.
-
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.
-
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.
-
def
--=(xs: TraversableOnce[A]): HashMapToSet.this.type
- Definition Classes
- Shrinkable
-
def
-=(a: A, b: B): Unit
remove a pair from the relation
-
def
-=(key: A): HashMapToSet.this.type
- Definition Classes
- HashMap → MapLike → Shrinkable
-
def
-=(elem1: A, elem2: A, elems: A*): HashMapToSet.this.type
- Definition Classes
- Shrinkable
-
def
/:[B](z: B)(op: (B, (A, HashSet[B])) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: ((A, HashSet[B]), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
val
_loadFactor: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
addEntry(e: DefaultEntry[A, HashSet[B]]): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- MapLike → TraversableOnce
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (A, HashSet[B])) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
alwaysInitSizeMap: Boolean
- Attributes
- protected
- Definition Classes
- HashTable
-
def
andThen[C](k: (HashSet[B]) ⇒ C): PartialFunction[A, C]
- Definition Classes
- PartialFunction → Function1
-
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
-
def
applyOrElse[K1 <: A, V1 >: HashSet[B]](x: K1, default: (K1) ⇒ V1): V1
- Definition Classes
- MapLike → PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
calcSizeMapSize(tableLength: Int): Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
cleanup(a: A): Unit
remove the entry for a if there are no b such (a,b) is in the relation
-
def
clear(): Unit
- Definition Classes
- HashMap → MapLike → Builder → Growable → Clearable
-
def
clearTable(): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
clone(): HashMap[A, HashSet[B]]
- Definition Classes
- MapLike → Cloneable → AnyRef
-
def
collect[B, That](pf: PartialFunction[(A, HashSet[B]), B])(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[(A, HashSet[B]), B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Iterable]
- Definition Classes
- Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ A): (A) ⇒ HashSet[B]
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains(key: A): Boolean
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
copyToArray[B >: (A, HashSet[B])](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (A, HashSet[B])](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (A, HashSet[B])](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (A, HashSet[B])](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: ((A, HashSet[B])) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
createNewEntry[B1](key: A, value: B1): Entry
- Attributes
- protected
- Definition Classes
- HashMap → HashTable
-
def
default(key: A): HashSet[B]
- Definition Classes
- MapLike → GenMapLike
-
def
drop(n: Int): HashMap[A, HashSet[B]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): HashMap[A, HashSet[B]]
- Definition Classes
- IterableLike
-
def
dropWhile(p: ((A, HashSet[B])) ⇒ Boolean): HashMap[A, HashSet[B]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
elemEquals(key1: A, key2: A): Boolean
- Attributes
- protected
- Definition Classes
- HashTable
-
def
elemHashCode(key: A): Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
def
empty: HashMap[A, HashSet[B]]
- Definition Classes
- HashMap → Map → Map → MapLike
-
def
entriesIterator: Iterator[DefaultEntry[A, HashSet[B]]]
- Attributes
- protected
- Definition Classes
- HashTable
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenMapLike → Equals → AnyRef → Any
-
def
exists(p: ((A, HashSet[B])) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((A, HashSet[B])) ⇒ Boolean): HashMap[A, HashSet[B]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterKeys(p: (A) ⇒ Boolean): Map[A, HashSet[B]]
- Definition Classes
- MapLike → GenMapLike
-
def
filterNot(p: ((A, HashSet[B])) ⇒ Boolean): HashMap[A, HashSet[B]]
- Definition Classes
- MapLike → TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((A, HashSet[B])) ⇒ Boolean): Option[(A, HashSet[B])]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
findEntry(key: A): DefaultEntry[A, HashSet[B]]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
findOrAddEntry[B](key: A, value: B): DefaultEntry[A, HashSet[B]]
- Attributes
- protected
- Definition Classes
- HashTable
-
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
-
def
flatten[B](implicit asTraversable: ((A, HashSet[B])) ⇒ GenTraversableOnce[B]): Iterable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: (A, HashSet[B])](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (A, HashSet[B])) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((A, HashSet[B]), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: ((A, HashSet[B])) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((A, HashSet[B])) ⇒ U): Unit
- Definition Classes
- HashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
foreachEntry[U](f: (DefaultEntry[A, HashSet[B]]) ⇒ U): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
- Definition Classes
- GenericTraversableTemplate
-
def
get(key: A): Option[HashSet[B]]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getOrElse[V1 >: HashSet[B]](key: A, default: ⇒ V1): V1
- Definition Classes
- MapLike → GenMapLike
-
def
getOrElseUpdate(key: A, defaultValue: ⇒ HashSet[B]): HashSet[B]
- Definition Classes
- HashMap → MapLike
- def getOrEmpty(a: A): HashSet[B]
-
def
groupBy[K](f: ((A, HashSet[B])) ⇒ K): Map[K, HashMap[A, HashSet[B]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[HashMap[A, HashSet[B]]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- GenMapLike → AnyRef → Any
-
def
head: (A, HashSet[B])
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[(A, HashSet[B])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
improve(hcode: Int, seed: Int): Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
final
def
index(hcode: Int): Int
- Attributes
- protected
- Definition Classes
- HashTable
-
def
init: HashMap[A, HashSet[B]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
initWithContents(c: Contents[A, DefaultEntry[A, HashSet[B]]]): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
initialSize: Int
- Attributes
- protected
- Definition Classes
- HashTable
-
def
inits: Iterator[HashMap[A, HashSet[B]]]
- Definition Classes
- TraversableLike
-
def
isDefinedAt(key: A): Boolean
- Definition Classes
- MapLike → GenMapLike → PartialFunction
-
def
isEmpty: Boolean
- Definition Classes
- MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isSizeMapDefined: Boolean
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: Iterator[(A, HashSet[B])]
- Definition Classes
- HashMap → MapLike → IterableLike → GenIterableLike
-
def
keySet: Set[A]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
keys: Iterable[A]
- Definition Classes
- MapLike → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
keys
returnsIterable[K]
rather thanIterator[K]
.
-
def
keysIterator: Iterator[A]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
last: (A, HashSet[B])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[(A, HashSet[B])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lift: (A) ⇒ Option[HashSet[B]]
- Definition Classes
- PartialFunction
-
def
map[B, That](f: ((A, HashSet[B])) ⇒ B)(implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
mapResult[NewTo](f: (HashMap[A, HashSet[B]]) ⇒ NewTo): Builder[(A, HashSet[B]), NewTo]
- Definition Classes
- Builder
-
def
mapValues[W](f: (HashSet[B]) ⇒ W): Map[A, W]
- Definition Classes
- MapLike → GenMapLike
-
def
max[B >: (A, HashSet[B])](implicit cmp: Ordering[B]): (A, HashSet[B])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((A, HashSet[B])) ⇒ B)(implicit cmp: Ordering[B]): (A, HashSet[B])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: (A, HashSet[B])](implicit cmp: Ordering[B]): (A, HashSet[B])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((A, HashSet[B])) ⇒ B)(implicit cmp: Ordering[B]): (A, HashSet[B])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[(A, HashSet[B]), HashMap[A, HashSet[B]]]
- Attributes
- protected[this]
- Definition Classes
- MapLike → MapLike → TraversableLike → HasNewBuilder
-
def
nnSizeMapAdd(h: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
nnSizeMapRemove(h: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
nnSizeMapReset(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orElse[A1 <: A, B1 >: HashSet[B]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
pairs: Iterator[(A, B)]
get an iterator over all pairs
-
def
par: ParHashMap[A, HashSet[B]]
- Definition Classes
- HashMap → CustomParallelizable → Parallelizable
-
def
parCombiner: Combiner[(A, HashSet[B]), ParHashMap[A, HashSet[B]]]
- Attributes
- protected[this]
- Definition Classes
- CustomParallelizable → Parallelizable
-
def
partition(p: ((A, HashSet[B])) ⇒ Boolean): (HashMap[A, HashSet[B]], HashMap[A, HashSet[B]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: (A, HashSet[B])](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
put(key: A, value: HashSet[B]): Option[HashSet[B]]
- Definition Classes
- HashMap → MapLike
-
def
reduce[A1 >: (A, HashSet[B])](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (A, HashSet[B])](op: (B, (A, HashSet[B])) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (A, HashSet[B])](op: (B, (A, HashSet[B])) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (A, HashSet[B])](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (A, HashSet[B])](op: ((A, HashSet[B]), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (A, HashSet[B])](op: ((A, HashSet[B]), B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
remove(key: A): Option[HashSet[B]]
- Definition Classes
- HashMap → MapLike
-
def
removeEntry(key: A): DefaultEntry[A, HashSet[B]]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
repr: HashMap[A, HashSet[B]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
result(): HashMap[A, HashSet[B]]
- Definition Classes
- MapLike → Builder
-
def
retain(p: (A, HashSet[B]) ⇒ Boolean): HashMapToSet.this.type
- Definition Classes
- MapLike
-
def
reversed: List[(A, HashSet[B])]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (HashSet[B]) ⇒ U): (A) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: (A, HashSet[B])](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
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
-
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
-
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.
-
val
seedvalue: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
seq: Map[A, HashSet[B]]
- Definition Classes
- Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- HashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
- Definition Classes
- Builder
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHint(size: Int): Unit
- Definition Classes
- Builder
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHintIfCheap: Int
- Attributes
- protected[collection]
- Definition Classes
- GenTraversableOnce
-
final
def
sizeMapBucketBitSize: Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
final
def
sizeMapBucketSize: Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
def
sizeMapDisable(): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
sizeMapInit(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
sizeMapInitAndRebuild(): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
val
sizemap: Array[Int]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
slice(from: Int, until: Int): HashMap[A, HashSet[B]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[HashMap[A, HashSet[B]]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[HashMap[A, HashSet[B]]]
- Definition Classes
- IterableLike
-
def
span(p: ((A, HashSet[B])) ⇒ Boolean): (HashMap[A, HashSet[B]], HashMap[A, HashSet[B]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (HashMap[A, HashSet[B]], HashMap[A, HashSet[B]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- MapLike → TraversableLike → GenTraversableLike
-
def
sum[B >: (A, HashSet[B])](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
val
table: Array[HashEntry[A, DefaultEntry[A, HashSet[B]]]]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
val
tableSize: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
tableSizeSeed: Int
- Attributes
- protected
- Definition Classes
- HashTable
-
def
tail: HashMap[A, HashSet[B]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[HashMap[A, HashSet[B]]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): HashMap[A, HashSet[B]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): HashMap[A, HashSet[B]]
- Definition Classes
- IterableLike
-
def
takeWhile(p: ((A, HashSet[B])) ⇒ Boolean): HashMap[A, HashSet[B]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[(A, HashSet[B])]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
val
threshold: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, HashSet[B]), Col[(A, HashSet[B])]]): Col[(A, HashSet[B])]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: (A, HashSet[B])](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[E >: (A, HashSet[B])]: Buffer[E]
- Definition Classes
- MapLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: HashMap[A, HashSet[B]]): Iterable[(A, HashSet[B])]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[(A, HashSet[B])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[(A, HashSet[B])]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[(A, HashSet[B])]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[(A, HashSet[B])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(A, HashSet[B]), (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[(A, HashSet[B])]
- Definition Classes
- MapLike → MapLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (A, HashSet[B])]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[(A, HashSet[B])]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- HashMapToSet → MapLike → Function1 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[(A, HashSet[B])]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[(A, HashSet[B])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transform(f: (A, HashSet[B]) ⇒ HashSet[B]): HashMapToSet.this.type
- Definition Classes
- MapLike
-
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 anIllegalArgumentException
if collections are not uniformly sized.
-
def
unzip[A1, A2](implicit asPair: ((A, HashSet[B])) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: ((A, HashSet[B])) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(key: A, value: HashSet[B]): Unit
- Definition Classes
- HashMap → MapLike
-
def
updated[V1 >: HashSet[B]](key: A, value: V1): Map[A, V1]
- Definition Classes
- MapLike → MapLike
-
def
useSizeMap(t: Boolean): Unit
- Definition Classes
- HashMap
-
def
values: Iterable[HashSet[B]]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
valuesIterator: Iterator[HashSet[B]]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
view(from: Int, until: Int): IterableView[(A, HashSet[B]), HashMap[A, HashSet[B]]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[(A, HashSet[B]), HashMap[A, HashSet[B]]]
- Definition Classes
- IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
withDefault(d: (A) ⇒ HashSet[B]): Map[A, HashSet[B]]
- Definition Classes
- Map
-
def
withDefaultValue(d: HashSet[B]): Map[A, HashSet[B]]
- Definition Classes
- Map
-
def
withFilter(p: ((A, HashSet[B])) ⇒ Boolean): FilterMonadic[(A, HashSet[B]), HashMap[A, HashSet[B]]]
- Definition Classes
- TraversableLike → FilterMonadic
-
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
-
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
-
def
zipWithIndex[A1 >: (A, HashSet[B]), That](implicit bf: CanBuildFrom[HashMap[A, HashSet[B]], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike