-
... ee Wait being used to pause a routine // This waits for one second between each number 1.wait; }); // Wait half second before saying we're done 0.5.wait; "done" .postln; }.play; ) // waitUntil ( var r; r = Routine { var times = { rrand(1.0, ...
-
... white (0, 188893 - ( Pkey ( \dur ) * 44100), inf ) )).play; ) // shows a buffer number allocated ('true' ContiguousBlock) s.bufferAllocator.debug; p.stop; s.bufferAllocator.debug; // after stop, the buffer is gone Previous: PG_06e_Language_ ...
-
... so that parallel streams can be merged. In order to understand the framework, a number of concepts must be covered. These concepts are embodied in the classes for Streams, Patterns, and Events. You should learn these concepts in the order p ...
-
... 5, 1), commentColor: Color (0.75, 0, 0, 1), symbolColor: Color (0, 0.45, 0, 1), numberColor: Color (0, 0, 0, 1) ) ); If you want to have your own themes for syntax colorization, you need to put your color set into Document.themes first (pre ...
-
... radius, startAngle, arcAngle) Draw an arc around the [Point] center , at radius number of pixels. startAngle and arcAngle refer to the starting angle and the extent of the arc, and are in radians [0..2pi]. ( w = Window .new.front; w.view.ba ...
-
... . Patches can be built dynamically and parameterized not just by floating point numbers from a static score, but by other graphs of unit generators as well. Or you can construct patches algorithmically on the fly. This kind of fluidity is n ...
-
... e: ~u.play(0, 2); // initialize 2 audio channels (default). 0 is the output bus number. // if the proxy is not inititialized, play defaults to 2 channels. // here it is explicitly given only to make it more clear. ~u = { PinkNoise .ar(0.2) ...
-
... m can modify it. An EventStreamPlayer is itself a stream which returns scalars (numbers) which are used by the clock to schedule its next invocation. At every call to EventStreamPlayer-next by the clock, the player gets its delta values by ...
-
... nts have been reordered via one of 10 "counting" algorithms. The algorithms are numbered 1 through 10. Run the examples to see the algorithms. [1, 2, 3, 4].pyramid(1).postln; ( 10.do({ arg i; [1, 2, 3, 4].pyramid(i + 1).postcs; }); ) pyrami ...
-
... { |x| try { x.even } }: \even // try is needed because argument might not be a number ); ); d.matchAt(0) d.matchAt(1) d.matchAt(2) // matches both 'fibonacci' and 'even', either may be returned d.matchAt(4) d.matchAt( \abc ) trueAt(key) Re ...