it behaves like the opposite on my machine. the abstraction based patch measures 6ms and the one, that generates everything from scratch, measures ~300ms.
now, after claude's explanation, i think, i know why this is the case. i don't have any pathes loaded at all in my preferences. i try to do everything with [declare]s inside the patches. thus pd hasn't to search a whole bunch of pathes, but only the ones that are really useful.
roman
On Mon, 2009-05-11 at 19:49 -0700, Jonathan Wilkes wrote:
I've been doing a lot of dynamic patching and notice that using abstractions slows down the process immensely. Why is it that test-abs.pd is so much slower than test-sp.pd (which just creates chains of internal objects in a subpatch)? Is there any way this could be sped up in future versions of pd? I find dynamic patching to be a powerful idiom when used with abstractions, but its kind of clunky right now because of the lengthy creation time.
Thanks, Jonathan
p.s. please excuse the trivial nature of the dsp, which is just there for the sake of comparison
_______________________________________________ Pd-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
___________________________________________________________ Der frühe Vogel fängt den Wurm. Hier gelangen Sie zum neuen Yahoo! Mail: http://mail.yahoo.de