flo-mat 2.0.2 → 2.0.4

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++) {
-            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 };
+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/x-for-debugging.d.ts

@@ -1,9 +1,9 @@
-import { IPointOnShape } from '../../../point-on-shape.js';
-/** @hidden */
-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) {
-    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 };
+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-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) {
-    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 };
+/** @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/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 };