trait
Ops[T, F[_]] extends AnyRef
Abstract Value Members
-
abstract
def
self: T
-
abstract
def
typeClassInstance: Aux[T, F]
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
getClass(): Class[_]
-
def
gpara[W[_], A](e: DistributiveLaw[F, W], f: GAlgebra[[γ$17$]EnvT[T, W, γ$17$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
-
def
gprepro[W[_], A](k: DistributiveLaw[F, W], e: ~>[F, F], f: GAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
lambek(implicit BF: Functor[F]): F[T]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
prepro[A](e: ~>[F, F], f: Algebra[F, A])(implicit BF: Functor[F]): A
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
topDownCata[A](a: A)(f: (A, T) ⇒ (A, T))(implicit BF: Functor[F]): T
-
def
topDownCataM[M[_], A](a: A)(f: (A, T) ⇒ M[(A, T)])(implicit arg0: Monad[M], BT: Traverse[F]): M[T]
-
def
transAnaT(f: (T) ⇒ T)(implicit BF: Functor[F]): T
-
def
transAnaTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], BF: Traverse[F]): M[T]
-
def
transApoT(f: (T) ⇒ \/[T, T])(implicit BF: Functor[F]): T
-
def
transCataT(f: (T) ⇒ T)(implicit BF: Functor[F]): T
-
def
transCataTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], BF: Traverse[F]): M[T]
-
def
transParaT(f: ((T, T)) ⇒ T)(implicit BF: Functor[F]): T
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
