Hello,

I'm not sure I understand everything you're saying, but to me it seems that you might be overcomplicating the task. In my experience the best way to separate transients from the rest is by using a simple envelope follower. The parts in the input signal that are louder than the follower's ...

Yes, it can be modified to calculate min, max and sum (average=sum/bufferSize).
Nice! So if you calculate the average of the buffer after "max from buffer" twice with half the window size, you should end up with a very smooth, accurate and cpu-efficient lookahead curve, as far as I'm concerned ...

Hi, I've done some research and it turns out it is possible to implement the "max from array" in O(1) steps (meaning the overall CPU usage will be independent of array-size). Here's a module I've made.
Wow, this truly is powerful. Thank you for the find indeed!

Filters do make a lot of ...

Also I believe most new PCs are pre-loaded with 64 bit Windows and many will not want to re-install their OS for 1 application.
Generally speaking 64 bit Windows' can run 32 bit hosts (which of course widely support 32 bit plugins), and even with 64 bit hosts you'll be able to bridge plugins from ...

Yes, I'm totally in for this!

This is probably my first post in the FS forum, but I visit here almost every day. I've been using SM/FS for about 3 years now, and I'm sure there are more people like me who are not actively posting but use FS all the time, and would like to have the 64-bit support ...