recursion

Type Members

1. sealed abstract class AtomOrComposite[A] extends AnyRef

   

   Useful for situations where composite items need to be wrapped when nested, but not at the top level.

   Useful for situations where composite items need to be wrapped when nested, but not at the top level.

   Allows "2 * (1 + 1)" instead of "(2 * (1 + 1))".

2. type CVAlgebra[F[_], A] = (F[Cofree[F, A]]) ⇒ A

   

   Course-of-values algebra

3. type CVCoalgebra[F[_], A] = (A) ⇒ F[Free[F, A]]

   

   Course-of-values co-algebra

4. type FAlgebra[F[_], A] = (F[A]) ⇒ A

   

5. type FAlgebraM[M[_], F[_], A] = (F[A]) ⇒ M[A]

   

6. final class FAlgebraOps[F[_], A] extends AnyVal

   

7. type FCoalgebra[F[_], A] = (A) ⇒ F[A]

   

8. type FCoalgebraM[M[_], F[_], A] = (A) ⇒ M[F[A]]

   

9. final class FCoalgebraOps[F[_], A] extends AnyVal

   

10. type Fix[F[_]] = recursion.FixModule.Fix[F]

    

11. sealed trait FixModule extends AnyRef

    

12. implicit final class FixOps[F[_]] extends AnyVal

    

    Annotations

    @inline()

13. type RAlgebra[F[_], A] = (F[(Fix[F], A)]) ⇒ A

    

14. type RCoalgebra[F[_], A] = (A) ⇒ F[Either[Fix[F], A]]