-
... //remove if((removechance.coin) && (numfx>0),{ cutgroup.removeAt(basenum+(numfx.rand)); numfx=numfx-1; }); if((addchance.coin) && (numfx<maxnumfx),{ newfx = [ {var cfreq, rq,drq; cfreq= [exprand(500,7500),{arg block; (block.phraseprop)*1000 ...
-
... md)); /* color code: fail create delete affirm : synced color code each node by rand color translate addActions group,synth colors would be nice */ } colorForCmd { |cmd| ^cmd.asString.switch( "/n_free",{ Color.red}, "/g_freeAll",{Color.red} ...
-
... ~start = ~startbase.copy; // place a couple of snare hits on beat or 8th note rrand(2, 4).do({ i = pool.select( _ .even).choose; pool.remove(i); ~amps[i] = 1; ~start[i] = ~segments[#[ \snare , \crash ].choose].choose; }); // throw some oth ...
-
... .sort; Pswitch1( [Psin(min, max, cycleLength) , Psin(min, max, cycleLength2)], Prand([0, 1], inf) ) }, [ \cycleLength, \cycleLength ], \stream); // why not ? Instr([\minmax, \NumberEditor], { arg min=0.0, max=1.0; # min, max = [min, max].so ...
-
... ~start = ~startbase.copy; // place a couple of snare hits on beat or 8th note rrand(2, 4).do({ i = pool.select( _ .even).choose; pool.remove(i); ~amps[i] = 1; ~start[i] = ~segments[#[ \snare , \crash ].choose].choose; }); // throw some oth ...
-
... nce=sc; stutterspeed=ss; stutterarea=sa; if(numrepeats.isNil, { numrepeats= {(2.rand)+1}; } ); unitsdone=0; totalunits=0; numbarsnow=0; stutteron=0; } chooseblock { var unitsleft, unitproj,stutsp; var oddmax,repeats; //new phrase to calcula ...
-
... ostln;}) .nodeUpAction_({ arg nodeloc; nodeloc.postln}); 30.do({ a.setState_(24.rand, 8.rand, 1); // column, row, state }); ) b = a.getNodeStates // clear the grid a.clearGrid // set it back to previous state a.setNodeStates_(b) // draw on ...
-
... ary buffer mirrored here? //offset choosing object as part of this- defaults to random positions based on imposed grid //var <>grain=0.5, <>randomoffset=0.0; //for continuous write, offset is relative to write head pos- else for fixed bufs, ...
-
... that does nothing runs really fast bench({ nil }); // filling a big array with random numbers takes a while longer. bench({ Array.rand(100000, 0.0, 1.0) }); // different operations may take different times bench({ 1000000.do { 3.sqrt.cos } ...
-
... ,rf,of,rl; cutfunc= cf ? {[1.5,1].wchoose([0.666,0.334])}; repeatfunc= rf ? {(2.rand)+1}; offsetfunc= of ? {arg q,bpsubdiv; rrand(0,q - 1)*bpsubdiv}; reclevel= rl ? 2; offsetlist= Array.new(0); } chooseblock { var next; if((offsetlist.size) ...