Trait

matryoshka.Recursive

Ops

Related Doc: package Recursive

Permalink

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

Linear Supertypes
AnyRef, Any
Known Subclasses
AllOps, AllOps
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[A](z: A)(f: (A, F[T]) ⇒ A)(implicit BF: Functor[F]): Cofree[F, A]

    Permalink

  8. def attributeTopDownM[M[_], A](z: A)(f: (A, F[T]) ⇒ M[A])(implicit arg0: Monad[M], BT: Traverse[F]): M[Cofree[F, A]]

    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(implicit BT: Traverse[F]): slamdata.Predef.List[T]

    Permalink

  12. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  13. def collect[B](pf: slamdata.Predef.PartialFunction[T, B])(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.List[B]

    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[[β$43$]Cofree[F, β$43$], F, A])(implicit BF: Functor[F]): A

    Permalink

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

    Permalink

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

    Permalink

  21. def elgotZygoM[A, B, M[_]](f: AlgebraM[M, F, B], g: ElgotAlgebraM[[β$37$](B, β$37$), 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[[γ$39$]EnvT[B, W, γ$39$], 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. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  31. def ghisto[H[_], A](g: DistributiveLaw[F, H], f: GAlgebra[[β$44$]Cofree[H, β$44$], F, A])(implicit arg0: Functor[H], BF: Functor[F]): A

    Permalink

  32. def gpara[W[_], A](e: DistributiveLaw[F, W], f: GAlgebra[[γ$33$]EnvT[T, W, γ$33$], F, A])(implicit arg0: Comonad[W], T: Corecursive.Aux[T, F], BF: Functor[F]): A

    Permalink

  33. 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

    Permalink

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

    Permalink

  35. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  36. def histo[A](f: GAlgebra[[β$42$]Cofree[F, β$42$], F, A])(implicit BF: Functor[F]): A

    Permalink

  37. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  38. def isLeaf(implicit BT: Traverse[F]): slamdata.Predef.Boolean

    Permalink

  39. def lambek(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): F[T]

    Permalink

  40. def mapR[U, G[_]](f: (F[T]) ⇒ G[U])(implicit arg0: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): U

    Permalink

  41. def mutu[A, B](f: GAlgebra[[β$40$](A, β$40$), F, B], g: GAlgebra[[β$41$](B, β$41$), F, A])(implicit BF: Functor[F]): A

    Permalink

  42. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  43. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  44. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  45. def para[A](f: GAlgebra[[β$30$](T, β$30$), F, A])(implicit BF: Functor[F]): A

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

  49. def prepro[A](e: ~>[F, F], f: Algebra[F, A])(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): A

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  52. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  53. def topDownCata[A](a: A)(f: (A, T) ⇒ (A, T))(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T

    Permalink

  54. 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]

    Permalink

  55. object transAna

    Permalink

  56. 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]

    Permalink

  57. def transAnaT(f: (T) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T

    Permalink

  58. def transAnaTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BF: Traverse[F]): M[T]

    Permalink

  59. def transApo[U, G[_]](f: CoalgebraicGTransform[[β$48$]\/[U, β$48$], T, F, G])(implicit arg0: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): U

    Permalink

  60. def transApoT(f: (T) ⇒ \/[T, T])(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T

    Permalink

  61. object transCata

    Permalink

  62. 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

  63. def transCataT(f: (T) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T

    Permalink

  64. def transCataTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BF: Traverse[F]): M[T]

    Permalink

  65. 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

    Permalink

  66. object transPara

    Permalink

  67. def transParaT(f: ((T, T)) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T

    Permalink

  68. object transPostpro

    Permalink

  69. object transPrepro

    Permalink

  70. 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]

    Permalink

  71. def universe(implicit BF: Functor[F], B: Foldable[F]): NonEmptyList[T]

    Permalink

  72. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  73. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  74. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  75. def zygo[A, B](f: Algebra[F, B], g: GAlgebra[[β$34$](B, β$34$), F, A])(implicit BF: Functor[F]): A

    Permalink

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

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped