pimpathon.map

MapPimps

implicit final class MapPimps[K, V] extends AnyVal

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

Instance Constructors

  1. new MapPimps(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 calcIfNonEmpty[A](f: (Map[K, V]) ⇒ A): Option[A]

  7. def composeM[C](other: Map[C, K]): Map[C, V]

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

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

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

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

  12. def containsEntry(k: K, v: V): Boolean

  13. def containsEntry(kv: (K, V)): Boolean

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

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

  16. def filterKeysNot(p: (K) ⇒ Boolean): Map[K, V]

  17. def filterValues(p: (V) ⇒ Boolean): Map[K, V]

  18. def filterValuesNot(p: (V) ⇒ Boolean): Map[K, V]

  19. def findKey(p: (K) ⇒ Boolean): Option[K]

  20. def findValue(p: (V) ⇒ Boolean): Option[V]

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

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

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

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

  25. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  26. def keyExists(p: (K) ⇒ Boolean): Boolean

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

  28. val map: Map[K, V]

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

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

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

  32. def mutable: Map[K, V]

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

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

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

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

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

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

  39. def toMutable: Map[K, V]

  40. def toString(): String

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

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

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

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

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

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

  47. def valueExists(p: (V) ⇒ Boolean): Boolean

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

Inherited from AnyVal

Inherited from NotNull

Inherited from Any

Ungrouped