4 Feb
2018
4 Feb
'18
1:33 p.m.
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[0], ($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