implicit final
class
MapOps[K, V] extends AnyVal
Instance Constructors
-
new
MapOps(map: Map[K, V])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
andThenM[W](other: Map[V, W]): Map[K, W]
-
final
def
asInstanceOf[T0]: T0
-
def
containsAll[GK <: GenTraversableOnce[K]](gk: GK): Boolean
-
def
containsAll(ok: Option[K]): Boolean
-
def
containsAny[GK <: GenTraversableOnce[K]](gk: GK): Boolean
-
def
containsAny(ok: Option[K]): Boolean
-
def
emptyTo(empty: ⇒ Map[K, V]): Map[K, V]
-
def
entryFor: MapAndThen[K, V, (K, V)]
-
def
filterKeysNot(p: Predicate[K]): Map[K, V]
-
def
filterValues(p: Predicate[V]): Map[K, V]
-
def
filterValuesNot(p: Predicate[V]): Map[K, V]
-
def
findKey(p: Predicate[K]): Option[K]
-
def
findValue(p: Predicate[V]): Option[V]
-
def
get(ok: Option[K]): Option[V]
-
def
getClass(): Class[_ <: AnyVal]
-
def
getOrThrow(k: K, exception: ⇒ Exception): V
-
def
getOrThrow(k: K, message: String): V
-
final
def
isInstanceOf[T0]: Boolean
-
def
keyFor: MapAndThen[K, V, K]
-
val
map: Map[K, V]
-
def
mapNonEmpty[A](f: (Map[K, V]) ⇒ A): Option[A]
-
def
mapValuesEagerly[W](f: (V) ⇒ W): Map[K, W]
-
def
mutable: Map[K, V]
-
def
reverse(f: (Set[K]) ⇒ K): Map[V, K]
-
def
reverseToMultiMap: MultiMap[Set, V, K]
-
def
sorted(implicit ordering: Ordering[K]): SortedMap[K, V]
-
def
toMutable: Map[K, V]
-
def
toString(): String
-
def
uncons[A](empty: ⇒ A, nonEmpty: (Map[K, V]) ⇒ A): A
-
def
valueExists(p: Predicate[V]): Boolean
-
def
valueFor: MapAndThen[K, V, V]
Inherited from AnyVal
Inherited from Any