Packages

trait Bifunctor[F[_, _]] extends BifunctorParent[F]

A type giving rise to two unrelated scalaz.Functors.

Self Type
Bifunctor[F]
Source
Bifunctor.scala
Linear Supertypes
BifunctorParent[F], AnyRef, Any
Known Subclasses
Bitraverse, IsomorphismBifunctor, IsomorphismBitraverse
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Bifunctor
  2. BifunctorParent
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def bimap[A, B, C, D](fab: F[A, B])(f: (A) ⇒ C, g: (B) ⇒ D): F[C, D]

    map over both type parameters.

Concrete 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 asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. val bifunctorSyntax: BifunctorSyntax[F]
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def compose[G[_, _]](implicit G0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β], G[α, β]]]

    The composition of Bifunctors F and G, [x,y]F[G[x,y],G[x,y]], is a Bifunctor

  8. def embed[G[_], H[_]](implicit G0: Functor[G], H0: Functor[H]): Bifunctor[[α, β]F[G[α], H[β]]]

    Embed two Functors , one on each side

  9. def embedLeft[G[_]](implicit G0: Functor[G]): Bifunctor[[α, β]F[G[α], β]]

    Embed one Functor to the left

  10. def embedRight[H[_]](implicit H0: Functor[H]): Bifunctor[[α, β]F[α, H[β]]]

    Embed one Functor to the right

  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. def leftFunctor[X]: Functor[[α$0$]F[α$0$, X]]

    Extract the Functor on the first param.

  18. def leftMap[A, B, C](fab: F[A, B])(f: (A) ⇒ C): F[C, B]
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  22. def product[G[_, _]](implicit G0: Bifunctor[G]): Bifunctor[[α, β](F[α, β], G[α, β])]

    The product of Bifunctors F and G, [x,y](F[x,y], G[x,y]), is a Bifunctor

  23. def rightFunctor[X]: Functor[[β$1$]F[X, β$1$]]

    Extract the Functor on the second param.

  24. def rightMap[A, B, D](fab: F[A, B])(g: (B) ⇒ D): F[A, D]
  25. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. def uFunctor: Functor[[α]F[α, α]]

    Unify the functor over both params.

  28. def umap[A, B](faa: F[A, A])(f: (A) ⇒ B): F[B, B]
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. def widen[A, B, C >: A, D >: B](fab: F[A, B]): F[C, D]

    Bifunctors are covariant by nature

    Bifunctors are covariant by nature

    Definition Classes
    BifunctorParent

Inherited from BifunctorParent[F]

Inherited from AnyRef

Inherited from Any

Ungrouped