LinHashMultiMap

scalation.database.LinHashMultiMap
class LinHashMultiMap[K, V](order: Int, loadFactor: (Double, Double))(implicit evidence$1: ClassTag[K], evidence$2: ClassTag[V]) extends LinHashMap[K, Set[V]]

The LinHashMultiMap class provides hash maps that use the Linear Hashing algorithm. It build on LinHashMap allowing values to multi-valued Set [V] and can be used for building Non-Unique Indices.

Type parameters

K

the type of the keys contained in this hash map

V

the base-type of the values assigned to keys in this hash map

Value parameters

loadFactor

the (lower, upper) bound on the load factor (# keys over # home slots)

order

the number of slots per bucket

Attributes

See also

scalation.database.LinHashMap

Graph
Supertypes
class LinHashMap[K, Set[V]]
trait Serializable
class AbstractMap[K, Set[V]]
trait Map[K, Set[V]]
trait MapOps[K, Set[V], Map, Map[K, Set[V]]]
trait Shrinkable[K]
trait Builder[(K, Set[V]), Map[K, Set[V]]]
trait Growable[(K, Set[V])]
trait Clearable
trait Cloneable[Map[K, Set[V]]]
trait Cloneable
trait Iterable[(K, Set[V])]
class AbstractMap[K, Set[V]]
trait Map[K, Set[V]]
trait Equals
trait MapFactoryDefaults[K, Set[V], Map, Iterable]
trait MapOps[K, Set[V], Map, Map[K, Set[V]]]
trait PartialFunction[K, Set[V]]
trait K => Set[V]
class AbstractIterable[(K, Set[V])]
trait Iterable[(K, Set[V])]
trait IterableFactoryDefaults[(K, Set[V]), Iterable]
trait IterableOps[(K, Set[V]), Iterable, Map[K, Set[V]]]
trait IterableOnceOps[(K, Set[V]), Iterable, Map[K, Set[V]]]
trait IterableOnce[(K, Set[V])]
class Object
trait Matchable
class Any
Show all

Members list

Type members

Inherited classlikes

class Bucket() extends Serializable

The Bucket inner class defines buckets that are stored in this hash table.

The Bucket inner class defines buckets that are stored in this hash table.

Attributes

Inherited from:
LinHashMap
Supertypes
trait Serializable
class Object
trait Matchable
class Any
class HTIterator(is: Int, bs: Bucket, js: Int) extends Iterator[(K, V)]

The HTIterator inner class supports iterating over all the elements in a Hash-Table by traversing through the buckets in this hash table.

The HTIterator inner class supports iterating over all the elements in a Hash-Table by traversing through the buckets in this hash table.

Value parameters

bs

the starting home bucket (defaults to hTable(0))

is

the starting bucket chain (defaults to 0)

js

the starting within node index (defaults to 0)

Attributes

Inherited from:
LinHashMap
Supertypes
trait Iterator[(K, V)]
trait IterableOnceOps[(K, V), Iterator, Iterator[(K, V)]]
trait IterableOnce[(K, V)]
class Object
trait Matchable
class Any
Show all

Value members

Concrete methods

def addOne1(elem: (K, V)): this.type

Add one key-value pair into this hash table and return this (called by put). The addOne method adds a set of values, whereas addOne1 adds a single value.

Add one key-value pair into this hash table and return this (called by put). The addOne method adds a set of values, whereas addOne1 adds a single value.

Value parameters

elem

the key-value pair to add/insert for an individual value

Attributes

Inherited methods

final def ++[B >: (K, Set[V])](suffix: IterableOnce[B]): Iterable[B]

Attributes

Inherited from:
IterableOps
def ++[V2 >: Set[V]](xs: IterableOnce[(K, V2)]): Map[K, V2]

Attributes

Inherited from:
MapOps
final def ++=(xs: IterableOnce[(K, Set[V])]): Growable.this.type

Attributes

Inherited from:
Growable
final def +=(elem: (K, Set[V])): Growable.this.type

Attributes

Inherited from:
Growable
final def --=(xs: IterableOnce[K]): Shrinkable.this.type

Attributes

Inherited from:
Shrinkable
final def -=(elem: K): Shrinkable.this.type

Attributes

Inherited from:
Shrinkable
def addAll(xs: IterableOnce[(K, Set[V])]): Growable.this.type

Attributes

Inherited from:
Growable
def addOne(elem: (K, Set[V])): LinHashMap.this.type

Add one key-value pair into this hash table and return this (called by put). Note: it splits the 'isplit' bucket chain when the load factor is exceeded.

Add one key-value pair into this hash table and return this (called by put). Note: it splits the 'isplit' bucket chain when the load factor is exceeded.

Value parameters

elem

the key-value pair to add/insert

Attributes

Inherited from:
LinHashMap
final def addString(b: StringBuilder): b.type

Attributes

Inherited from:
IterableOnceOps
final def addString(b: StringBuilder, sep: String): b.type

Attributes

Inherited from:
IterableOnceOps
override def addString(sb: StringBuilder, start: String, sep: String, end: String): sb.type

Attributes

Definition Classes
MapOps -> IterableOnceOps
Inherited from:
MapOps
def andThen[C](k: PartialFunction[Set[V], C]): PartialFunction[K, C]

Attributes

Inherited from:
PartialFunction
override def andThen[C](k: (Set[V]) => C): PartialFunction[K, C]

Attributes

Definition Classes
PartialFunction -> Function1
Inherited from:
PartialFunction
def apply(key: K): Set[V]

Attributes

Inherited from:
MapOps
override def applyOrElse[K1 <: K, V1 >: Set[V]](x: K1, default: K1 => V1): V1

Attributes

Definition Classes
MapOps -> PartialFunction
Inherited from:
MapOps
def canEqual(that: Any): Boolean

Attributes

Inherited from:
Map
def clear(): Unit

Attributes

Inherited from:
MapOps
override def clone(): Map[K, Set[V]]

Create a copy of the receiver object.

Create a copy of the receiver object.

The default implementation of the clone method is platform dependent.

Attributes

Returns

a copy of the receiver object.

Note

not specified by SLS as a member of AnyRef

Definition Classes
MapOps -> Cloneable -> Object
Inherited from:
MapOps
def collect[B](pf: PartialFunction[(K, Set[V]), B]): Iterable[B]

Attributes

Inherited from:
IterableOps
def collect[K2, V2](pf: PartialFunction[(K, Set[V]), (K2, V2)]): Map[K2, V2]

Attributes

Inherited from:
MapOps
def collectFirst[B](pf: PartialFunction[(K, Set[V]), B]): Option[B]

Attributes

Inherited from:
IterableOnceOps
def compose[R](k: PartialFunction[R, K]): PartialFunction[R, Set[V]]

Attributes

Inherited from:
PartialFunction
def compose[A](g: A => K): A => Set[V]

Attributes

Inherited from:
Function1
def concat[B >: (K, Set[V])](suffix: IterableOnce[B]): Iterable[B]

Attributes

Inherited from:
IterableOps
def concat[V2 >: Set[V]](suffix: IterableOnce[(K, V2)]): Map[K, V2]

Attributes

Inherited from:
MapOps
def contains(key: K): Boolean

Attributes

Inherited from:
MapOps
def copyToArray[B >: (K, Set[V])](xs: Array[B], start: Int, len: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: (K, Set[V])](xs: Array[B], start: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: (K, Set[V])](xs: Array[B]): Int

Attributes

Inherited from:
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: ((K, Set[V]), B) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def count(p: ((K, Set[V])) => Boolean): Int

Attributes

Inherited from:
IterableOnceOps
def default(key: K): Set[V]

Attributes

Inherited from:
MapOps
def drop(n: Int): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def dropRight(n: Int): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def dropWhile(p: ((K, Set[V])) => Boolean): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def elementWise: ElementWiseExtractor[K, Set[V]]

Attributes

Inherited from:
PartialFunction
override def empty: Map[K, Set[V]]

Attributes

Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from:
MapFactoryDefaults
override def equals(o: Any): Boolean

Compares the receiver object (this) with the argument object (that) for equivalence.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

  • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
  • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Value parameters

that

the object to compare against this object for equality.

Attributes

Returns

true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
Map -> Equals -> Any
Inherited from:
Map
def exists(p: ((K, Set[V])) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def filter(pred: ((K, Set[V])) => Boolean): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def filterInPlace(p: (K, Set[V]) => Boolean): MapOps.this.type

Attributes

Inherited from:
MapOps
def filterNot(pred: ((K, Set[V])) => Boolean): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def find(p: ((K, Set[V])) => Boolean): Option[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def flatMap[B](f: ((K, Set[V])) => IterableOnce[B]): Iterable[B]

Attributes

Inherited from:
IterableOps
def flatMap[K2, V2](f: ((K, Set[V])) => IterableOnce[(K2, V2)]): Map[K2, V2]

Attributes

Inherited from:
MapOps
def flatten[B](implicit asIterable: ((K, Set[V])) => IterableOnce[B]): Iterable[B]

Attributes

Inherited from:
IterableOps
def fold[A1 >: (K, Set[V])](z: A1)(op: (A1, A1) => A1): A1

Attributes

Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, (K, Set[V])) => B): B

Attributes

Inherited from:
IterableOnceOps
def foldRight[B](z: B)(op: ((K, Set[V]), B) => B): B

Attributes

Inherited from:
IterableOnceOps
def forall(p: ((K, Set[V])) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def foreach[U](f: ((K, Set[V])) => U): Unit

Attributes

Inherited from:
IterableOnceOps
def foreachEntry[U](f: (K, Set[V]) => U): Unit

Attributes

Inherited from:
MapOps
override protected def fromSpecific(coll: IterableOnce[(K, Set[V])]): Map[K, Set[V]]

Attributes

Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from:
MapFactoryDefaults
def get(key: K): Option[Set[V]]

Return the value associated with the key by looking it up in this hash table.

Return the value associated with the key by looking it up in this hash table.

Value parameters

key

the key used for look up

Attributes

Inherited from:
LinHashMap
def getOrElse[V1 >: Set[V]](key: K, default: => V1): V1

Attributes

Inherited from:
MapOps
def getOrElseUpdate(key: K, op: => Set[V]): Set[V]

Attributes

Inherited from:
MapOps
def groupBy[K](f: ((K, Set[V])) => K): Map[K, Map[K, Set[V]]]

Attributes

Inherited from:
IterableOps
def groupMap[K, B](key: ((K, Set[V])) => K)(f: ((K, Set[V])) => B): Map[K, Iterable[B]]

Attributes

Inherited from:
IterableOps
def groupMapReduce[K, B](key: ((K, Set[V])) => K)(f: ((K, Set[V])) => B)(reduce: (B, B) => B): Map[K, B]

Attributes

Inherited from:
IterableOps
def grouped(size: Int): Iterator[Map[K, Set[V]]]

Attributes

Inherited from:
IterableOps
override def hashCode(): Int

Calculates a hash code value for the object.

Calculates a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Attributes

Returns

the hash code value for this object.

Definition Classes
Map -> Any
Inherited from:
Map
def head: (K, Set[V])

Attributes

Inherited from:
IterableOps
def headOption: Option[(K, Set[V])]

Attributes

Inherited from:
IterableOps
def init: Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def inits: Iterator[Map[K, Set[V]]]

Attributes

Inherited from:
IterableOps
def isDefinedAt(key: K): Boolean

Attributes

Inherited from:
MapOps
def isEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
override def isTraversableAgain: Boolean

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
override def iterableFactory: IterableFactory[Iterable]

Attributes

Definition Classes
Iterable -> Iterable -> IterableOps
Inherited from:
Iterable
def iterator: Iterator[(K, Set[V])]

Return an iterator for retrieving all the elements in this hash table.

Return an iterator for retrieving all the elements in this hash table.

Attributes

See also

scala.collection.IterableOnce

Inherited from:
LinHashMap
def keySet: Set[K]

Attributes

Inherited from:
MapOps
def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S

Attributes

Inherited from:
MapOps
def keys: Iterable[K]

Attributes

Inherited from:
MapOps
def keysIterator: Iterator[K]

Attributes

Inherited from:
MapOps
override def knownSize: Int

Attributes

Definition Classes
MapOps -> Growable -> IterableOnce
Inherited from:
MapOps
def last: (K, Set[V])

Attributes

Inherited from:
IterableOps
def lastOption: Option[(K, Set[V])]

Attributes

Inherited from:
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[(K, Set[V]), B, Iterable.this.type]

Attributes

Inherited from:
Iterable
def lift: K => Option[Set[V]]

Attributes

Inherited from:
PartialFunction
def map[B](f: ((K, Set[V])) => B): Iterable[B]

Attributes

Inherited from:
IterableOps
def map[K2, V2](f: ((K, Set[V])) => (K2, V2)): Map[K2, V2]

Attributes

Inherited from:
MapOps
override def mapFactory: MapFactory[Map]

Attributes

Definition Classes
Map -> Map -> MapOps
Inherited from:
Map
def mapResult[NewTo](f: (Map[K, Set[V]]) => NewTo): Builder[(K, Set[V]), NewTo]

Attributes

Inherited from:
Builder
def mapValuesInPlace(f: (K, Set[V]) => Set[V]): MapOps.this.type

Attributes

Inherited from:
MapOps
def max[B >: (K, Set[V])](implicit ord: Ordering[B]): (K, Set[V])

Attributes

Inherited from:
IterableOnceOps
def maxBy[B](f: ((K, Set[V])) => B)(implicit ord: Ordering[B]): (K, Set[V])

Attributes

Inherited from:
IterableOnceOps
def maxByOption[B](f: ((K, Set[V])) => B)(implicit ord: Ordering[B]): Option[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def maxOption[B >: (K, Set[V])](implicit ord: Ordering[B]): Option[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def min[B >: (K, Set[V])](implicit ord: Ordering[B]): (K, Set[V])

Attributes

Inherited from:
IterableOnceOps
def minBy[B](f: ((K, Set[V])) => B)(implicit ord: Ordering[B]): (K, Set[V])

Attributes

Inherited from:
IterableOnceOps
def minByOption[B](f: ((K, Set[V])) => B)(implicit ord: Ordering[B]): Option[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def minOption[B >: (K, Set[V])](implicit ord: Ordering[B]): Option[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
final def mkString: String

Attributes

Inherited from:
IterableOnceOps
final def mkString(sep: String): String

Attributes

Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String

Attributes

Inherited from:
IterableOnceOps
override protected def newSpecificBuilder: Builder[(K, Set[V]), Map[K, Set[V]]]

Attributes

Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from:
MapFactoryDefaults
def nonEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
def orElse[A1 <: K, B1 >: Set[V]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

Attributes

Inherited from:
PartialFunction
def partition(p: ((K, Set[V])) => Boolean): (Map[K, Set[V]], Map[K, Set[V]])

Attributes

Inherited from:
IterableOps
def partitionMap[A1, A2](f: ((K, Set[V])) => Either[A1, A2]): (Iterable[A1], Iterable[A2])

Attributes

Inherited from:
IterableOps
def product[B >: (K, Set[V])](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def put(key: K, value: Set[V]): Option[Set[V]]

Attributes

Inherited from:
MapOps
def reduce[B >: (K, Set[V])](op: (B, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeft[B >: (K, Set[V])](op: (B, (K, Set[V])) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeftOption[B >: (K, Set[V])](op: (B, (K, Set[V])) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceOption[B >: (K, Set[V])](op: (B, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceRight[B >: (K, Set[V])](op: ((K, Set[V]), B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceRightOption[B >: (K, Set[V])](op: ((K, Set[V]), B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def remove(key: K): Option[Set[V]]

Attributes

Inherited from:
MapOps
def result(): Map[K, Set[V]]

Attributes

Inherited from:
MapOps
protected def reversed: Iterable[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def runWith[U](action: (Set[V]) => U): K => Boolean

Attributes

Inherited from:
PartialFunction

Attributes

Inherited from:
Cloneable
def scan[B >: (K, Set[V])](z: B)(op: (B, B) => B): Iterable[B]

Attributes

Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, (K, Set[V])) => B): Iterable[B]

Attributes

Inherited from:
IterableOps
def scanRight[B](z: B)(op: ((K, Set[V]), B) => B): Iterable[B]

Attributes

Inherited from:
IterableOps
def show(): Unit

Show/print this hash table.

Show/print this hash table.

Attributes

Inherited from:
LinHashMap
override def size: Int

Return the size (order * number of home buckets) of this hash table.

Return the size (order * number of home buckets) of this hash table.

Attributes

Definition Classes
LinHashMap -> IterableOnceOps
Inherited from:
LinHashMap
inline def size0: Int

Attributes

Inherited from:
LinHashMap
def sizeCompare(that: Iterable[_]): Int

Attributes

Inherited from:
IterableOps
def sizeCompare(otherSize: Int): Int

Attributes

Inherited from:
IterableOps
final def sizeHint(coll: IterableOnce[_], delta: Int): Unit

Attributes

Inherited from:
Builder
def sizeHint(size: Int): Unit

Attributes

Inherited from:
Builder
final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit

Attributes

Inherited from:
Builder
final def sizeIs: SizeCompareOps

Attributes

Inherited from:
IterableOps
def slice(from: Int, until: Int): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def sliding(size: Int, step: Int): Iterator[Map[K, Set[V]]]

Attributes

Inherited from:
IterableOps
def sliding(size: Int): Iterator[Map[K, Set[V]]]

Attributes

Inherited from:
IterableOps
def span(p: ((K, Set[V])) => Boolean): (Map[K, Set[V]], Map[K, Set[V]])

Attributes

Inherited from:
IterableOps
override def splitAt(n: Int): (Map[K, Set[V]], Map[K, Set[V]])

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, Set[V]), S]): S

Attributes

Inherited from:
IterableOnce
def subtractAll(xs: IterableOnce[K]): Shrinkable.this.type

Attributes

Inherited from:
Shrinkable
def subtractOne(key: K): LinHashMap.this.type

Subtract/remove the one element (key-value pair) with the given key. Note: it merges home buckets when load factor is too low.

Subtract/remove the one element (key-value pair) with the given key. Note: it merges home buckets when load factor is too low.

Value parameters

key

the key whose element is to be removed

Attributes

Inherited from:
LinHashMap
def sum[B >: (K, Set[V])](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def tail: Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def tails: Iterator[Map[K, Set[V]]]

Attributes

Inherited from:
IterableOps
def take(n: Int): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def takeRight(n: Int): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
def takeWhile(p: ((K, Set[V])) => Boolean): Map[K, Set[V]]

Attributes

Inherited from:
IterableOps
override def tapEach[U](f: ((K, Set[V])) => U): Map[K, Set[V]]

Attributes

Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def to[C1](factory: Factory[(K, Set[V]), C1]): C1

Attributes

Inherited from:
IterableOnceOps
def toArray[B >: (K, Set[V]) : ClassTag]: Array[B]

Attributes

Inherited from:
IterableOnceOps
final def toBuffer[B >: (K, Set[V])]: Buffer[B]

Attributes

Inherited from:
IterableOnceOps
def toIndexedSeq: IndexedSeq[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def toList: List[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: (K, Set[V]) <:< (K, V)): Map[K, V]

Attributes

Inherited from:
IterableOnceOps
def toSeq: Seq[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def toSet[B >: (K, Set[V])]: Set[B]

Attributes

Inherited from:
IterableOnceOps
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Map -> Function1 -> Iterable -> Any
Inherited from:
Map
def toVector: Vector[(K, Set[V])]

Attributes

Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: ((K, Set[V])) => Iterable[B]): Iterable[Iterable[B]]

Attributes

Inherited from:
IterableOps
def unapply(a: K): Option[Set[V]]

Attributes

Inherited from:
PartialFunction
def unzip[A1, A2](implicit asPair: ((K, Set[V])) => (A1, A2)): (Iterable[A1], Iterable[A2])

Attributes

Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: ((K, Set[V])) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

Attributes

Inherited from:
IterableOps
def update(key: K, value: Set[V]): Unit

Attributes

Inherited from:
MapOps
def updateWith(key: K)(remappingFunction: (Option[Set[V]]) => Option[Set[V]]): Option[Set[V]]

Attributes

Inherited from:
MapOps
def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[Set[V], S]): S

Attributes

Inherited from:
MapOps
def values: Iterable[Set[V]]

Attributes

Inherited from:
MapOps
def valuesIterator: Iterator[Set[V]]

Attributes

Inherited from:
MapOps
override def view: MapView[K, Set[V]]

Attributes

Definition Classes
MapOps -> IterableOps
Inherited from:
MapOps
def withDefault(d: K => Set[V]): Map[K, Set[V]]

Attributes

Inherited from:
Map
def withDefaultValue(d: Set[V]): Map[K, Set[V]]

Attributes

Inherited from:
Map
override def withFilter(p: ((K, Set[V])) => Boolean): WithFilter[K, Set[V], Iterable, Map]

Attributes

Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from:
MapFactoryDefaults
def zip[B](that: IterableOnce[B]): Iterable[((K, Set[V]), B)]

Attributes

Inherited from:
IterableOps
def zipAll[A1 >: (K, Set[V]), B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]

Attributes

Inherited from:
IterableOps
def zipWithIndex: Iterable[((K, Set[V]), Int)]

Attributes

Inherited from:
IterableOps

Deprecated and Inherited methods

def +[V1 >: Set[V]](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): Map[K, V1]

Attributes

Deprecated
[Since version 2.13.0] Use ++ with an explicit collection argument instead of + with varargs
Inherited from:
MapOps
def +[V1 >: Set[V]](kv: (K, V1)): Map[K, V1]

Attributes

Deprecated
[Since version 2.13.0] Consider requiring an immutable Map or fall back to Map.concat.
Inherited from:
MapOps
def ++:[B >: (K, Set[V])](that: IterableOnce[B]): Iterable[B]

Attributes

Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from:
IterableOps
def ++:[V1 >: Set[V]](that: IterableOnce[(K, V1)]): Map[K, V1]

Attributes

Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from:
MapOps
final def +=(elem1: (K, Set[V]), elem2: (K, Set[V]), elems: (K, Set[V])*): Growable.this.type

Attributes

Deprecated
[Since version 2.13.0] Use `++=` aka `addAll` instead of varargs `+=`; infix operations with an operand of multiple args will be deprecated
Inherited from:
Growable
final def -(key1: K, key2: K, keys: K*): Map[K, Set[V]]

Attributes

Deprecated
[Since version 2.13.0] Use -- or removeAll on an immutable Map
Inherited from:
MapOps
final def -(key: K): Map[K, Set[V]]

Attributes

Deprecated
[Since version 2.13.0] Use - or remove on an immutable Map
Inherited from:
MapOps
def --(keys: IterableOnce[K]): Map[K, Set[V]]

Attributes

Deprecated
[Since version 2.13.0] Consider requiring an immutable Map.
Inherited from:
MapOps
def -=(elem1: K, elem2: K, elems: K*): Shrinkable.this.type

Attributes

Deprecated
[Since version 2.13.3] Use `--=` aka `subtractAll` instead of varargs `-=`; infix operations with an operand of multiple args will be deprecated
Inherited from:
Shrinkable
final def /:[B](z: B)(op: (B, (K, Set[V])) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: ((K, Set[V]), B) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, (K, Set[V])) => B, combop: (B, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
def companion: IterableFactory[Iterable]

Attributes

Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: (K, Set[V])](dest: Buffer[B]): Unit

Attributes

Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
def filterKeys(p: K => Boolean): MapView[K, Set[V]]

Attributes

Deprecated
[Since version 2.13.0] Use .view.filterKeys(f). A future version will include a strict version of this method (for now, .view.filterKeys(p).toMap).
Inherited from:
MapOps
def hasDefiniteSize: Boolean

Attributes

Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
def mapValues[W](f: (Set[V]) => W): MapView[K, W]

Attributes

Deprecated
[Since version 2.13.0] Use .view.mapValues(f). A future version will include a strict version of this method (for now, .view.mapValues(f).toMap).
Inherited from:
MapOps
final def repr: Map[K, Set[V]]

Attributes

Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
final def retain(p: (K, Set[V]) => Boolean): MapOps.this.type

Attributes

Deprecated
[Since version 2.13.0] Use filterInPlace instead
Inherited from:
MapOps
def seq: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
final def toIterator: Iterator[(K, Set[V])]

Attributes

Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[(K, Set[V])]

Attributes

Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[(K, Set[V])]

Attributes

Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
final def transform(f: (K, Set[V]) => Set[V]): MapOps.this.type

Attributes

Deprecated
[Since version 2.13.0] Use mapValuesInPlace instead
Inherited from:
MapOps
def updated[V1 >: Set[V]](key: K, value: V1): Map[K, V1]

Attributes

Deprecated
[Since version 2.13.0] Use m.clone().addOne((k,v)) instead of m.updated(k, v)
Inherited from:
MapOps
def view(from: Int, until: Int): View[(K, Set[V])]

Attributes

Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from:
IterableOps

Inherited fields

var count: Int

Attributes

Inherited from:
LinHashMap