-
... te its own Window , and place it conveniently on the screen if the bounds are a Point . If the bounds are a Rect , then the Rect determines the window bounds. bounds - An instance of Rect or Point . Default value is 160@200 . label - The la ...
-
... o[x]/o[y] This wraps if need be. d2Pivot (start) Find a pivot based on a start point. Finding the new pivot point means picking one of the fractions in a triad. Finding the new start means figuring out wether the new pivot is the top, midd ...
-
... (parent, bounds) parent - The parent view. bounds - An instance of Rect , or a Point indicating width@height. ( w = Window .new.front; a = Hr Slider (w, Rect (20, 60, 150, 20)); a.action = { a.value.postln }; ) Accessing Instance and Class ...
-
... o Basic Creation takes an array of [x, y] pairs and a curve value for all break points x values can be negative (for use in indexing with negartive values or signals). * new([[x0, y0], [x1, y1] ... [xn, yn]], curve) a = InterplPairs([[0, 1] ...
-
... ime maxTime Subclassing and Internal Methods defaultMouseDownAction env addBreakPoint insertAtTime pointsPerSegment initSCEnvelopeEdit redraw updateAll updateSegment clear Inherited instance methods Examples Classes | GUI > Kits'>Kits > Kit ...
-
... .7); ~red = Color(0.8, 0, 0); ~ltRed = ~red.blend(~white, 0.7); ~buttonExtent = Point(25, 25); ~labelHeight = 16; ~labelFont = Font.default.copy.pixelSize_(11); ~sliderWidth = 200; ~xyExtent = Point(140, 145); ~gap = Point(5, 5); // this is ...
-
... arestN Description Performs online k-means classification, classifying each datapoint that comes in and updating the k-means centroids. The method is described in Algorithm B.1 of Brian McFee's 2012 thesis ( http://cseweb.ucsd.edu/~bmcfee/p ...
-
... ( LFNoise0 .ar(4, 400, 450), 0, 0.2 ) }.play; ) // freq is the rate of starting points { var freq = 1000; [ LFNoise0 .ar(freq), Impulse .ar(freq)] }.plot
-
... { var origin = this.bounds.leftTop, maxpt; if(relativeOrigin ? false) { maxpt = Point(0, 0); } { maxpt = origin; }; children.do({ arg c; maxpt = maxpt.max(c.findRightBottom); }); if(relativeOrigin ? false) { maxpt = maxpt + origin; }; if(de ...
-
... { var origin = this.bounds.leftTop, maxpt; if(relativeOrigin ? false) { maxpt = Point(0, 0); } { maxpt = origin; }; children.do({ arg c; maxpt = maxpt.max(c.findRightBottom); }); if(relativeOrigin ? false) { maxpt = maxpt + origin; }; if(de ...