Coyoneda

The dual view of the Yoneda lemma. Also a free functor on F. This is isomorphic to F as long as F itself is a functor. The homomorphism from F[A] to Coyoneda[F,A] exists even when F is not a functor.

Self Type: Coyoneda[F, A]
Source: Yoneda.scala

Linear Supertypes

AnyRef, Any

Instance Constructors

new Coyoneda()

Type Members

abstract type I

Abstract Value Members

abstract def fi: F[I]
abstract def k(i: I): A

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def extend[G[_]](f: ~>[[a]Coyoneda[F, a], G]): Coyoneda[G, A]

Coyoneda is a comonad in an endofunctor category
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def flatMap[G[_]](f: ~>[F, [a]Coyoneda[G, a]]): Coyoneda[G, A]

Coyoneda is a monad in an endofunctor category
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def map[B](f: (A) ⇒ B): Coyoneda[F, B]

Simple function composition.
Simple function composition. Allows map fusion without touching the underlying F.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def run(implicit F: Functor[F]): F[A]

Converts to F[A] given that F is a functor
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toLan: Lan[Id.Id, F, A]

Coyoneda[F,_] is the left Kan extension of F along Id
def toString(): String

Definition Classes
AnyRef → Any
def toYoneda(implicit F: Functor[F]): Yoneda[F, A]

Converts to Yoneda[F,A] given that F is a functor
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object Coyoneda | package scalaz

abstract class Coyoneda[F[_], A] extends AnyRef

Instance Constructors

new Coyoneda()

Type Members

abstract type I

Abstract Value Members

abstract def fi: F[I]

abstract def k(i: I): A

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def extend[G[_]](f: ~>[[a]Coyoneda[F, a], G]): Coyoneda[G, A]

def finalize(): Unit

def flatMap[G[_]](f: ~>[F, [a]Coyoneda[G, a]]): Coyoneda[G, A]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[B](f: (A) ⇒ B): Coyoneda[F, B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def run(implicit F: Functor[F]): F[A]

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

def toLan: Lan[Id.Id, F, A]

def toString(): String

def toYoneda(implicit F: Functor[F]): Yoneda[F, A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped