flo-mat 2.0.1 → 2.0.3

package/node/mat/find-mat/find-and-add-hole-closing-2-prongs.d.ts

@@ -1,14 +1,14 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { Loop } from '../../loop.js';
-import { CpNode } from '../../cp-node.js';
-/**
- * @hidden
- * Find and add two-prongs that remove any holes in the shape.
- * @param loops The loops (that as a precondition must be ordered from
- * highest (i.e. smallest y-value) topmost point loops to lowest)
- * @param cpTrees
- * @param extreme The maximum coordinate value used to calculate floating point
- * tolerances.
- */
-declare function findAndAddHoleClosing2Prongs(loops: Loop[], cpTrees: Map<Loop, LlRbTree<CpNode>>, extreme: number): void;
-export { findAndAddHoleClosing2Prongs };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { Loop } from '../../loop.js';
+import { CpNode } from '../../cp-node.js';
+/**
+ * @hidden
+ * Find and add two-prongs that remove any holes in the shape.
+ * @param loops The loops (that as a precondition must be ordered from
+ * highest (i.e. smallest y-value) topmost point loops to lowest)
+ * @param cpTrees
+ * @param extreme The maximum coordinate value used to calculate floating point
+ * tolerances.
+ */
+declare function findAndAddHoleClosing2Prongs(loops: Loop[], cpTrees: Map<Loop, LlRbTree<CpNode>>, extreme: number): void;
+export { findAndAddHoleClosing2Prongs };

package/node/mat/find-mat/find-and-add-hole-closing-2-prongs.js

@@ -1,34 +1,34 @@
-import { getShapeBounds } from '../../svg/get-shape-bounds.js';
-import { getMinYPos } from '../../svg/get-min-y-pos.js';
-import { find2Prong } from './find-2-prong/find-2-prong.js';
-import { add2Prong } from './add-2-prong.js';
-/**
- * @hidden
- * Find and add two-prongs that remove any holes in the shape.
- * @param loops The loops (that as a precondition must be ordered from
- * highest (i.e. smallest y-value) topmost point loops to lowest)
- * @param cpTrees
- * @param extreme The maximum coordinate value used to calculate floating point
- * tolerances.
- */
-function findAndAddHoleClosing2Prongs(loops, cpTrees, extreme) {
-    let bounds = getShapeBounds(loops);
-    let squaredDiagonalLength = (bounds.maxX.p[0] - bounds.minX.p[0]) ** 2 +
-        (bounds.maxY.p[1] - bounds.minY.p[1]) ** 2;
-    // Find the topmost points on each loop.
-    let minYs = loops.map(getMinYPos);
-    // We start at 1 since 0 is the outer (root) loop
-    for (let k = 1; k < minYs.length; k++) {
-        let posSource = minYs[k];
-        let holeClosingTwoProng = find2Prong(loops, extreme, squaredDiagonalLength, cpTrees, posSource, true, k);
-        if (!holeClosingTwoProng) {
-            throw new Error(`Unable to find hole-closing 2-prong`);
-        }
-        // TODO important - handle case of n-prong, i.e. more than one antipode
-        // - currently we only handle case of single antipode (the general case)
-        let { circle, zs: posAntipodes } = holeClosingTwoProng;
-        add2Prong(cpTrees, circle, posSource, [posAntipodes[0]], true, extreme);
-    }
-}
-export { findAndAddHoleClosing2Prongs };
+import { getShapeBounds } from '../../svg/get-shape-bounds.js';
+import { getMinYPos } from '../../svg/get-min-y-pos.js';
+import { find2Prong } from './find-2-prong/find-2-prong.js';
+import { add2Prong } from './add-2-prong.js';
+/**
+ * @hidden
+ * Find and add two-prongs that remove any holes in the shape.
+ * @param loops The loops (that as a precondition must be ordered from
+ * highest (i.e. smallest y-value) topmost point loops to lowest)
+ * @param cpTrees
+ * @param extreme The maximum coordinate value used to calculate floating point
+ * tolerances.
+ */
+function findAndAddHoleClosing2Prongs(loops, cpTrees, extreme) {
+    const bounds = getShapeBounds(loops);
+    const squaredDiagonalLength = (bounds.maxX.p[0] - bounds.minX.p[0]) ** 2 +
+        (bounds.maxY.p[1] - bounds.minY.p[1]) ** 2;
+    // Find the topmost points on each loop.
+    const minYs = loops.map(getMinYPos);
+    // We start at 1 since 0 is the outer (root) loop
+    for (let k = 1; k < minYs.length; k++) {
+        const posSource = minYs[k];
+        const holeClosingTwoProng = find2Prong(loops, extreme, squaredDiagonalLength, cpTrees, posSource, true, k);
+        if (!holeClosingTwoProng) {
+            throw new Error(`Unable to find hole-closing 2-prong`);
+        }
+        // TODO important - handle case of n-prong, i.e. more than one antipode
+        // - currently we only handle case of single antipode (the general case)
+        const { circle, zs: posAntipodes } = holeClosingTwoProng;
+        add2Prong(cpTrees, circle, posSource, [posAntipodes[0]], true, extreme);
+    }
+}
+export { findAndAddHoleClosing2Prongs };
 //# sourceMappingURL=find-and-add-hole-closing-2-prongs.js.map

package/node/mat/find-mat/find-and-add-hole-closing-2-prongs.js.map

@@ -1 +1 @@
-{"version":3,"file":"find-and-add-hole-closing-2-prongs.js","sourceRoot":"","sources":["../../../src/mat/find-mat/find-and-add-hole-closing-2-prongs.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAG7C;;;;;;;;GAQG;AACH,SAAS,4BAA4B,CAC7B,KAAa,EACb,OAAmC,EACnC,OAAe;IAEnB,IAAI,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,qBAAqB,GACrB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC;QACxC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC,CAAC;IAE7C,wCAAwC;IACxC,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAElC,iDAAiD;IACjD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEzB,IAAI,mBAAmB,GAAG,UAAU,CAChC,KAAK,EAAE,OAAO,EAAE,qBAAqB,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CACrE,CAAC;QAEF,IAAI,CAAC,mBAAmB,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;SAC1D;QAED,uEAAuE;QACvE,wEAAwE;QACxE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,GAAG,mBAAmB,CAAC;QAEvD,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;KAC3E;AACL,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}
+{"version":3,"file":"find-and-add-hole-closing-2-prongs.js","sourceRoot":"","sources":["../../../src/mat/find-mat/find-and-add-hole-closing-2-prongs.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAG7C;;;;;;;;GAQG;AACH,SAAS,4BAA4B,CAC7B,KAAa,EACb,OAAmC,EACnC,OAAe;IAEnB,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,qBAAqB,GACvB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC;QACxC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC,CAAC;IAE7C,wCAAwC;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAEpC,iDAAiD;IACjD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAE3B,MAAM,mBAAmB,GAAG,UAAU,CAClC,KAAK,EAAE,OAAO,EAAE,qBAAqB,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CACrE,CAAC;QAEF,IAAI,CAAC,mBAAmB,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;SAC1D;QAED,uEAAuE;QACvE,wEAAwE;QACxE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,GAAG,mBAAmB,CAAC;QAEzD,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;KAC3E;AACL,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}

package/node/mat/find-mat/get-potential-2-prongs.d.ts

@@ -1,4 +1,4 @@
-import { IPointOnShape } from '../../point-on-shape.js';
-/** @hidden */
-declare function getPotential2Prongs(possPerLoop: IPointOnShape[][]): IPointOnShape[][];
-export { getPotential2Prongs };
+import { IPointOnShape } from '../../point-on-shape.js';
+/** @hidden */
+declare function getPotential2Prongs(possPerLoop: IPointOnShape[][]): IPointOnShape[][];
+export { getPotential2Prongs };

package/node/mat/find-mat/get-potential-2-prongs.js

@@ -1,17 +1,17 @@
-import { isPosQuiteSharpCorner } from '../../point-on-shape.js';
-/** @hidden */
-function getPotential2Prongs(possPerLoop) {
-    let for2ProngsArray = [];
-    for (let poss of possPerLoop) {
-        let for2Prongs = [];
-        for (let pos of poss) {
-            if (!isPosQuiteSharpCorner(pos)) {
-                for2Prongs.push(pos);
-            }
-        }
-        for2ProngsArray.push(for2Prongs);
-    }
-    return for2ProngsArray;
-}
-export { getPotential2Prongs };
+import { isPosQuiteSharpCorner } from '../../point-on-shape.js';
+/** @hidden */
+function getPotential2Prongs(possPerLoop) {
+    const for2ProngsArray = [];
+    for (const poss of possPerLoop) {
+        const for2Prongs = [];
+        for (const pos of poss) {
+            if (!isPosQuiteSharpCorner(pos)) {
+                for2Prongs.push(pos);
+            }
+        }
+        for2ProngsArray.push(for2Prongs);
+    }
+    return for2ProngsArray;
+}
+export { getPotential2Prongs };
 //# sourceMappingURL=get-potential-2-prongs.js.map

package/node/mat/find-mat/get-potential-2-prongs.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-potential-2-prongs.js","sourceRoot":"","sources":["../../../src/mat/find-mat/get-potential-2-prongs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiB,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAG/E,cAAc;AACd,SAAS,mBAAmB,CAAC,WAA8B;IACvD,IAAI,eAAe,GAAG,EAAE,CAAC;IAEzB,KAAK,IAAI,IAAI,IAAI,WAAW,EAAE;QAC1B,IAAI,UAAU,GAAG,EAAE,CAAC;QAEpB,KAAK,IAAI,GAAG,IAAI,IAAI,EAAE;YAClB,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,EAAE;gBAC7B,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACxB;SACJ;QAED,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;KACpC;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}
+{"version":3,"file":"get-potential-2-prongs.js","sourceRoot":"","sources":["../../../src/mat/find-mat/get-potential-2-prongs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiB,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAG/E,cAAc;AACd,SAAS,mBAAmB,CAAC,WAA8B;IACvD,MAAM,eAAe,GAAG,EAAE,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE;QAC5B,MAAM,UAAU,GAAG,EAAE,CAAC;QAEtB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;YACpB,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,EAAE;gBAC7B,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACxB;SACJ;QAED,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;KACpC;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}

package/node/mat/find-mat/get-sharp-corners.d.ts

@@ -1,4 +1,4 @@
-import { IPointOnShape } from '../../point-on-shape.js';
-/** @hidden */
-declare function getSharpCorners(possPerLoop: IPointOnShape[][]): IPointOnShape[][];
-export { getSharpCorners };
+import { IPointOnShape } from '../../point-on-shape.js';
+/** @hidden */
+declare function getSharpCorners(possPerLoop: IPointOnShape[][]): IPointOnShape[][];
+export { getSharpCorners };

package/node/mat/find-mat/get-sharp-corners.js

@@ -1,18 +1,18 @@
-import { isPosQuiteSharpCorner } from '../../point-on-shape.js';
-/** @hidden */
-function getSharpCorners(possPerLoop) {
-    let sharpCornersPerLoop = [];
-    for (let poss of possPerLoop) {
-        let sharpCorners = [];
-        for (let pos of poss) {
-            //if (PointOnShape.isQuiteSharpCorner(pos)) {
-            if (isPosQuiteSharpCorner(pos)) {
-                sharpCorners.push(pos);
-            }
-        }
-        sharpCornersPerLoop.push(sharpCorners);
-    }
-    return sharpCornersPerLoop;
-}
-export { getSharpCorners };
+import { isPosQuiteSharpCorner } from '../../point-on-shape.js';
+/** @hidden */
+function getSharpCorners(possPerLoop) {
+    const sharpCornersPerLoop = [];
+    for (const poss of possPerLoop) {
+        const sharpCorners = [];
+        for (const pos of poss) {
+            //if (PointOnShape.isQuiteSharpCorner(pos)) {
+            if (isPosQuiteSharpCorner(pos)) {
+                sharpCorners.push(pos);
+            }
+        }
+        sharpCornersPerLoop.push(sharpCorners);
+    }
+    return sharpCornersPerLoop;
+}
+export { getSharpCorners };
 //# sourceMappingURL=get-sharp-corners.js.map

package/node/mat/find-mat/get-sharp-corners.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-sharp-corners.js","sourceRoot":"","sources":["../../../src/mat/find-mat/get-sharp-corners.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiB,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAG/E,cAAc;AACd,SAAS,eAAe,CAAC,WAA8B;IACnD,IAAI,mBAAmB,GAAG,EAAE,CAAC;IAE7B,KAAK,IAAI,IAAI,IAAI,WAAW,EAAE;QAC1B,IAAI,YAAY,GAAG,EAAE,CAAC;QAEtB,KAAK,IAAI,GAAG,IAAI,IAAI,EAAE;YAClB,6CAA6C;YAC7C,IAAI,qBAAqB,CAAC,GAAG,CAAC,EAAE;gBAC5B,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aAC1B;SACJ;QAED,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;KAC1C;IAED,OAAO,mBAAmB,CAAC;AAC/B,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}
+{"version":3,"file":"get-sharp-corners.js","sourceRoot":"","sources":["../../../src/mat/find-mat/get-sharp-corners.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiB,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAG/E,cAAc;AACd,SAAS,eAAe,CAAC,WAA8B;IACnD,MAAM,mBAAmB,GAAG,EAAE,CAAC;IAE/B,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE;QAC5B,MAAM,YAAY,GAAG,EAAE,CAAC;QAExB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;YACpB,6CAA6C;YAC7C,IAAI,qBAAqB,CAAC,GAAG,CAAC,EAAE;gBAC5B,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aAC1B;SACJ;QAED,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;KAC1C;IAED,OAAO,mBAAmB,CAAC;AAC/B,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/mat/geometry/get-closest-square-distance-to-rect.d.ts

@@ -1,5 +1,5 @@
-/**
- * @hidden
- */
-declare function getClosestSquareDistanceToRect(box: number[][], p: number[]): number;
-export { getClosestSquareDistanceToRect };
+/**
+ * @hidden
+ */
+declare function getClosestSquareDistanceToRect(box: number[][], p: number[]): number;
+export { getClosestSquareDistanceToRect };

package/node/mat/geometry/get-closest-square-distance-to-rect.js

@@ -1,50 +1,50 @@
-import { squaredDistanceBetween as squaredDistanceBetween_ } from 'flo-vector2d';
-const squaredDistanceBetween = squaredDistanceBetween_;
-/**
- * @hidden
- */
-function getClosestSquareDistanceToRect(box, p) {
-    const p0 = box[0];
-    const p1 = box[1];
-    const x0 = p0[0];
-    const y0 = p0[1];
-    const x1 = p1[0];
-    const y1 = p1[1];
-    const xp = p[0];
-    const yp = p[1];
-    //let [[x0,y0],[x1,y1]] = box;
-    //let [xp,yp] = p;
-    if (xp < x0) {
-        if (yp < y0) {
-            return squaredDistanceBetween(box[0], p);
-        }
-        else if (yp > y1) {
-            return squaredDistanceBetween([x0, y1], p);
-        }
-        else {
-            return (x0 - xp) ** 2;
-        }
-    }
-    else if (xp > x1) {
-        if (yp < y0) {
-            return squaredDistanceBetween([x1, y0], p);
-        }
-        else if (yp > y1) {
-            return squaredDistanceBetween(box[1], p);
-        }
-        else {
-            return (xp - x1) ** 2;
-        }
-    }
-    else {
-        if (yp < y0) {
-            return (y0 - yp) ** 2;
-        }
-        else if (yp > y1) {
-            return (yp - y1) ** 2;
-        }
-        return 0;
-    }
-}
-export { getClosestSquareDistanceToRect };
+import { squaredDistanceBetween as squaredDistanceBetween_ } from 'flo-vector2d';
+const squaredDistanceBetween = squaredDistanceBetween_;
+/**
+ * @hidden
+ */
+function getClosestSquareDistanceToRect(box, p) {
+    const p0 = box[0];
+    const p1 = box[1];
+    const x0 = p0[0];
+    const y0 = p0[1];
+    const x1 = p1[0];
+    const y1 = p1[1];
+    const xp = p[0];
+    const yp = p[1];
+    //let [[x0,y0],[x1,y1]] = box;
+    //let [xp,yp] = p;
+    if (xp < x0) {
+        if (yp < y0) {
+            return squaredDistanceBetween(box[0], p);
+        }
+        else if (yp > y1) {
+            return squaredDistanceBetween([x0, y1], p);
+        }
+        else {
+            return (x0 - xp) ** 2;
+        }
+    }
+    else if (xp > x1) {
+        if (yp < y0) {
+            return squaredDistanceBetween([x1, y0], p);
+        }
+        else if (yp > y1) {
+            return squaredDistanceBetween(box[1], p);
+        }
+        else {
+            return (xp - x1) ** 2;
+        }
+    }
+    else {
+        if (yp < y0) {
+            return (y0 - yp) ** 2;
+        }
+        else if (yp > y1) {
+            return (yp - y1) ** 2;
+        }
+        return 0;
+    }
+}
+export { getClosestSquareDistanceToRect };
 //# sourceMappingURL=get-closest-square-distance-to-rect.js.map

package/node/mat/geometry/get-closest-squared-distance-to-rotated-rect.d.ts

@@ -1,5 +1,5 @@
-/**
- * @hidden
- */
-declare function getClosestSquaredDistanceToRotatedRect(ps: number[][], p: number[]): number;
-export { getClosestSquaredDistanceToRotatedRect };
+/**
+ * @hidden
+ */
+declare function getClosestSquaredDistanceToRotatedRect(ps: number[][], p: number[]): number;
+export { getClosestSquaredDistanceToRotatedRect };

package/node/mat/geometry/get-closest-squared-distance-to-rotated-rect.js

@@ -1,16 +1,16 @@
-import { squaredDistanceBetweenPointAndLineSegment, squaredDistanceBetween } from 'flo-vector2d';
-/**
- * @hidden
- */
-function getClosestSquaredDistanceToRotatedRect(ps, p) {
-    let ds = [0, 1, 2, 3].map(i => squaredDistanceBetweenPointAndLineSegment(p, [ps[i], ps[(i + 1) % 4]]));
-    let width = squaredDistanceBetween(ps[0], ps[1]);
-    let height = squaredDistanceBetween(ps[0], ps[3]);
-    if (ds[0] <= height && ds[2] <= height &&
-        ds[1] <= width && ds[3] <= width) {
-        return 0; // Inside rotated rect
-    }
-    return Math.min(...ds);
-}
-export { getClosestSquaredDistanceToRotatedRect };
+import { squaredDistanceBetweenPointAndLineSegment, squaredDistanceBetween } from 'flo-vector2d';
+/**
+ * @hidden
+ */
+function getClosestSquaredDistanceToRotatedRect(ps, p) {
+    const ds = [0, 1, 2, 3].map(i => squaredDistanceBetweenPointAndLineSegment(p, [ps[i], ps[(i + 1) % 4]]));
+    const width = squaredDistanceBetween(ps[0], ps[1]);
+    const height = squaredDistanceBetween(ps[0], ps[3]);
+    if (ds[0] <= height && ds[2] <= height &&
+        ds[1] <= width && ds[3] <= width) {
+        return 0; // Inside rotated rect
+    }
+    return Math.min(...ds);
+}
+export { getClosestSquaredDistanceToRotatedRect };
 //# sourceMappingURL=get-closest-squared-distance-to-rotated-rect.js.map

package/node/mat/geometry/get-closest-squared-distance-to-rotated-rect.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-closest-squared-distance-to-rotated-rect.js","sourceRoot":"","sources":["../../../src/mat/geometry/get-closest-squared-distance-to-rotated-rect.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,yCAAyC,EAAE,sBAAsB,EACjE,MAAM,cAAc,CAAC;AAGtB;;GAEG;AACH,SAAS,sCAAsC,CAAC,EAAc,EAAE,CAAW;IAC1E,IAAI,EAAE,GAAG,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,yCAAyC,CACnE,CAAC,EACD,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CACtB,CACD,CAAC;IAEF,IAAI,KAAK,GAAI,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,IAAI,MAAM,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAElD,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM;QACrC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAK,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE;QAEnC,OAAO,CAAC,CAAC,CAAC,sBAAsB;KAChC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,sCAAsC,EAAE,CAAA"}
+{"version":3,"file":"get-closest-squared-distance-to-rotated-rect.js","sourceRoot":"","sources":["../../../src/mat/geometry/get-closest-squared-distance-to-rotated-rect.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,yCAAyC,EAAE,sBAAsB,EACjE,MAAM,cAAc,CAAC;AAGtB;;GAEG;AACH,SAAS,sCAAsC,CAAC,EAAc,EAAE,CAAW;IAC1E,MAAM,EAAE,GAAG,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,yCAAyC,CACrE,CAAC,EACD,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CACtB,CACD,CAAC;IAEF,MAAM,KAAK,GAAI,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM;QACrC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAK,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE;QAEnC,OAAO,CAAC,CAAC,CAAC,sBAAsB;KAChC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,sCAAsC,EAAE,CAAA"}

package/node/mat/get-boundary-piece-beziers.d.ts

@@ -1,11 +1,11 @@
-import { CpNode } from '../cp-node.js';
-import { BezierPiece } from './bezier-piece.js';
-/**
- * @hidden
- * Returns the ordered cubic bezier pieces (i.e a bezier with a t range)
- * from the given boundary piece.
- * @param cpNodes - An ordered pair that represents the start and end points of
- * the boundary piece
- */
-declare function getBoundaryPieceBeziers(cpNodes: CpNode[]): BezierPiece[];
-export { getBoundaryPieceBeziers };
+import { CpNode } from '../cp-node.js';
+import { BezierPiece } from './bezier-piece.js';
+/**
+ * @hidden
+ * Returns the ordered cubic bezier pieces (i.e a bezier with a t range)
+ * from the given boundary piece.
+ * @param cpNodes - An ordered pair that represents the start and end points of
+ * the boundary piece
+ */
+declare function getBoundaryPieceBeziers(cpNodes: CpNode[]): BezierPiece[];
+export { getBoundaryPieceBeziers };

package/node/mat/get-boundary-piece-beziers.js

@@ -1,59 +1,59 @@
-import { isPosQuiteSharpCorner } from '../point-on-shape.js';
-import { compareCps } from '../contact-point.js';
-/**
- * @hidden
- * Returns the ordered cubic bezier pieces (i.e a bezier with a t range)
- * from the given boundary piece.
- * @param cpNodes - An ordered pair that represents the start and end points of
- * the boundary piece
- */
-function getBoundaryPieceBeziers(cpNodes) {
-    let cpThis = cpNodes[0];
-    let cpEnd = cpNodes[1];
-    let bezierPieces = [];
-    // As opposed to going around the circle and taking the last exit
-    let goStraight = true;
-    do {
-        if (!goStraight) {
-            goStraight = true;
-            cpThis = cpThis.prevOnCircle; // take last exit
-            continue;
-        }
-        goStraight = false;
-        let posThis = cpThis.cp.pointOnShape;
-        let posNext = cpThis.next.cp.pointOnShape;
-        if (posNext.curve === posThis.curve &&
-            //PointOnShape.isQuiteSharpCorner(posThis) && 
-            //PointOnShape.isQuiteSharpCorner(posNext)) {
-            isPosQuiteSharpCorner(posThis) &&
-            isPosQuiteSharpCorner(posNext)) {
-            // Do nothing
-        }
-        else if (posNext.curve === posThis.curve &&
-            compareCps(cpThis.next.cp, cpThis.cp) > 0) {
-            bezierPieces.push({ curve: posThis.curve, ts: [posThis.t, posNext.t] });
-        }
-        else {
-            bezierPieces.push({ curve: posThis.curve, ts: [posThis.t, 1] });
-            if (cpThis.cp.pointOnShape.curve.loop === cpThis.next.cp.pointOnShape.curve.loop) {
-                addSkippedBeziers(bezierPieces, posThis.curve, posNext.curve, posNext.t);
-            }
-        }
-        cpThis = cpThis.next;
-    } while (cpThis !== cpEnd);
-    return bezierPieces;
-}
-/**
- * @hidden
- * Adds pieces of skipped beziers
- */
-function addSkippedBeziers(bezierPieces, curveStart, curveEnd, t1) {
-    let curveThis = curveStart;
-    do {
-        curveThis = curveThis.next;
-        let tEnd = curveThis === curveEnd ? t1 : 1;
-        bezierPieces.push({ curve: curveThis, ts: [0, tEnd] });
-    } while (curveThis !== curveEnd);
-}
-export { getBoundaryPieceBeziers };
+import { isPosQuiteSharpCorner } from '../point-on-shape.js';
+import { compareCps } from '../contact-point.js';
+/**
+ * @hidden
+ * Returns the ordered cubic bezier pieces (i.e a bezier with a t range)
+ * from the given boundary piece.
+ * @param cpNodes - An ordered pair that represents the start and end points of
+ * the boundary piece
+ */
+function getBoundaryPieceBeziers(cpNodes) {
+    let cpThis = cpNodes[0];
+    const cpEnd = cpNodes[1];
+    const bezierPieces = [];
+    // As opposed to going around the circle and taking the last exit
+    let goStraight = true;
+    do {
+        if (!goStraight) {
+            goStraight = true;
+            cpThis = cpThis.prevOnCircle; // take last exit
+            continue;
+        }
+        goStraight = false;
+        const posThis = cpThis.cp.pointOnShape;
+        const posNext = cpThis.next.cp.pointOnShape;
+        if (posNext.curve === posThis.curve &&
+            //PointOnShape.isQuiteSharpCorner(posThis) && 
+            //PointOnShape.isQuiteSharpCorner(posNext)) {
+            isPosQuiteSharpCorner(posThis) &&
+            isPosQuiteSharpCorner(posNext)) {
+            // Do nothing
+        }
+        else if (posNext.curve === posThis.curve &&
+            compareCps(cpThis.next.cp, cpThis.cp) > 0) {
+            bezierPieces.push({ curve: posThis.curve, ts: [posThis.t, posNext.t] });
+        }
+        else {
+            bezierPieces.push({ curve: posThis.curve, ts: [posThis.t, 1] });
+            if (cpThis.cp.pointOnShape.curve.loop === cpThis.next.cp.pointOnShape.curve.loop) {
+                addSkippedBeziers(bezierPieces, posThis.curve, posNext.curve, posNext.t);
+            }
+        }
+        cpThis = cpThis.next;
+    } while (cpThis !== cpEnd);
+    return bezierPieces;
+}
+/**
+ * @hidden
+ * Adds pieces of skipped beziers
+ */
+function addSkippedBeziers(bezierPieces, curveStart, curveEnd, t1) {
+    let curveThis = curveStart;
+    do {
+        curveThis = curveThis.next;
+        const tEnd = curveThis === curveEnd ? t1 : 1;
+        bezierPieces.push({ curve: curveThis, ts: [0, tEnd] });
+    } while (curveThis !== curveEnd);
+}
+export { getBoundaryPieceBeziers };
 //# sourceMappingURL=get-boundary-piece-beziers.js.map

package/node/mat/get-boundary-piece-beziers.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-boundary-piece-beziers.js","sourceRoot":"","sources":["../../src/mat/get-boundary-piece-beziers.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAGjD;;;;;;GAMG;AACH,SAAS,uBAAuB,CAAC,OAAiB;IAC9C,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,KAAK,GAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAExB,IAAI,YAAY,GAAG,EAAE,CAAC;IAEtB,iEAAiE;IACjE,IAAI,UAAU,GAAG,IAAI,CAAC;IACtB,GAAG;QACC,IAAI,CAAC,UAAU,EAAE;YACb,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,iBAAiB;YAC/C,SAAS;SACZ;QAED,UAAU,GAAG,KAAK,CAAC;QAEnB,IAAI,OAAO,GAAG,MAAM,CAAM,EAAE,CAAC,YAAY,CAAC;QAC1C,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC;QAE1C,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK;YAC/B,8CAA8C;YAC9C,6CAA6C;YAC7C,qBAAqB,CAAC,OAAO,CAAC;YAC9B,qBAAqB,CAAC,OAAO,CAAC,EAAE;YAEhC,aAAa;SAChB;aAAM,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK;YAC/B,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;YAElD,YAAY,CAAC,IAAI,CACb,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CACvD,CAAC;SACL;aAAM;YACH,YAAY,CAAC,IAAI,CACb,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAC/C,CAAC;YAEF,IAAI,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE;gBAC9E,iBAAiB,CACT,YAAY,EACZ,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;aACL;SACJ;QAED,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;KACxB,QAAQ,MAAM,KAAK,KAAK,EAAE;IAG3B,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,YAA4B,EAC5B,UAAoB,EACpB,QAAoB,EACpB,EAAqB;IAEzB,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG;QACC,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,IAAI,IAAI,GAAG,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;KAC1D,QAAQ,SAAS,KAAK,QAAQ,EAAE;AACrC,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA"}
+{"version":3,"file":"get-boundary-piece-beziers.js","sourceRoot":"","sources":["../../src/mat/get-boundary-piece-beziers.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAGjD;;;;;;GAMG;AACH,SAAS,uBAAuB,CAAC,OAAiB;IAC9C,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,KAAK,GAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAE1B,MAAM,YAAY,GAAG,EAAE,CAAC;IAExB,iEAAiE;IACjE,IAAI,UAAU,GAAG,IAAI,CAAC;IACtB,GAAG;QACC,IAAI,CAAC,UAAU,EAAE;YACb,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,iBAAiB;YAC/C,SAAS;SACZ;QAED,UAAU,GAAG,KAAK,CAAC;QAEnB,MAAM,OAAO,GAAG,MAAM,CAAM,EAAE,CAAC,YAAY,CAAC;QAC5C,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC;QAE5C,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK;YAC/B,8CAA8C;YAC9C,6CAA6C;YAC7C,qBAAqB,CAAC,OAAO,CAAC;YAC9B,qBAAqB,CAAC,OAAO,CAAC,EAAE;YAEhC,aAAa;SAChB;aAAM,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK;YAC/B,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;YAElD,YAAY,CAAC,IAAI,CACb,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CACvD,CAAC;SACL;aAAM;YACH,YAAY,CAAC,IAAI,CACb,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAC/C,CAAC;YAEF,IAAI,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE;gBAC9E,iBAAiB,CACT,YAAY,EACZ,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;aACL;SACJ;QAED,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;KACxB,QAAQ,MAAM,KAAK,KAAK,EAAE;IAG3B,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,YAA4B,EAC5B,UAAoB,EACpB,QAAoB,EACpB,EAAqB;IAEzB,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG;QACC,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;KAC1D,QAAQ,SAAS,KAAK,QAAQ,EAAE;AACrC,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA"}

package/node/mat/get-contact-circles-at-interface.d.ts

@@ -1,8 +1,8 @@
-import { Curve } from '../curve.js';
-import { IPointOnShape } from '../point-on-shape.js';
-/**
- * @hidden
- * @param curve
- */
-declare function getContactCirclesAtInterface(curve: Curve): IPointOnShape[];
-export { getContactCirclesAtInterface };
+import { Curve } from '../curve.js';
+import { IPointOnShape } from '../point-on-shape.js';
+/**
+ * @hidden
+ * @param curve
+ */
+declare function getContactCirclesAtInterface(curve: Curve): IPointOnShape[];
+export { getContactCirclesAtInterface };

package/node/mat/get-contact-circles-at-interface.js

@@ -1,21 +1,21 @@
-import { getCornerAtEnd } from '../curve.js';
-import { PointOnShape } from '../point-on-shape.js';
-/**
- * @hidden
- * @param curve
- */
-function getContactCirclesAtInterface(curve) {
-    let { isQuiteSharp, isQuiteDull } = getCornerAtEnd(curve);
-    if (isQuiteSharp) {
-        return [new PointOnShape(curve, 1)];
-    }
-    else if (isQuiteDull) {
-        return [
-            new PointOnShape(curve, 1),
-            new PointOnShape(curve.next, 0)
-        ];
-    }
-    return [];
-}
-export { getContactCirclesAtInterface };
+import { getCornerAtEnd } from '../curve.js';
+import { PointOnShape } from '../point-on-shape.js';
+/**
+ * @hidden
+ * @param curve
+ */
+function getContactCirclesAtInterface(curve) {
+    const { isQuiteSharp, isQuiteDull } = getCornerAtEnd(curve);
+    if (isQuiteSharp) {
+        return [new PointOnShape(curve, 1)];
+    }
+    else if (isQuiteDull) {
+        return [
+            new PointOnShape(curve, 1),
+            new PointOnShape(curve.next, 0)
+        ];
+    }
+    return [];
+}
+export { getContactCirclesAtInterface };
 //# sourceMappingURL=get-contact-circles-at-interface.js.map

package/node/mat/get-contact-circles-at-interface.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-contact-circles-at-interface.js","sourceRoot":"","sources":["../../src/mat/get-contact-circles-at-interface.ts"],"names":[],"mappings":"AAAA,OAAO,EAAS,cAAc,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAIpD;;;GAGG;AACH,SAAS,4BAA4B,CAAC,KAAY;IACjD,IAAI,EAAE,YAAY,EAAE,WAAW,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAE1D,IAAI,YAAY,EAAE;QACjB,OAAO,CAAC,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;KACpC;SAAM,IAAI,WAAW,EAAE;QACvB,OAAO;YACN,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1B,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;SAC/B,CAAC;KACF;IAED,OAAO,EAAE,CAAC;AACX,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}
+{"version":3,"file":"get-contact-circles-at-interface.js","sourceRoot":"","sources":["../../src/mat/get-contact-circles-at-interface.ts"],"names":[],"mappings":"AAAA,OAAO,EAAS,cAAc,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAIpD;;;GAGG;AACH,SAAS,4BAA4B,CAAC,KAAY;IACjD,MAAM,EAAE,YAAY,EAAE,WAAW,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAE5D,IAAI,YAAY,EAAE;QACjB,OAAO,CAAC,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;KACpC;SAAM,IAAI,WAAW,EAAE;QACvB,OAAO;YACN,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1B,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;SAC/B,CAAC;KACF;IAED,OAAO,EAAE,CAAC;AACX,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}

package/node/mat/get-largest-vertex.d.ts

@@ -1,4 +1,4 @@
-import { CpNode } from '../cp-node.js';
-/** @hidden */
-declare function getLargestVertex(cpNodes: CpNode[]): CpNode;
-export { getLargestVertex };
+import { CpNode } from '../cp-node.js';
+/** @hidden */
+declare function getLargestVertex(cpNodes: CpNode[]): CpNode;
+export { getLargestVertex };

package/node/mat/get-largest-vertex.js

@@ -1,10 +1,10 @@
-/** @hidden */
-function getLargestVertex(cpNodes) {
-    return cpNodes.reduce(function (maxCpNode, cpNode) {
-        return maxCpNode.cp.circle.radius >= cpNode.cp.circle.radius
-            ? maxCpNode
-            : cpNode;
-    }, cpNodes[0]);
-}
-export { getLargestVertex };
+/** @hidden */
+function getLargestVertex(cpNodes) {
+    return cpNodes.reduce(function (maxCpNode, cpNode) {
+        return maxCpNode.cp.circle.radius >= cpNode.cp.circle.radius
+            ? maxCpNode
+            : cpNode;
+    }, cpNodes[0]);
+}
+export { getLargestVertex };
 //# sourceMappingURL=get-largest-vertex.js.map