StoreT

abstract def run: (F[(A) ⇒ B], A)

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ***[C, D](that: StoreT[F, C, D])(implicit M: Bind[F]): StoreT[F, (A, C), (B, D)]

alias for product

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def bmap[X](b: BijectionT.Bijection[A, X])(implicit F: Functor[F]): StoreT[F, X, B]

def clone(): AnyRef

def cobind[C](f: (StoreT[F, A, B]) ⇒ C)(implicit c: Cobind[F]): StoreT[F, A, C]

def copoint(implicit F: Copointed[F]): B

def duplicate(implicit F: Comonad[F]): StoreT[F, A, StoreT[F, A, B]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[C](f: (B) ⇒ C)(implicit ftr: Functor[F]): StoreT[F, A, C]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pos: A

def product[C, D](that: StoreT[F, C, D])(implicit M: Bind[F]): StoreT[F, (A, C), (B, D)]

Two disjoint lenses can be paired

def put(a: A)(implicit F: Functor[F]): F[B]

def puts(f: (A) ⇒ A)(implicit F: Functor[F]): F[B]

def set: F[(A) ⇒ B]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def xmap[X](f: (A) ⇒ X)(g: (X) ⇒ A)(implicit F: Functor[F]): StoreT[F, X, B]