Created
April 4, 2016 10:56
-
-
Save travisbrown/ec509d94a3ea0a18915fdaca9bcd2017 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import cats.{ Applicative, Traverse } | |
import cats.std.list._ | |
import java.util.concurrent.TimeUnit | |
import org.openjdk.jmh.annotations._ | |
trait DefaultApApplicative[F[_]] extends Applicative[F] { | |
def ap[A, B](ff: F[A => B])(fa: F[A]): F[B] = map(product(ff, fa)) { | |
case (f, a) => f(a) | |
} | |
} | |
trait DefaultMapApplicative[F[_]] extends Applicative[F] { | |
def map[A, B](fa: F[A])(f: A => B): F[B] = ap(pure(f))(fa) | |
def product[A, B](fa: F[A], fb: F[B]): F[(A, B)] = ap(map(fa)(a => (b: B) => (a, b)))(fb) | |
} | |
@State(Scope.Thread) | |
@BenchmarkMode(Array(Mode.Throughput)) | |
@OutputTimeUnit(TimeUnit.SECONDS) | |
class ApplicativeBenchmark { | |
val instance1: Applicative[Option] = new DefaultMapApplicative[Option] { | |
def pure[A](a: A): Option[A] = Some(a) | |
def ap[A, B](ff: Option[A => B])(fa: Option[A]): Option[B] = (ff, fa) match { | |
case (Some(f), Some(a)) => Some(f(a)) | |
case _ => None | |
} | |
} | |
val instance2: Applicative[Option] = new DefaultMapApplicative[Option] { | |
def pure[A](a: A): Option[A] = Some(a) | |
def ap[A, B](ff: Option[A => B])(fa: Option[A]): Option[B] = (ff, fa) match { | |
case (Some(f), Some(a)) => Some(f(a)) | |
case _ => None | |
} | |
override def map[A, B](fa: Option[A])(f: A => B): Option[B] = fa.map(f) | |
override def product[A, B](fa: Option[A], fb: Option[B]): Option[(A, B)] = (fa, fb) match { | |
case (Some(a), Some(b)) => Some((a, b)) | |
case _ => None | |
} | |
} | |
val instance3: Applicative[Option] = new DefaultApApplicative[Option] { | |
def pure[A](a: A): Option[A] = Some(a) | |
def map[A, B](fa: Option[A])(f: A => B): Option[B] = fa.map(f) | |
def product[A, B](fa: Option[A], fb: Option[B]): Option[(A, B)] = (fa, fb) match { | |
case (Some(a), Some(b)) => Some((a, b)) | |
case _ => None | |
} | |
} | |
val data: List[Option[Int]] = (0 to 10000).map(Option(_)).toList | |
@Benchmark | |
def traverse1: Option[List[Int]] = Traverse[List].sequence(data)(instance1) | |
@Benchmark | |
def traverse2: Option[List[Int]] = Traverse[List].sequence(data)(instance2) | |
@Benchmark | |
def traverse3: Option[List[Int]] = Traverse[List].sequence(data)(instance3) | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Throughput:
Allocation rate: