mitkus

final class ConstrainedFunctorKOpsMapPartial[A[_[_]], C[_[_]], F[_]](af: A[F]) {
  def apply[G[_]](fk: F ~> G)(implicit C_ : C[F], F_ : ConstrainedFunctorK[A, C]): A[G] =
    F_.mapKC(af)(fk)
}

mitkus

➜  [console-api] make docker                 monitor-fields2
docker build . -t lightbend-docker-commercial-registry.bintray.io/enterprise-suite/console-api:latest
Sending build context to Docker daemon   76.5MB
Step 1/9 : FROM golang:1.11 as build-env
 ---> 28daaf3edbdb
Step 2/9 : WORKDIR /go/src/github.com/lightbend/console-api
 ---> Using cache
 ---> 54f5a97a07e7
Step 3/9 : COPY . .
 ---> 0d1cc2300e13

mitkus

Keybase proof

I hereby claim:

• I am mitkus on github.
• I am mitkus (https://keybase.io/mitkus) on keybase.
• I have a public key ASAwskLKUionr0vUT28oCzaDoDEb1j7L_o7PQS6grN0twQo

To claim this, I am signing this object:

mitkus

#include <stdio.h>
#include <string.h>
#include <stdbool.h>

typedef unsigned char byte;
typedef unsigned int uint;

#define n_bits 1024
#define n_hashes 3
bool bloom[n_bits] = {0};

mitkus

#include <stdio.h>

#define min(a, b) (a > b ? b : a)

int gcd(int a, int b) {
	int greatest = 1;

	// Try all numbers from 1 to min(a, b)
	for(int i = 1; i < min(a, b); ++i) {
		// Check if i divides both a and b

mitkus

import random

for i in range(10):
    print(random.randint(0, 2**31))