th7nder

type omg struct {
}

func (o *omg) InterceptWorkflow(info *workflow.Info, next interceptors.WorkflowInboundCallsInterceptor) internal.WorkflowInboundCallsInterceptor {
	// name := info.WorkflowType.Name
	/*
		executionId | name | startedAt | finishedAt | error
	*/
	// insert into executions values (executionId, name, time.Now(), nil, nil)

th7nder

Keybase proof

I hereby claim:

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

To claim this, I am signing this object:

th7nder

from multiprocessing import Pool
import array
signal = ''.join(['03036732577212944063491565474664'] * 200)
signal = [int(x) for x in str(signal)]
output = array.array('i', (0,) * len(signal))

def get_pattern(repetition, index):
  repetition += 1
  max_len = 4 * repetition
  index = (index + 1) % max_len

th7nder

import argparse
import pathlib
import sys
import serial

SOH = 0x01
EOT = 0x04
ACK = 0x06
NAK = 0x15
CAN = 0x18

th7nder

import argparse
import math
import os
import pathlib
import sys
import numpy as np

# Matrix for single error correction and two errors detection
h1 = np.matrix([[1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0],
                [0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0],

th7nder

import React, { Component } from "react";
import PropTypes from "prop-types";
import Input from "./Input";
import Date from "./Date";

const formFields = [
  { name: "company", desc: "Firma" },
  { name: "dimensions", desc: "Wymiary" },
  { name: "amount", desc: "Ilość", type: "number" },
  { name: "grossMargin", desc: "Marża", type: "number" },

th7nder

#include <pthread.h>
#include <stdio.h>
#include <unistd.h>

int fibonacci(int n) {
  if (n <= 1) return 1;
  return fibonacci(n - 2) + fibonacci(n - 1);
}

void *task(void *) {

th7nder

#include <pthread.h>
#include <stdio.h>
#include <unistd.h>

int fibonacci(int n) {
  if (n <= 1) return 1;
  return fibonacci(n - 2) + fibonacci(n - 1);
}

void *task(void *) {

th7nder

#include <pthread.h>
#include <stdio.h>
#include <unistd.h>

int fibonacci(int n) {
  if (n <= 1) return 1;
  return fibonacci(n - 2) + fibonacci(n - 1);
}

void *task(void *) {

th7nder

#include <cmath>

#include "falsi.h"
#include <iostream>
namespace ZRN {
  std::tuple<bool, unsigned int, double> falsi(
    std::function<double(double)> f, 
    double a, 
    double b, 
    double eps,