HashTrieMap

scala.collection.immutable.OldHashMap.HashTrieMap
final class HashTrieMap[K, +V](val bitmap: Int, val elems: Array[OldHashMap[K, V]], val size0: Int) extends OldHashMap[K, V]

Attributes

Graph
Supertypes
class OldHashMap[K, V]
trait Serializable
class AbstractMap[K, V]
trait Map[K, V]
trait MapOps[K, V, OldHashMap, OldHashMap[K, V]]
trait Iterable[(K, V)]
class AbstractMap[K, V]
trait Map[K, V]
trait Equals
trait MapOps[K, V, OldHashMap, OldHashMap[K, V]]
trait PartialFunction[K, V]
trait K => V
class AbstractIterable[(K, V)]
trait Iterable[(K, V)]
trait IterableOps[(K, V), Iterable, OldHashMap[K, V]]
trait IterableOnceOps[(K, V), Iterable, OldHashMap[K, V]]
trait IterableOnce[(K, V)]
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

override def foreach[U](f: ((K, V)) => U): Unit

Attributes

Definition Classes
override def isEmpty: Boolean

Attributes

Definition Classes
override def iterator: Iterator[(K, V)]

Attributes

Definition Classes
override def knownSize: Int

Attributes

Definition Classes
override def removed0(key: K, hash: Int, level: Int): OldHashMap[K, V]

Attributes

Definition Classes
override def size: Int

Attributes

Definition Classes
override def split: Seq[OldHashMap[K, V]]

Attributes

Definition Classes

Inherited methods

final override def +[V1 >: V](kv: (K, V1)): OldHashMap[K, V1]

Attributes

Definition Classes
Inherited from:
OldHashMap
final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]

Attributes

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

Attributes

Inherited from:
MapOps
final def -(key: K): OldHashMap[K, V]

Attributes

Inherited from:
MapOps
final override def --(keys: IterableOnce[K]): OldHashMap[K, V]

Attributes

Definition Classes
Inherited from:
MapOps
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
Inherited from:
MapOps

Attributes

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

Attributes

Definition Classes
Inherited from:
PartialFunction
def apply(key: K): V

Attributes

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

Attributes

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

Attributes

Inherited from:
Map
override def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): OldHashMap[K2, V2]

Attributes

Definition Classes
Inherited from:
StrictOptimizedMapOps
def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

Attributes

Inherited from:
IterableOnceOps

Attributes

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

Attributes

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

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedMapOps
final override def contains(key: K): Boolean

Attributes

Definition Classes
Inherited from:
OldHashMap
def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Int

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
def default(key: K): V

Attributes

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

Attributes

Inherited from:
IterableOps
override def dropRight(n: Int): OldHashMap[K, V]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def dropWhile(p: ((K, V)) => Boolean): OldHashMap[K, V]

Attributes

Inherited from:
IterableOps

Attributes

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

Attributes

Definition Classes
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, V)) => Boolean): Boolean

Attributes

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

Attributes

Definition Classes
Inherited from:
OldHashMap
override def filterNot(pred: ((K, V)) => Boolean): OldHashMap[K, V]

Attributes

Definition Classes
Inherited from:
OldHashMap
def find(p: ((K, V)) => Boolean): Option[(K, V)]

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): OldHashMap[K2, V2]

Attributes

Definition Classes
Inherited from:
StrictOptimizedMapOps
override def flatten[B](implicit toIterableOnce: ((K, V)) => IterableOnce[B]): Iterable[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOps

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, V)

Attributes

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

Attributes

Inherited from:
IterableOps
override def init: OldHashMap[K, V]

Attributes

Definition Classes
Inherited from:
OldHashMap
def inits: Iterator[OldHashMap[K, V]]

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
MapOps
override def isTraversableAgain: Boolean

Attributes

Definition Classes
Inherited from:
IterableOps

Attributes

Definition Classes
Inherited from:
Iterable
override def keySet: Set[K]

Attributes

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

Attributes

Inherited from:
MapOps
def last: (K, V)

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def map[K2, V2](f: ((K, V)) => (K2, V2)): OldHashMap[K2, V2]

Attributes

Definition Classes
Inherited from:
StrictOptimizedMapOps

Attributes

Definition Classes
Inherited from:
OldHashMap
def max[B >: (K, V)](implicit ord: Ordering[B]): (K, V)

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
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 parameters

V1

the value type of the other hash map

Value parameters

mergef

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

that

the other hash map

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
final def mkString: String

Attributes

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

Attributes

Inherited from:
IterableOnceOps

Attributes

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

Attributes

Definition Classes
Inherited from:
MapFactoryDefaults

Attributes

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

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def product[B >: (K, V)](implicit num: Numeric[B]): B

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
final def removed(key: K): OldHashMap[K, V]

Attributes

Inherited from:
OldHashMap

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps
final def sizeIs: SizeCompareOps

Attributes

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

Attributes

Inherited from:
IterableOps

Attributes

Inherited from:
IterableOps

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def splitAt(n: Int): (OldHashMap[K, V], OldHashMap[K, V])

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
override def tail: OldHashMap[K, V]

Attributes

Definition Classes
Inherited from:
OldHashMap
def tails: Iterator[OldHashMap[K, V]]

Attributes

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

Attributes

Inherited from:
IterableOps
override def takeRight(n: Int): OldHashMap[K, V]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def takeWhile(p: ((K, V)) => Boolean): OldHashMap[K, V]

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def to[C1](factory: Factory[(K, V), C1]): C1

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Inherited from:
IterableOnceOps
final override def toMap[K2, V2](implicit ev: (K, V) <:< (K2, V2)): Map[K2, V2]

Attributes

Definition Classes
Inherited from:
Map
def toSeq: Seq[(K, V)]

Attributes

Inherited from:
IterableOnceOps
def toSet[B >: (K, 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, V)]

Attributes

Inherited from:
IterableOnceOps
def transform[W](f: (K, V) => W): OldHashMap[K, W]

Attributes

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

Attributes

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

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
final def updated[V1 >: V](key: K, value: V1): OldHashMap[K, V1]

Attributes

Inherited from:
OldHashMap
def updatedWith[V1 >: V](key: K)(remappingFunction: (Option[V]) => Option[V1]): OldHashMap[K, V1]

Attributes

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

Attributes

Inherited from:
MapOps
def values: Iterable[V]

Attributes

Inherited from:
MapOps

Attributes

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

Attributes

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

Attributes

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

Attributes

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

Attributes

Definition Classes
Inherited from:
MapFactoryDefaults
override def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def zipAll[A1 >: (K, V), B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]

Attributes

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

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps

Deprecated and Inherited methods

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

Attributes

Deprecated
[Since version 2.13.0] Use ++ with an explicit collection argument instead of + with varargs
Definition Classes
Inherited from:
StrictOptimizedMapOps
def ++:[B >: (K, 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 >: V](that: IterableOnce[(K, V1)]): OldHashMap[K, V1]

Attributes

Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from:
MapOps
def -(key1: K, key2: K, keys: K*): OldHashMap[K, V]

Attributes

Deprecated
[Since version 2.13.0] Use -- with an explicit collection
Inherited from:
MapOps
final def /:[B](z: B)(op: (B, (K, V)) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: ((K, 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, V)) => B, combop: (B, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] For sequential collections, prefer `foldLeft(z)(seqop)`. For parallel collections, use `ParIterableLike#aggregate`.
Inherited from:
IterableOnceOps

Attributes

Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: (K, 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, 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

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: (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: OldHashMap[K, 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
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, V)]

Attributes

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

Attributes

Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[(K, 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
def view(from: Int, until: Int): View[(K, V)]

Attributes

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