trait
AllOps[T, F[_]] extends Ops[T, F] with Recursive.Ops[T, F]
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
-
def
all(p: (T) ⇒ Boolean)(implicit BF: Functor[F], B: Foldable[F]): Boolean
-
def
any(p: (T) ⇒ Boolean)(implicit BF: Functor[F], B: Foldable[F]): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
attributeTopDown[A](z: A)(f: (A, F[T]) ⇒ A)(implicit BF: Functor[F]): Cofree[F, A]
-
def
attributeTopDownM[M[_], A](z: A)(f: (A, F[T]) ⇒ M[A])(implicit arg0: Monad[M], BT: Traverse[F]): M[Cofree[F, A]]
-
def
cata[A](f: Algebra[F, A])(implicit BF: Functor[F]): A
-
def
cataM[M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
-
def
children(implicit BT: Traverse[F]): List[T]
-
def
clone(): AnyRef
-
def
collect[B](pf: PartialFunction[T, B])(implicit BF: Functor[F], B: Foldable[F]): List[B]
-
def
contains(c: T)(implicit T: Equal[T], BF: Functor[F], B: Foldable[F]): Boolean
-
def
convertTo[R](implicit R: Corecursive.Aux[R, F], BF: Functor[F]): R
-
def
elgotCata[W[_], A](k: DistributiveLaw[F, W], g: ElgotAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
-
def
elgotHisto[A](f: ElgotAlgebra[[β$35$]Cofree[F, β$35$], F, A])(implicit BF: Functor[F]): A
-
def
elgotPara[A](f: ElgotAlgebra[[β$25$](T, β$25$), F, A])(implicit BF: Functor[F]): A
-
def
elgotZygo[A, B](f: Algebra[F, B], g: ElgotAlgebra[[β$29$](B, β$29$), F, A])(implicit BF: Functor[F]): A
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
foldMap[Z](f: (T) ⇒ Z)(implicit arg0: Monoid[Z], BF: Functor[F], B: Foldable[F]): Z
-
def
foldMapM[M[_], Z](f: (T) ⇒ M[Z])(implicit arg0: Monad[M], arg1: Monoid[Z], BF: Functor[F], B: Foldable[F]): M[Z]
-
def
gElgotZygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: ElgotAlgebra[[γ$31$]EnvT[B, W, γ$31$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
-
def
gcata[W[_], A](k: DistributiveLaw[F, W], g: GAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
-
def
gcataM[W[_], M[_], A](k: DistributiveLaw[F, W], g: GAlgebraM[W, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], BT: Traverse[F]): M[A]
-
final
def
getClass(): Class[_]
-
def
ghisto[H[_], A](g: DistributiveLaw[F, H], f: GAlgebra[[β$36$]Cofree[H, β$36$], F, A])(implicit arg0: Functor[H], BF: Functor[F]): A
-
def
gpara[W[_], A](e: DistributiveLaw[F, W], f: GAlgebra[[γ$27$]EnvT[T, W, γ$27$], F, A])(implicit arg0: Comonad[W], T: Corecursive.Aux[T, F], BF: Functor[F]): A
-
def
gprepro[W[_], A](k: DistributiveLaw[F, W], e: ~>[F, F], f: GAlgebra[W, F, A])(implicit arg0: Comonad[W], T: Corecursive.Aux[T, F], BF: Functor[F]): A
-
def
gzygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: GAlgebra[[γ$30$]EnvT[B, W, γ$30$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
-
def
hashCode(): Int
-
def
histo[A](f: GAlgebra[[β$34$]Cofree[F, β$34$], F, A])(implicit BF: Functor[F]): A
-
final
def
isInstanceOf[T0]: Boolean
-
def
isLeaf(implicit BT: Traverse[F]): Boolean
-
def
lambek(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): F[T]
-
def
mapR[U, G[_]](f: (F[T]) ⇒ G[U])(implicit arg0: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): U
-
def
mutu[A, B](f: GAlgebra[[β$32$](A, β$32$), F, B], g: GAlgebra[[β$33$](B, β$33$), F, A])(implicit BF: Functor[F]): A
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
para[A](f: GAlgebra[[β$24$](T, β$24$), F, A])(implicit BF: Functor[F]): A
-
def
paraM[M[_], A](f: GAlgebraM[[β$26$](T, β$26$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
-
def
paraMerga[A](that: T)(f: (T, T, Option[F[A]]) ⇒ A)(implicit BF: Functor[F], BM: Merge[F]): A
-
def
paraZygo[A, B](f: GAlgebra[[β$37$](T, β$37$), F, B], g: GAlgebra[[β$38$](B, β$38$), F, A])(implicit BF: Functor[F], BU: Unzip[F]): A
-
def
prepro[A](e: ~>[F, F], f: Algebra[F, A])(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): A
-
def
project(implicit BF: Functor[F]): F[T]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
topDownCata[A](a: A)(f: (A, T) ⇒ (A, T))(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
-
def
topDownCataM[M[_], A](a: A)(f: (A, T) ⇒ M[(A, T)])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BT: Traverse[F]): M[T]
-
-
def
transAnaM[M[_], U, G[_]](f: TransformM[M, T, F, G])(implicit arg0: Monad[M], arg1: Traverse[G], U: Corecursive.Aux[U, G], BF: Functor[F]): M[U]
-
def
transAnaT(f: (T) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
-
def
transAnaTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BF: Traverse[F]): M[T]
-
def
transApo[U, G[_]](f: CoalgebraicGTransform[[β$40$]\/[U, β$40$], T, F, G])(implicit arg0: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): U
-
def
transApoT(f: (T) ⇒ \/[T, T])(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
-
-
def
transCataM[M[_], U, G[_]](f: TransformM[M, U, F, G])(implicit arg0: Monad[M], arg1: Functor[G], U: Corecursive.Aux[U, G], BT: Traverse[F]): M[U]
-
def
transCataT(f: (T) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
-
def
transCataTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BF: Traverse[F]): M[T]
-
def
transHylo[G[_], U, H[_]](φ: (G[U]) ⇒ H[U], ψ: (F[T]) ⇒ G[T])(implicit arg0: Functor[G], arg1: Functor[H], U: Corecursive.Aux[U, H], BF: Functor[F]): U
-
-
def
transParaT(f: ((T, T)) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
-
-
-
def
traverseR[M[_], U, G[_]](f: (F[T]) ⇒ M[G[U]])(implicit arg0: Functor[M], arg1: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): M[U]
-
def
universe(implicit BT: Traverse[F]): List[T]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zygo[A, B](f: Algebra[F, B], g: GAlgebra[[β$28$](B, β$28$), F, A])(implicit BF: Functor[F]): A
Inherited from AnyRef
Inherited from Any
