-
... parent's bounds var new, maxpt, mybounds, used; mybounds = this.bounds; maxpt = Point(0, 0); this.children.do({ arg c; maxpt = maxpt.max(c.findRightBottom); }); new = mybounds.resizeTo(maxpt.x + this.decorator.margin.x, maxpt.y + this.decor ...
-
... p : AbsApp { var cache, convertor, transactionCount = 0; mx { ^model } at { arg point; var u; u = model.at(point.x, point.y) ?? { ^nil }; ^this.prFind( u ) } put { arg point, object; ^this.prFind(model.put(point.x, point.y, object)) } atID ...
-
... t if( (i+1) == n ) { 1 } { 0 }, // is last ].mirror2; Pen.roundedRect( Rect.fromPoints( (baseRect.left + (knobWidth * i))@baseRect.top, (baseRect.left + (knobWidth * (i+1)))@baseRect.bottom ), radius.min( baseRect.width/2) * radiusMul ); }) ...
-
/* \map_polar Creates an UMap intended for use on modulatable point parameters. It converts the point into a polar, with linear controls for rho and theta, which on their turn can be used to assign other UMaps to. The point is mapped to a c ...
-
... guiBody { arg layout, bounds, argMaxTime; maxTime = argMaxTime ?? {model.spline.points.last[0]}; splineGui = this.make2DSpline(focusedDim).gui(layout, Rect(0, 0, layout.bounds.width, layout.bounds.height - 25), model.spec, ControlSpec(0, ma ...
-
... ; InstrBrowser({ arg layout, instr; ActionButton(layout, "INSERT FILTER", { var point, filter, newUnit, b, oldcables; point = boxes.boxPointForUnit(unit); if(model.at(point.x, point.y + 1).notNil, { newUnit = model.insert(point.x, point.y + ...
-
... is.prDrawNextButton; this.prDrawLastButton; // Write the time stamp Pen.stringAtPoint( currentTimeStamp, Point( super.interactionRect.left + 5, super.interactionRect.top ), thisFontInstance.deepCopy.size_( min( 12, super.interactionRect.hei ...
-
... } { \ }; // example of synthdef name: // 'wfsa_fdl_32' : focused dynamic linear point, 32 speakers // 'wfsa_psn_40' : static non-interpolating plane, 40 speakers ^[ this.prefix, [type, mode, int, sub].join(""), size ].join("_"); } *generate ...
-
... ructure for efficient spatial search A k d-tree is a data structure for storing points in a Euclidean space. It is not optimised for data that changes (insertions/deletions) but is very efficient at spatial queries such as nearest-neighbour ...
-
... ructure for efficient spatial search A k d-tree is a data structure for storing points in a Euclidean space. It is not optimised for data that changes (insertions/deletions) but is very efficient at spatial queries such as nearest-neighbour ...