-
... n, which will be called at each new phrase. subdivfunc Anything that returns an array of subdivisions when .value is called on it. (This array is normalizeSummed so it always adds up to 1.0). These subdivisions are applied once recursively, ...
-
+ Stream { generateAll { arg inval; // don't do this on infinite streams. var array; this.generate({|item| array = array.add(item); }, inval); ^array } }
-
... = of ? {arg q,bpsubdiv; rrand(0,q - 1)*bpsubdiv}; reclevel= rl ? 2; offsetlist= Array.new(0); } chooseblock { var next; if((offsetlist.size)==block, { //new phrase this.newPhraseAccounting; //currphraselength.postln; //number of points avai ...
-
//redFrik RedSequencer2 { *ar {|array, dur, reset= 0| ^Duty.ar(dur, reset, Dseq(array, inf)); } *kr {|array, dur, reset= 0| ^Duty.kr(dur, reset, Dseq(array, inf)); } }
-
//redFrik RedSequencer { *ar {|array, trig, reset= 0| ^Demand.ar(trig, reset, Dseq(array, inf)); } *kr {|array, trig, reset= 0| ^Demand.kr(trig, reset, Dseq(array, inf)); } }
-
... .location) ~node.nearestToNode[0].location */ TestKDTree : UnitTest { classvar <array, <size, <dims, <tree, <array2, <tree2, <>dumpTrees=false; setUp { } tearDown { } // Creates a 3D data structure and tests whether certain searches return ...
-
... .location) ~node.nearestToNode[0].location */ TestKDTree : UnitTest { classvar <array, <size, <dims, <tree, <array2, <tree2, <>dumpTrees=false; setUp { } tearDown { } // Creates a 3D data structure and tests whether certain searches return ...
-
... es clicks). freqEnv { |partialIdx| var freqVals = atsSound.freqs[partialIdx].as(Array); var ampVals = atsSound.amps[partialIdx].as(Array); var n = freqVals.size; var held = Array.newClear(n); var lastGood = nil, times; // Forward fill: repl ...
-
... ources over specific number of speakers // using PanAz. + Mix { *panSpread {arg array, nCha = 2, width = 2, offset = 0; //array must be audio-rate this.deprecated( thisMethod, Meta_SplayAz.findMethod(\ar) ); ^Mix.fill( array.size, { |i| Pan ...
-
... // when maxsize, only add if better than last element, if (function.value(item, array.last)) { array.pop; ^super.add(item); }; // else do nothing, i.e. just drop item } // always add them one by one to maintain maxSize addAll { |aColl| aCol ...