pimpathon.map

MapOps

implicit final class MapOps[K, V] extends AnyVal

Linear Supertypes
AnyVal, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MapOps
  2. AnyVal
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MapOps(map: Map[K, V])

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  2. final def ##(): Int

    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  4. def andThenM[W](other: Map[V, W]): Map[K, W]

  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. def composeM[C](other: Map[C, K]): Map[C, V]

  7. def containsAll[GK <: GenTraversableOnce[K]](gk: GK): Boolean

  8. def containsAll(ok: Option[K]): Boolean

  9. def containsAny[GK <: GenTraversableOnce[K]](gk: GK): Boolean

  10. def containsAny(ok: Option[K]): Boolean

  11. def emptyTo(empty: ⇒ Map[K, V]): Map[K, V]

  12. def entryFor: MapAndThen[K, V, (K, V)]

  13. def filterKeysNot(p: Predicate[K]): Map[K, V]

  14. def filterValues(p: Predicate[V]): Map[K, V]

  15. def filterValuesNot(p: Predicate[V]): Map[K, V]

  16. def findKey(p: Predicate[K]): Option[K]

  17. def findValue(p: Predicate[V]): Option[V]

  18. def get(ok: Option[K]): Option[V]

  19. def getClass(): Class[_ <: AnyVal]

    Definition Classes
    AnyVal → Any
  20. def getOrThrow(k: K, exception: ⇒ Exception): V

  21. def getOrThrow(k: K, message: String): V

  22. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  23. def keyExists(p: Predicate[K]): Boolean

  24. def keyFor: MapAndThen[K, V, K]

  25. val map: Map[K, V]

  26. def mapEntries[C, W](f: (K) ⇒ (V) ⇒ (C, W)): Map[C, W]

  27. def mapKeysEagerly[C](f: (K) ⇒ C): Map[C, V]

  28. def mapNonEmpty[A](f: (Map[K, V]) ⇒ A): Option[A]

  29. def mapValuesEagerly[W](f: (V) ⇒ W): Map[K, W]

  30. def mutable: Map[K, V]

  31. def partitionEntriesBy[C, W](pf: PartialFunction[(K, V), (C, W)]): (Map[K, V], Map[C, W])

  32. def partitionKeysBy[C](pf: PartialFunction[K, C]): (Map[K, V], Map[C, V])

  33. def partitionValuesBy[W](pf: PartialFunction[V, W]): (Map[K, V], Map[K, W])

  34. def reverse(f: (Set[K]) ⇒ K): Map[V, K]

  35. def reverseToMultiMap: MultiMap[Set, V, K]

  36. def sorted(implicit ordering: Ordering[K]): SortedMap[K, V]

  37. def toMutable: Map[K, V]

  38. def toString(): String

    Definition Classes
    Any
  39. def uncons[A](empty: ⇒ A, nonEmpty: (Map[K, V]) ⇒ A): A

  40. def updateKeys[C](f: (K) ⇒ Option[C]): Map[C, V]

  41. def updateKeys[C](pf: PartialFunction[K, C]): Map[C, V]

  42. def updateValue(key: K, f: (V) ⇒ Option[V]): Map[K, V]

  43. def updateValues[W](f: (V) ⇒ Option[W]): Map[K, W]

  44. def updateValues[W](pf: PartialFunction[V, W]): Map[K, W]

  45. def valueExists(p: Predicate[V]): Boolean

  46. def valueFor: MapAndThen[K, V, V]

Inherited from AnyVal

Inherited from Any

Ungrouped