I don't understand. I've understood recursive to mean a function that calls itself within itself. The output from my patch retriggers the patch, but to my understanding it should all be determinate; if Pd uses depth-first message passing, it should finish with one thread before calling the next. The abstraction is only retriggered from its left outlet, so nothing should happen during the 10 ms delay.
I'm also not sure how [until] will help. Pd doesn't know how many scalars the score has, or how many are of any one structure.
I'm still not clear on what "the stack" is or what makes it overflow. Thanks.
-Chuckk
On 3/23/06, Tim Blechmann TimBlechmann@gmx.net wrote:
On Thu, 2006-03-23 at 06:59 -0500, Chuckk Hubbard wrote:
Can anyone explain more about what exactly "stack overflow" is? Might it help if I just put a 1 ms delay for each scalar?
you've written a recursive patch, so each recursion increases the interpreter stack ... if your recursions are happening too often ... booooooom ... :-/
it's probably better to solve something like this with an iteration, which doesn't use the stack ... in pd it can be done with the |until| object ...
hth ... tim
-- TimBlechmann@gmx.de ICQ: 96771783 http://www.mokabar.tk
After one look at this planet any visitor from outer space would say "I want to see the manager." William S. Burroughs
-----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2.2 (GNU/Linux)
iD8DBQBEIpg6NDZZF/Yk3sURAq/tAKCxvMTiWrwTIrRsp1M/84jA4qPDEgCfavpK HlIXg2tHiybWlXLrgVPqMS8= =yuY2 -----END PGP SIGNATURE-----
-- "It is not when truth is dirty, but when it is shallow, that the lover of knowledge is reluctant to step into its waters." -Friedrich Nietzsche, "Thus Spoke Zarathustra"