Coyoneda

The dual view of the Yoneda lemma. The free functor on F. This is isomorphic to F as long as F itself is a functor. The function from F[A] to Coyoneda[F,A] exists even when F is not a functor. Implemented using a List of functions for stack-safety.

Self Type: Coyoneda[F, A]

Linear Supertypes

Serializable, Serializable, AnyRef, Any

Type Members

abstract type Pivot

The pivot between fi and k, usually existential.

Abstract Value Members

abstract val fi: F[Pivot]

The underlying value.

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 finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def foldMap[G[_]](trans: ~>[F, G])(implicit G: Functor[G]): G[A]

Converts to G[A] given that G is a functor
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
final def k: (Pivot) ⇒ A

The list of transformer functions composed into a single function, to be lifted into F by run.
final def map[B](f: (A) ⇒ B): Aux[F, B, Pivot]

Simple function composition.
Simple function composition. Allows map fusion without touching the underlying F.
final def mapK[G[_]](f: ~>[F, G]): Aux[G, A, Pivot]

Modify the context F using transformation f.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final 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 toString(): String

Definition Classes
AnyRef → Any
final 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( ... )

Deprecated Value Members

final def transform[G[_]](f: FunctionK[F, G]): Aux[G, A, Pivot]

Annotations
@deprecated
Deprecated
(Since version 1.0.0-RC2) Use mapK

Related Docs: object Coyoneda | package free

sealed abstract class Coyoneda[F[_], A] extends Serializable

Type Members

abstract type Pivot

Abstract Value Members

abstract val fi: F[Pivot]

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 finalize(): Unit

final def foldMap[G[_]](trans: ~>[F, G])(implicit G: Functor[G]): G[A]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def k: (Pivot) ⇒ A

final def map[B](f: (A) ⇒ B): Aux[F, B, Pivot]

final def mapK[G[_]](f: ~>[F, G]): Aux[G, A, Pivot]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def toString(): String

final 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

Deprecated Value Members

final def transform[G[_]](f: FunctionK[F, G]): Aux[G, A, Pivot]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped