pimpathon.map

MapOps

implicit final class MapOps[K, V] extends AnyVal

Linear Supertypes
AnyVal, NotNull, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MapOps
  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 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 containsAll[GK <: GenTraversableOnce[K]](gk: GK): Boolean

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

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

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

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

  11. def entryForMaxKey(implicit O: Ordering[K]): Option[(K, V)]

  12. def entryForMaxValue(implicit O: Ordering[V]): Option[(K, V)]

  13. def entryForMinKey(implicit O: Ordering[K]): Option[(K, V)]

  14. def entryForMinValue(implicit O: Ordering[V]): Option[(K, V)]

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

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

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

  18. def findEntryWithKey(p: (K) ⇒ Boolean): Option[(K, V)]

  19. def findEntryWithValue(p: (V) ⇒ Boolean): Option[(K, V)]

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

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

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

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

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

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

  26. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  27. def keyForMaxValue(implicit O: Ordering[V]): Option[K]

  28. def keyForMinValue(implicit O: Ordering[V]): Option[K]

  29. val map: Map[K, V]

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

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

  32. def mutable: Map[K, V]

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

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

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

  36. def toMutable: Map[K, V]

  37. def toString(): String

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

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

  40. def valueForMaxKey(implicit O: Ordering[K]): Option[V]

  41. def valueForMinKey(implicit O: Ordering[K]): Option[V]

Inherited from AnyVal

Inherited from NotNull

Inherited from Any

Ungrouped