phderome

package com.fantasy.seed

import cats.{Apply, Functor, FunctorFilter, Invariant, Semigroupal}
import cats.implicits._
import monix.reactive._

trait Collector[F[_]] extends Apply[F] with FunctorFilter[F] {

  def map[A, B, Z](fa: F[A], fb: F[B], f: Function1[(A, B), Z])(implicit inv: Invariant[F],
                                                                semi: Semigroupal[F]): F[Z] =

phderome

#!/bin/python3

from typing import *
from pymonad import curry


class Square(NamedTuple):
    """
    represents a chessboard square indexed by row and col(short column), using 0-based indexing
    """

phderome

def fibi2(n: int) -> int:
    """Fibonacci numbers with iteration and memoization

    >>> fibi2(20)
    6765
    >>> fibi2(1)
    1
    """
    # originally, line 109 had None (replace with Int as 0) f = [0, 1] + [None for _ in range(2, n+1)]
    f = [0, 1] + [0 for _ in range(2, n+1)]

phderome

package code

import eu.timepit.refined._
import eu.timepit.refined.api.Refined
import eu.timepit.refined.auto._
import eu.timepit.refined.numeric._

import scala.annotation.tailrec

object KnightTourSolver extends App {

phderome

package code

import eu.timepit.refined._
import eu.timepit.refined.api.Refined
import eu.timepit.refined.auto._
import eu.timepit.refined.numeric._

import scala.annotation.tailrec

object Utils1 {

phderome

package code

import eu.timepit.refined._
import eu.timepit.refined.api.Refined
import eu.timepit.refined.auto._
import eu.timepit.refined.numeric._

import scala.annotation.tailrec

object RefinedQueens extends App {

phderome

import scala.concurrent.Future
import scala.concurrent.ExecutionContext.Implicits.global
import scala.concurrent._
import scala.concurrent.duration._

case class fourData(a: Int, b: Int, c: Int, d: Int)

val computeListInputs: List[Int] = List(1,2,3,4)

def slowBlockingComputation(input: Int)(implicit ec: ExecutionContext): Future[Int] = {