Type Members
-
type
-|[F[_], G[_]] = Adjunction[F, G]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply[F[_], G[_]](implicit A: -|[F, G], F: Functor[F], G: Functor[F]): -|[F, G]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
implicit
def
compositeAdjunction[F[_], P[_], G[_], Q[_]](implicit A1: -|[F, G], A2: -|[P, Q]): -|[[α]P[F[α]], [α]G[Q[α]]]
-
implicit
def
curryUncurryAdjunction[S]: -|[[β$0$](S, β$0$), [β$1$](S) ⇒ β$1$]
-
-
-
-
implicit
val
f0IdAdjunction: -|[Function0, Id.Id]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
implicit
val
idF0Adjunction: -|[Id.Id, Function0]
-
implicit
val
identityAdjunction: -|[Id.Id, Id.Id]
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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
-
implicit
def
writerReaderAdjunction[E]: Adjunction[[β$4$]WriterT[[X]X, E, β$4$], [β$5$]Kleisli[[X]X, E, β$5$]]
