strudel/packages/core/signal.mjs
2022-04-15 10:14:51 +01:00

62 lines
1.7 KiB
JavaScript

import { Hap } from './hap.mjs';
import { Pattern, fastcat } from './pattern.mjs';
import Fraction from './fraction.mjs';
export function steady(value) {
// A continuous value
return new Pattern((span) => Hap(undefined, span, value));
}
export const signal = (func) => {
const query = (state) => [new Hap(undefined, state.span, func(state.span.midpoint()))];
return new Pattern(query);
};
export const isaw = signal((t) => 1 - (t % 1));
export const isaw2 = isaw._toBipolar();
export const saw = signal((t) => t % 1);
export const saw2 = saw._toBipolar();
export const sine2 = signal((t) => Math.sin(Math.PI * 2 * t));
export const sine = sine2._fromBipolar();
export const cosine = sine._early(Fraction(1).div(4));
export const cosine2 = sine2._early(Fraction(1).div(4));
export const square = signal((t) => Math.floor((t * 2) % 2));
export const square2 = square._toBipolar();
export const tri = fastcat(isaw, saw);
export const tri2 = fastcat(isaw2, saw2);
// random signals
const xorwise = x => {
const a = (x << 13) ^ x
const b = (a >> 17) ^ a
return (b << 5) ^ b
}
// stretch 300 cycles over the range of [0,2**29 == 536870912) then apply the xorshift algorithm
const _frac = x => x - Math.trunc(x);
const timeToIntSeed = x => xorwise(Math.trunc(_frac(x / 300) * 536870912));
const intSeedToRand = x => (x % 536870912) / 536870912;
const timeToRand = x => intSeedToRand(timeToIntSeed(x));
const timeToRandsPrime = (seed, n) => {
const result = [];
for (let i = 0; i < n; ++n) {
result.push(intSeedToRand(seed));
seed = xorwise(seed);
}
return(result);
}
const timeToRands = (t, n) => timeToRandsPrime(timeToIntSeed(t), n)
export const rand = signal(timeToRand)