Trait

matryoshka.Recursive

Ops

Related Doc: package Recursive

Permalink

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

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

Abstract Value Members

  1. abstract def self: T[C]

    Permalink

  2. abstract val typeClassInstance: Recursive[T]

    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[C]) ⇒ Boolean)(implicit arg0: Functor[C], arg1: Foldable[C]): Boolean

    Permalink

  5. def ana[T[_[_]], F[_]](f: (Ops[T, C]) ⇒ F[Ops[T, C]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  6. def anaM[T[_[_]], M[_], F[_]](f: (Ops[T, C]) ⇒ M[F[Ops[T, C]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  7. def any(p: (T[C]) ⇒ Boolean)(implicit arg0: Functor[C], arg1: Foldable[C]): Boolean

    Permalink

  8. def apo[T[_[_]], F[_]](f: (Ops[T, C]) ⇒ F[\/[T[F], Ops[T, C]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  9. def apoM[T[_[_]], M[_], F[_]](f: (Ops[T, C]) ⇒ M[F[\/[T[F], Ops[T, C]]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  11. def attributeAna[F[_]](ψ: (Ops[T, C]) ⇒ F[Ops[T, C]])(implicit arg0: Functor[F]): Cofree[F, Ops[T, C]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  12. def attributeAnaM[M[_], F[_]](ψ: (Ops[T, C]) ⇒ M[F[Ops[T, C]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[Cofree[F, Ops[T, C]]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  13. def cata[A](f: (C[A]) ⇒ A)(implicit arg0: Functor[C]): A

    Permalink

  14. def children(implicit arg0: Functor[C], arg1: Foldable[C]): List[T[C]]

    Permalink

  15. def chrono[F[_], B](g: (F[Cofree[F, B]]) ⇒ B, f: (Ops[T, C]) ⇒ F[Free[F, Ops[T, C]]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  16. def clone(): AnyRef

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

  17. def codyna[F[_], B](φ: (F[B]) ⇒ B, ψ: (Ops[T, C]) ⇒ F[Free[F, Ops[T, C]]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  18. def codynaM[M[_], F[_], B](φ: (F[B]) ⇒ M[B], ψ: (Ops[T, C]) ⇒ M[F[Free[F, Ops[T, C]]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  19. def coelgot[F[_], B](φ: ((Ops[T, C], F[B])) ⇒ B, ψ: (Ops[T, C]) ⇒ F[Ops[T, C]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  20. def coelgotM[M[_]]: IdOps.CoelgotMPartiallyApplied[M]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  21. def collect[B](pf: PartialFunction[T[C], B])(implicit arg0: Functor[C], arg1: Foldable[C]): List[B]

    Permalink

  22. def contains(c: T[C])(implicit arg0: Functor[C], arg1: Foldable[C], T: Equal[T[C]]): Boolean

    Permalink

  23. def convertTo[R[_[_]]](implicit arg0: Functor[C], arg1: Corecursive[R]): R[C]

    Permalink

  24. def dyna[F[_], B](φ: (F[Cofree[F, B]]) ⇒ B, ψ: (Ops[T, C]) ⇒ F[Ops[T, C]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  25. def elgot[F[_], B](φ: (F[B]) ⇒ B, ψ: (Ops[T, C]) ⇒ \/[B, F[Ops[T, C]]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  26. def elgotAna[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (Ops[T, C]) ⇒ M[F[Ops[T, C]]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  27. def elgotApo[T[_[_]], F[_]](f: (Ops[T, C]) ⇒ \/[T[F], F[Ops[T, C]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  28. def elgotHisto[A](f: (Cofree[C, C[A]]) ⇒ A)(implicit arg0: Functor[C]): A

    Permalink

  29. def elgotPara[A](f: ((T[C], C[A])) ⇒ A)(implicit arg0: Functor[C]): A

    Permalink

  30. def elgotZygo[A, B](f: (C[B]) ⇒ B, g: ElgotAlgebra[[β](B, β), C, A])(implicit arg0: Functor[C]): A

    Permalink

  31. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  32. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  33. def finalize(): Unit

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

  34. def foldMap[Z](f: (T[C]) ⇒ Z)(implicit arg0: Functor[C], arg1: Foldable[C], arg2: Monoid[Z]): Z

    Permalink

  35. def foldMapM[M[_], Z](f: (T[C]) ⇒ M[Z])(implicit arg0: Functor[C], arg1: Foldable[C], arg2: Monad[M], arg3: Monoid[Z]): M[Z]

    Permalink

  36. def freeAna[F[_], B](ψ: (Ops[T, C]) ⇒ \/[B, F[Ops[T, C]]])(implicit arg0: Functor[F]): Free[F, B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  37. def futu[T[_[_]], F[_]](f: (Ops[T, C]) ⇒ F[Free[F, Ops[T, C]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  38. def futuM[T[_[_]], M[_], F[_]](f: (Ops[T, C]) ⇒ M[F[Free[F, Ops[T, C]]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  39. def gElgotZygo[W[_], A, B](f: (C[B]) ⇒ B, w: DistributiveLaw[C, W], g: ElgotAlgebra[[γ]EnvT[B, W, γ], C, A])(implicit arg0: Functor[C], arg1: Comonad[W]): A

    Permalink

  40. def gana[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (Ops[T, C]) ⇒ F[M[Ops[T, C]]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  41. def ganaM[T[_[_]], M[_], N[_], F[_]](k: DistributiveLaw[M, F], f: (Ops[T, C]) ⇒ N[F[M[Ops[T, C]]]])(implicit arg0: Monad[M], arg1: Traverse[M], arg2: Monad[N], arg3: Traverse[F], T: Corecursive[T]): N[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  42. def gcataM[W[_], M[_], A](k: DistributiveLaw[C, W], g: (C[W[A]]) ⇒ M[A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], arg3: Traverse[C]): M[A]

    Permalink

  43. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  44. def ghisto[H[_], A](g: DistributiveLaw[C, H], f: (C[Cofree[H, A]]) ⇒ A)(implicit arg0: Functor[C], arg1: Functor[H]): A

    Permalink

  45. def ghylo[W[_], M[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ B, g: (Ops[T, C]) ⇒ F[M[Ops[T, C]]])(implicit arg0: Comonad[W], arg1: Monad[M], arg2: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  46. def ghyloM[W[_], M[_], N[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ N[B], g: (Ops[T, C]) ⇒ N[F[M[Ops[T, C]]]])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], arg3: Traverse[M], arg4: Monad[N], arg5: Traverse[F]): N[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink

  48. def gpostpro[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], e: ~>[F, F], g: (Ops[T, C]) ⇒ F[M[Ops[T, C]]])(implicit arg0: Recursive[T], arg1: Monad[M], arg2: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink

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

    Permalink

  51. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  52. def histo[A](f: (C[Cofree[C, A]]) ⇒ A)(implicit arg0: Functor[C]): A

    Permalink

  53. def hylo[F[_], B](f: (F[B]) ⇒ B, g: (Ops[T, C]) ⇒ F[Ops[T, C]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  54. def hyloM[M[_], F[_], B](f: (F[B]) ⇒ M[B], g: (Ops[T, C]) ⇒ M[F[Ops[T, C]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  55. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  56. def isLeaf(implicit arg0: Functor[C], arg1: Foldable[C]): Boolean

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  58. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  59. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  60. def para[A](f: (C[(T[C], A)]) ⇒ A)(implicit arg0: Functor[C]): A

    Permalink

  61. def paraM[M[_], A](f: (C[(T[C], A)]) ⇒ M[A])(implicit arg0: Traverse[C], arg1: Monad[M]): M[A]

    Permalink

  62. def paraZygo[A, B](f: (C[(T[C], B)]) ⇒ B, g: (C[(B, A)]) ⇒ A)(implicit arg0: Functor[C], arg1: Unzip[C]): A

    Permalink

  63. def postpro[T[_[_]], F[_]](e: ~>[F, F], g: (Ops[T, C]) ⇒ F[Ops[T, C]])(implicit arg0: Recursive[T], arg1: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Ops[T, C] to IdOps[Ops[T, C]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  64. def prepro[A](e: ~>[C, C], f: (C[A]) ⇒ A)(implicit arg0: Functor[C], T: Corecursive[T]): A

    Permalink

  65. def project(implicit arg0: Functor[C]): C[T[C]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  67. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  69. def universe(implicit arg0: Functor[C], arg1: Foldable[C]): List[T[C]]

    Permalink

  70. final def wait(): Unit

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

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

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

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

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

  73. def zygo[A, B](f: (C[B]) ⇒ B, g: (C[(B, A)]) ⇒ A)(implicit arg0: Functor[C]): A

    Permalink

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toIdOps from Ops[T, C] to IdOps[Ops[T, C]]

Ungrouped