Trait

matryoshka.Recursive

Ops

Related Doc: package Recursive

Permalink

trait Ops[T, F[_]] extends AnyRef

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Ops
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def self: T

    Permalink
  2. abstract def typeClassInstance: Aux[T, F]

    Permalink

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def all(p: (T) ⇒ slamdata.Predef.Boolean)(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean

    Permalink
  5. def any(p: (T) ⇒ slamdata.Predef.Boolean)(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean

    Permalink
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def attributeTopDown[U, A](z: A)(f: (A, F[T]) ⇒ A)(implicit U: Corecursive.Aux[U, [γ$56$]EnvT[A, F, γ$56$]], BF: Functor[F]): U

    Permalink
  8. def attributeTopDownM[M[_], U, A](z: A)(f: (A, F[T]) ⇒ M[A])(implicit arg0: Monad[M], U: Corecursive.Aux[U, [γ$57$]EnvT[A, F, γ$57$]], BT: Traverse[F]): M[U]

    Permalink
  9. def cata[A](f: Algebra[F, A])(implicit BF: Functor[F]): A

    Permalink
  10. def cataM[M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

    Permalink
  11. def children[U](implicit U: Corecursive.Aux[U, [β$55$]ListF[T, β$55$]], BT: Traverse[F]): U

    Permalink
  12. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def collect[U, B](pf: slamdata.Predef.PartialFunction[T, B])(implicit arg0: Monoid[U], F: Corecursive.Aux[U, [β$58$]ListF[B, β$58$]], BF: Functor[F], B: Foldable[F]): U

    Permalink
  14. def contains(c: T)(implicit T: Equal[T], BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean

    Permalink
  15. def convertTo[R](implicit R: Corecursive.Aux[R, F], BF: Functor[F]): R

    Permalink
  16. def elgotCata[W[_], A](k: DistributiveLaw[F, W], g: ElgotAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

    Permalink
  17. def elgotCataM[W[_], M[_], A](k: DistributiveLaw[F, [A]M[W[A]]], g: ElgotAlgebraM[W, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], BT: Traverse[F]): M[A]

    Permalink
  18. def elgotHisto[A](f: ElgotAlgebra[[β$50$]Cofree[F, β$50$], F, A])(implicit BF: Functor[F]): A

    Permalink
  19. def elgotPara[A](f: ElgotAlgebra[[β$39$](T, β$39$), F, A])(implicit BF: Functor[F]): A

    Permalink
  20. def elgotZygo[A, B](f: Algebra[F, B], g: ElgotAlgebra[[β$43$](B, β$43$), F, A])(implicit BF: Functor[F]): A

    Permalink
  21. def elgotZygoM[A, B, M[_]](f: AlgebraM[M, F, B], g: ElgotAlgebraM[[β$44$](B, β$44$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

    Permalink
  22. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  24. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  25. def foldMap[Z](f: (T) ⇒ Z)(implicit arg0: Monoid[Z], BF: Functor[F], B: Foldable[F]): Z

    Permalink
  26. def foldMapM[M[_], Z](f: (T) ⇒ M[Z])(implicit arg0: Monad[M], arg1: Monoid[Z], BF: Functor[F], B: Foldable[F]): M[Z]

    Permalink
  27. def gElgotZygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: ElgotAlgebra[[γ$46$]EnvT[B, W, γ$46$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

    Permalink
  28. def gcata[W[_], A](k: DistributiveLaw[F, W], g: GAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

    Permalink
  29. def gcataM[W[_], M[_], A](w: DistributiveLaw[F, W], g: GAlgebraM[W, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], BT: Traverse[F]): M[A]

    Permalink
  30. def gcataZygo[W[_], A, B](w: DistributiveLaw[F, W], f: GAlgebra[W, F, B], g: GAlgebra[[β$52$](B, β$52$), F, A])(implicit arg0: Comonad[W], BF: Functor[F], BU: Unzip[F]): A

    Permalink
  31. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  32. def ghisto[H[_], A](g: DistributiveLaw[F, H], f: GAlgebra[[β$51$]Cofree[H, β$51$], F, A])(implicit arg0: Functor[H], BF: Functor[F]): A

    Permalink
  33. def gzygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: GAlgebra[[γ$45$]EnvT[B, W, γ$45$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

    Permalink
  34. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  35. def histo[A](f: GAlgebra[[β$49$]Cofree[F, β$49$], F, A])(implicit BF: Functor[F]): A

    Permalink
  36. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  37. def isLeaf(implicit BT: Traverse[F]): slamdata.Predef.Boolean

    Permalink
  38. def mutu[A, B](f: GAlgebra[[β$47$](A, β$47$), F, B], g: GAlgebra[[β$48$](B, β$48$), F, A])(implicit BF: Functor[F]): A

    Permalink
  39. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  40. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  41. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  42. def para[A](f: GAlgebra[[β$38$](T, β$38$), F, A])(implicit BF: Functor[F]): A

    Permalink
  43. def paraM[M[_], A](f: GAlgebraM[[β$40$](T, β$40$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

    Permalink
  44. def paraMerga[A](that: T)(f: (T, T, slamdata.Predef.Option[F[A]]) ⇒ A)(implicit BF: Functor[F], BM: Merge[F]): A

    Permalink
  45. def paraZygo[A, B](f: GAlgebra[[β$53$](T, β$53$), F, B], g: GAlgebra[[β$54$](B, β$54$), F, A])(implicit BF: Functor[F], BU: Unzip[F]): A

    Permalink
  46. def project(implicit BF: Functor[F]): F[T]

    Permalink
  47. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  48. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  49. object transCata

    Permalink
  50. 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]

    Permalink
  51. object transPara

    Permalink
  52. object transPostpro

    Permalink
  53. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  54. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  55. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  56. def zygo[A, B](f: Algebra[F, B], g: GAlgebra[[β$41$](B, β$41$), F, A])(implicit BF: Functor[F]): A

    Permalink
  57. def zygoM[A, B, M[_]](f: AlgebraM[M, F, B], g: GAlgebraM[[β$42$](B, β$42$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped