trait
Ops[T[_[_]], C[_]] extends AnyRef
Abstract Value Members
-
abstract
def
self: T[C]
-
abstract
val
typeClassInstance: Recursive[T]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
all(p: (T[C]) ⇒ Boolean)(implicit arg0: Functor[C], arg1: Foldable[C]): Boolean
-
def
any(p: (T[C]) ⇒ Boolean)(implicit arg0: Functor[C], arg1: Foldable[C]): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
cata[A](f: (C[A]) ⇒ A)(implicit arg0: Functor[C]): A
-
def
children(implicit arg0: Functor[C], arg1: Foldable[C]): List[T[C]]
-
def
clone(): AnyRef
-
def
collect[B](pf: PartialFunction[T[C], B])(implicit arg0: Functor[C], arg1: Foldable[C]): List[B]
-
def
contains(c: T[C])(implicit arg0: Functor[C], arg1: Foldable[C], T: Equal[T[C]]): Boolean
-
def
convertTo[R[_[_]]](implicit arg0: Functor[C], arg1: Corecursive[R]): R[C]
-
def
elgotHisto[A](f: (Cofree[C, C[A]]) ⇒ A)(implicit arg0: Functor[C]): A
-
def
elgotPara[A](f: ((T[C], C[A])) ⇒ A)(implicit arg0: Functor[C]): A
-
def
elgotZygo[A, B](f: (C[B]) ⇒ B, g: ElgotAlgebra[[β](B, β), C, A])(implicit arg0: Functor[C]): A
-
-
-
def
finalize(): Unit
-
def
foldMap[Z](f: (T[C]) ⇒ Z)(implicit arg0: Functor[C], arg1: Foldable[C], arg2: Monoid[Z]): Z
-
def
foldMapM[M[_], Z](f: (T[C]) ⇒ M[Z])(implicit arg0: Functor[C], arg1: Foldable[C], arg2: Monad[M], arg3: Monoid[Z]): M[Z]
-
final
def
getClass(): Class[_]
-
def
ghisto[H[_], A](g: DistributiveLaw[C, H], f: (C[Cofree[H, A]]) ⇒ A)(implicit arg0: Functor[C], arg1: Functor[H]): A
-
def
gpara[W[_], A](e: DistributiveLaw[C, W], f: (C[EnvT[T[C], W, A]]) ⇒ A)(implicit arg0: Functor[C], arg1: Comonad[W], T: Corecursive[T]): A
-
def
gprepro[W[_], A](k: DistributiveLaw[C, W], e: ~>[C, C], f: (C[W[A]]) ⇒ A)(implicit arg0: Functor[C], arg1: Comonad[W], T: Corecursive[T]): A
-
def
gzygo[W[_], A, B](f: (C[B]) ⇒ B, w: DistributiveLaw[C, W], g: (C[EnvT[B, W, A]]) ⇒ A)(implicit arg0: Functor[C], arg1: Comonad[W]): A
-
def
hashCode(): Int
-
def
histo[A](f: (C[Cofree[C, A]]) ⇒ A)(implicit arg0: Functor[C]): A
-
final
def
isInstanceOf[T0]: Boolean
-
def
isLeaf(implicit arg0: Functor[C], arg1: Foldable[C]): Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
para[A](f: (C[(T[C], A)]) ⇒ A)(implicit arg0: Functor[C]): A
-
def
paraM[M[_], A](f: (C[(T[C], A)]) ⇒ M[A])(implicit arg0: Traverse[C], arg1: Monad[M]): M[A]
-
def
paraZygo[A, B](f: (C[(T[C], B)]) ⇒ B, g: (C[(B, A)]) ⇒ A)(implicit arg0: Functor[C], arg1: Unzip[C]): A
-
def
prepro[A](e: ~>[C, C], f: (C[A]) ⇒ A)(implicit arg0: Functor[C], T: Corecursive[T]): A
-
def
project(implicit arg0: Functor[C]): C[T[C]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
topDownCataM[M[_], A](a: A)(f: (A, T[C]) ⇒ M[(A, T[C])])(implicit arg0: Traverse[C], arg1: Monad[M], T: Corecursive[T]): M[T[C]]
-
def
universe(implicit arg0: Functor[C], arg1: Foldable[C]): List[T[C]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zygo[A, B](f: (C[B]) ⇒ B, g: (C[(B, A)]) ⇒ A)(implicit arg0: Functor[C]): A
