MapFunctions

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. final def alter[K, A](m: Map[K, A], k: K)(f: (Option[A]) ⇒ Option[A]): Map[K, A]

   

   Vary the value of m get k.

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

8. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

10. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

11. final def getOrAdd[F[_], K, A](m: Map[K, A], k: K)(fa: ⇒ F[A])(implicit F: Applicative[F]): F[(Map[K, A], A)]

    

    Grab a value out of Map if it's present.

    Grab a value out of Map if it's present. Otherwise evaluate a value to be placed at that key in the Map.

12. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

13. final def insertWith[K, A](m1: Map[K, A], k: K, v: A)(f: (A, A) ⇒ A): Map[K, A]

    

    As with Map.updated, but resolve a collision with f.

    As with Map.updated, but resolve a collision with f. The first argument is guaranteed to be from m1.

14. final def intersectWith[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (A, B) ⇒ C): Map[K, C]

    

    Collect only elements with matching keys, joining their associated values with f.

15. final def intersectWithKey[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (K, A, B) ⇒ C): Map[K, C]

    

    Like intersectWith, but tell f about the key.

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

17. final def mapKeys[K, K2, A](m: Map[K, A])(f: (K) ⇒ K2): Map[K2, A]

    

    Exchange keys of m according to f.

    Exchange keys of m according to f. Result may be smaller if f maps two or more Ks to the same K2, in which case the resulting associated value is an arbitrary choice.

18. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

21. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

22. def toString(): String

    

    Definition Classes

    AnyRef → Any

23. final def unionWith[K, A](m1: Map[K, A], m2: Map[K, A])(f: (A, A) ⇒ A): Map[K, A]

    

    Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

    Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

    Note

    iff f gives rise to a scalaz.Semigroup, so does unionWith(_, _)(f).

24. final def unionWithKey[K, A](m1: Map[K, A], m2: Map[K, A])(f: (K, A, A) ⇒ A): Map[K, A]

    

    Like unionWith, but telling f about the key.

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )