sealed abstract
class
HMap[K[_], V[_]] extends AnyRef
Instance Constructors
-
new
HMap()
Type Members
-
type
Pair[t] = (K[t], V[t])
Abstract Value Members
-
abstract
val
map: Map[K[_], V[_]]
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+[T](kv: (K[T], V[T])): HMap[K, V]
-
def
-(k: K[_]): HMap[K, V]
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
apply[T](id: K[T]): V[T]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
collect[R[_]](p: GenPartial[Pair, R]): Stream[R[_]]
-
def
collectValues[R[_]](p: GenPartial[V, R]): Stream[R[_]]
-
def
contains[T](id: K[T]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
filter(pred: GenFunction[Pair, [T]Boolean]): HMap[K, V]
-
def
finalize(): Unit
-
def
get[T](id: K[T]): Option[V[T]]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
keysOf[T](v: V[T]): Set[K[T]]
-
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
updateFirst(p: GenPartial[K, V]): Option[(HMap[K, V], K[_])]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
This is a weak heterogenous map. It uses equals on the keys, so it is your responsibilty that if k: K[_] == k2: K[_] then the types are actually equal (either be careful or store a type identifier).