On Fre, 2018-02-02 at 18:31 +0000, Dario Sanfilippo wrote: > There's an implementation of a peak holder in this blog post: http:// > dariosanfilippo.tumblr.com/post/162523174771/lookahead-limiting-in- > pure-data.
BTW: the peak envelope part could be also implemented using fexpr~: [fexpr~ max($x1, ($y[-1]*$f2)] This has the advantage of not requiring a re-blocked subpatch with blocksize=1. However, I wonder which is computationally less expensive. Is there a rule of thumb whether [fexpr~] or [block~ 1] is faster? Roman
Description: This is a digitally signed message part
_______________________________________________ Pdemail@example.com mailing list UNSUBSCRIBE and account-management -> https://lists.puredata.info/listinfo/pd-list