scala-parallel-collections/scala.collection.immutable/OldHashMap

OldHashMap

sealed abstract class OldHashMap[K, +V] extends AbstractMap[K, V] with MapOps[K, V, [K, V] =>> OldHashMap[K, V], OldHashMap[K, V]] with StrictOptimizedIterableOps[(K, V), [A] =>> Iterable[A], OldHashMap[K, V]] with StrictOptimizedMapOps[K, V, [K, V] =>> OldHashMap[K, V], OldHashMap[K, V]] with MapFactoryDefaults[K, V, [K, V] =>> OldHashMap[K, V], [A] =>> Iterable[A]] with Serializable

This class implements immutable maps using a hash trie.

'''Note:''' The builder of this hash map may return specialized representations for small maps.

Type Params
K

the type of the keys contained in this hash map.

V

the type of the values associated with the keys.

See also

"Scala's Collection Library overview" section on Hash Tries for more information.

Companion
object
trait Serializable
trait StrictOptimizedMapOps[K, V, [K, V] =>> OldHashMap[K, V], OldHashMap[K, V]]
trait StrictOptimizedIterableOps[(K, V), [A] =>> Iterable[A], OldHashMap[K, V]]
class AbstractMap[K, V]
trait Map[K, V]
trait MapOps[K, V, [K, V] =>> OldHashMap[K, V], OldHashMap[K, V]]
trait Iterable[(K, V)]
class AbstractMap[K, V]
trait Map[K, V]
trait Equals
trait MapFactoryDefaults[K, V, [K, V] =>> OldHashMap[K, V], [A] =>> Iterable[A]]
trait MapOps[K, V, [K, V] =>> OldHashMap[K, V], OldHashMap[K, V]]
trait PartialFunction[K, V]
trait K => V
class AbstractIterable[(K, V)]
trait Iterable[(K, V)]
trait IterableFactoryDefaults[(K, V), [A] =>> Iterable[A]]
trait IterableOps[(K, V), [A] =>> Iterable[A], OldHashMap[K, V]]
trait IterableOnceOps[(K, V), [A] =>> Iterable[A], OldHashMap[K, V]]
trait IterableOnce[(K, V)]
class Object
trait Matchable
class Any
class HashTrieMap[K, V]
class OldHashMap1[K, V]

Type members

Inherited classlikes

protected class ImmutableKeySet
Inherited from
MapOps

Value members

Concrete methods

@inline
final override def +[V1 >: V](kv: (K, V1)): OldHashMap[K, V1]
Definition Classes
MapOps -> MapOps
final override def contains(key: K): Boolean
Definition Classes
MapOps
override def filter(pred: (K, V) => Boolean): OldHashMap[K, V]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
override def filterNot(pred: (K, V) => Boolean): OldHashMap[K, V]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
def get(key: K): Option[V]
override def init: OldHashMap[K, V]
Definition Classes
IterableOps
override def mapFactory: MapFactory[[K, V] =>> OldHashMap[K, V]]
Definition Classes
Map -> Map -> MapOps
def merged[V1 >: V](that: OldHashMap[K, V1])(mergef: ((K, V1), (K, V1)) => (K, V1)): OldHashMap[K, V1]

Creates a new map which is the merge of this and the argument hash map.

Creates a new map which is the merge of this and the argument hash map.

Uses the specified collision resolution function if two keys are the same. The collision resolution function will always take the first argument from this hash map and the second from that.

The merged method is on average more performant than doing a traversal and reconstructing a new immutable hash map from scratch, or ++.

Type Params
V1

the value type of the other hash map

Value Params
mergef

the merge function or null if the first key-value pair is to be picked

that

the other hash map

final def removed(key: K): OldHashMap[K, V]
def split: Seq[OldHashMap[K, V]]
override def tail: OldHashMap[K, V]
Definition Classes
IterableOps
final def updated[V1 >: V](key: K, value: V1): OldHashMap[K, V1]

Inherited methods

@inline
final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
def ++[V2 >: V](xs: IterableOnce[(K, V2)]): OldHashMap[K, V2]
Inherited from
MapOps
@inline
final def -(key: K): OldHashMap[K, V]
Inherited from
MapOps
@inline
final override def --(keys: IterableOnce[K]): OldHashMap[K, V]
Definition Classes
MapOps -> MapOps
Inherited from
MapOps
@inline
final def addString(b: StringBuilder): StringBuilder
Inherited from
IterableOnceOps
@inline
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from
IterableOnceOps
override def addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder
Definition Classes
MapOps -> IterableOnceOps
Inherited from
MapOps
def andThen[C](k: PartialFunction[V, C]): PartialFunction[K, C]
Inherited from
PartialFunction
override def andThen[C](k: V => C): PartialFunction[K, C]
Definition Classes
PartialFunction -> Function1
Inherited from
PartialFunction
@throws(scala.this.throws.$lessinit$greater$default$1[scala.NoSuchElementException])
def apply(key: K): V
Inherited from
MapOps
override def applyOrElse[K1 <: K, V1 >: V](x: K1, default: K1 => V1): V1
Definition Classes
MapOps -> PartialFunction
Inherited from
MapOps
def canEqual(that: Any): Boolean
Inherited from
Map
override def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): OldHashMap[K2, V2]
Definition Classes
StrictOptimizedMapOps -> MapOps
Inherited from
StrictOptimizedMapOps
def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
Inherited from
IterableOnceOps
def compose[R](k: PartialFunction[R, K]): PartialFunction[R, V]
Inherited from
PartialFunction
@unspecialized
def compose[A](g: A => K): A => V
Inherited from
Function1
def concat[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
override def concat[V2 >: V](suffix: IterableOnce[(K, V2)]): OldHashMap[K, V2]
Definition Classes
StrictOptimizedMapOps -> MapOps
Inherited from
StrictOptimizedMapOps
def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: (K, V)](xs: Array[B]): Int
Inherited from
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: ((K, V), B) => Boolean): Boolean
Inherited from
IterableOnceOps
def count(p: (K, V) => Boolean): Int
Inherited from
IterableOnceOps
@throws(scala.this.throws.$lessinit$greater$default$1[scala.NoSuchElementException])
def default(key: K): V
Inherited from
MapOps
def drop(n: Int): OldHashMap[K, V]
Inherited from
IterableOps
override def dropRight(n: Int): OldHashMap[K, V]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def dropWhile(p: (K, V) => Boolean): OldHashMap[K, V]
Inherited from
IterableOps
def elementWise: ElementWiseExtractor[K, V]
Inherited from
PartialFunction
override def empty: OldHashMap[K, V]
Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from
MapFactoryDefaults
override def equals(o: Any): Boolean
Definition Classes
Map -> Equals -> Any
Inherited from
Map
def exists(p: (K, V) => Boolean): Boolean
Inherited from
IterableOnceOps
def find(p: (K, V) => Boolean): Option[(K, V)]
Inherited from
IterableOnceOps
override def flatMap[B](f: (K, V) => IterableOnce[B]): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def flatMap[K2, V2](f: (K, V) => IterableOnce[(K2, V2)]): OldHashMap[K2, V2]
Definition Classes
StrictOptimizedMapOps -> MapOps
Inherited from
StrictOptimizedMapOps
override def flatten[B](implicit toIterableOnce: (K, V) => IterableOnce[B]): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1
Inherited from
IterableOnceOps
def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
Inherited from
IterableOnceOps
def foldRight[B](z: B)(op: ((K, V), B) => B): B
Inherited from
IterableOnceOps
def forall(p: (K, V) => Boolean): Boolean
Inherited from
IterableOnceOps
def foreach[U](f: (K, V) => U): Unit
Inherited from
IterableOnceOps
def foreachEntry[U](f: (K, V) => U): Unit
Inherited from
MapOps
override protected def fromSpecific(coll: IterableOnce[(K, V)]): OldHashMap[K, V]
Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from
MapFactoryDefaults
def getOrElse[V1 >: V](key: K, default: => V1): V1
Inherited from
MapOps
def groupBy[K](f: (K, V) => K): Map[K, OldHashMap[K, V]]
Inherited from
IterableOps
def groupMap[K, B](key: (K, V) => K)(f: (K, V) => B): Map[K, Iterable[B]]
Inherited from
IterableOps
def groupMapReduce[K, B](key: (K, V) => K)(f: (K, V) => B)(reduce: (B, B) => B): Map[K, B]
Inherited from
IterableOps
def grouped(size: Int): Iterator[OldHashMap[K, V]]
Inherited from
IterableOps
override def hashCode(): Int
Definition Classes
Map -> Any
Inherited from
Map
def head: (K, V)
Inherited from
IterableOps
def headOption: Option[(K, V)]
Inherited from
IterableOps
def inits: Iterator[OldHashMap[K, V]]
Inherited from
IterableOps
def isDefinedAt(key: K): Boolean
Inherited from
MapOps
def isEmpty: Boolean
Inherited from
IterableOnceOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
override def iterableFactory: IterableFactory[[A] =>> Iterable[A]]
Definition Classes
Iterable -> Iterable -> IterableOps
Inherited from
Iterable
def iterator: Iterator[(K, V)]
Inherited from
IterableOnce
override def keySet: Set[K]
Definition Classes
MapOps -> MapOps
Inherited from
MapOps
def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S
Inherited from
MapOps
def keys: Iterable[K]
Inherited from
MapOps
def keysIterator: Iterator[K]
Inherited from
MapOps
def knownSize: Int
Inherited from
IterableOnce
def last: (K, V)
Inherited from
IterableOps
def lastOption: Option[(K, V)]
Inherited from
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[(K, V), B, OldHashMap[K, V]]
Inherited from
Iterable
def lift: K => Option[V]
Inherited from
PartialFunction
override def map[B](f: (K, V) => B): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def map[K2, V2](f: (K, V) => (K2, V2)): OldHashMap[K2, V2]
Definition Classes
StrictOptimizedMapOps -> MapOps
Inherited from
StrictOptimizedMapOps
def max[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
Inherited from
IterableOnceOps
def maxBy[B](f: (K, V) => B)(implicit cmp: Ordering[B]): (K, V)
Inherited from
IterableOnceOps
def maxByOption[B](f: (K, V) => B)(implicit cmp: Ordering[B]): Option[(K, V)]
Inherited from
IterableOnceOps
def maxOption[B >: (K, V)](implicit ord: Ordering[B]): Option[(K, V)]
Inherited from
IterableOnceOps
def min[B >: (K, V)](implicit ord: Ordering[B]): (K, V)
Inherited from
IterableOnceOps
def minBy[B](f: (K, V) => B)(implicit cmp: Ordering[B]): (K, V)
Inherited from
IterableOnceOps
def minByOption[B](f: (K, V) => B)(implicit cmp: Ordering[B]): Option[(K, V)]
Inherited from
IterableOnceOps
def minOption[B >: (K, V)](implicit ord: Ordering[B]): Option[(K, V)]
Inherited from
IterableOnceOps
@inline
final def mkString: String
Inherited from
IterableOnceOps
@inline
final def mkString(sep: String): String
Inherited from
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from
IterableOnceOps
override protected def newSpecificBuilder: Builder[(K, V), OldHashMap[K, V]]
Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from
MapFactoryDefaults
@deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
def nonEmpty: Boolean
Inherited from
IterableOnceOps
def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from
PartialFunction
override def partition(p: (K, V) => Boolean): (OldHashMap[K, V], OldHashMap[K, V])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def partitionMap[A1, A2](f: (K, V) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def product[B >: (K, V)](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def reduce[B >: (K, V)](op: (B, B) => B): B
Inherited from
IterableOnceOps
def reduceLeft[B >: (K, V)](op: (B, (K, V)) => B): B
Inherited from
IterableOnceOps
def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) => B): Option[B]
Inherited from
IterableOnceOps
def reduceOption[B >: (K, V)](op: (B, B) => B): Option[B]
Inherited from
IterableOnceOps
def reduceRight[B >: (K, V)](op: ((K, V), B) => B): B
Inherited from
IterableOnceOps
def reduceRightOption[B >: (K, V)](op: ((K, V), B) => B): Option[B]
Inherited from
IterableOnceOps
def removedAll(keys: IterableOnce[K]): OldHashMap[K, V]
Inherited from
MapOps
protected def reversed: Iterable[(K, V)]
Inherited from
IterableOnceOps
def runWith[U](action: V => U): K => Boolean
Inherited from
PartialFunction
def scan[B >: (K, V)](z: B)(op: (B, B) => B): Iterable[B]
Inherited from
IterableOps
override def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]
Inherited from
IterableOps
def size: Int
Inherited from
IterableOnceOps
def sizeCompare(that: Iterable[_]): Int
Inherited from
IterableOps
def sizeCompare(otherSize: Int): Int
Inherited from
IterableOps
@inline
final def sizeIs: SizeCompareOps
Inherited from
IterableOps
def slice(from: Int, until: Int): OldHashMap[K, V]
Inherited from
IterableOps
def sliding(size: Int, step: Int): Iterator[OldHashMap[K, V]]
Inherited from
IterableOps
def sliding(size: Int): Iterator[OldHashMap[K, V]]
Inherited from
IterableOps
override def span(p: (K, V) => Boolean): (OldHashMap[K, V], OldHashMap[K, V])
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def splitAt(n: Int): (OldHashMap[K, V], OldHashMap[K, V])
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S
Inherited from
IterableOnce
def sum[B >: (K, V)](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def tails: Iterator[OldHashMap[K, V]]
Inherited from
IterableOps
def take(n: Int): OldHashMap[K, V]
Inherited from
IterableOps
override def takeRight(n: Int): OldHashMap[K, V]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def takeWhile(p: (K, V) => Boolean): OldHashMap[K, V]
Inherited from
IterableOps
override def tapEach[U](f: (K, V) => U): OldHashMap[K, V]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def to[C1](factory: Factory[(K, V), C1]): C1
Inherited from
IterableOnceOps
def toArray[B >: (K, V)](implicit ClassTag[B]): Array[B]
Inherited from
IterableOnceOps
@inline
final def toBuffer[B >: (K, V)]: Buffer[B]
Inherited from
IterableOnceOps
def toIndexedSeq: IndexedSeq[(K, V)]
Inherited from
IterableOnceOps
final def toIterable: OldHashMap[K, V]
Inherited from
Iterable
def toList: List[(K, V)]
Inherited from
IterableOnceOps
final override def toMap[K2, V2](implicit ev: (K, V) <:< (K2, V2)): Map[K2, V2]
Definition Classes
Map -> IterableOnceOps
Inherited from
Map
def toSeq: Seq[(K, V)]
Inherited from
IterableOnceOps
def toSet[B >: (K, V)]: Set[B]
Inherited from
IterableOnceOps
override def toString(): String
Definition Classes
Map -> Function1 -> Iterable -> Any
Inherited from
Map
def toVector: Vector[(K, V)]
Inherited from
IterableOnceOps
def transform[W](f: (K, V) => W): OldHashMap[K, W]
Inherited from
MapOps
def transpose[B](implicit asIterable: (K, V) => Iterable[B]): Iterable[Iterable[B]]
Inherited from
IterableOps
def unapply(a: K): Option[V]
Inherited from
PartialFunction
override def unzip[A1, A2](implicit asPair: (K, V) => (A1, A2)): (Iterable[A1], Iterable[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](implicit asTriple: (K, V) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def updatedWith[V1 >: V](key: K)(remappingFunction: Option[V] => Option[V1]): OldHashMap[K, V1]
Inherited from
MapOps
def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S
Inherited from
MapOps
def values: Iterable[V]
Inherited from
MapOps
def valuesIterator: Iterator[V]
Inherited from
MapOps
override def view: MapView[K, V]
Definition Classes
MapOps -> IterableOps
Inherited from
MapOps
def withDefault[V1 >: V](d: K => V1): Map[K, V1]
Inherited from
Map
def withDefaultValue[V1 >: V](d: V1): Map[K, V1]
Inherited from
Map
override def withFilter(p: (K, V) => Boolean): WithFilter[K, V, [A] =>> Iterable[A], [K, V] =>> OldHashMap[K, V]]
Definition Classes
MapFactoryDefaults -> IterableOps
Inherited from
MapFactoryDefaults
override def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def zipAll[A1 >: (K, V), B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
Inherited from
IterableOps
override def zipWithIndex: Iterable[((K, V), Int)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps

Deprecated and Inherited methods

@deprecated(message = "Use ++ with an explicit collection argument instead of + with varargs", since = "2.13.0")
override def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): OldHashMap[K, V1]
Deprecated
[Since version 2.13.0] Use ++ with an explicit collection argument instead of + with varargs
Definition Classes
StrictOptimizedMapOps -> MapOps
Inherited from
StrictOptimizedMapOps
@deprecated(message = "Use ++ instead of ++: for collections of type Iterable", since = "2.13.0")
def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from
IterableOps
@deprecated(message = "Use ++ instead of ++: for collections of type Iterable", since = "2.13.0")
def ++:[V1 >: V](that: IterableOnce[(K, V1)]): OldHashMap[K, V1]
Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from
MapOps
@deprecated(message = "Use -- with an explicit collection", since = "2.13.0")
def -(key1: K, key2: K, keys: K*): OldHashMap[K, V]
Deprecated
[Since version 2.13.0] Use -- with an explicit collection
Inherited from
MapOps
@inline @deprecated(message = "Use foldLeft instead of /:", since = "2.13.0")
final def /:[B](z: B)(op: (B, (K, V)) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use foldRight instead of :\\", since = "2.13.0")
final def :\[B](z: B)(op: ((K, V), B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from
IterableOnceOps
@deprecated(message = "`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", since = "2.13.0")
def aggregate[B](z: => B)(seqop: (B, (K, V)) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from
IterableOnceOps
@inline @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @deprecated(message = "Use iterableFactory instead", since = "2.13.0")
def companion: IterableFactory[[A] =>> Iterable[A]]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from
IterableOps
@inline @deprecated(message = "Use `dest ++= coll` instead", since = "2.13.0")
final def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from
IterableOnceOps
@deprecated(message = "Use .view.filterKeys(f). A future version will include a strict version of this method (for now, .view.filterKeys(p).toMap).", since = "2.13.0")
def filterKeys(p: K => Boolean): MapView[K, V]
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
@deprecated(message = "Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", since = "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from
IterableOnceOps
@deprecated(message = "Use .view.mapValues(f). A future version will include a strict version of this method (for now, .view.mapValues(f).toMap).", since = "2.13.0")
def mapValues[W](f: V => W): MapView[K, W]
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
@deprecated(message = "Use coll instead of repr in a collection implementation, use the collection value itself from the outside", since = "2.13.0")
final def repr: OldHashMap[K, V]
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
@deprecated(message = "Iterable.seq always returns the iterable itself", since = "2.13.0")
def seq: OldHashMap[K, V]
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from
Iterable
@inline @deprecated(message = "Use .iterator instead of .toIterator", since = "2.13.0")
final def toIterator: Iterator[(K, V)]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use .to(LazyList) instead of .toStream", since = "2.13.0")
final def toStream: Stream[(K, V)]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from
IterableOnceOps
@deprecated(message = "Use toIterable instead", since = "2.13.0")
final def toTraversable: Iterable[(K, V)]
Deprecated
[Since version 2.13.0] Use toIterable instead
Inherited from
IterableOps
@deprecated(message = "Use .view.slice(from, until) instead of .view(from, until)", since = "2.13.0")
def view(from: Int, until: Int): View[(K, V)]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from
IterableOps