-
... ct({ arg m, i; m.asMixerChannelGUI(this); }); // fix window, draw controls, fix numbering and redraw this.sizeWindow; { this.refresh; nil }.defer(0.1); ^this } // remove & removeAt won't work yet remove { arg ... mxs; // remove mixer(s) fro ...
-
... ct({ arg m, i; m.asMixerChannelGUI(this); }); // fix window, draw controls, fix numbering and redraw this.sizeWindow; { this.refresh; nil }.defer(0.1); ^this } // remove & removeAt won't work yet remove { arg ... mxs; // remove mixer(s) fro ...
-
... ake a gui if there already is one i = i+1; }); // resize the window only if the number of controlproxies has changed (oldNumGCs != model.controlProxies.size).if({ this.sizeWindow; }); }; } refresh { this.sizeWindow; } minNameWidth { ^200 } ...
-
... { proxy.set(\busOffset, inChan); }{ "%: new busOffset out of range of valid bus numbers!".format(thisMethod).warn; }; } set { |...args| proxy.set(*args); } get { |...args| proxy.get(*args); } gui { |argParent| var butWidth = 38; background ...
-
... help for more details Class Methods *new(numChans, bus, server) - numChans- the number of channels to allocate. Defaults to 1. bus - the bus id to write values to. Defaults to nil, where an id will be allocated for you. server - and instanc ...
-
... may be both Synth s and other Groups. Groups are thus useful for controlling a number of nodes at once, and when used as targets can be very helpful in controlling order of execution. (See Order of execution for more details on this topic) ...
-
... ake a gui if there already is one i = i+1; }); // resize the window only if the number of controlproxies has changed (oldNumGCs != model.controlProxies.size).if({ this.sizeWindow; }); }; } refresh { this.sizeWindow; } minNameWidth { ^200 } ...
-
... r options are available, which you are welcome to explore if you want. They are numbers that modulate the behaviour of the onset detector: relaxtime and floor are parameters to the whitening process used, a kind of normalisation of the FFT ...
-
... s faster than nested if statements), so it should be very fast and scale to any number of clauses. ( var x=0; //also try 1 switch(x,0,{ "hello" }, 1, { "goodbye" }) ) ( var x, z; z = [0, 1, 1.1, 1.3, 1.5, 2]; switch (z.choose.postln, 1, { \ ...
-
... one item this.addItem(item[0], item[1]); } }; queue.clear; // return the total number of time steps (seconds if speed==1). ^tree[0].at(0) } /* sounds: a list of functions (or other TextSequencer instances) * doCut: if a sound entry is a Te ...