OH. Basically you are saying my patch has to finish the last calculation before it's finished with the first one- so it's one really deep string of messages instead of a lot of short ones?
It all makes perfect sense now. I've just become a slightly better programmer. Thanks!
I guess my next question would be whether that will slow down the sequencer, having each scalar accessed at a different logical time, but I suppose in real time there won't be any difference. I'm going to revamp this and see how it works. Thanks again.
-Chuckk
On 3/23/06, Tim Blechmann TimBlechmann@gmx.net wrote:
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.
in pd every outlet call is a recursive function call ... if an message goes back to the message signal flow, you have an iteration ...
i've attached a simple patch with a counter counting to 100 ... this might show you the difference ...
hth ... tim
-- TimBlechmann@gmx.de ICQ: 96771783 http://www.mokabar.tk
Every word is like an unnecessary stain on silence and nothingness Samuel Beckett
-----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2.2 (GNU/Linux)
iD8DBQBEIulDNDZZF/Yk3sURAqUWAKCU5ykxTxdSyouzICj4zqobpNoP+wCfUVPu pj3x4x6zYloo+8TcpPRsa7w= =vknI -----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"