Trait/Object

matryoshka

Corecursive

Related Docs: object Corecursive | package matryoshka

Permalink

trait Corecursive[T[_[_]]] extends Serializable

Unfolds for corecursive data types.

Linear Supertypes
Serializable, Serializable, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Corecursive
  2. Serializable
  3. Serializable
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def embed[F[_]](t: F[T[F]])(implicit arg0: Functor[F]): T[F]

    Permalink
  2. abstract def getClass(): Class[_]

    Permalink
    Definition Classes
    Any

Concrete Value Members

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

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

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

    Permalink
    Definition Classes
    Any
  4. def ana[F[_], A](a: A)(f: (A) ⇒ F[A])(implicit arg0: Functor[F]): T[F]

    Permalink
  5. def anaM[F[_], M[_], A](a: A)(f: (A) ⇒ M[F[A]])(implicit arg0: Traverse[F], arg1: Monad[M]): M[T[F]]

    Permalink
  6. def apo[F[_], A](a: A)(f: (A) ⇒ F[\/[T[F], A]])(implicit arg0: Functor[F]): T[F]

    Permalink
  7. def apoM[F[_], M[_], A](a: A)(f: (A) ⇒ M[F[\/[T[F], A]]])(implicit arg0: Traverse[F], arg1: Monad[M]): M[T[F]]

    Permalink
  8. final def asInstanceOf[T0]: T0

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

    Permalink
    Definition Classes
    Any
  10. def futu[F[_], A](a: A)(f: (A) ⇒ F[Free[F, A]])(implicit arg0: Functor[F]): T[F]

    Permalink
  11. def futuM[F[_], M[_], A](a: A)(f: (A) ⇒ M[F[Free[F, A]]])(implicit arg0: Traverse[F], arg1: Monad[M]): M[T[F]]

    Permalink
  12. def gana[F[_], M[_], A](a: A)(k: DistributiveLaw[M, F], f: (A) ⇒ F[M[A]])(implicit arg0: Functor[F], M: Monad[M]): T[F]

    Permalink
  13. def gpostpro[F[_], M[_], A](a: A)(k: DistributiveLaw[M, F], e: ~>[F, F], g: (A) ⇒ F[M[A]])(implicit arg0: Functor[F], T: Recursive[T], M: Monad[M]): T[F]

    Permalink
  14. def hashCode(): Int

    Permalink
    Definition Classes
    Any
  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. def postpro[F[_], A](a: A)(e: ~>[F, F], g: (A) ⇒ F[A])(implicit arg0: Functor[F], T: Recursive[T]): T[F]

    Permalink
  17. def toString(): String

    Permalink
    Definition Classes
    Any

Inherited from Serializable

Inherited from Serializable

Inherited from Any

Ungrouped