11euclidean
An approach to the Euclidean algorithm using only standard max objects.
Screenshots:
Installation:
Just copy the files into your Max search path.
Changelog:
2014/3/16: I just removed some unnecessary patchcords in the abstraction and made a minimal change in the help patch.
|
http://maxforlive.com/library/index.php?by=any&q=euclidean
Could you explain the algorithm? I don`t understand connection from total steps to int in (count+=hits) block. Seems like i`ve missed smth.
for (i = 0; i < len; i++)
{
pattern <<= 1;
if (cnt >= len)
{
SET_BIT(pattern, 0);
cnt -= len;
}
cnt += pulses
}
Maybe that helps to better understand the patcher. O.
what would i use your patch 11euclidean for?
RSS feed for comments to this post