Packages

trait Corecursive[T] extends Based[T]

Unfolds for corecursive data types.

Linear Supertypes
Based[T], Serializable, Serializable, AnyRef, Any
Known Subclasses
Birecursive
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Corecursive
  2. Based
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. abstract type Base[A]
    Definition Classes
    Based

Abstract Value Members

  1. abstract def embed(t: Base[T])(implicit BF: Functor[Base]): T

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def ana[A](a: A)(f: Coalgebra[Base, A])(implicit BF: Functor[Base]): T
  5. def anaM[M[_], A](a: A)(f: CoalgebraM[M, Base, A])(implicit arg0: Monad[M], BT: Traverse[Base]): M[T]
  6. def apo[A](a: A)(f: GCoalgebra[[β$0$]\/[T, β$0$], Base, A])(implicit BF: Functor[Base]): T

    An unfold that can short-circuit certain sections.

  7. def apoM[M[_], A](a: A)(f: GCoalgebraM[[β$3$]\/[T, β$3$], M, Base, A])(implicit arg0: Monad[M], BT: Traverse[Base]): M[T]
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def elgotAna[N[_], A](a: A)(k: DistributiveLaw[N, Base], ψ: ElgotCoalgebra[N, Base, A])(implicit arg0: Monad[N], BF: Functor[Base]): T
  11. def elgotApo[A](a: A)(f: ElgotCoalgebra[[β$1$]\/[T, β$1$], Base, A])(implicit BF: Functor[Base]): T
  12. def elgotFutu[A](a: A)(f: ElgotCoalgebra[[β$6$]Free[Base, β$6$], Base, A])(implicit BF: Functor[Base]): T
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def futu[A](a: A)(f: GCoalgebra[[β$4$]Free[Base, β$4$], Base, A])(implicit BF: Functor[Base]): T
  17. def futuM[M[_], A](a: A)(f: GCoalgebraM[[β$8$]Free[Base, β$8$], M, Base, A])(implicit arg0: Monad[M], BT: Traverse[Base]): M[T]
  18. def gana[N[_], A](a: A)(k: DistributiveLaw[N, Base], f: GCoalgebra[N, Base, A])(implicit arg0: Monad[N], BF: Functor[Base]): T
  19. def ganaM[N[_], M[_], A](a: A)(k: DistributiveLaw[N, Base], f: GCoalgebraM[N, M, Base, A])(implicit arg0: Monad[N], arg1: Traverse[N], arg2: Monad[M], BT: Traverse[Base]): M[T]
  20. def gapo[A, B](a: A)(ψ0: Coalgebra[Base, B], ψ: GCoalgebra[[β$2$]\/[B, β$2$], Base, A])(implicit BF: Functor[Base]): T

    An unfold that can handle sections with a secondary unfold.

  21. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  22. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. final def notify(): Unit
    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  27. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  28. def toString(): String
    Definition Classes
    AnyRef → Any
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Based[T]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped