Add ContT monad

core/src/main/scala/cats/data/ContT.scala

@@ -0,0 +1,109 @@
+package cats
+package data
+
+/**
+ * This is a continuation transformer based on the ContT in
+ * the Haskell package Control.Monad.Cont
+ *
+ * This is reasonably straight-forward except that to make
+ * a tailRecM implementation we leverage the Defer type class to
+ * obtain stack-safety.
+ */
+sealed abstract class ContT[M[_], A, +B] extends Serializable {
+  final def run: (B => M[A]) => M[A] = runAndThen
+  protected def runAndThen: AndThen[B => M[A], M[A]]
+
+  final def map[C](fn: B => C)(implicit M: Defer[M]): ContT[M, A, C] = {
+    // allocate/pattern match once
+    val fnAndThen = AndThen(fn)
+    ContT { fn2 =>
+      val cb = fnAndThen.andThen(fn2)
+      M.defer(run(cb))
+    }
+  }
+
+  /**
+   * c.mapCont(f).run(g) == f(c.run(g))
+   */
+  final def mapCont(fn: M[A] => M[A]): ContT[M, A, B] =
+    // Use later here to avoid forcing run
+    ContT.later(runAndThen.andThen(fn))
+
+  /**
+   * cont.withCont(f).run(cb) == cont.run(f(cb))
+   */
+  final def withCont[C](fn: (C => M[A]) => B => M[A]): ContT[M, A, C] =
+    // lazy to avoid forcing run
+    ContT.later(AndThen(fn).andThen(runAndThen))
+
+  final def flatMap[C](fn: B => ContT[M, A, C])(implicit M: Defer[M]): ContT[M, A, C] = {
+    // allocate/pattern match once
+    val fnAndThen = AndThen(fn)
+    ContT[M, A, C] { fn2 =>
+      val contRun: ContT[M, A, C] => M[A] = (_.run(fn2))
+      val fn3: B => M[A] = fnAndThen.andThen(contRun)
+      M.defer(run(fn3))
+    }
+  }
+}
+
+object ContT {
+
+  // Note, we only have two instances of ContT in order to be gentle on the JVM JIT
+  // which treats classes with more than two subclasses differently
+
+  private case class FromFn[M[_], A, B](runAndThen: AndThen[B => M[A], M[A]]) extends ContT[M, A, B]
+
+  private case class DeferCont[M[_], A, B](next: () => ContT[M, A, B]) extends ContT[M, A, B] {
+    @annotation.tailrec
+    private def loop(n: () => ContT[M, A, B]): ContT[M, A, B] =
+      n() match {
+        case DeferCont(n) => loop(n)
+        case notDefer => notDefer
+      }
+
+    lazy val runAndThen: AndThen[B => M[A], M[A]] = loop(next).runAndThen
+  }
+
+  def pure[M[_], A, B](b: B): ContT[M, A, B] =
+    apply { cb => cb(b) }
+
+  def apply[M[_], A, B](fn: (B => M[A]) => M[A]): ContT[M, A, B] =
+    FromFn(AndThen(fn))
+
+  def later[M[_], A, B](fn: => (B => M[A]) => M[A]): ContT[M, A, B] =
+    DeferCont(() => FromFn(AndThen(fn)))
+
+  def tailRecM[M[_], A, B, C](a: A)(fn: A => ContT[M, C, Either[A, B]])(implicit M: Defer[M]): ContT[M, C, B] =
+    ContT[M, C, B] { cb: (B => M[C]) =>
+
+      def go(a: A): M[C] =
+        fn(a).run {
+          case Left(a) => M.defer(go(a))
+          case Right(b) => M.defer(cb(b))
+        }
+
+      go(a)
+    }
+
+  implicit def catsDataContTDefer[M[_], B]: Defer[ContT[M, B, ?]] =
+    new Defer[ContT[M, B, ?]] {
+      def defer[A](c: => ContT[M, B, A]): ContT[M, B, A] =
+        DeferCont(() => c)
+    }
+
+  implicit def catsDataContTMonad[M[_]: Defer, A]: Monad[ContT[M, A, ?]] =
+    new Monad[ContT[M, A, ?]] {
+      def pure[B](b: B): ContT[M, A, B] =
+        ContT.pure(b)
+
+      override def map[B, C](c: ContT[M, A, B])(fn: B => C): ContT[M, A, C] =
+        c.map(fn)
+
+      def flatMap[B, C](c: ContT[M, A, B])(fn: B => ContT[M, A, C]): ContT[M, A, C] =
+        c.flatMap(fn)
+
+      def tailRecM[B, C](b: B)(fn: B => ContT[M, A, Either[B, C]]): ContT[M, A, C] =
+        ContT.tailRecM(b)(fn)
+    }
+}

tests/src/test/scala/cats/tests/ContTSuite.scala

@@ -0,0 +1,69 @@
+package cats
+package tests
+
+import cats.data.ContT
+import cats.laws.discipline._
+import cats.laws.discipline.arbitrary._
+import org.scalacheck.{Arbitrary, Gen}
+
+class ContTSuite extends CatsSuite {
+
+  implicit def arbContT[M[_], A, B](implicit arbFn: Arbitrary[(B => M[A]) => M[A]]): Arbitrary[ContT[M, A, B]] =
+    Arbitrary(arbFn.arbitrary.map(ContT[M, A, B](_)))
+
+  implicit def eqContT[M[_], A, B](implicit arbFn: Arbitrary[B => M[A]], eqMA: Eq[M[A]]): Eq[ContT[M, A, B]] = {
+    val genItems = Gen.listOfN(100, arbFn.arbitrary)
+    val fns = genItems.sample.get
+    new Eq[ContT[M, A, B]] {
+      def eqv(a: ContT[M, A, B], b: ContT[M, A, B]) =
+        fns.forall { fn =>
+          eqMA.eqv(a.run(fn), b.run(fn))
+        }
+    }
+  }
+
+  checkAll("ContT[Function0, Int, ?]", MonadTests[ContT[Function0, Int, ?]].monad[Int, String, Int])
+  checkAll("ContT[Eval, Int, ?]", MonadTests[ContT[Eval, Int, ?]].monad[Int, String, Int])
+  checkAll("ContT[Function0, Int, ?]", DeferTests[ContT[Function0, Int, ?]].defer[Int])
+
+  /**
+   * c.mapCont(f).run(g) == f(c.run(g))
+   */
+  def mapContLaw[M[_], A, B](
+    implicit eqma: Eq[M[A]],
+     cArb: Arbitrary[ContT[M, A, B]],
+     fnArb: Arbitrary[M[A] => M[A]],
+     gnArb: Arbitrary[B => M[A]]) =
+    forAll { (cont: ContT[M, A, B], fn: M[A] => M[A], gn: B => M[A]) =>
+      assert(eqma.eqv(cont.mapCont(fn).run(gn), fn(cont.run(gn))))
+    }
+
+  /**
+   * cont.withCont(f).run(g) == cont.run(f(g))
+   */
+  def withContLaw[M[_], A, B, C](
+    implicit eqma: Eq[M[A]],
+     cArb: Arbitrary[ContT[M, A, B]],
+     fnArb: Arbitrary[(C => M[A]) => B => M[A]],
+     gnArb: Arbitrary[C => M[A]]) =
+    forAll { (cont: ContT[M, A, B], fn: (C => M[A]) => B => M[A], gn: C => M[A]) =>
+      assert(eqma.eqv(cont.withCont(fn).run(gn), cont.run(fn(gn))))
+    }
+
+  test("ContT.mapContLaw[Function0, Int, String]") {
+    mapContLaw[Function0, Int, String]
+  }
+
+  test("ContT.mapContLaw[Eval, Int, String]") {
+    mapContLaw[Eval, Int, String]
+  }
+
+  test("ContT.withContLaw[Function0, Int, String, Int]") {
+    withContLaw[Function0, Int, String, Int]
+  }
+
+  test("ContT.withContLaw[Eval, Int, String, Int]") {
+    withContLaw[Eval, Int, String, Int]
+  }
+
+}