-
... tecting the previous content to be overwritten. You can reposition the internal pointer using the seek method to anywhere in the file for reading, but writing operations will move it back to the end of file. The file is created if it does n ...
-
... when analysis is completed. It takes the result (an event) as argument. maxDataPoints A limit on the number of points added to the data. trimDuration When trimDuration is unspecified, the duration is no longer than the length of the file. ...
-
... ; this.refresh; }; } resize_ { |new| resize = new; view.resize_( resize ); } getPoints { |bounds| bounds = bounds ? plotView.drawBounds; ^eqSetting.argNames.collect({ |array, i| var freq; if( array.includes( \freq ) ) { freq = eqSetting[ i, ...
-
... ; this.refresh; }; } resize_ { |new| resize = new; view.resize_( resize ); } getPoints { |bounds| bounds = bounds ? plotView.drawBounds; ^eqSetting.argNames.collect({ |array, i| var freq; if( array.includes( \freq ) ) { freq = eqSetting[ i, ...
-
... f(Integer), { midiPort = MIDIOut(clientPort) }, { if(clientPort.isKindOf(MIDIEndPoint), { midiPort = MIDIOut.newByName(clientPort.device, clientPort.name) }, { if(clientPort.isKindOf(MIDIOut), { midiPort = clientPort; }) }) }); }; if(client ...
-
... ntrol(name, value); } // to cache this def, this info needs to be saved // argi points to the slot in objects (as supplied to secretDefArgs) // selector will be called on that object to produce the synthArg // thus sample can indicate itsel ...
-
... ntrol(name, value); } // to cache this def, this info needs to be saved // argi points to the slot in objects (as supplied to secretDefArgs) // selector will be called on that object to produce the synthArg // thus sample can indicate itsel ...
-
... nd is bound to a time by placing it in another array, with the time (a floating point number, in beats) first: [143.2647423, ['/n_set', 1000, 'gate', 0]] ⧉ ✔ NOTE: Times are adjusted for the clock's tempo. Score: *new allows you to specify ...
-
... rregular performance, time allows for the bundle to be evaluated at a specified point in the future. Thus all messages are synchronous relative to each other, but delayed by a constant offset. If such a bundle arrives late, the server repli ...
-
... istribution quite efficiently. The table building is expensive though. The more points there are in the random table, the more accurate the distribution. ( var randomNumbers, histogram, distribution, randomTable, randTableSize=200; var minV ...