>From Pierre Fleurance:
Together with Logelloù (Philippe Ollivier, Rozenn Nicol) we're organising
community days around Max from 12 to 14 September.
The format is hybrid, combining artistic presentations (concerts,
installations), oral presentations (by developers, researchers, and
artists), and
Hi Autumn,
Here is how to cross inputs 2 and 3.
Cheers
Yann
X = _,_ <: !,_,_,!;
process = _,X,_:par(i,2,(voc(n,0.01,1,mod_bw,mod_order,car_bw,car_order))):>
_,_;
Le jeu. 28 déc. 2023 à 14:06, Autumn Cheney via Faudiostream-users <
faudiostream-users@lists.sourceforge.net> a écrit :
> hi!
>
> i
Hi,
Faust is a very modular language, and it's easy to reuse any Faust program
as a component of another, thanks to the `component()` construct. For
example: `component("freeverb.dsp")` lets you integrate a fully functional
reverb, with its user interface, inside another program.
But how to contr
op(i1,v1,i2,v2) = select2(v2>v1,i1,i2), max(v1,v2);
> };
>
> for example
>
> process = 3,2,4,6,2 : i_max(5);
>
> outputs
>
> output0[i0] = FAUSTFLOAT(3); // index
> output1[i0] = FAUSTFLOAT(6);// maximum
>
> probably not
r to have working, after changing my input and output
> formats to suit:
>
> https://github.com/magnetophon/faustExperiments/blob/0d2735bc4900dc4e51da24fb8ee05e49d44eb73c/acor.dsp#L76
>
> Thanks,
> Daz
>
> --
> *From:* Yann Orlarey
> *S
Thank you David for undertaking this work, it is really very useful!
Yann
Le jeu. 23 mars 2023 à 22:44, David Braun a
écrit :
> On this page: https://github.com/DBraun/faust/actions/runs/4458934421 there's
> an "artifacts" section at the bottom. It may be possible to use some of
> the libfaust o
Hi David,
Fantastic, thanks for this great contribution! I think it would be really
interesting to organize an online presentation for the Faust community.
What do you think about it?
Cheers,
Yann
Le jeu. 20 oct. 2022 à 20:15, Stéphane Letz a écrit :
> Hi David,
>
> Thanks for this awesome co
-- Forwarded message -
De : Myriam Desainte-Catherine
Date: ven. 14 oct. 2022 à 18:35
Subject: [AFIM.INFO] Appel à candidatures : professeur des universités
Bordeaux - recherche en informatique musicale // Call for applications :
full professor Bordeaux - research in computer music
== 3
Le ven. 19 août 2022 à 17:05, Robin Gareus a écrit :
> On 8/19/22 08:19, Yann Orlarey wrote:
> > Hi Robin,
> >
> > Here is a generic shelfcascade with an arbitrary list of frequencies. The
> > gains are directly routed. They are in the reverse order (the first input
&
Hi Robin,
Here is a generic shelfcascade with an arbitrary list of frequencies. The
gains are directly routed. They are in the reverse order (the first input
is the gain of the last stage).
shelfcascade(lf) = bus(lf), ls3(first(lf)) : sc(lf) // lf : list of
frequencies
with {
sc((f1, f2, lf)) =
Hi Robin,
Welcome back!
As written, analyzer needs a list of frequencies as a second argument.
These frequencies can be numbers or more complex circuits, but they have to
be number-like, i.e. with no input and only one output. So you can't use
the identity function _ as a frequency (because it ha
Hi Dario and Oleg,
After reflection, I think it is not possible to merge with and letrec.
Indeed, since letrec is implemented with an abstraction (as Oleg rightly
pointed out), then any additional definition inside the definition of this
abstraction, will not be visible outside.
In other words, l
Hi Dario,
I think it would be a great idea to make this unification between letrec
and with. The current implementation of letrec is extremely simple and
almost like syntactic sugar, so there is some work to do, but it should be
feasible of course...
Cheers,
Yann
Le dim. 26 juin 2022 à 13:49, D
That's a very good news !!! Also many thanks to Stephane for making that
possible.
Yann
Le sam. 21 mai 2022 à 13:46, Stéphane Letz a écrit :
> Faust News
>
> >> May 20, 2022: Two Google Summer of Code projects attributed
>
> Two projects have finally been attributed to GRAME:
>
> • Faus
xtremely useful for us to improve
Faust and its ecosystem.
https://forms.gle/ijYpNH9mLMeTqGMV8
Yann
Le ven. 4 mars 2022 à 17:13, yann orlarey a écrit :
> Hi,
>
> The FAUST community is growing steadily, so this year we decided to
> conduct a survey to better understand your use of FA
demos, or tutorials. In
this case, the submission process is much lighter, you only need to provide
a one-page maximum abstract.
Yann
Le mar. 30 nov. 2021 à 14:47, Yann Orlarey a écrit :
> IFC-22 Call for Papers
> ==
>
> The International Faust Conference aims at gath
Hi,
The FAUST community is growing steadily, so this year we decided to conduct
a survey to better understand your use of FAUST and your expectations.
Don't hesitate to fill in the questionnaire!
https://forms.gle/ijYpNH9mLMeTqGMV8
We will unveil the results on the occasion of the 20th anniversa
Science European Conference (OSEC).
https://www.ouvrirlascience.fr/remise-des-prix-science-ouverte-du-logiciel-libre-de-la-recherche/
D. Fober, S. Letz, R. Michon, Y. Orlarey
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre
Hi Jean-Louis,
This is a very legitimate question. You have to use multiple rwtables. But,
as long as these tables differ only on the reading index, then the compiler
will optimize the code and share the table which will exist only in one
copy.
Yann
Le mer. 26 janv. 2022 à 15:08, Jean-Louis Paqu
Hi Jean-Louis,
If the content is known at compile-time, an efficient approach to implement
a lookup table is to use a waveform and a read-only table. Here are two
examples.
The first one is very minimal, with no protection on the read index:
l1(i) = waveform{1,2,7,4,5,6}, i : rdtable;
process =
09:30-09:50: Welcome, Yann Orlarey (Scientific Director, GRAME, Lyon,
France)
- 09:50-10:10: Audio in Unreal with Faust, Ethan Geller (Audio Research
Software Engineer, Meta/Facebook, USA)
- 10:10-10:30: Video Game Engine as Media Creation Swiss Army Knife,
Michael Bolufer (Technical director at
enne.
Local Organization Committee
-
Stéphane Letz
Romain Michon
Yann Orlarey
Laurent Pottier
Steering Committee
--
Alain Bonardi
Albert Gräf
Stéphane Letz
Romain Michon
Yann Orlarey
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +
Hi Steven,
That's right, we had to fix the behavior of the log and exp scales of the
IDE to be identical to those of other architectures. In a few words, in
most cases (for example for frequencies) you have to use the logarithmic
scale and not an exponential scale. The exponential scale is there f
Hi Lucian,
A useful function, in this type of routing, is `ro.interleave(N,M)`. It has
the advantage of requiring less work for the compiler, especially when N or
M is large.
import("stdfaust.lib");
N = 10;
process = ro.interleave(N,2) : par(i,N,*);
https://faustide.grame.fr/?autorun=0&voices
Hi Klaus,
We recently made some changes to fix the logarithmic scale of the sliders
and bargraphs, but obviously, we broke the bargraphs in some conditions!
We'll try to fix that asap...
Yann
Le mar. 17 août 2021 à 12:05, Klaus Scheuermann a écrit :
> Me again...
>
> Did something change in
Hi Ethan,
Thanks for asking. We are still working on a multi-rate version of Faust,
even if its development is not necessarily going as fast as we would like!
The idea is to introduce the multi-rate aspects as a new class of
primitives focusing on the signal processors themselves (rather than
oper
us Scheuermann wrote:
>
> Hi Yann!
>
> Of course it works perfectly and I learned about par, si.bus and
> ro.interleave :)
>
> Thanks... will be back soon I guess ;)
>
> Klaus
>
>
> On 27.07.21 12:17, Yann Orlarey wrote:
>
> Hi Klaus,
>
> Thanks for the
oldcounter(x) = (max(holdreset(x) * holdsamps,_) ~-(1));
> holdsig(x) = holdcounter(x) > 0;
> holdreset(x) = rawgatesig(x) < rawgatesig(x)'; // reset hold when raw
> gate falls
> holdsamps = int(hold*ma.SR);
> };
>
> Thanks,
> Klaus
>
>
>
>
> On 26.07.21
Hi Klaus,
You can give names to the input signals as in your example, but you don't
have to. In other words, instead of writing:
process(x) = f(g(x));
you can use a more idiomatic style, and write:
process = g : f;
Faust is inspired by Moses Schönfinkel's combinatory logic (1924) and John
Back
Hi Klaus and Giuseppe,
A simple and efficient implementation can be done using the min and max
primitives:
limit(lo,hi) = min(hi) : max(lo);
Cheers
Yann
Le lun. 19 juil. 2021 à 11:07, Giuseppe Silvi via Faudiostream-users <
faudiostream-users@lists.sourceforge.net> a écrit :
> Hi Klaus,
>
>
tern as its undelayed counterpart. This can be arranged by
> converting to fixed-point and leaving enough guard bits to accommodate the
> dynamic range needed. Alternatively, of course a TIIR version can be
> implemented.
>
> Cheers,
> Julius
>
> On Mon, Jul 12, 2021 at 3:28 PM Ya
Hi Julius and Dario,
Sliding sums written as:
sliding_sum(n) = (+ ~ _) <: _, @(n) : -;
accumulate errors (because the integral value is ever-growing, its
precision decrease with time).
This is why it is better to first subtract then integrate as in :
sliding_sum(n) = _ <: _,@(n) : - : +~_ ;
H
Hi!
Faustservice, the remote Faust compiler (https://faustservice.grame.fr/)
has been updated to the latest version: 2.33.1.
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours
And I unblocked the messages that were blocked because of the size...
Yann
Le dim. 11 juil. 2021 à 12:31, Stéphane Letz a écrit :
> I’ve just raised the size limit to 999 KB, which the the biggest value
> that the mailman system allows.
>
> Stéphane
>
> > Le 11 juil. 2021 à 12:02, Dario Sanfili
-- Forwarded message -
De : Samuel Limier
Date: mer. 12 mai 2021 à 13:14
Subject: Open permanent position at Arturia
To:
* Apologies for cross-posting *
Dear list,
We're opening up a permanent position for a senior digital signal
processing PhD graduate / engineer at Arturia (
Hi Oleg,
Thank you for these elements, you are obviously welcome to join the
discussion!
Y
Le mar. 11 mai 2021 à 15:40, Oleg Nesterov a écrit :
> Hi,
>
> I noticed by accident your discussion in
> https://github.com/grame-cncm/faustlibraries/pull/80
>
> ===
> From @orla
Hi,
Strings are not first-class citizens in Faust. For this reason you can't
write: `"test", -1, 1, x : vbargraph`. Therefore `vbargraph` alone, is not
a valid signal processor and only the form `vbargraph("test",-1,1)` is a
valid one (compiler/parser/faustparser.y:700). It's the same for all UI
e
Hi,
The issue of preserving musical works and equipment is indeed very
important and is a challenge for Faust.
In 2008-2010 we incorporated in the compiler the possibility to
automatically generate the mathematical description of the computations
performed by a Faust program (faust2mathdoc) see
h
-- Forwarded message -
De : Luca Turchet
Date: mer. 21 avr. 2021 à 18:45
Subject: [ubimus] [Deadline Extension] Audio Mostly Conference
To:
*Audio Mostly - virtual conference*
*Submission deadline extended to 15th of May *
https://audiomostly.com/
*** Apologies for cross-posti
The Computer Science and Experimental Music Creation and Research Studio
(SCRIME, https://scrime.u-bordeaux.fr/) is recruiting:
- a software platform engineer on a renewable 1-year fixed-term
contract.
Located on the Peixotto campus (Sciences and technologies) of the
University of Bordeaux
-- Forwarded message -
De : Gilberto Bernardes Almeida
Date: ven. 16 avr. 2021 à 11:46
Subject: [ubimus] [CFP] Extended deadline (April 25): Eleventh Workshop on
Ubiquitous Music (UbiMus 2021)
To: ubiquitousmu...@googlegroups.com
*++ Eleventh Workshop on Ubiquitous Music (UbiMu
-- Forwarded message -
De : Luca Turchet
Date: jeu. 1 avr. 2021 à 13:04
Subject: [ubimus] Final call for contributions: Audio Mostly Conference,
1-3 September 2021
To:
*Audio Mostly - virtual conference*
*1-3 September 2021*
https://audiomostly.com/
*** Apologies for cross-pos
MTYpOw%3D%3D
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002 Lyon
www.grame.fr | facebook <https://www.facebook.com/Gramelyon/> | instagram
<http
Hi Dario,
Thanks for sharing, that's very interesting!
I take this opportunity to remind that URLs can be used directly in Faust
expressions.
For example:
process = component("
https://raw.githubusercontent.com/dariosanfilippo/lotka-volterra_osc_A/main/lotka-volterra_A.dsp
");
Using the share
Hi Yoann,
As James pointed out, Faust has strict semantics. This means that all
signals are always computed (https://en.wikipedia.org/wiki/Strict_function)
and that there is no non-strict 'if' in Faust.
It turns out that due to a bug in the compiler, the code generated for
select2 and select3 is
.sciencesconf.org/
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002 Lyon
www.grame.fr | facebook <https://www.facebook.com/Gramelyon/> | instagram
.sciencesconf.org/
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002 Lyon
www.grame.fr | facebook <https://www.facebook.com/Gramelyon/> | instagram
Hi Alain,
The library is indeed missing (but when faust is also installed we don't
realize it). Here is the file 'platform.lib' to add in
.FaustLive-CurrentSession-2.0/Libs.
Cheers.
Yann
// platform.lib
// A library to
k : ondemand(sig_demand_1)) -> x0, x0, x1, x1,
> x2, x2, ...
> sig -> x0, x1, x2, x3
>
>
> ?
>
> --
> Till Bovermann
>
> https://tai-studio.org | http://lfsaw.de |
> https://www.instagram.com/_lfsaw/
>
>
>
>
>
>
>
>
>
>
>
> > O
Yann
Le ven. 21 août 2020 à 18:13, Oleg Nesterov a écrit :
> Hi Yann,
>
> On 08/21, Yann Orlarey wrote:
> >
> > A *very* experimental implementation of the ondemand primitive is
> available
> > here :
> >
> > https://github.com/grame-cncm/faust/tree/exp
a look at the generated block-diagram to see how P is transformed in
ondemand(P).
In a future version, the clock signal values could be higher than 1, for
upsampling. We should then have a fairly general multi-rate system...
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
le.com/file/d/1LkT8KviWocnzt6hqRsLlSri5uwVDWI5p/view?usp=sharing
with a new section on combining on-demands.
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002 Lyon
www.grame.fr | fa
many aspects remain to be detailed...
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002 Lyon
www.grame.fr | facebook <https://www.facebook.com/G
Hi Till,
Thanks for the offer! Could you explain in a few words how demand-rate
works in supercollider?
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul
s are here
https://photos.app.goo.gl/UTHpYfz5q1oe4CRV7, although I doubt it would be
understandable to anyone but me ;-)
If you have specific use cases and examples to feed the reflection, it
would be helpful to us...
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
U in some
circumstances. But this primitive must be used with great care. In
particular, it is the responsibility of the programmer to ensure that his
use of enable(x,y) behaves as much as possible like x*y.
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr
;
apply(N,op) = par(i,N,_) <: op(selectors(N))
with {
selectors(N) = par(i,N,selector(N,i));
selector(N,i) = route(N,1,i+1,1);
};
//process = \(x1,x2,x3,x4).(tsum((x1,x2,x3,x4)));
process = apply(4,tsum);
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.f
Hi Oleg,
I'm not sure that answers your question, but you can do that, for instance:
dsBus2int(1) = >(0);
dsBus2int(N) = dsBus2int(N-1) << 1, dsBus2int(1) :> _;
encode2int(P) = P : dsBus2int(outputs(P));
process = encode2int((1,0,1,0));
Yann
*Yann Orlarey*
Directeur scient
> _;
Cheers
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002 Lyon
www.grame.fr | facebook <https://www.facebook.com/Gramelyon/> | instagram
, they will be welcome too.
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002 Lyon
www.grame.fr | facebook <https://www.facebook.com/Gramelyon/> | instagram
kshop for the general public on writing VST plugins with Faust.
Tell us what you think. If the first two seem interesting to you, we'll
start collecting questions and projects very quickly.
Thanks
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0)
Hi Oleg,
I agree with you, we should probably think more seriously about introducing
a real NIL in Faust!
Yann
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 37 00
GRAME - Centre national de création musicale
11 cours de Verdun Gensoul | 69002
))) )
-R1-> 1 + ba.count( ((3,4),(5,6)) )
-R1-> 1 + 1 + ba.count( (5,6) )
-R1-> 1 + 1 + 1 + ba.count( 6 )
-R2-> 1 + 1 + 1 + 1
Please note that pattern matching is not limited to parallel composition,
the other composition operators (<: : :> ~) can be used too.
Ya
.
Register as soon as possible at https://forms.gle/f6pSMEwUg8mtH3Ko9
*Date*: December 14, 2019, 8:30 - 18:00
*Location*: UCLy, Campus Saint-Paul, 10 Place des Archives, 69002 Lyon
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 43 10
GRAME - Centre
.
Register as soon as possible at https://forms.gle/f6pSMEwUg8mtH3Ko9
*Date*: December 14, 2019, 8:30 - 18:00
*Location*: UCLy, Campus Saint-Paul, 10 Place des Archives, 69002 Lyon
*Yann Orlarey*
Directeur scientifique/Scientific director
orla...@grame.fr T : +33 (0) 4 72 07 43 10
GRAME - Centre
system.
Cheers
Yann
-
Yann Orlarey
Directeur scientifique / Scientific Director
<http://www.grame.fr>
Le mar. 18 juin 2019 à 12:37, Dario Sanfilippo
a écrit :
> Personally, I'd love that too.
>
> Currently, what is the condition that determines w
gameaudio/bubble.dsp was inspired by a similar paper by the same author:
http://persianney.com/kvdoelcsubc/publications/tap05.pdf
Cheers
Yann
-
Yann Orlarey
Directeur scientifique / Scientific Director
<http://www.grame.fr>
Le sam. 15 juin 2019 à 22:42, St
Hi Matt,
Welcome to Faust!
In your example you can use :
gate = button("../basshit-gate");
Cheers
Yann
-----
Yann Orlarey
Directeur scientifique / Scientific Director
<http://www.grame.fr>
Le mar. 11 juin 2019 à 19:56, interrupt a
écrit :
> B
Nice! Do you know if the presentation will be streamed?
Yann
Le mer. 12 juin 2019 à 08:29, azvinz via Faudiostream-users <
faudiostream-users@lists.sourceforge.net> a écrit :
> Dear list,
>
> just to inform you, I will have a talk and a small workshop today at the
> Chaos Computer Club Freiburg,
Hi Jonatan,
You can do the following:
process = hgroup("proc", def);
def = vgroup("innerbox", hslider("../slider",0, 0, 1, 0.01));
instead of
process = hgroup("proc", def);
def = vgroup("innerbox", hslider("slider",0, 0, 1, 0.01));
or you can code full pathname directly:
process = hslider("
Hi Jonatan,
I am not sure to understand what the problem is?
import("stdfaust.lib");
process = control(os.osc(440), choice==0), control(os.osc(660), choice==1)
:> _;
choice = button("choice");
In the above code, only one of the two branches will be computed and the
choice will be done at runti
Hi,
Two consecutive delay lines `@(n):@(m)` are now only merged if `n` is
constant.
Yann
Le lun. 8 oct. 2018 à 13:43, Yann Orlarey a écrit :
> Hi Oleg,
>
> You are right, `@(n):@(m)` is equivalent to `@(n+m)` only if `n` is
> constant. We must test this condition before mergi
Hi Oleg,
You are right, `@(n):@(m)` is equivalent to `@(n+m)` only if `n` is
constant. We must test this condition before merging the delay lines.
Thanks (again) for discovering the problem...
Yann
-
Yann Orlarey
Directeur scientifique
www.grame.fr
Le dim. 7 oct
As an approximation, you could use a bargraph, between 0 and 100 for
example, and scale the value to display with the length of the file.
Yann
Le mar. 25 sept. 2018 à 23:31, azvinz via Faudiostream-users <
faudiostream-users@lists.sourceforge.net> a écrit :
> okay, it is like it is ;)
>
> thank
compiler option for choosing between "local
> non-causality" and "causal non-locality".
>
> Sorry - I couldn't resist :-)
>
> - Julius
>
> On Tue, Sep 11, 2018 at 8:56 AM Yann Orlarey wrote:
>
>> Hi Oleg,
>>
>> I find all these a
Cheers
Yann
-
Yann Orlarey
Directeur scientifique
www.grame.fr
Le lun. 10 sept. 2018 à 09:53, Oleg Nesterov a écrit :
> On 09/09, yann orlarey wrote:
> >
> > Hi Oleg,
> >
> > `process = @(2) : @(-1);` is incorrect because `@(-1)` i
, Oleg Nesterov a écrit :
> Hi Yann,
>
> On 09/08, Yann Orlarey wrote:
> >
> > Hi,
> >
> > In principle, the problem should be solved in version 2.8.6. We have now
> a
> > pass of explicit casting before any optimization.
>
-
Yann Orlarey
Directeur scientifique
www.grame.fr
Le sam. 25 août 2018 à 01:16, yann orlarey a écrit :
> Hi,
>
> That's clearly a bug. Thanks Oleg for discovering the problem. I will have
> a look asap...
>
> Yann
>
> Le ven. 24 août 2018 à 16:30, Ole
Hi,
That's clearly a bug. Thanks Oleg for discovering the problem. I will have
a look asap...
Yann
Le ven. 24 août 2018 à 16:30, Oleg Nesterov a écrit :
> On 08/24, Julius Smith wrote:
> >
> > I think this one may have been fixed. I cannot reproduce it in the
> > latest git master-dev branch:
France), - Victor Lazzarini (Maynooth U.,
Maynooth, Ireland), - Romain Michon (Stanford U., Palo Alto, USA)- Yann
Orlarey (GRAME, Lyon, France), - Laurent Pottier (U. Jean Monnet,
Saint-Etienne, France),- Julius Smith (Stanford U., Palo Alto, USA)to iPlug
2 <https://github.com/iplug2> a free o
Hello,
If you were in a hurry to complete your project, the submission deadline
has been extended to June 7, 2018.
We look forward to receiving your submissions!
Yann Orlarey
2018-02-18 22:52 GMT+01:00 Yann Orlarey :
> [Sorry for cross-posting, please distribute.]
>
> Faust Op
ows 64 bits
code for Max6. But it was never really tested, and from your tests, I
understand that it is not working correctly. Do you have more details?
Yann
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-04-09 1:58 GMT+02:00 Patrik Lechner :
> Hi everyo
r
only in their return type cannot be overloaded" ?) instead of triggering an
exception when that's not the case.
---------
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-03-26 11:16 GMT-07:00 Stéphane Letz :
>
> > Le 26 mars 2018 à 14:48, Oleg Nesterov
both examples in less than 3s on my machine (instead of 123s for the code
using doubles). Compiling all the examples of the example folder shows a
global improvement of around 10%.
Cheers
Yann
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-03-23 6:52 GMT-07
Hi,
The problem has been fixed in version 2.5.26. The compiler now reports
an error instead of an exception.
Yann
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-03-21 8:16 GMT-07:00 Yann Orlarey :
> Hi Oleg,
>
> Thanks for pointing these problems.
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-03-21 5:04 GMT-07:00 Oleg Nesterov :
> On 03/21, Oleg Nesterov wrote:
> >
> > Ah, no, sorry, this is faustassert(lsig.size()==2) in realPropagate(),
> >
> >339 else if (isBoxPrim2(box, &p2))
Right. Internally the faust compiler uses doubles anyway and these doubles
are parsed using a very standard atof function. It would be useful if you
could send me a sample code because it's really weird.
Yann
-----
Yann Orlarey
Directeur scientifique
www.gra
ba.take() ==> O(n)
but par(i, n, ba.take()) ==> O(n^2)
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-03-20 5:26 GMT-07:00 Stéphane Letz :
> ba.take ==> complexity O(n^2)
>
> I think that this kind of info should be added in the libra
HI,
I did some tests and I don't see any problem with fi.fir(), it supports
very large lists. Here is the test file I used:
// --- fir500.dsp --
import("stdfaust.lib");
process = fi.fir((
1,2,3,4,5,6,7,8,9,10,
...48 copies...
1,2,3,4,5,6,7,8,9,10));
//--
ittee
---
- Jean-Louis Giavitto (IRCAM, Paris, France),
- Albert Gräf (Johannes Gutenberg U., Mainz, Germany),
- Pierre Jouvelot (Ecole des Mines, Paris, France),
- Victor Lazzarini (Maynooth U., Maynooth, Ireland),
- Romain Michon (CCRMA, Stanford , USA)
- Yann Orlarey (Grame, Lyon, F
Right, everything seems to be fine now :-). The problem was due to a data
center migration: https://sourceforge.net/blog/datacenter-migration-update/
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-02-19 19:02 GMT-08:00 Mykle Hansen :
>
> > On Feb 19,
Hi everybody,
We seem to have had some "delay" problems with this mailing list. Because
of these delays, we all felt like no one was answering Mykle's question and
so we all answered; -)
Yann
PS: Let's see how long it takes for this message to reach the ML. It is now
5:02 p. m. Pacific time.
---
Hi Mykle,
You can start labels with a metadata number "[1]myslider..." to change the
lexicographical order.
Cheers
Yann
-----
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-02-16 11:48 GMT-08:00 Mykle Hansen :
> Hi,
>
> A quick question I can
ts/organ.dsp
-----
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-02-09 17:33 GMT-08:00 Yann Orlarey :
> Hi Mykle,
>
> Here is a preliminary version:
>
> https://faust.grame.fr/editor/?code=https://gist.
> githubusercontent.com/orlarey/b92854
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2018-02-09 0:01 GMT-08:00 Stéphane Letz :
> Not yet !
>
> Stéphane
>
> > Le 9 févr. 2018 à 07:46, Mykle Hansen a écrit :
> >
> > Hi,
> >
> > Question about the online Faust edi
Congratulations Oli!
Yann
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2017-11-20 10:31 GMT-08:00 Oliver Larkin via Faudiostream-users <
faudiostream-users@lists.sourceforge.net>:
> Came 3rd in the end. So very happy at least to be featured in Roli’s m
It worked. Thanks
--
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot___
Faudiostream-users mailing list
Hi Philip,
Great, thanks for this initiative! I will be very happy to proofread the
article, but the link requires a password.
Best regards
Yann
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2017-11-08 10:01 GMT+01:00 Yassin Philip :
> Hi everyone!
>
We have published a new online Faust Editor at http://faust.grame.fr/editor
.
It is still experimental, but it can be used to edit, compile and run Faust
code from any recent Web Browser with webassembly support. This editor
works completely on the client side and it is therefore very convenient f
Many thanks Oli!
-
Yann Orlarey
Directeur scientifique
www.grame.fr
2017-10-22 15:51 GMT+02:00 Oliver Larkin via Faudiostream-devel <
faudiostream-de...@lists.sourceforge.net>:
> if any windows users are interested in having a play with faust2, here a
1 - 100 of 169 matches
Mail list logo
