On Fri, 26 Oct 2007, Frank Barknecht wrote:
Then if you have long-running [until]s that generate stack-overflows, you can work around this by dividing long computations into smaaller chunks with some [delay]s as well. Of course working around stack overflows this way can be even more dangerous, as is illustrated with the [pipe] example in attachement as well. [pipe] also act as an endpoint to depth first travesal just like [delay].
Actually, [delay] and such are doing breadth-first traversal. By putting one or a few [delay]s you get a breadth-first traversal of depth-first components, and if you insert a [delay] in every connection you have a purely breadth-first system.
depth-first is based on a stack. breadth-first is based on a queue.I say just that as a different way to explain the concept. It also answers questions like "if an execution pattern is not depth-first then else can it be?" even though such a question would only be asked by impertinent students who deserves the leather strap.
_ _ __ ___ _____ ________ _____________ _____________________ ... | Mathieu Bouchard - tél:+1.514.383.3801, Montréal QC Canada
_______________________________________________ PD-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
