Add two new combinators: cedeMap and intercede

core/shared/src/main/scala/cats/effect/IO.scala

@@ -497,6 +497,20 @@ sealed abstract class IO[+A] private () extends IOPlatform[A] {
    */
   def map[B](f: A => B): IO[B] = IO.Map(this, f, Tracing.calculateTracingEvent(f))
 
+  /**
+   * Functor map, but causes a reschedule before and after `f`. For more information, checkout
+   * `cede` in the companion object.
+   */
+  def cedeMap[B](f: A => B): IO[B] =
+    (this <* IO.cede).map(a => f(a)).guarantee(IO.cede)
+
+  /**
+   * Causes a reschedule before and after `fa`. For more information, checkout `cede` in the
+   * companion object.
+   */
+  def intercede: IO[A] =
+    IO.cede *> this.guarantee(IO.cede)
+
   /**
    * Applies rate limiting to this `IO` based on provided backpressure semantics.
    *

kernel/shared/src/main/scala/cats/effect/kernel/GenSpawn.scala

@@ -282,6 +282,27 @@ trait GenSpawn[F[_], E] extends MonadCancel[F, E] with Unique[F] {
    */
   def cede: F[Unit]
 
+  /**
+   * Functor map, but causes a reschedule before and after `f`
+   */
+  def cedeMap[A, B](fa: F[A])(f: A => B): F[B] =
+    for {
+      a <- fa
+      _ <- cede
+      b = f(a)
+      _ <- cede
+    } yield b
+
+  /**
+   * Causes a reschedule before and after `fa`
+   */
+  def intercede[A](fa: F[A]): F[A] =
+    for {
+      _ <- cede
+      a <- fa
+      _ <- cede
+    } yield a
+
   /**
    * A low-level primitive for racing the evaluation of two fibers that returns the [[Outcome]]
    * of the winner and the [[Fiber]] of the loser. The winner of the race is considered to be