Keybase proof
I hereby claim:
- I am bgola on github.
- I am bgola (https://keybase.io/bgola) on keybase.
- I have a public key ASC5Mib70GTndDCXCK2rTLrHtnpVtnpY1NmM5xAbaYshwgo
To claim this, I am signing this object:
class Complex { | |
double real; | |
double img; | |
public Complex(double real, double img) { | |
this.real = real; | |
this.img = img; | |
} | |
public Complex multi(Complex b) { |
int CELL_SIZE = 2; | |
ArrayList tolive; | |
ArrayList todie; | |
boolean[][] grid; | |
int f(int v) { | |
return (int)v*CELL_SIZE; | |
} |
float f; | |
float step_i = 0.05; | |
float step_j = 0.05; | |
boolean savegif; | |
int nd = 6; | |
void setup() { | |
//size(851, 315); | |
size(1200, 800); | |
colorMode(HSB); |
I hereby claim:
To claim this, I am signing this object:
#!/usr/bin/python | |
import random, sys | |
from numpy.random import choice | |
bible = open("bible.txt").read() | |
com = open("com.txt").read() | |
di = None | |
d = {} | |
bible_words = bible.split() |
#!/usr/bin/python2 | |
# coding: utf-8 | |
import re, datetime, random, mido, sys, time | |
data = {} | |
def split(seq): | |
for i in range(len(seq) - 2): | |
yield tuple(seq[i:i+3]) |
( | |
Ndef(\test, { | |
var pan, snd, freq, fdbk, fold, fold_range, smooth_amount, env, dly; | |
var lfo_freq = LFNoise0.kr(0.5).range(0.1, 20); | |
var trig_freq = LFNoise0.kr(0.5).range(0.2, 10); | |
var ftrig = Impulse.kr(LFNoise2.kr(0.3).range(0.03, 5)); | |
freq = Demand.kr(ftrig, 0, Dseq([100, 150, 300], inf)) * TChoose.kr(ftrig, [1,1.3, 1.5, 2.0, 4.0]); | |
fdbk = SinOsc.kr(lfo_freq*1.3).range(0.2, 2.3); | |
fold = SinOsc.kr(lfo_freq*0.75 + SinOsc.kr(lfo_freq*1.3).range(-2, 5)).range(0, 0.5).neg; | |
fold_range = SinOsc.kr(lfo_freq).range(0.3, 0.8).abs; |