ComonadStore

abstract def cobind[A, B](fa: F[A])(f: (F[A]) ⇒ B): F[B]

Also know as extend

abstract def copoint[A](p: F[A]): A

Also known as extract / copure

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

Lift f into F and apply to F[A].

abstract def peek[A](s: S, w: F[A]): A

abstract def pos[A](w: F[A]): S

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

Alias for map.

final def asInstanceOf[T0]: T0

def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β]]]

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

def clone(): AnyRef

def cobindLaw: CobindLaws

val cobindSyntax: CobindSyntax[F]

def cojoin[A](fa: F[A]): F[F[A]]

Also known as duplicate

def comonadLaw: ComonadLaws

val comonadSyntax: ComonadSyntax[F]

def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]

The composition of Functors F and G, [x]F[G[x]], is a Functor

final def copure[A](p: F[A]): A

alias for copoint

def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def experiment[G[_], A](s: (S) ⇒ G[S], w: F[A])(implicit FG: Functor[G]): G[A]

final def extend[A, B](fa: F[A])(f: (F[A]) ⇒ B): F[B]

def finalize(): Unit

def fpair[A](fa: F[A]): F[(A, A)]

Twin all As in fa.

def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

Pair all As in fa with the result of function application.

def functorLaw: FunctorLaw

val functorSyntax: FunctorSyntax[F]

final def getClass(): Class[_]

def hashCode(): Int

def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[G[α]]]

The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

def invariantFunctorLaw: InvariantFunctorLaw

val invariantFunctorSyntax: InvariantFunctorSyntax[F]

final def isInstanceOf[T0]: Boolean

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

Lift f into F.

def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]

Lift apply(a), and apply the result to f.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def peeks[A](s: (S) ⇒ S, w: F[A]): A

def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]

The product of Functors F and G, [x](F[x], G[x]]), is a Functor

def seek[A](s: S, w: F[A]): F[A]

def seeks[A](s: (S) ⇒ S, w: F[A]): F[A]

def strengthL[A, B](a: A, f: F[B]): F[(A, B)]

Inject a to the left of Bs in f.

def strengthR[A, B](f: F[A], b: B): F[(A, B)]

Inject b to the right of As in f.

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

def toString(): String

def void[A](fa: F[A]): F[Unit]

Empty fa of meaningful pure values, preserving its structure.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def widen[A, B](fa: F[A])(implicit ev: <~<[A, B]): F[B]

Functors are covariant by nature, so we can treat an F[A] as an F[B] if A is a subtype of B.

def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

Converts ma to a value of type F[B] using the provided functions f and g.

def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]

Converts ma to a value of type F[B] using the provided bijection.

def xmapi[A, B](ma: F[A])(iso: Isomorphism.<=>[A, B]): F[B]

Converts ma to a value of type F[B] using the provided isomorphism.