class
LvdPWMap[A, B] extends HashMap[A, B]
Instance Constructors
-
new
LvdPWMap()(implicit arg0: ClassTag[A], arg1: ClassTag[B])
-
new
LvdPWMap(size: Int)(implicit arg0: ClassTag[A], arg1: ClassTag[B])
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
val
HashMask: Int
-
final
def
asInstanceOf[T0]: T0
-
def
clear: Unit
-
def
clone(): AnyRef
-
def
delete(key: A): Unit
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
getOrElse(key: A, default: ⇒ B): B
-
def
getOrElseUpdate(key: A, op: ⇒ B): B
-
def
hash(k: A): Int
-
def
hashCode(): Int
-
final
def
improve(hcode: Int): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
update(key: A, datum: B): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
An implementation of a HashMap based upon "Boosting Multi-Core Reachability Performance with Shared Hash Tables", by Alfons Laarman, Jaco van de Pol and Michael Weber, extended to allow deletion.