class
EqHashMap[K <: AnyRef, V] extends Map[K, V] with MapLike[K, V, EqHashMap[K, V]] with EqHash[(K, V), EqHashMap[K, V]]
Instance Constructors
-
new
EqHashMap(other: EqHashMap[K, V])
-
new
EqHashMap(_sizeHint: Int = EqHash.defCapacity)
Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+[B1 >: V](elem1: (K, B1), elem2: (K, B1), elems: (K, B1)*): Map[K, B1]
-
def
+[B1 >: V](kv: (K, B1)): Map[K, B1]
-
-
-
def
++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
-
def
++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
-
-
def
+=(kv: (K, V)): EqHashMap.this.type
-
def
+=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): EqHashMap.this.type
-
def
-(elem1: K, elem2: K, elems: K*): EqHashMap[K, V]
-
def
-(key: K): EqHashMap[K, V]
-
-
-
def
-=(key: K): EqHashMap.this.type
-
def
-=(elem1: K, elem2: K, elems: K*): EqHashMap.this.type
-
def
->[B](y: B): (EqHashMap[K, V], B)
-
def
/:[B](z: B)(op: (B, (K, V)) ⇒ B): B
-
def
:\[B](z: B)(op: ((K, V), B) ⇒ B): B
-
-
final
def
==(arg0: Any): Boolean
-
var
_size: Int
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
-
-
def
aggregate[B](z: B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
-
final
def
apply(key: K): V
-
def
applyOrElse[A1 <: K, B1 >: V](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
asParIterable: ParIterable[(K, V)]
-
def
asParSeq: ParSeq[(K, V)]
-
def
canEqual(other: Any): Boolean
-
def
clear: Unit
-
def
clone(): EqHashMap[K, V]
-
final
def
closeDeletion(index: Int): Unit
-
def
collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
-
-
-
def
compose[A](g: (A) ⇒ K): (A) ⇒ V
-
final
def
contains(key: K): Boolean
-
def
containsElem(elem: (K, V)): Boolean
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: (K, V)](xs: Array[B]): Unit
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
-
def
count(p: ((K, V)) ⇒ Boolean): Int
-
def
default(key: K): V
-
-
def
dropRight(n: Int): EqHashMap[K, V]
-
def
dropWhile(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
-
-
-
-
-
-
-
-
def
equals(other: Any): Boolean
-
-
def
filter(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
-
def
filterKeys(p: (K) ⇒ Boolean): Map[K, V]
-
def
filterNot(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
-
def
finalize(): Unit
-
def
find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
-
-
def
flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
-
def
fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
-
def
foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
-
-
def
foreach[U](f: ((K, V)) ⇒ U): Unit
-
def
formatted(fmtstr: String): String
-
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
final
def
get(key: K): Option[V]
-
final
def
getClass(): Class[_]
-
def
getOrElse[B1 >: V](key: K, default: ⇒ B1): B1
-
def
getOrElseUpdate(key: K, op: ⇒ V): V
-
def
getOrNull(key: K): AnyRef
-
def
groupBy[K](f: ((K, V)) ⇒ K): Map[K, EqHashMap[K, V]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: (K, V)
-
def
headOption: Option[(K, V)]
-
def
ifParSeq[R](isbody: (ParSeq[(K, V)]) ⇒ R): (TraversableOps[(K, V)])#Otherwise[R]
-
final
def
index(key: AnyRef): Int
-
def
index(maskedKey: AnyRef, keyHash: Int, tabLength: Int): Int
-
-
-
def
isDefinedAt(key: K): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
isParIterable: Boolean
-
-
def
isParallel: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[(K, V)]
-
def
keySet: Set[K]
-
-
def
keysIterator: Iterator[K]
-
def
last: (K, V)
-
def
lastOption: Option[(K, V)]
-
def
lift: (K) ⇒ Option[V]
-
def
map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
-
def
mapResult[NewTo](f: (EqHashMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
-
def
mapValues[C](f: (V) ⇒ C): Map[K, C]
-
final
def
maskNull(key: AnyRef): AnyRef
-
def
max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
-
def
maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
-
final
def
maxCapacity: Int
-
def
min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
-
def
minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
nextKeyIndex(i: Int, len: Int): Int
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
par: ParMap[K, V]
-
def
parCombiner: Combiner[(K, V), ParMap[K, V]]
-
-
def
product[B >: (K, V)](implicit num: Numeric[B]): B
-
def
put(key: K, value: V): Option[V]
-
def
reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
-
def
reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
-
def
reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
-
def
reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
-
def
remove(key: K): Option[V]
-
-
def
resize: Unit
-
def
result(): EqHashMap[K, V]
-
def
retain(p: (K, V) ⇒ Boolean): EqHashMap.this.type
-
def
reversed: List[(K, V)]
-
def
runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
-
def
sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
-
def
scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[EqHashMap[K, V], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
-
def
scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That
-
def
seq: Map[K, V]
-
final
def
size: Int
-
final
def
sizeHint: Int
-
-
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
def
slice(from: Int, until: Int): EqHashMap[K, V]
-
-
-
-
-
final
def
step: Int
-
def
stringPrefix: String
-
def
sum[B >: (K, V)](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
def
takeRight(n: Int): EqHashMap[K, V]
-
def
takeWhile(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]
-
def
thisCollection: Iterable[(K, V)]
-
var
threshold: Int
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
-
def
toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[C >: (K, V)]: Buffer[C]
-
def
toCollection(repr: EqHashMap[K, V]): Iterable[(K, V)]
-
def
toIndexedSeq: IndexedSeq[(K, V)]
-
def
toIterable: Iterable[(K, V)]
-
def
toIterator: Iterator[(K, V)]
-
def
toList: List[(K, V)]
-
def
toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]
-
def
toParArray: ParArray[(K, V)]
-
def
toSeq: Seq[(K, V)]
-
def
toSet[B >: (K, V)]: Set[B]
-
def
toStream: Stream[(K, V)]
-
def
toString(): String
-
def
toTraversable: Traversable[(K, V)]
-
def
toVector: Vector[(K, V)]
-
def
transform(f: (K, V) ⇒ V): EqHashMap.this.type
-
-
final
def
unmaskNull(key: AnyRef): AnyRef
-
def
unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
def
update(key: K, value: V): Unit
-
def
updated[B1 >: V](key: K, value: B1): Map[K, B1]
-
-
def
valuesIterator: Iterator[V]
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withDefault(d: (K) ⇒ V): Map[K, V]
-
def
withDefaultValue(d: V): Map[K, V]
-
-
def
zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, B), That]): That
-
def
zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, B), That]): That
-
def
zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, Int), That]): That
-
def
→[B](y: B): (EqHashMap[K, V], B)
Shadowed Implicit Value Members
-
def
+(other: String): String
-
-
-
def
map[B](f: ((K, V)) ⇒ B): TraversableOnce[B]
-
val
self: Any
-
val
self: Any
-
def
withFilter(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]
Deprecated Value Members
-
def
/:\[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
-
-
Inherited from Cloneable
Inherited from (K) ⇒ V
Inherited by implicit conversion MonadOps from
EqHashMap[K, V] to MonadOps[(K, V)]
Inherited by implicit conversion any2ArrowAssoc from
EqHashMap[K, V] to ArrowAssoc[EqHashMap[K, V]]
Inherited by implicit conversion any2Ensuring from
EqHashMap[K, V] to Ensuring[EqHashMap[K, V]]
Inherited by implicit conversion alternateImplicit from
EqHashMap[K, V] to ForceImplicitAmbiguity
