This file contains hidden or 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
object Rational { | |
implicit def rationalInt(n: Int): Rational = | |
Rational(n, 1) | |
def gcd(a: Int, b: Int): Int = | |
if (b == 0) a else gcd(b, a % b) | |
} | |
case class Rational(p: Int, q: Int) { | |
require(q != 0, "Denominator 'q' cannot be 0") |
This file contains hidden or 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 doobie._ | |
import doobie.imports._ | |
import scala.concurrent.duration._ | |
import scalaz.Nondeterminism | |
import scalaz.concurrent.Task | |
import scalaz.std.list._ | |
// def transactor: Transactor[Task] = ??? |
This file contains hidden or 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 java.time.format.{DateTimeFormatter, DateTimeFormatterBuilder} | |
import java.time.temporal.ChronoField | |
import java.time.{LocalDateTime, ZoneId} | |
import io.getquill._ | |
import io.getquill.naming.SnakeCase | |
import io.getquill.sources.sql.idiom.PostgresDialect | |
case class Test(date: Option[LocalDateTime]) |
This file contains hidden or 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 java.util.concurrent.atomic.AtomicInteger | |
import scala.concurrent._ | |
import duration._ | |
import ExecutionContext.Implicits.global | |
def ftraverse[A, B](xs: Seq[A])(f: A => Future[B]): Future[Seq[B]] = { | |
if(xs.isEmpty) Future successful Seq.empty[B] | |
else f(xs.head) flatMap { fh => ftraverse(xs.tail)(f) map (r => fh +: r) } | |
} |
NewerOlder