Merge pull request #524 from adelbertc/freeapplicative-remove-hoist

FreeApplicative#hoist is same as compile
typelevel · Sep 13, 2015 · 7be80e5 · 7be80e5
2 parents b92c3eb + 6df3cdc
commit 7be80e5
Showing 1 changed file with 2 additions and 8 deletions.
diff --git a/free/src/main/scala/cats/free/FreeApplicative.scala b/free/src/main/scala/cats/free/FreeApplicative.scala
@@ -23,13 +23,6 @@ sealed abstract class FreeApplicative[F[_], A] extends Product with Serializable
       case x@Ap() => apply(x.pivot)(x.fn.map(f compose _))
     }
 
-  /** Natural Transformation of FreeApplicative based on given Natural Transformation */
-  final def hoist[G[_]](f: F ~> G): FA[G, A] =
-    this match {
-      case Pure(a) => Pure[G, A](a)
-      case x@Ap() => apply(f(x.pivot))(x.fn.hoist(f))
-  }
-
   /** Interprets/Runs the sequence of operations using the semantics of Applicative G
     * Tail recursive only if G provides tail recursive interpretation (ie G is FreeMonad)
     */
@@ -45,7 +38,8 @@ sealed abstract class FreeApplicative[F[_], A] extends Product with Serializable
   final def fold(implicit F: Applicative[F]): F[A] =
     foldMap(NaturalTransformation.id[F])
 
-  final def compile[G[_]](f: F ~> G)(implicit G: Applicative[G]): FA[G, A] =
+  /** Interpret this algebra into another FreeApplicative */
+  final def compile[G[_]](f: F ~> G): FA[G, A] =
     foldMap[FA[G, ?]] {
       new NaturalTransformation[F, FA[G, ?]] {
         def apply[B](fa: F[B]): FA[G, B] = lift(f(fa))