Julius Smith

Hi Bart, I am not aware of a special name for organizing a string of computations into a tree structure to maximize reuse, although there are special examples such as...

Ok, it sounds like I should always click on the pull-request link to get latest info. My tests also come out clean, e.g.: // trunningsum.dsp // Usage: faust2plot trunningsum.dsp; trunningsum...

In case it is not clear, I would simply use fi.integrator and do only signal-processing-level testing. I would test and debug slidingReduce only when I had a winning use-case for...

> My tests *don't* come out clean: I can't get the 3 versions to agree, when the input is random. Our emails crossed in the ether, but my previous email...

That is very interesting --- an irresistible debugging challenge I would say :-) My "signal processing answer" for slidingMin (also O(1) complexity) would be runningMin = min ~ _ ;...

> Do you have any ideas for debugging slidingReduce? I would just do the usual thing of finding the minimum failing case on a repeatable input signal (such as no.noise)...

Here is my minimum failing case at the moment. Very interesting: // trunningsum.dsp // Usage: // faust2plot trunningsum.dsp; trunningsum import("stdfaust.lib"); bart = library("basics-bart.dsp"); //signal = 1; // ok //signal =...

Looks nice to have! If it's not going to noises.lib, then I think random-number generators in both files should have SEE ALSO comments pointing to each other. In principle, noise...

I think that's a great idea! Thanks, Julius On Wed, Oct 28, 2020 at 4:33 PM Dario Sanfilippo wrote: > Nice hearing from you, Julius. :-) > > Sure, I...

So you are saying there is no bug but that you prefer a linear over exponential shape for the first segment? I assume you know about the piecewise linear envelopes...