flo-mat 2.0.1 → 2.0.3

package/node/mat/closest-boundary-point/get-close-boundary-points.d.ts

@@ -1,17 +1,17 @@
-import { IPointOnShape } from '../../point-on-shape.js';
-import { BezierPiece } from '../bezier-piece.js';
-/**
- * @hidden
- * Returns the closest boundary point to the given point, limited to the given
- * bezier pieces, including the beziers actually checked after culling.
- * @param bezierPieces
- * @param point
- * @param touchedCurve
- * @param t
- * @param extreme
- */
-declare function getCloseBoundaryPoints(bezierPieces: BezierPiece[], point: number[], y: IPointOnShape, distance: number): {
-    pos: IPointOnShape;
-    d: number;
-}[];
-export { getCloseBoundaryPoints };
+import { IPointOnShape } from '../../point-on-shape.js';
+import { BezierPiece } from '../bezier-piece.js';
+/**
+ * @hidden
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param point
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+declare function getCloseBoundaryPoints(bezierPieces: BezierPiece[], point: number[], y: IPointOnShape, distance: number): {
+    pos: IPointOnShape;
+    d: number;
+}[];
+export { getCloseBoundaryPoints };

package/node/mat/closest-boundary-point/get-close-boundary-points.js

@@ -1,81 +1,81 @@
-import { distanceBetween } from 'flo-vector2d';
-import { PointOnShape } from '../../point-on-shape.js';
-import { cullBezierPieces } from './cull-bezier-pieces.js';
-import { closestPointsOnCurve } from './closest-points-on-curve.js';
-/**
- * @hidden
- * Returns the closest boundary point to the given point, limited to the given
- * bezier pieces, including the beziers actually checked after culling.
- * @param bezierPieces
- * @param point
- * @param touchedCurve
- * @param t
- * @param extreme
- */
-function getCloseBoundaryPoints(bezierPieces, point, y, distance) {
-    let touchedCurve = y.curve;
-    let t = y.t;
-    let p_ = y.p;
-    bezierPieces = cullBezierPieces(bezierPieces, point);
-    // TODO - integrate with is-another-cp-closeby - we MUST check angle too!
-    let DISTANCE_TOLERANCE = 1e-9;
-    let posInfos = [];
-    for (let i = 0; i < bezierPieces.length; i++) {
-        let bezierPiece = bezierPieces[i];
-        // TOOD - important - should be able to return multiple points
-        let ps = closestPointsOnCurve(bezierPiece.curve, point, bezierPiece.ts, touchedCurve, t);
-        //if (ps === undefined) { continue; }
-        for (let j = 0; j < ps.length; j++) {
-            let p = ps[j];
-            let d = distanceBetween(p.p, point);
-            let curve = bezierPiece.curve;
-            let t_ = p.t;
-            if (Math.abs(d - distance) < DISTANCE_TOLERANCE) {
-                if (t_ === 0) {
-                    t_ = 1;
-                    curve = bezierPiece.curve.prev;
-                }
-                posInfos.push({ pos: new PointOnShape(curve, t_), d });
-            }
-        }
-    }
-    if (posInfos.length > 1) {
-        // Remove ones that are too close together.
-        // TODO - in future remove all these checks and join n-prongs when they
-        // are being added - much simpler and more symmetric. Remeber order when
-        // comparing closeness!
-        let indexesToCheck = [];
-        for (let i = 0; i < posInfos.length; i++) {
-            let pi = posInfos[i];
-            // Only check if they are close to the edges. Why??
-            //if (pi.pos.t < 1e-2 || 1-pi.pos.t < 1e-2) {
-            indexesToCheck.push(i);
-            //}
-        }
-        let indexesToRemove = [];
-        for (let i = 0; i < indexesToCheck.length; i++) {
-            for (let j = i + 1; j < indexesToCheck.length; j++) {
-                if (i === j) {
-                    continue;
-                }
-                let p1 = posInfos[indexesToCheck[i]].pos.p;
-                let p2 = posInfos[indexesToCheck[j]].pos.p;
-                // Below checks for source point too - similar to 
-                // isAnotherCpCloseBy
-                let p3 = p_;
-                if ((Math.abs(p1[0] - p2[0]) < 1e-6 &&
-                    Math.abs(p1[1] - p2[1]) < 1e-6) ||
-                    (Math.abs(p1[0] - p3[0]) < 1e-6 &&
-                        Math.abs(p1[1] - p3[1]) < 1e-6)) {
-                    indexesToRemove.push(indexesToCheck[i]);
-                }
-            }
-        }
-        for (let i = indexesToRemove.length - 1; i >= 0; i--) {
-            posInfos.splice(indexesToRemove[i], 1);
-        }
-    }
-    return posInfos;
-}
-export { getCloseBoundaryPoints };
+import { distanceBetween } from 'flo-vector2d';
+import { PointOnShape } from '../../point-on-shape.js';
+import { cullBezierPieces } from './cull-bezier-pieces.js';
+import { closestPointsOnCurve } from './closest-points-on-curve.js';
+/**
+ * @hidden
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param point
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+function getCloseBoundaryPoints(bezierPieces, point, y, distance) {
+    const touchedCurve = y.curve;
+    const t = y.t;
+    const p_ = y.p;
+    bezierPieces = cullBezierPieces(bezierPieces, point);
+    // TODO - integrate with is-another-cp-closeby - we MUST check angle too!
+    const DISTANCE_TOLERANCE = 1e-9;
+    const posInfos = [];
+    for (let i = 0; i < bezierPieces.length; i++) {
+        const bezierPiece = bezierPieces[i];
+        // TOOD - important - should be able to return multiple points
+        const ps = closestPointsOnCurve(bezierPiece.curve, point, bezierPiece.ts, touchedCurve, t);
+        //if (ps === undefined) { continue; }
+        for (let j = 0; j < ps.length; j++) {
+            const p = ps[j];
+            const d = distanceBetween(p.p, point);
+            let curve = bezierPiece.curve;
+            let t_ = p.t;
+            if (Math.abs(d - distance) < DISTANCE_TOLERANCE) {
+                if (t_ === 0) {
+                    t_ = 1;
+                    curve = bezierPiece.curve.prev;
+                }
+                posInfos.push({ pos: new PointOnShape(curve, t_), d });
+            }
+        }
+    }
+    if (posInfos.length > 1) {
+        // Remove ones that are too close together.
+        // TODO - in future remove all these checks and join n-prongs when they
+        // are being added - much simpler and more symmetric. Remeber order when
+        // comparing closeness!
+        const indexesToCheck = [];
+        for (let i = 0; i < posInfos.length; i++) {
+            const pi = posInfos[i];
+            // Only check if they are close to the edges. Why??
+            //if (pi.pos.t < 1e-2 || 1-pi.pos.t < 1e-2) {
+            indexesToCheck.push(i);
+            //}
+        }
+        const indexesToRemove = [];
+        for (let i = 0; i < indexesToCheck.length; i++) {
+            for (let j = i + 1; j < indexesToCheck.length; j++) {
+                if (i === j) {
+                    continue;
+                }
+                const p1 = posInfos[indexesToCheck[i]].pos.p;
+                const p2 = posInfos[indexesToCheck[j]].pos.p;
+                // Below checks for source point too - similar to 
+                // isAnotherCpCloseBy
+                const p3 = p_;
+                if ((Math.abs(p1[0] - p2[0]) < 1e-6 &&
+                    Math.abs(p1[1] - p2[1]) < 1e-6) ||
+                    (Math.abs(p1[0] - p3[0]) < 1e-6 &&
+                        Math.abs(p1[1] - p3[1]) < 1e-6)) {
+                    indexesToRemove.push(indexesToCheck[i]);
+                }
+            }
+        }
+        for (let i = indexesToRemove.length - 1; i >= 0; i--) {
+            posInfos.splice(indexesToRemove[i], 1);
+        }
+    }
+    return posInfos;
+}
+export { getCloseBoundaryPoints };
 //# sourceMappingURL=get-close-boundary-points.js.map

package/node/mat/closest-boundary-point/get-close-boundary-points.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-close-boundary-points.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/get-close-boundary-points.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAiB,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAEtE,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAGpE;;;;;;;;;GASG;AACH,SAAS,sBAAsB,CACvB,YAA2B,EAC3B,KAAe,EACrB,CAAgB,EAChB,QAAgB;IAEjB,IAAI,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACZ,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEb,YAAY,GAAG,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAErD,yEAAyE;IACzE,IAAI,kBAAkB,GAAG,IAAI,CAAC;IAC9B,IAAI,QAAQ,GAAwC,EAAE,CAAC;IACvD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,IAAI,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAElC,8DAA8D;QAC9D,IAAI,EAAE,GAAG,oBAAoB,CAC3B,WAAW,CAAC,KAAK,EACjB,KAAK,EACL,WAAW,CAAC,EAAE,EACd,YAAY,EACZ,CAAC,CACF,CAAC;QAEF,qCAAqC;QAErC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/B,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAEpC,IAAI,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;YAC9B,IAAI,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC;YAEZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAC,QAAQ,CAAC,GAAG,kBAAkB,EAAE;gBAC9C,IAAI,EAAE,KAAK,CAAC,EAAE;oBACb,EAAE,GAAG,CAAC,CAAC;oBACP,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;iBAC/B;gBAED,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACvD;SACD;KACD;IAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;QACxB,2CAA2C;QAC3C,uEAAuE;QACvE,wEAAwE;QACxE,uBAAuB;QACvB,IAAI,cAAc,GAAa,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACrB,mDAAmD;YACnD,6CAA6C;YAC5C,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,GAAG;SACH;QACD,IAAI,eAAe,GAAa,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,KAAK,IAAI,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,IAAI,CAAC,KAAK,CAAC,EAAE;oBAAE,SAAS;iBAAE;gBAC1B,IAAI,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC3C,IAAI,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC3C,kDAAkD;gBAClD,qBAAqB;gBACrB,IAAI,EAAE,GAAG,EAAE,CAAC;gBACZ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;oBACjC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;oBAE/B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;wBAC9B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAC/B;oBAEF,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACD;SACD;QACD,KAAK,IAAI,CAAC,GAAC,eAAe,CAAC,MAAM,GAAE,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAChD,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACzC;KACD;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAC"}
+{"version":3,"file":"get-close-boundary-points.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/get-close-boundary-points.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAiB,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAEtE,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAGpE;;;;;;;;;GASG;AACH,SAAS,sBAAsB,CACvB,YAA2B,EAC3B,KAAe,EACrB,CAAgB,EAChB,QAAgB;IAEjB,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC;IAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEf,YAAY,GAAG,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAErD,yEAAyE;IACzE,MAAM,kBAAkB,GAAG,IAAI,CAAC;IAChC,MAAM,QAAQ,GAAwC,EAAE,CAAC;IACzD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAEpC,8DAA8D;QAC9D,MAAM,EAAE,GAAG,oBAAoB,CAC7B,WAAW,CAAC,KAAK,EACjB,KAAK,EACL,WAAW,CAAC,EAAE,EACd,YAAY,EACZ,CAAC,CACF,CAAC;QAEF,qCAAqC;QAErC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/B,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAEtC,IAAI,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;YAC9B,IAAI,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC;YAEZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAC,QAAQ,CAAC,GAAG,kBAAkB,EAAE;gBAC9C,IAAI,EAAE,KAAK,CAAC,EAAE;oBACb,EAAE,GAAG,CAAC,CAAC;oBACP,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;iBAC/B;gBAED,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACvD;SACD;KACD;IAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;QACxB,2CAA2C;QAC3C,uEAAuE;QACvE,wEAAwE;QACxE,uBAAuB;QACvB,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,mDAAmD;YACnD,6CAA6C;YAC5C,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,GAAG;SACH;QACD,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,KAAK,IAAI,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,IAAI,CAAC,KAAK,CAAC,EAAE;oBAAE,SAAS;iBAAE;gBAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7C,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7C,kDAAkD;gBAClD,qBAAqB;gBACrB,MAAM,EAAE,GAAG,EAAE,CAAC;gBACd,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;oBACjC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;oBAE/B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;wBAC9B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAC/B;oBAEF,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACD;SACD;QACD,KAAK,IAAI,CAAC,GAAC,eAAe,CAAC,MAAM,GAAE,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAChD,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACzC;KACD;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAC"}

package/node/mat/closest-boundary-point/get-closest-boundary-point.d.ts

@@ -1,18 +1,18 @@
-import { Curve } from '../../curve.js';
-import { IPointOnShape } from '../../point-on-shape.js';
-import { BezierPiece } from '../bezier-piece.js';
-/**
- * @hidden
- * Returns the closest boundary point to the given point, limited to the given
- * bezier pieces, including the beziers actually checked after culling.
- * @param bezierPieces
- * @param point
- * @param touchedCurve
- * @param t
- * @param extreme
- */
-declare function getClosestBoundaryPoint(bezierPieces: BezierPiece[], point: number[], touchedCurve: Curve, t: number): {
-    pos: IPointOnShape;
-    d: number;
-};
-export { getClosestBoundaryPoint };
+import { Curve } from '../../curve.js';
+import { IPointOnShape } from '../../point-on-shape.js';
+import { BezierPiece } from '../bezier-piece.js';
+/**
+ * @hidden
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param point
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+declare function getClosestBoundaryPoint(bezierPieces: BezierPiece[], point: number[], touchedCurve: Curve, t: number): {
+    pos: IPointOnShape;
+    d: number;
+};
+export { getClosestBoundaryPoint };

package/node/mat/closest-boundary-point/get-closest-boundary-point.js

@@ -1,41 +1,41 @@
-import { distanceBetween, getObjClosestTo } from 'flo-vector2d';
-import { PointOnShape } from '../../point-on-shape.js';
-import { cullBezierPieces } from './cull-bezier-pieces.js';
-import { closestPointsOnCurve } from './closest-points-on-curve.js';
-/**
- * @hidden
- * Returns the closest boundary point to the given point, limited to the given
- * bezier pieces, including the beziers actually checked after culling.
- * @param bezierPieces
- * @param point
- * @param touchedCurve
- * @param t
- * @param extreme
- */
-function getClosestBoundaryPoint(bezierPieces, point, touchedCurve, t) {
-    bezierPieces = cullBezierPieces(bezierPieces, point);
-    let bestDistance = Number.POSITIVE_INFINITY;
-    let posInfo;
-    for (let i = 0; i < bezierPieces.length; i++) {
-        let bezierPiece = bezierPieces[i];
-        let ps = closestPointsOnCurve(bezierPiece.curve, point, bezierPiece.ts, touchedCurve, t);
-        let p = getObjClosestTo(point, ps, p => p.p);
-        if (p === undefined) {
-            continue;
-        }
-        let d = distanceBetween(p.p, point);
-        let curve = bezierPiece.curve;
-        let t_ = p.t;
-        if (d < bestDistance) {
-            if (t_ === 0) {
-                t_ = 1;
-                curve = bezierPiece.curve.prev;
-            }
-            posInfo = { pos: new PointOnShape(curve, t_), d };
-            bestDistance = d;
-        }
-    }
-    return posInfo;
-}
-export { getClosestBoundaryPoint };
+import { distanceBetween, getObjClosestTo } from 'flo-vector2d';
+import { PointOnShape } from '../../point-on-shape.js';
+import { cullBezierPieces } from './cull-bezier-pieces.js';
+import { closestPointsOnCurve } from './closest-points-on-curve.js';
+/**
+ * @hidden
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param point
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+function getClosestBoundaryPoint(bezierPieces, point, touchedCurve, t) {
+    bezierPieces = cullBezierPieces(bezierPieces, point);
+    let bestDistance = Number.POSITIVE_INFINITY;
+    let posInfo;
+    for (let i = 0; i < bezierPieces.length; i++) {
+        const bezierPiece = bezierPieces[i];
+        const ps = closestPointsOnCurve(bezierPiece.curve, point, bezierPiece.ts, touchedCurve, t);
+        const p = getObjClosestTo(point, ps, p => p.p);
+        if (p === undefined) {
+            continue;
+        }
+        const d = distanceBetween(p.p, point);
+        let curve = bezierPiece.curve;
+        let t_ = p.t;
+        if (d < bestDistance) {
+            if (t_ === 0) {
+                t_ = 1;
+                curve = bezierPiece.curve.prev;
+            }
+            posInfo = { pos: new PointOnShape(curve, t_), d };
+            bestDistance = d;
+        }
+    }
+    return posInfo;
+}
+export { getClosestBoundaryPoint };
 //# sourceMappingURL=get-closest-boundary-point.js.map

package/node/mat/closest-boundary-point/get-closest-boundary-point.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-closest-boundary-point.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/get-closest-boundary-point.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEhE,OAAO,EAAE,YAAY,EAAiB,MAAM,yBAAyB,CAAC;AAEtE,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAGpE;;;;;;;;;GASG;AACH,SAAS,uBAAuB,CACxB,YAA2B,EAC3B,KAAe,EACrB,YAAmB,EACnB,CAAS;IAEV,YAAY,GAAG,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAErD,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,IAAI,OAA0C,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,IAAI,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAElC,IAAI,EAAE,GAAG,oBAAoB,CAC3B,WAAW,CAAC,KAAK,EACjB,KAAK,EACL,WAAW,CAAC,EAAE,EACd,YAAY,EACZ,CAAC,CACF,CAAC;QAEF,IAAI,CAAC,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAE5C,IAAI,CAAC,KAAK,SAAS,EAAE;YAAE,SAAS;SAAE;QAElC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAEpC,IAAI,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;QAC9B,IAAI,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,CAAC,GAAG,YAAY,EAAE;YACrB,IAAI,EAAE,KAAK,CAAC,EAAE;gBACb,EAAE,GAAG,CAAC,CAAC;gBACP,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;aAC/B;YAED,OAAO,GAAG,EAAE,GAAG,EAAE,IAAI,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAClD,YAAY,GAAG,CAAC,CAAC;SACjB;KACD;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAC"}
+{"version":3,"file":"get-closest-boundary-point.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/get-closest-boundary-point.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEhE,OAAO,EAAE,YAAY,EAAiB,MAAM,yBAAyB,CAAC;AAEtE,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAGpE;;;;;;;;;GASG;AACH,SAAS,uBAAuB,CACxB,YAA2B,EAC3B,KAAe,EACrB,YAAmB,EACnB,CAAS;IAEV,YAAY,GAAG,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAErD,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,IAAI,OAA0C,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAEpC,MAAM,EAAE,GAAG,oBAAoB,CAC7B,WAAW,CAAC,KAAK,EACjB,KAAK,EACL,WAAW,CAAC,EAAE,EACd,YAAY,EACZ,CAAC,CACF,CAAC;QAEF,MAAM,CAAC,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAE9C,IAAI,CAAC,KAAK,SAAS,EAAE;YAAE,SAAS;SAAE;QAElC,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAEtC,IAAI,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;QAC9B,IAAI,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,CAAC,GAAG,YAAY,EAAE;YACrB,IAAI,EAAE,KAAK,CAAC,EAAE;gBACb,EAAE,GAAG,CAAC,CAAC;gBACP,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;aAC/B;YAED,OAAO,GAAG,EAAE,GAAG,EAAE,IAAI,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAClD,YAAY,GAAG,CAAC,CAAC;SACjB;KACD;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAC"}

package/node/mat/corner.d.ts

@@ -1,37 +1,37 @@
-/**
- * @hidden
- * Represents a corner on the shape boundary, i.e. a point where two bezier
- * curves meet. Typically used internally only.
- */
-interface Corner {
-    /**
-     * The unit tangents at the points t === 1 of the first curve and at
-     * t === 0 of the second respectively.
-     */
-    tangents: number[][];
-    /** The cross of the unit tangents. */
-    crossTangents: number;
-    /**
-     * True if the corner is sharp, i.e. > 0 radians as one goes in a positive
-     * direction around the shape boundary.
-     */
-    isSharp: boolean;
-    /**
-     * True if the corner is dull, i.e. < 0 radians as one goes in a positive
-     * direction around the shape boundary.
-     */
-    isDull: boolean;
-    /**
-     * True if the corner is quite sharp, i.e. > δ radians as one goes in a
-     * positive direction around the shape boundary where δ is some
-     * pre-determined parameter.
-     */
-    isQuiteSharp: boolean;
-    /**
-     * True if the corner is quite dull, i.e. < δ radians as one goes in a
-     * positive direction around the shape boundary where δ is some
-     * pre-determined parameter.
-     */
-    isQuiteDull: boolean;
-}
-export { Corner };
+/**
+ * @hidden
+ * Represents a corner on the shape boundary, i.e. a point where two bezier
+ * curves meet. Typically used internally only.
+ */
+interface Corner {
+    /**
+     * The unit tangents at the points t === 1 of the first curve and at
+     * t === 0 of the second respectively.
+     */
+    tangents: number[][];
+    /** The cross of the unit tangents. */
+    crossTangents: number;
+    /**
+     * True if the corner is sharp, i.e. > 0 radians as one goes in a positive
+     * direction around the shape boundary.
+     */
+    isSharp: boolean;
+    /**
+     * True if the corner is dull, i.e. < 0 radians as one goes in a positive
+     * direction around the shape boundary.
+     */
+    isDull: boolean;
+    /**
+     * True if the corner is quite sharp, i.e. > δ radians as one goes in a
+     * positive direction around the shape boundary where δ is some
+     * pre-determined parameter.
+     */
+    isQuiteSharp: boolean;
+    /**
+     * True if the corner is quite dull, i.e. < δ radians as one goes in a
+     * positive direction around the shape boundary where δ is some
+     * pre-determined parameter.
+     */
+    isQuiteDull: boolean;
+}
+export { Corner };

package/node/mat/corner.js

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

package/node/mat/create-new-cp-tree.d.ts

@@ -1,9 +1,9 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from '../cp-node.js';
-import { Loop } from '../loop.js';
-/**
- * @hidden
- * @param cpNode
- */
-declare function createNewCpTree(cpNode: CpNode): Map<Loop, LlRbTree<CpNode>>;
-export { createNewCpTree };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { CpNode } from '../cp-node.js';
+import { Loop } from '../loop.js';
+/**
+ * @hidden
+ * @param cpNode
+ */
+declare function createNewCpTree(cpNode: CpNode): Map<Loop, LlRbTree<CpNode>>;
+export { createNewCpTree };

package/node/mat/create-new-cp-tree.js

@@ -1,24 +1,24 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from '../cp-node.js';
-/**
- * @hidden
- * @param cpNode
- */
-function createNewCpTree(cpNode) {
-    let newCpTrees = new Map();
-    let cps = cpNode.getAllOnLoop();
-    cps.forEach(f);
-    function f(cpNode) {
-        let loop = cpNode.cp.pointOnShape.curve.loop;
-        let cpTree = newCpTrees.get(loop);
-        if (!cpTree) {
-            // qqq cpTree = new LlRbTree(CpNode.comparator, [], true); 
-            cpTree = new LlRbTree(CpNode.comparator, false);
-            newCpTrees.set(loop, cpTree);
-        }
-        cpTree.insert(cpNode);
-    }
-    return newCpTrees;
-}
-export { createNewCpTree };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { CpNode } from '../cp-node.js';
+/**
+ * @hidden
+ * @param cpNode
+ */
+function createNewCpTree(cpNode) {
+    const newCpTrees = new Map();
+    const cps = cpNode.getAllOnLoop();
+    cps.forEach(f);
+    function f(cpNode) {
+        const loop = cpNode.cp.pointOnShape.curve.loop;
+        let cpTree = newCpTrees.get(loop);
+        if (!cpTree) {
+            // qqq cpTree = new LlRbTree(CpNode.comparator, [], true); 
+            cpTree = new LlRbTree(CpNode.comparator, false);
+            newCpTrees.set(loop, cpTree);
+        }
+        cpTree.insert(cpNode);
+    }
+    return newCpTrees;
+}
+export { createNewCpTree };
 //# sourceMappingURL=create-new-cp-tree.js.map

package/node/mat/create-new-cp-tree.js.map

@@ -1 +1 @@
-{"version":3,"file":"create-new-cp-tree.js","sourceRoot":"","sources":["../../src/mat/create-new-cp-tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAIvC;;;GAGG;AACH,SAAS,eAAe,CAAC,MAAc;IACtC,IAAI,UAAU,GAA+B,IAAI,GAAG,EAAE,CAAC;IAEvD,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;IAEhC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAEf,SAAS,CAAC,CAAC,MAAc;QACxB,IAAI,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;QAC7C,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE;YACZ,2DAA2D;YAC3D,MAAM,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAChD,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;SAC7B;QACD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}
+{"version":3,"file":"create-new-cp-tree.js","sourceRoot":"","sources":["../../src/mat/create-new-cp-tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAIvC;;;GAGG;AACH,SAAS,eAAe,CAAC,MAAc;IACtC,MAAM,UAAU,GAA+B,IAAI,GAAG,EAAE,CAAC;IAEzD,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;IAElC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAEf,SAAS,CAAC,CAAC,MAAc;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;QAC/C,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE;YACZ,2DAA2D;YAC3D,MAAM,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAChD,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;SAC7B;QACD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/mat/elem-type-two-prong.d.ts

@@ -1,3 +1,3 @@
-/** @hidden */
-declare type ElemType_TwoProng = 'twoProng_regular' | 'twoProng_holeClosing';
-export { ElemType_TwoProng };
+/** @hidden */
+type ElemType_TwoProng = 'twoProng_regular' | 'twoProng_holeClosing';
+export { ElemType_TwoProng };

package/node/mat/elem-type-two-prong.js

@@ -1,2 +1,2 @@
-export {};
+export {};
 //# sourceMappingURL=elem-type-two-prong.js.map

package/node/mat/find-mat/add-1-prong.d.ts

@@ -1,12 +1,12 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { Loop } from '../../loop.js';
-import { IPointOnShape } from '../../point-on-shape.js';
-import { CpNode } from '../../cp-node.js';
-/**
- * @hidden
- * Add a 1-prong to the MAT.
- * @param cpGraphs
- * @param pos
- */
-declare function add1Prong(maxOsculatingCircleRadius: number, cpGraphs: Map<Loop, LlRbTree<CpNode>>, pos: IPointOnShape): void;
-export { add1Prong };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { Loop } from '../../loop.js';
+import { IPointOnShape } from '../../point-on-shape.js';
+import { CpNode } from '../../cp-node.js';
+/**
+ * @hidden
+ * Add a 1-prong to the MAT.
+ * @param cpGraphs
+ * @param pos
+ */
+declare function add1Prong(maxOsculatingCircleRadius: number, cpGraphs: Map<Loop, LlRbTree<CpNode>>, pos: IPointOnShape): void;
+export { add1Prong };

package/node/mat/find-mat/add-1-prong.js

@@ -1,43 +1,43 @@
-import { getOsculatingCircle, calcPosOrder, isPosDullCorner } from '../../point-on-shape.js';
-import { addToCpGraph } from '../add-to-cp-graph.js';
-import { isAnotherCpCloseby } from '../is-another-cp-closeby.js';
-/**
- * @hidden
- * Add a 1-prong to the MAT.
- * @param cpGraphs
- * @param pos
- */
-function add1Prong(maxOsculatingCircleRadius, cpGraphs, pos) {
-    //if (PointOnShape.isDullCorner(pos)) {
-    if (isPosDullCorner(pos)) {
-        // This is a 1-prong at a dull corner.
-        // TODO IMPORTANT 
-        // Remove this line, uncomment piece below it and implement the 
-        // following strategy to find the 3-prongs: if deltas are conjoined due 
-        // to dull corner, split the conjoinment by inserting successively 
-        // closer (binary division) 2-prongs. If a 2-prong actually fails, 
-        // simply remove the 1-prong at the dull corner. In this way **all** 
-        // terminal points are found, e.g. zoom in on top left leg of ant.
-        // Afterthought: there is a better way - split points by two prongs.
-        //toRemove.push(posNode); // this!
-        if (typeof _debug_ !== 'undefined') {
-            _debug_.generated.elems.oneProngAtDullCorner.push(pos);
-        }
-        return;
-    }
-    //let circle = PointOnShape.getOsculatingCircle(maxOsculatingCircleRadius, pos);
-    let circle = getOsculatingCircle(maxOsculatingCircleRadius, pos);
-    //let order = PointOnShape.calcOrder(circle, pos);
-    let order = calcPosOrder(circle, pos);
-    // Make sure there isn't already a ContactPoint close by - it can cause
-    // floating point stability issues.
-    if (isAnotherCpCloseby(cpGraphs, pos, circle, order, 0, 1000, 'magenta')) {
-        return;
-    }
-    addToCpGraph(circle, [-0.5, +0.5], cpGraphs, [pos, pos]);
-    if (typeof _debug_ !== 'undefined') {
-        _debug_.generated.elems.oneProng.push(pos);
-    }
-}
-export { add1Prong };
+import { getOsculatingCircle, calcPosOrder, isPosDullCorner } from '../../point-on-shape.js';
+import { addToCpGraph } from '../add-to-cp-graph.js';
+import { isAnotherCpCloseby } from '../is-another-cp-closeby.js';
+/**
+ * @hidden
+ * Add a 1-prong to the MAT.
+ * @param cpGraphs
+ * @param pos
+ */
+function add1Prong(maxOsculatingCircleRadius, cpGraphs, pos) {
+    //if (PointOnShape.isDullCorner(pos)) {
+    if (isPosDullCorner(pos)) {
+        // This is a 1-prong at a dull corner.
+        // TODO IMPORTANT 
+        // Remove this line, uncomment piece below it and implement the 
+        // following strategy to find the 3-prongs: if deltas are conjoined due 
+        // to dull corner, split the conjoinment by inserting successively 
+        // closer (binary division) 2-prongs. If a 2-prong actually fails, 
+        // simply remove the 1-prong at the dull corner. In this way **all** 
+        // terminal points are found, e.g. zoom in on top left leg of ant.
+        // Afterthought: there is a better way - split points by two prongs.
+        //toRemove.push(posNode); // this!
+        if (typeof _debug_ !== 'undefined') {
+            _debug_.generated.elems.oneProngAtDullCorner.push(pos);
+        }
+        return;
+    }
+    //let circle = PointOnShape.getOsculatingCircle(maxOsculatingCircleRadius, pos);
+    const circle = getOsculatingCircle(maxOsculatingCircleRadius, pos);
+    //const order = PointOnShape.calcOrder(circle, pos);
+    const order = calcPosOrder(circle, pos);
+    // Make sure there isn't already a ContactPoint close by - it can cause
+    // floating point stability issues.
+    if (isAnotherCpCloseby(cpGraphs, pos, circle, order, 0, 1000, 'magenta')) {
+        return;
+    }
+    addToCpGraph(circle, [-0.5, +0.5], cpGraphs, [pos, pos]);
+    if (typeof _debug_ !== 'undefined') {
+        _debug_.generated.elems.oneProng.push(pos);
+    }
+}
+export { add1Prong };
 //# sourceMappingURL=add-1-prong.js.map

package/node/mat/find-mat/add-1-prong.js.map

@@ -1 +1 @@
-{"version":3,"file":"add-1-prong.js","sourceRoot":"","sources":["../../../src/mat/find-mat/add-1-prong.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAE,eAAe,EAAiB,MAAM,yBAAyB,CAAC;AAE5G,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAGjE;;;;;GAKG;AACH,SAAS,SAAS,CAChB,yBAAiC,EAC3B,QAAoC,EACpC,GAAkB;IAEzB,uCAAuC;IACpC,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE;QAC5B,sCAAsC;QAEtC,kBAAkB;QAClB,gEAAgE;QAChE,wEAAwE;QACxE,mEAAmE;QACnE,mEAAmE;QACnE,qEAAqE;QAC/D,kEAAkE;QAClE,oEAAoE;QAE1E,kCAAkC;QAElC,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;YAC1B,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAC1D;QAEP,OAAO;KACP;IAED,gFAAgF;IAChF,IAAI,MAAM,GAAG,mBAAmB,CAAC,yBAAyB,EAAE,GAAG,CAAC,CAAC;IAEjE,kDAAkD;IAClD,IAAI,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACtC,uEAAuE;IACvE,mCAAmC;IACnC,IAAI,kBAAkB,CAAC,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE;QACzE,OAAO;KACP;IAEE,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAE5D,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAC7B,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAC9C;AACL,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}
+{"version":3,"file":"add-1-prong.js","sourceRoot":"","sources":["../../../src/mat/find-mat/add-1-prong.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAE,eAAe,EAAiB,MAAM,yBAAyB,CAAC;AAE5G,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAGjE;;;;;GAKG;AACH,SAAS,SAAS,CAChB,yBAAiC,EAC3B,QAAoC,EACpC,GAAkB;IAEzB,uCAAuC;IACpC,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE;QAC5B,sCAAsC;QAEtC,kBAAkB;QAClB,gEAAgE;QAChE,wEAAwE;QACxE,mEAAmE;QACnE,mEAAmE;QACnE,qEAAqE;QAC/D,kEAAkE;QAClE,oEAAoE;QAE1E,kCAAkC;QAElC,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;YAC1B,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAC1D;QAEP,OAAO;KACP;IAED,gFAAgF;IAChF,MAAM,MAAM,GAAG,mBAAmB,CAAC,yBAAyB,EAAE,GAAG,CAAC,CAAC;IAEnE,oDAAoD;IACpD,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACxC,uEAAuE;IACvE,mCAAmC;IACnC,IAAI,kBAAkB,CAAC,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE;QACzE,OAAO;KACP;IAEE,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAE5D,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAC7B,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAC9C;AACL,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}