Interesting test!
Will have to drill down on this...
On Tue, Dec 22, 2020 at 11:43 AM Oleg Nesterov wrote:
> Julius, et al,
>
> sorry for delay, I was busy.
>
> And let me apologize in advance, most probably I won't be responsive
> till next week.
>
> On 12/20, Julius Smith wrote:
> >
> > In
Julius, et al,
sorry for delay, I was busy.
And let me apologize in advance, most probably I won't be responsive
till next week.
On 12/20, Julius Smith wrote:
>
> In filters.lib, I just now changed (in faustlibraries / master)
> smax = 0.;
> to
> smax = 1.0-ma.EPSILON;
OK, I ran the
OK fine,
Note that using min/max based guard can be a better alternative than using «
ba.if ».
You can read the "Does select2 behaves as a standard C/C++ like if ? » in the
FAQ:
https://github.com/grame-cncm/faustdoc/blob/master/mkdocs/docs/manual/faq.md
and especially the last section.
Thak-you Stéphane,
I've read the recursion paragraph many times! :-D
By the way, it was my code that was buggy, because I had a division by
zero error...very noob fault!
Here is my working version, checking before that loopSize is bigger than
zero:
readIndex = ba.if(loopSize>0,
> Le 22 déc. 2020 à 14:29, Daniele Pagliero a
> écrit :
>
> this statement is clear:
>
> recIndex = (+(1) : %(maxSamples)) ~ *(btn)
>
> and I can translate it in something like:
>
> recIndex = ((recIndex + 1) % maxSamples) * btn
No, you cannot write the second version with «
My starting point was this:
https://faustdoc.grame.fr/manual/syntax/#rwtable-primitive
On 22/12/20 14:37, Stéphane Letz wrote:
Where does this looper code comes from?
Thanks.
Stéphane
Le 22 déc. 2020 à 14:29, Daniele Pagliero a écrit :
Hello Stéphane,
thanks a lot, This solve the
Where does this looper code comes from?
Thanks.
Stéphane
> Le 22 déc. 2020 à 14:29, Daniele Pagliero a
> écrit :
>
> Hello Stéphane,
>
> thanks a lot, This solve the compile error.
>
> I take the advantage of your kindness to ask more about the language
> functionality that to me is
Hello Stéphane,
thanks a lot, This solve the compile error.
I take the advantage of your kindness to ask more about the language
functionality that to me is still cryptic.
here is the previous code with the int cast fix:
import("stdfaust.lib");
sampleRate = 48000;
maxTime = 4;
OK,
: rwtable(n,s,w,_,r) : _
Where:
• n: the table size
• s: the initial table content
• w: the write index (an int between 0 and n-1)
• r: the read index (an int between 0 and n-1)
So « w » and « r » must be of type « int » , correction here :
recIndex
Hi Daniele,
I don’t see this error when compiling here with master-dev 2.30.3 version.
Which Faust version are you using ?
Thanks.
Stéphane
> Le 22 déc. 2020 à 01:34, daniele.pagli...@gmail.com a écrit :
>
> Hi Dario,
>
> thanks a lot! It is exactly what I needed.
> To go further with the
Hello Stéphane,
actually I'm playing with the online Faust IDE.
Daniele
Il giorno mar 22 dic 2020 alle ore 11:40 Stéphane Letz ha
scritto:
> Hi Daniele,
>
> I don’t see this error when compiling here with master-dev 2.30.3 version.
>
> Which Faust version are you using ?
>
> Thanks.
>
>
I'm sorry for the noise, but the tests below are wrong. I had to change the
SR limits to do some oversampling but then some code was not compiling. So
I changed it back and it looks like faust2csvplot is only working at
44.1KHz now, which is probably why the filters went unstable at CFs below
what
12 matches
Mail list logo
