flo-mat 2.0.1 → 2.0.3

package/node/mat/find-mat/find-2-prong/find-equidistant-point-on-line.js

@@ -1,40 +1,40 @@
-/**
- * @hidden
- * @param x
- * @param y
- * @param z
- * @returns The point on the line from y to x that is equidistant from y and z.
- */
-function findEquidistantPointOnLine(x, y, z) {
-    // Some basic algebra (not shown) finds the required point.
-    // Swap axes if x and y are more aligned to y-axis than to x-axis.
-    let swapAxes = Math.abs((x[1] - y[1]) / (x[0] - y[0])) > 1;
-    // Cache
-    let x1, x2, y1, y2, z1, z2;
-    if (swapAxes) {
-        x1 = x[1];
-        x2 = x[0];
-        y1 = y[1];
-        y2 = y[0];
-        z1 = z[1];
-        z2 = z[0];
-    }
-    else {
-        x1 = x[0];
-        x2 = x[1];
-        y1 = y[0];
-        y2 = y[1];
-        z1 = z[0];
-        z2 = z[1];
-    }
-    // a <= 1 (due to swapped axes)
-    let a = (x2 - y2) / (x1 - y1);
-    let b = y2 - a * y1;
-    let c = (y1 * y1 + y2 * y2 - z1 * z1 - z2 * z2) + 2 * b * (z2 - y2);
-    let d = y1 - z1 + a * (y2 - z2);
-    let t1 = c / (2 * d);
-    let t2 = a * t1 + b;
-    return swapAxes ? [t2, t1] : [t1, t2];
-}
-export { findEquidistantPointOnLine };
+/**
+ * @hidden
+ * @param x
+ * @param y
+ * @param z
+ * @returns The point on the line from y to x that is equidistant from y and z.
+ */
+function findEquidistantPointOnLine(x, y, z) {
+    // Some basic algebra (not shown) finds the required point.
+    // Swap axes if x and y are more aligned to y-axis than to x-axis.
+    const swapAxes = Math.abs((x[1] - y[1]) / (x[0] - y[0])) > 1;
+    // Cache
+    let x1, x2, y1, y2, z1, z2;
+    if (swapAxes) {
+        x1 = x[1];
+        x2 = x[0];
+        y1 = y[1];
+        y2 = y[0];
+        z1 = z[1];
+        z2 = z[0];
+    }
+    else {
+        x1 = x[0];
+        x2 = x[1];
+        y1 = y[0];
+        y2 = y[1];
+        z1 = z[0];
+        z2 = z[1];
+    }
+    // a <= 1 (due to swapped axes)
+    const a = (x2 - y2) / (x1 - y1);
+    const b = y2 - a * y1;
+    const c = (y1 * y1 + y2 * y2 - z1 * z1 - z2 * z2) + 2 * b * (z2 - y2);
+    const d = y1 - z1 + a * (y2 - z2);
+    const t1 = c / (2 * d);
+    const t2 = a * t1 + b;
+    return swapAxes ? [t2, t1] : [t1, t2];
+}
+export { findEquidistantPointOnLine };
 //# sourceMappingURL=find-equidistant-point-on-line.js.map

package/node/mat/find-mat/find-2-prong/find-equidistant-point-on-line.js.map

@@ -1 +1 @@
-{"version":3,"file":"find-equidistant-point-on-line.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-2-prong/find-equidistant-point-on-line.ts"],"names":[],"mappings":"AACA;;;;;;GAMG;AACH,SAAS,0BAA0B,CAAC,CAAW,EAAE,CAAW,EAAE,CAAW;IACxE,2DAA2D;IAE3D,kEAAkE;IAClE,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE3D,QAAQ;IACR,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;IAE3B,IAAI,QAAQ,EAAE;QACb,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB;SAAM;QACN,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB;IAED,+BAA+B;IAC/B,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAC,EAAE,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACxD,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9B,IAAI,EAAE,GAAG,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;IACjB,IAAI,EAAE,GAAG,CAAC,GAAC,EAAE,GAAG,CAAC,CAAC;IAElB,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;AACrC,CAAC;AAGD,OAAO,EAAE,0BAA0B,EAAE,CAAA"}
+{"version":3,"file":"find-equidistant-point-on-line.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-2-prong/find-equidistant-point-on-line.ts"],"names":[],"mappings":"AACA;;;;;;GAMG;AACH,SAAS,0BAA0B,CAAC,CAAW,EAAE,CAAW,EAAE,CAAW;IACxE,2DAA2D;IAE3D,kEAAkE;IAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE7D,QAAQ;IACR,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;IAE3B,IAAI,QAAQ,EAAE;QACb,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB;SAAM;QACN,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB;IAED,+BAA+B;IAC/B,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAC,EAAE,CAAC;IACpB,MAAM,CAAC,GAAG,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1D,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,CAAC,GAAC,EAAE,GAAG,CAAC,CAAC;IAEpB,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;AACrC,CAAC;AAGD,OAAO,EAAE,0BAA0B,EAAE,CAAA"}

package/node/mat/find-mat/find-2-prong/get-initial-bezier-pieces.d.ts

@@ -1,11 +1,11 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { BezierPiece } from '../../bezier-piece.js';
-import { Loop } from '../../../loop.js';
-import { CpNode } from '../../../cp-node.js';
-import { IPointOnShape } from '../../../point-on-shape.js';
-/** @hidden */
-declare function getInitialBezierPieces(isHoleClosing: boolean, k: number, loops: Loop[], cpTrees: Map<Loop, LlRbTree<CpNode>>, y: IPointOnShape): {
-    bezierPieces: BezierPiece[];
-    δ: CpNode[];
-};
-export { getInitialBezierPieces };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { BezierPiece } from '../../bezier-piece.js';
+import { Loop } from '../../../loop.js';
+import { CpNode } from '../../../cp-node.js';
+import { IPointOnShape } from '../../../point-on-shape.js';
+/** @hidden */
+declare function getInitialBezierPieces(isHoleClosing: boolean, k: number, loops: Loop[], cpTrees: Map<Loop, LlRbTree<CpNode>>, y: IPointOnShape): {
+    bezierPieces: BezierPiece[];
+    δ: CpNode[];
+};
+export { getInitialBezierPieces };

package/node/mat/find-mat/find-2-prong/get-initial-bezier-pieces.js

@@ -1,38 +1,38 @@
-import { getNeighbouringPoints } from '../../get-neighboring-cps.js';
-import { getBoundaryPieceBeziers } from '../../get-boundary-piece-beziers.js';
-import { isPosDullCorner } from '../../../point-on-shape.js';
-/** @hidden */
-function getInitialBezierPieces(isHoleClosing, k, loops, cpTrees, y) {
-    let bezierPieces;
-    let δ;
-    if (isHoleClosing) {
-        bezierPieces = [];
-        for (let k2 = 0; k2 < k; k2++) {
-            let pieces = loops[k2].curves
-                .map(curve => ({ curve, ts: [0, 1] }));
-            bezierPieces.push(...pieces);
-        }
-    }
-    else {
-        //let order = PointOnShape.isDullCorner(y)
-        let order = isPosDullCorner(y)
-            ? y.t === 1 ? -1 : +1
-            : 0;
-        let loop = loops[k];
-        let cpNode = getNeighbouringPoints(cpTrees.get(loop), y, order, 0)[0];
-        δ = [cpNode, cpNode];
-        if (!cpNode ||
-            // The special case if there is only a single sharp corner or 
-            // terminating 2-prong currently in the MAT. Don't remove!
-            (cpNode === cpNode.next.next)) {
-            bezierPieces = loop.curves
-                .map(curve => ({ curve, ts: [0, 1] }));
-        }
-        else {
-            bezierPieces = getBoundaryPieceBeziers(δ);
-        }
-    }
-    return { bezierPieces, δ };
-}
-export { getInitialBezierPieces };
+import { getNeighbouringPoints } from '../../get-neighboring-cps.js';
+import { getBoundaryPieceBeziers } from '../../get-boundary-piece-beziers.js';
+import { isPosDullCorner } from '../../../point-on-shape.js';
+/** @hidden */
+function getInitialBezierPieces(isHoleClosing, k, loops, cpTrees, y) {
+    let bezierPieces;
+    let δ;
+    if (isHoleClosing) {
+        bezierPieces = [];
+        for (let k2 = 0; k2 < k; k2++) {
+            const pieces = loops[k2].curves
+                .map(curve => ({ curve, ts: [0, 1] }));
+            bezierPieces.push(...pieces);
+        }
+    }
+    else {
+        //let order = PointOnShape.isDullCorner(y)
+        const order = isPosDullCorner(y)
+            ? y.t === 1 ? -1 : +1
+            : 0;
+        const loop = loops[k];
+        const cpNode = getNeighbouringPoints(cpTrees.get(loop), y, order, 0)[0];
+        δ = [cpNode, cpNode];
+        if (!cpNode ||
+            // The special case if there is only a single sharp corner or 
+            // terminating 2-prong currently in the MAT. Don't remove!
+            (cpNode === cpNode.next.next)) {
+            bezierPieces = loop.curves
+                .map(curve => ({ curve, ts: [0, 1] }));
+        }
+        else {
+            bezierPieces = getBoundaryPieceBeziers(δ);
+        }
+    }
+    return { bezierPieces, δ };
+}
+export { getInitialBezierPieces };
 //# sourceMappingURL=get-initial-bezier-pieces.js.map

package/node/mat/find-mat/find-2-prong/get-initial-bezier-pieces.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-initial-bezier-pieces.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-2-prong/get-initial-bezier-pieces.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AACrE,OAAO,EAAE,uBAAuB,EAAE,MAAM,qCAAqC,CAAC;AAI9E,OAAO,EAAE,eAAe,EAAiB,MAAM,4BAA4B,CAAC;AAG5E,cAAc;AACd,SAAS,sBAAsB,CACvB,aAAsB,EACtB,CAAS,EACT,KAAa,EACb,OAAmC,EACnC,CAAgB;IAEpB,IAAI,YAA2B,CAAC;IAChC,IAAI,CAAW,CAAC;IAEhB,IAAI,aAAa,EAAE;QACf,YAAY,GAAG,EAAE,CAAC;QAClB,KAAK,IAAI,EAAE,GAAC,CAAC,EAAE,EAAE,GAAC,CAAC,EAAE,EAAE,EAAE,EAAE;YACvB,IAAI,MAAM,GAAkB,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM;iBACvC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACzC,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;SAChC;KACJ;SAAM;QACH,0CAA0C;QAC1C,IAAI,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC;YACtB,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,MAAM,GAAG,qBAAqB,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM;YACP,8DAA8D;YAC9D,0DAA0D;YAC1D,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAC/B;YACE,YAAY,GAAG,IAAI,CAAC,MAAM;iBACrB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;SAC5C;aAAM;YACH,YAAY,GAAG,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAC7C;KACJ;IAED,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;AAC/B,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}
+{"version":3,"file":"get-initial-bezier-pieces.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-2-prong/get-initial-bezier-pieces.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AACrE,OAAO,EAAE,uBAAuB,EAAE,MAAM,qCAAqC,CAAC;AAI9E,OAAO,EAAE,eAAe,EAAiB,MAAM,4BAA4B,CAAC;AAG5E,cAAc;AACd,SAAS,sBAAsB,CACvB,aAAsB,EACtB,CAAS,EACT,KAAa,EACb,OAAmC,EACnC,CAAgB;IAEpB,IAAI,YAA2B,CAAC;IAChC,IAAI,CAAW,CAAC;IAEhB,IAAI,aAAa,EAAE;QACf,YAAY,GAAG,EAAE,CAAC;QAClB,KAAK,IAAI,EAAE,GAAC,CAAC,EAAE,EAAE,GAAC,CAAC,EAAE,EAAE,EAAE,EAAE;YACvB,MAAM,MAAM,GAAkB,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM;iBACzC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACzC,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;SAChC;KACJ;SAAM;QACH,0CAA0C;QAC1C,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC;YACxB,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,MAAM,GAAG,qBAAqB,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM;YACP,8DAA8D;YAC9D,0DAA0D;YAC1D,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAC/B;YACE,YAAY,GAAG,IAAI,CAAC,MAAM;iBACrB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;SAC5C;aAAM;YACH,YAAY,GAAG,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAC7C;KACJ;IAED,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;AAC/B,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}

package/node/mat/find-mat/find-2-prong/x-for-debugging.d.ts

@@ -1,9 +1,9 @@
-import { IPointOnShape } from '../../../point-on-shape.js';
-/** @hidden */
-declare type TXForDebugging = {
-    x: number[];
-    y: IPointOnShape;
-    z: IPointOnShape;
-    t: number;
-};
-export { TXForDebugging };
+import { IPointOnShape } from '../../../point-on-shape.js';
+/** @hidden */
+type TXForDebugging = {
+    x: number[];
+    y: IPointOnShape;
+    z: IPointOnShape;
+    t: number;
+};
+export { TXForDebugging };

package/node/mat/find-mat/find-2-prong/x-for-debugging.js

@@ -1,2 +1,2 @@
-export {};
+export {};
 //# sourceMappingURL=x-for-debugging.js.map

package/node/mat/find-mat/find-3-prong/calc-better-x.d.ts

@@ -1,19 +1,19 @@
-import { IPointOnShape } from '../../../point-on-shape.js';
-import { BezierPiece } from '../../bezier-piece.js';
-/**
- * @hidden
- * Find new x and ps that are a better estimate of the 3-prong circle.
- * The potential function, V, is defined as the distance to the actual 3 prong
- * circle center.
- * @param bezierPiece3s The three boundary pieces, each of which should contain
- * a point of the 3-prong to be found.
- * @param x The currently best guess at the center of the 3-prong circle.
- * @param vectorToZeroV
- * @param extreme
- */
-declare function calcBetterX(bezierPiece3s: BezierPiece[][], x: number[], vectorToZeroV: number[]): {
-    newX: number[];
-    newV: number;
-    newPs: IPointOnShape[];
-};
-export { calcBetterX };
+import { IPointOnShape } from '../../../point-on-shape.js';
+import { BezierPiece } from '../../bezier-piece.js';
+/**
+ * @hidden
+ * Find new x and ps that are a better estimate of the 3-prong circle.
+ * The potential function, V, is defined as the distance to the actual 3 prong
+ * circle center.
+ * @param bezierPiece3s The three boundary pieces, each of which should contain
+ * a point of the 3-prong to be found.
+ * @param x The currently best guess at the center of the 3-prong circle.
+ * @param vectorToZeroV
+ * @param extreme
+ */
+declare function calcBetterX(bezierPiece3s: BezierPiece[][], x: number[], vectorToZeroV: number[]): {
+    newX: number[];
+    newV: number;
+    newPs: IPointOnShape[];
+};
+export { calcBetterX };

package/node/mat/find-mat/find-3-prong/calc-better-x.js

@@ -1,37 +1,37 @@
-import { fromTo, circumCenter, len, scale, translate } from 'flo-vector2d';
-import { getClosestPoints } from './get-closest-points.js';
-/**
- * @hidden
- * Find new x and ps that are a better estimate of the 3-prong circle.
- * The potential function, V, is defined as the distance to the actual 3 prong
- * circle center.
- * @param bezierPiece3s The three boundary pieces, each of which should contain
- * a point of the 3-prong to be found.
- * @param x The currently best guess at the center of the 3-prong circle.
- * @param vectorToZeroV
- * @param extreme
- */
-function calcBetterX(bezierPiece3s, x, vectorToZeroV) {
-    let V = len(vectorToZeroV);
-    let nu = 1;
-    let better;
-    let newX;
-    let newPs;
-    let newV;
-    let i = 0; // Safeguard
-    do {
-        let shift = scale(vectorToZeroV, nu);
-        newX = translate(shift, x);
-        newPs = getClosestPoints(newX, bezierPiece3s);
-        // Point of zero V
-        let newCircleCenter = circumCenter(newPs.map(pos => pos.p));
-        let newVectorToZeroV = fromTo(newX, newCircleCenter);
-        newV = len(newVectorToZeroV);
-        better = newV < V;
-        nu = nu / 2;
-        i++;
-    } while (!better && i < 3);
-    return { newX, newV, newPs };
-}
-export { calcBetterX };
+import { fromTo, circumCenter, len, scale, translate } from 'flo-vector2d';
+import { getClosestPoints } from './get-closest-points.js';
+/**
+ * @hidden
+ * Find new x and ps that are a better estimate of the 3-prong circle.
+ * The potential function, V, is defined as the distance to the actual 3 prong
+ * circle center.
+ * @param bezierPiece3s The three boundary pieces, each of which should contain
+ * a point of the 3-prong to be found.
+ * @param x The currently best guess at the center of the 3-prong circle.
+ * @param vectorToZeroV
+ * @param extreme
+ */
+function calcBetterX(bezierPiece3s, x, vectorToZeroV) {
+    const V = len(vectorToZeroV);
+    let nu = 1;
+    let better;
+    let newX;
+    let newPs;
+    let newV;
+    let i = 0; // Safeguard
+    do {
+        const shift = scale(vectorToZeroV, nu);
+        newX = translate(shift, x);
+        newPs = getClosestPoints(newX, bezierPiece3s);
+        // Point of zero V
+        const newCircleCenter = circumCenter(newPs.map(pos => pos.p));
+        const newVectorToZeroV = fromTo(newX, newCircleCenter);
+        newV = len(newVectorToZeroV);
+        better = newV < V;
+        nu = nu / 2;
+        i++;
+    } while (!better && i < 3);
+    return { newX, newV, newPs };
+}
+export { calcBetterX };
 //# sourceMappingURL=calc-better-x.js.map

package/node/mat/find-mat/find-3-prong/calc-better-x.js.map

@@ -1 +1 @@
-{"version":3,"file":"calc-better-x.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-3-prong/calc-better-x.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAG3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAG3D;;;;;;;;;;GAUG;AACH,SAAS,WAAW,CACZ,aAA8B,EAC9B,CAAW,EACX,aAAuB;IAE3B,IAAI,CAAC,GAAG,GAAG,CAAC,aAAa,CAAC,CAAC;IAE3B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,MAAM,CAAC;IACX,IAAI,IAAI,CAAC;IACT,IAAI,KAAsB,CAAC;IAC3B,IAAI,IAAI,CAAC;IACT,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY;IACvB,GAAG;QACC,IAAI,KAAK,GAAG,KAAK,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;QACrC,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAG3B,KAAK,GAAG,gBAAgB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAE9C,kBAAkB;QAClB,IAAI,eAAe,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,gBAAgB,GAAG,MAAM,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QACrD,IAAI,GAAG,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAE7B,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC;QAElB,EAAE,GAAG,EAAE,GAAC,CAAC,CAAC;QAEV,CAAC,EAAE,CAAC;KACP,QAAQ,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,EAAE;IAE3B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;AAChC,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}
+{"version":3,"file":"calc-better-x.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-3-prong/calc-better-x.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAG3E,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAG3D;;;;;;;;;;GAUG;AACH,SAAS,WAAW,CACZ,aAA8B,EAC9B,CAAW,EACX,aAAuB;IAE3B,MAAM,CAAC,GAAG,GAAG,CAAC,aAAa,CAAC,CAAC;IAE7B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,MAAM,CAAC;IACX,IAAI,IAAI,CAAC;IACT,IAAI,KAAsB,CAAC;IAC3B,IAAI,IAAI,CAAC;IACT,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY;IACvB,GAAG;QACC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;QACvC,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAG3B,KAAK,GAAG,gBAAgB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAE9C,kBAAkB;QAClB,MAAM,eAAe,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,gBAAgB,GAAG,MAAM,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QACvD,IAAI,GAAG,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAE7B,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC;QAElB,EAAE,GAAG,EAAE,GAAC,CAAC,CAAC;QAEV,CAAC,EAAE,CAAC;KACP,QAAQ,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,EAAE;IAE3B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;AAChC,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

package/node/mat/find-mat/find-3-prong/calc-initial-3-prong-center.d.ts

@@ -1,13 +1,13 @@
-import { CpNode } from '../../../cp-node.js';
-import { BezierPiece } from '../../bezier-piece.js';
-/**
- * @hidden
- * Finds an initial 3-prong circle center point from which to iterate. The point
- * must be within the shape.
- * @param δ3s - The three boundary pieces of which we need to find the three
- * 3-prong points.
- * @param bezierPiece3s
- * @param extreme
- */
-declare function calcInitial3ProngCenter(δ3s: CpNode[][], bezierPiece3s: BezierPiece[][]): number[];
-export { calcInitial3ProngCenter };
+import { CpNode } from '../../../cp-node.js';
+import { BezierPiece } from '../../bezier-piece.js';
+/**
+ * @hidden
+ * Finds an initial 3-prong circle center point from which to iterate. The point
+ * must be within the shape.
+ * @param δ3s - The three boundary pieces of which we need to find the three
+ * 3-prong points.
+ * @param bezierPiece3s
+ * @param extreme
+ */
+declare function calcInitial3ProngCenter(δ3s: CpNode[][], bezierPiece3s: BezierPiece[][]): number[];
+export { calcInitial3ProngCenter };

package/node/mat/find-mat/find-3-prong/calc-initial-3-prong-center.js

@@ -1,26 +1,26 @@
-/** @hidden */
-import { circumCenter } from 'flo-vector2d';
-import { getClosestBoundaryPoint } from '../../closest-boundary-point/get-closest-boundary-point.js';
-/**
- * @hidden
- * Finds an initial 3-prong circle center point from which to iterate. The point
- * must be within the shape.
- * @param δ3s - The three boundary pieces of which we need to find the three
- * 3-prong points.
- * @param bezierPiece3s
- * @param extreme
- */
-function calcInitial3ProngCenter(δ3s, bezierPiece3s) {
-    let twoProngCircleCenter = δ3s[0][0].cp.circle.center;
-    let posInfo = getClosestBoundaryPoint(bezierPiece3s[1], twoProngCircleCenter, undefined, // curve
-    undefined // t
-    );
-    let meanPoints = [
-        δ3s[0][0].cp.pointOnShape.p,
-        posInfo.pos.p,
-        δ3s[2][1].cp.pointOnShape.p,
-    ];
-    return circumCenter(meanPoints);
-}
-export { calcInitial3ProngCenter };
+/** @hidden */
+import { circumCenter } from 'flo-vector2d';
+import { getClosestBoundaryPoint } from '../../closest-boundary-point/get-closest-boundary-point.js';
+/**
+ * @hidden
+ * Finds an initial 3-prong circle center point from which to iterate. The point
+ * must be within the shape.
+ * @param δ3s - The three boundary pieces of which we need to find the three
+ * 3-prong points.
+ * @param bezierPiece3s
+ * @param extreme
+ */
+function calcInitial3ProngCenter(δ3s, bezierPiece3s) {
+    const twoProngCircleCenter = δ3s[0][0].cp.circle.center;
+    const posInfo = getClosestBoundaryPoint(bezierPiece3s[1], twoProngCircleCenter, undefined, // curve
+    undefined // t
+    );
+    const meanPoints = [
+        δ3s[0][0].cp.pointOnShape.p,
+        posInfo.pos.p,
+        δ3s[2][1].cp.pointOnShape.p,
+    ];
+    return circumCenter(meanPoints);
+}
+export { calcInitial3ProngCenter };
 //# sourceMappingURL=calc-initial-3-prong-center.js.map

package/node/mat/find-mat/find-3-prong/calc-initial-3-prong-center.js.map

@@ -1 +1 @@
-{"version":3,"file":"calc-initial-3-prong-center.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-3-prong/calc-initial-3-prong-center.ts"],"names":[],"mappings":"AAAA,cAAc;AACd,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAG5C,OAAO,EAAE,uBAAuB,EAAE,MAAM,4DAA4D,CAAC;AAGrG;;;;;;;;GAQG;AACH,SAAS,uBAAuB,CACxB,GAAe,EACf,aAA8B;IAElC,IAAI,oBAAoB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;IAEtD,IAAI,OAAO,GAAG,uBAAuB,CAC7B,aAAa,CAAC,CAAC,CAAC,EAChB,oBAAoB,EACpB,SAAS,EAAE,QAAQ;IACnB,SAAS,CAAE,IAAI;KACtB,CAAC;IAEF,IAAI,UAAU,GAAG;QACb,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;KAC9B,CAAC;IAEF,OAAO,YAAY,CAAC,UAAU,CAAC,CAAC;AACpC,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA"}
+{"version":3,"file":"calc-initial-3-prong-center.js","sourceRoot":"","sources":["../../../../src/mat/find-mat/find-3-prong/calc-initial-3-prong-center.ts"],"names":[],"mappings":"AAAA,cAAc;AACd,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAG5C,OAAO,EAAE,uBAAuB,EAAE,MAAM,4DAA4D,CAAC;AAGrG;;;;;;;;GAQG;AACH,SAAS,uBAAuB,CACxB,GAAe,EACf,aAA8B;IAElC,MAAM,oBAAoB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;IAExD,MAAM,OAAO,GAAG,uBAAuB,CAC/B,aAAa,CAAC,CAAC,CAAC,EAChB,oBAAoB,EACpB,SAAS,EAAE,QAAQ;IACnB,SAAS,CAAE,IAAI;KACtB,CAAC;IAEF,MAAM,UAAU,GAAG;QACf,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;KAC9B,CAAC;IAEF,OAAO,YAAY,CAAC,UAAU,CAAC,CAAC;AACpC,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA"}

package/node/mat/find-mat/find-3-prong/find-3-prong-for-delta3s.d.ts

@@ -1,22 +1,22 @@
-import { CpNode } from '../../../cp-node.js';
-import { BezierPiece } from '../../bezier-piece.js';
-import { IPointOnShape } from '../../../point-on-shape.js';
-/**
- * @hidden
- * Finds a 3-prong using only the 3 given δs.
- * @param δs The boundary pieces
- * @param idx δ identifier
- * @param bezierPiecess
- * @param extreme The maximum coordinate value used to calculate floating point
- * tolerances.
- */
-declare function find3ProngForDelta3s(δs: CpNode[][], idx: number, k: number, bezierPiecess: BezierPiece[][], extreme: number): {
-    ps: IPointOnShape[];
-    circle: {
-        center: number[];
-        radius: number;
-    };
-    error: number;
-    δ3s: CpNode[][];
-};
-export { find3ProngForDelta3s };
+import { CpNode } from '../../../cp-node.js';
+import { BezierPiece } from '../../bezier-piece.js';
+import { IPointOnShape } from '../../../point-on-shape.js';
+/**
+ * @hidden
+ * Finds a 3-prong using only the 3 given δs.
+ * @param δs The boundary pieces
+ * @param idx δ identifier
+ * @param bezierPiecess
+ * @param extreme The maximum coordinate value used to calculate floating point
+ * tolerances.
+ */
+declare function find3ProngForDelta3s(δs: CpNode[][], idx: number, k: number, bezierPiecess: BezierPiece[][], extreme: number): {
+    ps: IPointOnShape[];
+    circle: {
+        center: number[];
+        radius: number;
+    };
+    error: number;
+    δ3s: CpNode[][];
+};
+export { find3ProngForDelta3s };