Trait

scalaz.std

MapSubFunctions

Related Doc: package std

Permalink

trait MapSubFunctions extends MapSub

Source
Map.scala
Linear Supertypes
MapSub, AnyRef, Any
Known Subclasses
AllInstances, AllInstances, MapFunctions, MapInstances, MapSubInstances, Scalaz, map, sortedMap
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MapSubFunctions
  2. MapSub
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. abstract type BuildKeyConstraint[K]

    Permalink

    Evidence on key needed to construct new maps.

    Evidence on key needed to construct new maps.

    Definition Classes
    MapSub

  2. abstract type XMap[K, V] <: Map[K, V] with MapLike[K, V, XMap[K, V]]

    Permalink
    Definition Classes
    MapSub

Abstract Value Members

  1. abstract def ab_+[K, V](m: XMap[K, V], k: K, v: V)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    Permalink

    How MapLike#updated might be typed in a sane world.

    How MapLike#updated might be typed in a sane world. A world that embraced higher kinds, instead of shunning them.

    Attributes
    protected
    Definition Classes
    MapSub

  2. abstract def ab_-[K, V](m: XMap[K, V], k: K)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    Permalink

    As with ab_+, but with MapLike#-.

    As with ab_+, but with MapLike#-.

    Attributes
    protected
    Definition Classes
    MapSub

  3. implicit abstract def buildXMap[K, V, K2, V2](implicit arg0: BuildKeyConstraint[K2]): CanBuildFrom[XMap[K, V], (K2, V2), XMap[K2, V2]]

    Permalink
    Attributes
    protected
    Definition Classes
    MapSub

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def alter[K, A](m: XMap[K, A], k: K)(f: (Option[A]) ⇒ Option[A])(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Permalink

    Vary the value of m get k.

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

    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

    Permalink
    Definition Classes
    AnyRef → Any

  13. final def insertWith[K, A](m1: XMap[K, A], k: K, v: A)(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Permalink

    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: XMap[K, A], m2: XMap[K, B])(f: (A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

    Permalink

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

  15. final def intersectWithKey[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (K, A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

    Permalink

    Like intersectWith, but tell f about the key.

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  17. final def mapKeys[K, K2, A](m: XMap[K, A])(f: (K) ⇒ K2)(implicit arg0: BuildKeyConstraint[K2]): XMap[K2, A]

    Permalink

    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

    Permalink
    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  23. final def unionWith[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Permalink

    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: XMap[K, A], m2: XMap[K, A])(f: (K, A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Permalink

    Like unionWith, but telling f about the key.

  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from MapSub

Inherited from AnyRef

Inherited from Any

Ungrouped