• Home
• com.github.japgolly.microlibs
• recursion_sjs1_2.13
• 4.2.1
• source code
• EasyRecursion.scala

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

japgolly.microlibs.recursion.EasyRecursion.scala Maven / Gradle / Ivy

package japgolly.microlibs.recursion

import cats.{Functor, Monad, Traverse}

/**
  * Beginner-friendly. No Greek.
  */
object EasyRecursion {


  def fold[F[_]: Functor, A](alg: FAlgebra[F, A])(f: Fix[F]): A =
    Recursion.cata(alg)(f)

  def unfold[F[_]: Functor, A](coalg: FCoalgebra[F, A])(a: A): Fix[F] =
    Recursion.ana(coalg)(a)

  def unfoldIntoFold[F[_]: Functor, A, B](coalg: FCoalgebra[F, A], alg: FAlgebra[F, B])(a: A): B =
    Recursion.hylo(coalg, alg)(a)


  def monadicFold[M[_]: Monad, F[_]: Traverse, A](alg: FAlgebraM[M, F, A])(f: Fix[F]): M[A] =
    Recursion.cataM(alg)(f)

  def monadicUnfold[M[_]: Monad, F[_]: Traverse, A](coalg: FCoalgebraM[M, F, A])(a: A): M[Fix[F]] =
    Recursion.anaM(coalg)(a)

  def monadicUnfoldIntoFold[M[_]: Monad, F[_]: Traverse, A, B](coalg: FCoalgebraM[M, F, A], alg: FAlgebraM[M, F, B])(a: A): M[B] =
    Recursion.hyloM(coalg, alg)(a)

}