flo-mat 1.1.2 → 2.0.0

package/node/get-curve-to-next.js

@@ -1,6 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const get_curve_between_1 = require("./get-curve/get-curve-between");
+import { getCurveBetween } from './get-curve/get-curve-between.js';
 /**
  * Returns the bezier curve from the maximal disk of the given [[CpNode]] to the
  * next [[CpNode]]'s maximal disk and thus directly represents a piece of the
@@ -8,7 +6,7 @@ const get_curve_between_1 = require("./get-curve/get-curve-between");
  * @param cpNode
  */
 function getCurveToNext(cpNode) {
-    return get_curve_between_1.getCurveBetween(cpNode, cpNode.next);
+    return getCurveBetween(cpNode, cpNode.next);
 }
-exports.getCurveToNext = getCurveToNext;
+export { getCurveToNext };
 //# sourceMappingURL=get-curve-to-next.js.map

package/node/get-curve-to-next.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-curve-to-next.js","sourceRoot":"","sources":["../src/get-curve-to-next.ts"],"names":[],"mappings":";;AAEA,qEAAgE;AAGhE;;;;;GAKG;AACH,SAAS,cAAc,CAAC,MAAc;IACrC,OAAO,mCAAe,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAGQ,wCAAc"}
+{"version":3,"file":"get-curve-to-next.js","sourceRoot":"","sources":["../src/get-curve-to-next.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAGnE;;;;;GAKG;AACH,SAAS,cAAc,CAAC,MAAc;IACrC,OAAO,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAGD,OAAO,EAAE,cAAc,EAAE,CAAA"}

package/node/get-interface-ccw.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Returns a positive value if the second bezier (of order 1, 2 or 3) curves
+ * anti-clockwise with respect to the first at the point where the first bezier
+ * ends and the second one starts. Returns a negative number if the turn is
+ * clockwise. Returns 0 otherwise.
+ *
+ * The algorithm is a generalization of `ccw`, a.k.a `orient2d`.
+ *
+ * The above obviously necessitates that their endpoints coincide as described.
+ *
+ * Preconditions (for robustness):
+ * * The beziers has control points with max bit-length of 25 and bit-aligned.
+ * * The bezier does not have infinite curvature at either endpoint
+ *
+ * This is so the vectors between control points can be
+ * calculated exactly without resorting to adaptive infinite precision floating
+ * point operations. Note: aligned to 'grid' here means if you bitwise-and all
+ * values together the resulting bitlength === the max bithlength of any value.
+ *
+ * @param psI The incoming bezier that ends at the interface
+ * @param psO The outgoing bezier that starts at the interface
+ */
+declare function getInterfaceCcw(psI: number[][], psO: number[][]): number;
+export { getInterfaceCcw };

package/node/get-interface-ccw.js

@@ -0,0 +1,98 @@
+import { orient2d } from 'big-float-ts';
+import { dot } from "flo-vector2d";
+import { compareCurvaturesAtInterface } from "./compare-curvatures-at-interface.js";
+/**
+ * Returns a positive value if the second bezier (of order 1, 2 or 3) curves
+ * anti-clockwise with respect to the first at the point where the first bezier
+ * ends and the second one starts. Returns a negative number if the turn is
+ * clockwise. Returns 0 otherwise.
+ *
+ * The algorithm is a generalization of `ccw`, a.k.a `orient2d`.
+ *
+ * The above obviously necessitates that their endpoints coincide as described.
+ *
+ * Preconditions (for robustness):
+ * * The beziers has control points with max bit-length of 25 and bit-aligned.
+ * * The bezier does not have infinite curvature at either endpoint
+ *
+ * This is so the vectors between control points can be
+ * calculated exactly without resorting to adaptive infinite precision floating
+ * point operations. Note: aligned to 'grid' here means if you bitwise-and all
+ * values together the resulting bitlength === the max bithlength of any value.
+ *
+ * @param psI The incoming bezier that ends at the interface
+ * @param psO The outgoing bezier that starts at the interface
+ */
+// TODO - improve and make at least 46-bitlength precondition
+function getInterfaceCcw(psI, psO) {
+    let lenI = psI.length;
+    // second last control point of incoming curve
+    let p0 = psI[lenI - 2];
+    // last control point of incoming curve / first control point of outgoing
+    let p1 = psO[0];
+    // second control point of outgoing curve
+    let p2 = psO[1];
+    /*
+    if (typeof _bez_debug_ !== 'undefined') {
+        let maxBitLength = 25;
+        let p1_ = psI[lenI-1];
+        // ---- precondition: does endpoints coincide
+        if (p1_[0] !== p1[0] || p1_[1] !== p1[1]) {
+            throw new Error('Curve endpoints must coincide.');
+        }
+        // ---- precondition: are coordinates grid-aligned
+        // Get all coordinate values into an array
+        let xs: number[] = [];
+        [psI, psO].forEach(ps => ps.forEach(p => p.forEach(x => {
+            xs.push(x);
+        })));
+        
+        let msb = xs.reduce((prevX, x) => Math.max(prevX, msbExponent(x)), Number.NEGATIVE_INFINITY);
+        let lsb = xs.reduce((prevX, x) => Math.min(prevX, lsbExponent(x)), Number.POSITIVE_INFINITY);
+        let bitlengthAll = msb - lsb + 1;
+        if (bitlengthAll > maxBitLength) {
+            throw new Error(
+                `Curve control point coordinates must be bit-aligned and <= ${maxBitLength}. bitlength === ${bitlengthAll}, coordinates: ${xs}`
+            );
+        }
+    }
+    */
+    // Max one bit can be added in the calculations below due to bit-alignment
+    let xE = p1[0] - p0[0]; // tangent x-coordinate
+    let yE = p1[1] - p0[1]; // tangent y-coordinate
+    let xS = p2[0] - p1[0]; // tangent x-coordinate
+    let yS = p2[1] - p1[1]; // tangent y-coordinate
+    // If the tangent is to be found at t === 0 or t === 1 then using a basic 
+    // property of bezier curves we can find the tangents easily as below
+    // (non-normalized) tangent of incoming curve at t === 1
+    let tangentAtEnd = [xE, yE];
+    // (non-normalized) tangent of outgoing curve at t === 0
+    let tangentAtStart = [xS, yS];
+    // The cross calculated below will have a max bitlength of 
+    // (2*(maxBitLength+1))+1 === e.g. (2*(25+1)) + 1 === 53
+    // If the preconditions are met it is exact
+    //let crossTangents = cross(tangentAtEnd, tangentAtStart);
+    // The cross below is exact by adaptive infinite precision
+    let crossTangents = orient2d(p0, p1, p2);
+    if (crossTangents !== 0) {
+        return crossTangents;
+    }
+    // The dot calculated below will have a max bitlength of 
+    // (2*(maxBitLength+1))+1 === e.g. (2*(25+1)) + 1 === 53
+    // If the preconditions are met it is exact
+    let dotTangents = dot(tangentAtEnd, tangentAtStart);
+    if (dotTangents > 0) {
+        // Curves go in same direction at interface - neither clock or 
+        // anti-clockwise.
+        // Note: The above comment is not strictly true but as this case is not
+        // important for the algorithm we return 0
+        return 0;
+    }
+    // Curves go in opposite directions at interface starting off with the exact
+    // same tangent - look now at curvature to see which has the largest 
+    // curvature so we can base the clock or anti-clockwise result on that
+    // Look at curvature
+    return compareCurvaturesAtInterface(psI.slice().reverse(), psO);
+}
+export { getInterfaceCcw };
+//# sourceMappingURL=get-interface-ccw.js.map

package/node/get-interface-ccw.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-interface-ccw.js","sourceRoot":"","sources":["../src/get-interface-ccw.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AACnC,OAAO,EAAE,4BAA4B,EAAE,MAAM,sCAAsC,CAAC;AAGpF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,6DAA6D;AAC7D,SAAS,eAAe,CAAC,GAAe,EAAE,GAAe;IACrD,IAAI,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;IAEtB,8CAA8C;IAC9C,IAAI,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC;IACrB,yEAAyE;IACzE,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,yCAAyC;IACzC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhB;;;;;;;;;;;;;;;;;;;;;;;;MAwBE;IAEF,0EAA0E;IAC1E,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACnD,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAChD,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAC7C,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAEnD,0EAA0E;IACvE,qEAAqE;IAErE,wDAAwD;IACxD,IAAI,YAAY,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAC3B,wDAAwD;IAC3D,IAAI,cAAc,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAE1B,2DAA2D;IAC3D,wDAAwD;IACxD,2CAA2C;IAC3C,0DAA0D;IAE1D,0DAA0D;IAC1D,IAAI,aAAa,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAE5C,IAAI,aAAa,KAAK,CAAC,EAAE;QACxB,OAAO,aAAa,CAAC;KAClB;IAED,yDAAyD;IACzD,wDAAwD;IACxD,2CAA2C;IAC3C,IAAI,WAAW,GAAG,GAAG,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;IACpD,IAAI,WAAW,GAAG,CAAC,EAAE;QACjB,+DAA+D;QAC/D,kBAAkB;QAClB,uEAAuE;QACvE,0CAA0C;QAC1C,OAAO,CAAC,CAAC;KACZ;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,sEAAsE;IAEtE,oBAAoB;IACpB,OAAO,4BAA4B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC;AACpE,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/index.d.ts

@@ -1,37 +1,36 @@
-import { Mat } from './mat';
-import { Loop } from './loop';
-import { Curve } from './curve';
-import { CpNode } from './cp-node';
-import { PointOnShape, IPointOnShape } from './point-on-shape';
-import { Circle } from './circle';
-import { ContactPoint } from './contact-point';
-import { BezierPiece } from './mat/bezier-piece';
-import { findMats } from './find-mats';
-import { trimMat } from './mat/trim-mat';
-import { toScaleAxis } from './to-scale-axis';
-import { traverseEdges } from './traverse-edges';
-import { getBranches } from './get-branches';
-import { traverseVertices } from './traverse-vertices';
-import { Debug, enableDebugForMat } from './debug/debug';
-import { drawBranch } from './debug/functions/draw-elem/branch';
-import { drawMat } from './debug/functions/draw-elem/mat';
-import { IDebugElems } from './debug/debug-elem-types';
-import { TDrawElemFunctions } from './debug/functions/draw-elem/draw-elem';
-import { ICpNodeForDebugging } from './debug/cp-node-for-debugging';
-import { ITiming } from './debug/debug';
-import { getClosestBoundaryPoint } from './mat/closest-boundary-point/get-closest-boundary-point';
 import { beziersToSvgPathStr, getPathsFromStr } from 'flo-boolean';
-import { getShapeBounds } from './svg/get-shape-bounds';
-import { getBoundaryBeziersToNext } from './get-boundary-beziers-to-next';
-import { getBoundaryBezierPartsToNext } from './get-boundary-bezier-parts-to-next';
-import { getBoundaryPieceBeziers } from './mat/get-boundary-piece-beziers';
-import { simplifyMat } from './simplify-mat';
-import { simplifyMatMapOnly } from './mat/simplify-mat-map-only';
-import { drawElemFunctions } from './debug/functions/draw-elem/draw-elem';
-import { getCurveToNext } from './get-curve-to-next';
-import { getCurveBetween } from './get-curve/get-curve-between';
-import { sweepLine } from './sweep-line/sweep-line';
-import { areBoxesIntersecting } from './sweep-line/are-boxes-intersecting';
-import { getClosestSquareDistanceToRect } from './mat/geometry/get-closest-square-distance-to-rect';
-import { loopFromBeziers } from './loop';
-export { Mat, PointOnShape, IPointOnShape, Curve, Loop, CpNode, Circle, ContactPoint, BezierPiece, findMats, toScaleAxis, trimMat, traverseVertices, traverseEdges, getBranches, getBoundaryBeziersToNext, getBoundaryBezierPartsToNext, simplifyMat, simplifyMatMapOnly, beziersToSvgPathStr, getPathsFromStr, getShapeBounds, drawBranch, drawMat, getClosestBoundaryPoint, getCurveToNext, getCurveBetween, Debug, IDebugElems, TDrawElemFunctions, ICpNodeForDebugging, ITiming, getBoundaryPieceBeziers, drawElemFunctions, sweepLine, areBoxesIntersecting, getClosestSquareDistanceToRect, loopFromBeziers, enableDebugForMat };
+import { Mat } from './mat.js';
+import { Loop } from './loop.js';
+import { Curve } from './curve.js';
+import { CpNode } from './cp-node.js';
+import { PointOnShape, IPointOnShape } from './point-on-shape.js';
+import { Circle } from './circle.js';
+import { ContactPoint } from './contact-point.js';
+import { BezierPiece } from './mat/bezier-piece.js';
+import { findMats } from './find-mats.js';
+import { trimMat } from './mat/trim-mat.js';
+import { toScaleAxis } from './to-scale-axis.js';
+import { traverseEdges } from './traverse-edges.js';
+import { getBranches } from './get-branches.js';
+import { traverseVertices } from './traverse-vertices.js';
+import { Debug, enableDebugForMat } from './debug/debug.js';
+import { drawBranch } from './debug/functions/draw-elem/branch.js';
+import { drawMat } from './debug/functions/draw-elem/mat.js';
+import { IDebugElems } from './debug/debug-elem-types.js';
+import { TDrawElemFunctions } from './debug/functions/draw-elem/draw-elem.js';
+import { ICpNodeForDebugging } from './debug/cp-node-for-debugging.js';
+import { ITiming } from './debug/debug.js';
+import { getClosestBoundaryPoint } from './mat/closest-boundary-point/get-closest-boundary-point.js';
+import { getShapeBounds } from './svg/get-shape-bounds.js';
+import { getBoundaryBeziersToNext } from './get-boundary-beziers-to-next.js';
+import { getBoundaryBezierPartsToNext } from './get-boundary-bezier-parts-to-next.js';
+import { getBoundaryPieceBeziers } from './mat/get-boundary-piece-beziers.js';
+import { simplifyMat } from './simplify-mat.js';
+import { simplifyMatMapOnly } from './mat/simplify-mat-map-only.js';
+import { drawElemFunctions } from './debug/functions/draw-elem/draw-elem.js';
+import { getCurveToNext } from './get-curve-to-next.js';
+import { getCurveBetween } from './get-curve/get-curve-between.js';
+import { sweepLine } from './sweep-line/sweep-line.js';
+import { getClosestSquareDistanceToRect } from './mat/geometry/get-closest-square-distance-to-rect.js';
+import { loopFromBeziers } from './loop.js';
+export { Mat, PointOnShape, IPointOnShape, Curve, Loop, CpNode, Circle, ContactPoint, BezierPiece, findMats, toScaleAxis, trimMat, traverseVertices, traverseEdges, getBranches, getBoundaryBeziersToNext, getBoundaryBezierPartsToNext, simplifyMat, simplifyMatMapOnly, beziersToSvgPathStr, getPathsFromStr, getShapeBounds, drawBranch, drawMat, getClosestBoundaryPoint, getCurveToNext, getCurveBetween, Debug, IDebugElems, TDrawElemFunctions, ICpNodeForDebugging, ITiming, getBoundaryPieceBeziers, drawElemFunctions, sweepLine, getClosestSquareDistanceToRect, loopFromBeziers, enableDebugForMat };

package/node/index.js

@@ -1,56 +1,33 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const cp_node_1 = require("./cp-node");
-exports.CpNode = cp_node_1.CpNode;
-const point_on_shape_1 = require("./point-on-shape");
-exports.PointOnShape = point_on_shape_1.PointOnShape;
-const find_mats_1 = require("./find-mats");
-exports.findMats = find_mats_1.findMats;
-const trim_mat_1 = require("./mat/trim-mat");
-exports.trimMat = trim_mat_1.trimMat;
-const to_scale_axis_1 = require("./to-scale-axis");
-exports.toScaleAxis = to_scale_axis_1.toScaleAxis;
-const traverse_edges_1 = require("./traverse-edges");
-exports.traverseEdges = traverse_edges_1.traverseEdges;
-const get_branches_1 = require("./get-branches");
-exports.getBranches = get_branches_1.getBranches;
-const traverse_vertices_1 = require("./traverse-vertices");
-exports.traverseVertices = traverse_vertices_1.traverseVertices;
-const debug_1 = require("./debug/debug");
-exports.enableDebugForMat = debug_1.enableDebugForMat;
-const branch_1 = require("./debug/functions/draw-elem/branch");
-exports.drawBranch = branch_1.drawBranch;
-const mat_1 = require("./debug/functions/draw-elem/mat");
-exports.drawMat = mat_1.drawMat;
-const get_closest_boundary_point_1 = require("./mat/closest-boundary-point/get-closest-boundary-point");
-exports.getClosestBoundaryPoint = get_closest_boundary_point_1.getClosestBoundaryPoint;
-const flo_boolean_1 = require("flo-boolean");
-exports.beziersToSvgPathStr = flo_boolean_1.beziersToSvgPathStr;
-exports.getPathsFromStr = flo_boolean_1.getPathsFromStr;
-const get_shape_bounds_1 = require("./svg/get-shape-bounds");
-exports.getShapeBounds = get_shape_bounds_1.getShapeBounds;
-const get_boundary_beziers_to_next_1 = require("./get-boundary-beziers-to-next");
-exports.getBoundaryBeziersToNext = get_boundary_beziers_to_next_1.getBoundaryBeziersToNext;
-const get_boundary_bezier_parts_to_next_1 = require("./get-boundary-bezier-parts-to-next");
-exports.getBoundaryBezierPartsToNext = get_boundary_bezier_parts_to_next_1.getBoundaryBezierPartsToNext;
-const get_boundary_piece_beziers_1 = require("./mat/get-boundary-piece-beziers");
-exports.getBoundaryPieceBeziers = get_boundary_piece_beziers_1.getBoundaryPieceBeziers;
-const simplify_mat_1 = require("./simplify-mat");
-exports.simplifyMat = simplify_mat_1.simplifyMat;
-const simplify_mat_map_only_1 = require("./mat/simplify-mat-map-only");
-exports.simplifyMatMapOnly = simplify_mat_map_only_1.simplifyMatMapOnly;
-const draw_elem_1 = require("./debug/functions/draw-elem/draw-elem");
-exports.drawElemFunctions = draw_elem_1.drawElemFunctions;
-const get_curve_to_next_1 = require("./get-curve-to-next");
-exports.getCurveToNext = get_curve_to_next_1.getCurveToNext;
-const get_curve_between_1 = require("./get-curve/get-curve-between");
-exports.getCurveBetween = get_curve_between_1.getCurveBetween;
-const sweep_line_1 = require("./sweep-line/sweep-line");
-exports.sweepLine = sweep_line_1.sweepLine;
-const are_boxes_intersecting_1 = require("./sweep-line/are-boxes-intersecting");
-exports.areBoxesIntersecting = are_boxes_intersecting_1.areBoxesIntersecting;
-const get_closest_square_distance_to_rect_1 = require("./mat/geometry/get-closest-square-distance-to-rect");
-exports.getClosestSquareDistanceToRect = get_closest_square_distance_to_rect_1.getClosestSquareDistanceToRect;
-const loop_1 = require("./loop");
-exports.loopFromBeziers = loop_1.loopFromBeziers;
+import { beziersToSvgPathStr, getPathsFromStr } from 'flo-boolean';
+import { CpNode } from './cp-node.js';
+import { PointOnShape } from './point-on-shape.js';
+import { findMats } from './find-mats.js';
+import { trimMat } from './mat/trim-mat.js';
+import { toScaleAxis } from './to-scale-axis.js';
+import { traverseEdges } from './traverse-edges.js';
+import { getBranches } from './get-branches.js';
+import { traverseVertices } from './traverse-vertices.js';
+import { enableDebugForMat } from './debug/debug.js';
+import { drawBranch } from './debug/functions/draw-elem/branch.js';
+import { drawMat } from './debug/functions/draw-elem/mat.js';
+import { getClosestBoundaryPoint } from './mat/closest-boundary-point/get-closest-boundary-point.js';
+import { getShapeBounds } from './svg/get-shape-bounds.js';
+import { getBoundaryBeziersToNext } from './get-boundary-beziers-to-next.js';
+import { getBoundaryBezierPartsToNext } from './get-boundary-bezier-parts-to-next.js';
+import { getBoundaryPieceBeziers } from './mat/get-boundary-piece-beziers.js';
+import { simplifyMat } from './simplify-mat.js';
+import { simplifyMatMapOnly } from './mat/simplify-mat-map-only.js';
+import { drawElemFunctions } from './debug/functions/draw-elem/draw-elem.js';
+import { getCurveToNext } from './get-curve-to-next.js';
+import { getCurveBetween } from './get-curve/get-curve-between.js';
+import { sweepLine } from './sweep-line/sweep-line.js';
+import { getClosestSquareDistanceToRect } from './mat/geometry/get-closest-square-distance-to-rect.js';
+import { loopFromBeziers } from './loop.js';
+export { PointOnShape, CpNode, 
+// Main functions
+findMats, toScaleAxis, trimMat, traverseVertices, traverseEdges, getBranches, getBoundaryBeziersToNext, getBoundaryBezierPartsToNext, simplifyMat, simplifyMatMapOnly, 
+// SVG functions
+beziersToSvgPathStr, getPathsFromStr, getShapeBounds, drawBranch, drawMat, 
+// Other functions
+getClosestBoundaryPoint, getCurveToNext, getCurveBetween, getBoundaryPieceBeziers, drawElemFunctions, sweepLine, getClosestSquareDistanceToRect, loopFromBeziers, enableDebugForMat };
 //# sourceMappingURL=index.js.map

package/node/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;AAIA,uCAAmC;AAsDlC,iBAtDQ,gBAAM,CAsDR;AArDP,qDAA+D;AAiD9D,uBAjDQ,6BAAY,CAiDR;AA5Cb,2CAAuC;AAsDtC,mBAtDQ,oBAAQ,CAsDR;AArDT,6CAAyC;AAuDxC,kBAvDQ,kBAAO,CAuDR;AAtDR,mDAA8C;AAqD7C,sBArDQ,2BAAW,CAqDR;AAnDZ,qDAAiD;AAsDhD,wBAtDQ,8BAAa,CAsDR;AArDd,iDAA6C;AAsD5C,sBAtDQ,0BAAW,CAsDR;AArDZ,2DAAuD;AAmDtD,2BAnDQ,oCAAgB,CAmDR;AAjDjB,yCAAyD;AAqFxD,4BArFe,yBAAiB,CAqFf;AApFlB,+DAAgE;AA4D/D,qBA5DQ,mBAAU,CA4DR;AA3DX,yDAA0D;AA4DzD,kBA5DQ,aAAO,CA4DR;AAnDR,wGAC2D;AAqD1D,kCAtDQ,oDAAuB,CAsDR;AAnDxB,6CAAmE;AA4ClE,8BA5CQ,iCAAmB,CA4CR;AACnB,0BA7C6B,6BAAe,CA6C7B;AA5ChB,6DAAwD;AA6CvD,yBA7CQ,iCAAc,CA6CR;AA3Cf,iFAA0E;AAmCzE,mCAnCQ,uDAAwB,CAmCR;AAlCzB,2FAAmF;AAmClF,uCAnCQ,gEAA4B,CAmCR;AAlC7B,iFAA2E;AAwD1E,kCAxDQ,oDAAuB,CAwDR;AAvDxB,iDAA6C;AAkC5C,sBAlCQ,0BAAW,CAkCR;AAjCZ,uEAAiE;AAkChE,6BAlCQ,0CAAkB,CAkCR;AAhCnB,qEAAyE;AAsDxE,4BAtDQ,6BAAiB,CAsDR;AApDlB,2DAAqD;AAyCpD,yBAzCQ,kCAAc,CAyCR;AAxCf,qEAAgE;AAwC/C,0BAxCR,mCAAe,CAwCQ;AAvChC,wDAAoD;AAoDnD,oBApDQ,sBAAS,CAoDR;AAnDV,gFAA2E;AAoD1E,+BApDQ,6CAAoB,CAoDR;AAnDrB,4GAAoG;AAqDnG,yCArDQ,oEAA8B,CAqDR;AApD/B,iCAAyC;AAsDxC,0BAtDQ,sBAAe,CAsDR"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAKnE,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,YAAY,EAAiB,MAAM,qBAAqB,CAAC;AAIlE,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAS,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,MAAM,uCAAuC,CAAC;AACnE,OAAO,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAK7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,4DAA4D,CAAC;AACrG,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,wBAAwB,EAAE,MAAM,mCAAmC,CAAC;AAC7E,OAAO,EAAE,4BAA4B,EAAE,MAAM,wCAAwC,CAAC;AACtF,OAAO,EAAE,uBAAuB,EAAE,MAAM,qCAAqC,CAAC;AAC9E,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAE,MAAM,gCAAgC,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0CAA0C,CAAC;AAC7E,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,8BAA8B,EAAE,MAAM,uDAAuD,CAAC;AACvG,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAG5C,OAAO,EAGN,YAAY,EAIZ,MAAM;AAKN,iBAAiB;AACjB,QAAQ,EACR,WAAW,EACX,OAAO,EACP,gBAAgB,EAChB,aAAa,EACb,WAAW,EACX,wBAAwB,EACxB,4BAA4B,EAC5B,WAAW,EACX,kBAAkB;AAElB,gBAAgB;AAChB,mBAAmB,EACnB,eAAe,EACf,cAAc,EACd,UAAU,EACV,OAAO;AAEP,kBAAkB;AAClB,uBAAuB,EACvB,cAAc,EAAE,eAAe,EAS/B,uBAAuB,EAEvB,iBAAiB,EAEjB,SAAS,EAET,8BAA8B,EAE9B,eAAe,EACf,iBAAiB,EACjB,CAAA"}

package/node/loop/get-max-coordinate.js

@@ -1,5 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
 const max = Math.max;
 const abs = Math.abs;
 /**
@@ -42,5 +40,5 @@ function getLoopsMetrics(loops) {
     let maxRadius = max(width, height);
     return { maxCoordinate, maxRadius };
 }
-exports.getLoopsMetrics = getLoopsMetrics;
+export { getLoopsMetrics };
 //# sourceMappingURL=get-max-coordinate.js.map

package/node/loop/get-max-coordinate.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-max-coordinate.js","sourceRoot":"","sources":["../../src/loop/get-max-coordinate.ts"],"names":[],"mappings":";;AACA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;AACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;AAGrB;;;;GAIG;AACH,SAAS,eAAe,CAAC,KAAqB;IAI1C,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAEpC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE;QAAE,KAAK,IAAI,EAAE,IAAI,IAAI,EAAE;YAAE,KAAK,IAAI,CAAC,IAAI,EAAE,EAAE;gBAC/D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,GAAG,aAAa,EAAE;oBAAE,aAAa,GAAG,CAAC,CAAC;iBAAE;gBAC7C,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;aAC9B;SAAE;KAAE;IAEL,IAAI,KAAK,GAAI,IAAI,GAAG,IAAI,CAAC;IACzB,IAAI,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;IACzB,IAAI,SAAS,GAAG,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEnC,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;AACxC,CAAC;AAGQ,0CAAe"}
+{"version":3,"file":"get-max-coordinate.js","sourceRoot":"","sources":["../../src/loop/get-max-coordinate.ts"],"names":[],"mappings":"AAAA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;AACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;AAGrB;;;;GAIG;AACH,SAAS,eAAe,CAAC,KAAqB;IAI1C,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAEpC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE;QAAE,KAAK,IAAI,EAAE,IAAI,IAAI,EAAE;YAAE,KAAK,IAAI,CAAC,IAAI,EAAE,EAAE;gBAC/D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,GAAG,aAAa,EAAE;oBAAE,aAAa,GAAG,CAAC,CAAC;iBAAE;gBAC7C,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;gBAC3B,IAAI,CAAC,GAAG,IAAI,EAAE;oBAAE,IAAI,GAAG,CAAC,CAAC;iBAAE;aAC9B;SAAE;KAAE;IAEL,IAAI,KAAK,GAAI,IAAI,GAAG,IAAI,CAAC;IACzB,IAAI,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;IACzB,IAAI,SAAS,GAAG,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEnC,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;AACxC,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/loop.d.ts

@@ -1,4 +1,4 @@
-import { Curve } from './curve';
+import { Curve } from './curve.js';
 /**
  * Represents a two-way linked loop of [[ICurve]]s - mostly used internally to
  * conveniently represent shape boundaries.

package/node/loop.js

@@ -1,5 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
 /**
  * @param beziers A pre-ordered array of bezier curves to add initially.
  */
@@ -33,5 +31,5 @@ function loopFromBeziers(beziers = []) {
     lastCurve.next = curves[0];
     return loop;
 }
-exports.loopFromBeziers = loopFromBeziers;
+export { loopFromBeziers };
 //# sourceMappingURL=loop.js.map

package/node/loop.js.map

@@ -1 +1 @@
-{"version":3,"file":"loop.js","sourceRoot":"","sources":["../src/loop.ts"],"names":[],"mappings":";;AAgBA;;GAEG;AACH,SAAS,eAAe,CAAC,UAAwB,EAAE;IAC/C,IAAI,MAAM,GAAY,EAAE,CAAC;IAEzB,IAAI,IAAI,GAAS;QACb,OAAO;QACP,MAAM;KACT,CAAC;IAEF,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;QAAE,OAAO,IAAI,CAAC;KAAE;IAErC,IAAI,IAAW,CAAC;IAEhB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAEjC,IAAI,KAAK,GAAU;YACf,IAAI;YACJ,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;YACd,IAAI;YACJ,IAAI,EAAE,SAAS;YACf,GAAG,EAAE,CAAC;SACT,CAAC;QAEF,IAAI,IAAI,EAAE;YAAE,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;SAAE;QAChC,IAAI,GAAG,KAAK,CAAC;QAEb,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACtB;IAED,aAAa;IACb,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;IAC3B,SAAS,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAE3B,OAAO,IAAI,CAAC;AAChB,CAAC;AAGc,0CAAe"}
+{"version":3,"file":"loop.js","sourceRoot":"","sources":["../src/loop.ts"],"names":[],"mappings":"AAeA;;GAEG;AACH,SAAS,eAAe,CAAC,UAAwB,EAAE;IAC/C,IAAI,MAAM,GAAY,EAAE,CAAC;IAEzB,IAAI,IAAI,GAAS;QACb,OAAO;QACP,MAAM;KACT,CAAC;IAEF,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;QAAE,OAAO,IAAI,CAAC;KAAE;IAErC,IAAI,IAAW,CAAC;IAEhB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAEjC,IAAI,KAAK,GAAU;YACf,IAAI;YACJ,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;YACd,IAAI;YACJ,IAAI,EAAE,SAAS;YACf,GAAG,EAAE,CAAC;SACT,CAAC;QAEF,IAAI,IAAI,EAAE;YAAE,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;SAAE;QAChC,IAAI,GAAG,KAAK,CAAC;QAEb,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACtB;IAED,aAAa;IACb,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;IAC3B,SAAS,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAE3B,OAAO,IAAI,CAAC;AAChB,CAAC;AAGD,OAAO,EAAQ,eAAe,EAAE,CAAA"}

package/node/mat/add-to-cp-graph.d.ts

@@ -1,8 +1,8 @@
-import LlRbTree from 'flo-ll-rb-tree';
-import { Loop } from '../loop';
-import { Circle } from '../circle';
-import { IPointOnShape } from '../point-on-shape';
-import { CpNode } from '../cp-node';
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { Loop } from '../loop.js';
+import { Circle } from '../circle.js';
+import { IPointOnShape } from '../point-on-shape.js';
+import { CpNode } from '../cp-node.js';
 /**
  * @hidden
  * @param circle

package/node/mat/add-to-cp-graph.js

@@ -1,7 +1,5 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const cp_node_1 = require("../cp-node");
-const get_neighboring_cps_1 = require("./get-neighboring-cps");
+import { CpNode } from '../cp-node.js';
+import { getNeighbouringPoints } from './get-neighboring-cps.js';
 /**
  * @hidden
  * @param circle
@@ -17,8 +15,8 @@ function addToCpGraph(circle, orders, cpTrees, poss, neighbors) {
         let newCp_ = { pointOnShape: pos, circle, order: orders[i], order2: 0 };
         let neighboringCp = neighbors
             ? neighbors[i]
-            : get_neighboring_cps_1.getNeighbouringPoints(cpTree, pos, orders[i], 0);
-        let newCp = cp_node_1.CpNode.insert(false, false, cpTree, newCp_, neighboringCp[0]);
+            : getNeighbouringPoints(cpTree, pos, orders[i], 0);
+        let newCp = CpNode.insert(false, false, cpTree, newCp_, neighboringCp[0]);
         return newCp;
     });
     let len = poss.length;
@@ -29,5 +27,5 @@ function addToCpGraph(circle, orders, cpTrees, poss, neighbors) {
         newCps[i].nextOnCircle = newCps[indxNext];
     }
 }
-exports.addToCpGraph = addToCpGraph;
+export { addToCpGraph };
 //# sourceMappingURL=add-to-cp-graph.js.map

package/node/mat/add-to-cp-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"add-to-cp-graph.js","sourceRoot":"","sources":["../../src/mat/add-to-cp-graph.ts"],"names":[],"mappings":";;AAMA,wCAAoC;AACpC,+DAA8D;AAG9D;;;;;;;;GAQG;AACH,SAAS,YAAY,CACb,MAAgB,EAChB,MAAkB,EAClB,OAAoC,EACpC,IAAyB,EACzB,SAAuB;IAE3B,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAEzC,IAAI,MAAM,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAEtF,IAAI,aAAa,GAAG,SAAS;YACzB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,2CAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvD,IAAI,KAAK,GAAG,gBAAM,CAAC,MAAM,CACjB,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,aAAa,CAAC,CAAC,CAAC,CACvB,CAAC;QAEF,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAK,CAAC,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QACzC,IAAI,QAAQ,GAAG,CAAC,KAAK,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAK,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QAEzC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;KAC7C;AACL,CAAC;AAGQ,oCAAY"}
+{"version":3,"file":"add-to-cp-graph.js","sourceRoot":"","sources":["../../src/mat/add-to-cp-graph.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACvC,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AAGjE;;;;;;;;GAQG;AACH,SAAS,YAAY,CACb,MAAgB,EAChB,MAAkB,EAClB,OAAoC,EACpC,IAAyB,EACzB,SAAuB;IAE3B,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAEzC,IAAI,MAAM,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAEtF,IAAI,aAAa,GAAG,SAAS;YACzB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvD,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,CACjB,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,aAAa,CAAC,CAAC,CAAC,CACvB,CAAC;QAEF,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAK,CAAC,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QACzC,IAAI,QAAQ,GAAG,CAAC,KAAK,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAK,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QAEzC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;KAC7C;AACL,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

package/node/mat/bezier-piece.d.ts

@@ -1,4 +1,4 @@
-import { Curve } from '../curve';
+import { Curve } from '../curve.js';
 /**
  * @hidden
  * Represents a part of a bezier within the shape boundary.

package/node/mat/bezier-piece.js

@@ -1,3 +1,2 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
+export {};
 //# sourceMappingURL=bezier-piece.js.map

package/node/mat/closest-boundary-point/closest-points-on-curve.d.ts

@@ -1,4 +1,4 @@
-import { Curve } from "../../curve";
+import { Curve } from "../../curve.js";
 /**
  * @hidden
  * @param curve The curve

package/node/mat/closest-boundary-point/closest-points-on-curve.js

@@ -1,7 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const flo_poly_1 = require("flo-poly");
-const flo_bezier3_1 = require("flo-bezier3");
+// qqq import { deflateQuad, allRootsMultiWithErrBounds, RootInterval } from 'flo-poly';
+// qqq import { getTangentPolyFromPointExact, evalDeCasteljau, evaluate, getFootpointPolyExact } from 'flo-bezier3';
+import { ddDeflate, allRootsCertified } from 'flo-poly';
+import { evaluate, getFootpointPolyDd } from 'flo-bezier3';
 /**
  * @hidden
  * @param curve The curve
@@ -11,13 +11,15 @@ const flo_bezier3_1 = require("flo-bezier3");
  * @param t The t value of the bezier that locates p
  */
 function closestPointsOnCurve(curve, p, [tS, tE] = [0, 1], touchedCurve, t) {
-    let poly = flo_bezier3_1.getTangentPolyFromPointExact(curve.ps, p);
-    if (curve === touchedCurve) {
-        poly = flo_poly_1.deflateQuad(poly, t);
-    }
-    let roots = flo_poly_1.allRootsMultiWithErrBounds(poly, poly.map(c => 0), // because all coefficients are exact
-    undefined, // ...
-    tS, tE);
+    // qqq let poly = getTangentPolyFromPointExact(curve.ps, p);
+    const _poly = getFootpointPolyDd(curve.ps, p);
+    // qqq poly = deflateQuad(poly, t);
+    const poly = curve === touchedCurve
+        ? ddDeflate(_poly, t)
+        : _poly;
+    // let roots: Omit<RootInterval,'multiplicity'>[] = allRootsMultiWithErrBounds(
+    let roots;
+    roots = allRootsCertified(poly, tS, tE);
     // Also test the endpoints
     let push0 = true;
     let push1 = true;
@@ -63,10 +65,10 @@ function closestPointsOnCurve(curve, p, [tS, tE] = [0, 1], touchedCurve, t) {
             ? 0
             : tE > 1 ? 1 : (tS + tE) / 2;
         // TODO - why does evalDeCasteljau not work here?
-        return { p: flo_bezier3_1.evaluate(curve.ps, t), t };
+        return { p: evaluate(curve.ps, t), t };
         //return { p: evalDeCasteljau(curve.ps,t), t }
     });
     return ps;
 }
-exports.closestPointsOnCurve = closestPointsOnCurve;
+export { closestPointsOnCurve };
 //# sourceMappingURL=closest-points-on-curve.js.map

package/node/mat/closest-boundary-point/closest-points-on-curve.js.map

@@ -1 +1 @@
-{"version":3,"file":"closest-points-on-curve.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/closest-points-on-curve.ts"],"names":[],"mappings":";;AACA,uCAAiF;AACjF,6CAAsF;AAItF;;;;;;;GAOG;AACH,SAAS,oBAAoB,CACrB,KAAY,EACZ,CAAW,EACX,CAAC,EAAE,EAAC,EAAE,IAAc,CAAC,CAAC,EAAC,CAAC,CAAC,EACzB,YAAmB,EACnB,CAAS;IAEb,IAAI,IAAI,GAAG,0CAA4B,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAErD,IAAI,KAAK,KAAK,YAAY,EAAE;QACxB,IAAI,GAAG,sBAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;KAC/B;IAED,IAAI,KAAK,GAAwC,qCAA0B,CACvE,IAAI,EACJ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAG,qCAAqC;IACxD,SAAS,EAAU,MAAM;IACzB,EAAE,EACF,EAAE,CACL,CAAC;IAGF,0BAA0B;IAC1B,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IACD,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,CACd,IAAI,CAAC,EAAE;QACH,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,wEAAwE;QACxE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;QAC/B,iDAAiD;QACjD,OAAO,EAAE,CAAC,EAAE,sBAAQ,CAAC,KAAK,CAAC,EAAE,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA;QACrC,8CAA8C;IAClD,CAAC,CACJ,CAAC;IAEF,OAAO,EAAE,CAAC;AACd,CAAC;AAGQ,oDAAoB"}
+{"version":3,"file":"closest-points-on-curve.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/closest-points-on-curve.ts"],"names":[],"mappings":"AAAA,wFAAwF;AACxF,oHAAoH;AACpH,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAgB,MAAM,UAAU,CAAC;AACtE,OAAO,EAAmB,QAAQ,EAAE,kBAAkB,EAAyB,MAAM,aAAa,CAAC;AAKnG;;;;;;;GAOG;AACH,SAAS,oBAAoB,CACrB,KAAY,EACZ,CAAW,EACX,CAAC,EAAE,EAAC,EAAE,IAAc,CAAC,CAAC,EAAC,CAAC,CAAC,EACzB,YAAmB,EACnB,CAAS;IAKb,4DAA4D;IAC5D,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE9C,mCAAmC;IACnC,MAAM,IAAI,GAAG,KAAK,KAAK,YAAY;QAC/B,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QACrB,CAAC,CAAC,KAAK,CAAC;IAEZ,+EAA+E;IAC/E,IAAI,KAA0C,CAAC;IAC/C,KAAK,GAAG,iBAAiB,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAExC,0BAA0B;IAC1B,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IACD,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,CACd,IAAI,CAAC,EAAE;QACH,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,wEAAwE;QACxE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;QAC/B,iDAAiD;QACjD,OAAO,EAAE,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA;QACrC,8CAA8C;IAClD,CAAC,CACJ,CAAC;IAEF,OAAO,EAAE,CAAC;AACd,CAAC;AAGD,OAAO,EAAE,oBAAoB,EAAE,CAAA"}

package/node/mat/closest-boundary-point/cull-bezier-pieces.d.ts

@@ -1,4 +1,4 @@
-import { BezierPiece } from "../bezier-piece";
+import { BezierPiece } from '../bezier-piece.js';
 /**
  * @hidden
  * @param bezierPieces

package/node/mat/closest-boundary-point/cull-bezier-pieces.js

@@ -1,8 +1,6 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const get_best_distance_squared_1 = require("./get-best-distance-squared");
-const cull_by_loose_bounding_box_1 = require("./cull-by-loose-bounding-box");
-const cull_by_tight_boundary_box_1 = require("./cull-by-tight-boundary-box");
+import { getBestDistanceSquared } from './get-best-distance-squared.js';
+import { cullByLooseBoundingBox } from './cull-by-loose-bounding-box.js';
+import { cullByTightBoundingBox } from './cull-by-tight-boundary-box.js';
 /**
  * @hidden
  * @param bezierPieces
@@ -12,11 +10,11 @@ const cull_by_tight_boundary_box_1 = require("./cull-by-tight-boundary-box");
 function cullBezierPieces(bezierPieces, p) {
     const CULL_THRESHOLD = 0;
     if (bezierPieces.length > CULL_THRESHOLD) {
-        let bestSquaredDistance = get_best_distance_squared_1.getBestDistanceSquared(bezierPieces, p);
-        bezierPieces = cull_by_loose_bounding_box_1.cullByLooseBoundingBox(bezierPieces, p, bestSquaredDistance);
-        bezierPieces = cull_by_tight_boundary_box_1.cullByTightBoundingBox(bezierPieces, p, bestSquaredDistance);
+        let bestSquaredDistance = getBestDistanceSquared(bezierPieces, p);
+        bezierPieces = cullByLooseBoundingBox(bezierPieces, p, bestSquaredDistance);
+        bezierPieces = cullByTightBoundingBox(bezierPieces, p, bestSquaredDistance);
     }
     return bezierPieces;
 }
-exports.cullBezierPieces = cullBezierPieces;
+export { cullBezierPieces };
 //# sourceMappingURL=cull-bezier-pieces.js.map

package/node/mat/closest-boundary-point/cull-bezier-pieces.js.map

@@ -1 +1 @@
-{"version":3,"file":"cull-bezier-pieces.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/cull-bezier-pieces.ts"],"names":[],"mappings":";;AAEA,2EAAqE;AACrE,6EAAsE;AACtE,6EAAsE;AAGtE;;;;;GAKG;AACH,SAAS,gBAAgB,CACjB,YAA2B,EAC3B,CAAW;IAEf,MAAM,cAAc,GAAG,CAAC,CAAC;IAEzB,IAAI,YAAY,CAAC,MAAM,GAAG,cAAc,EAAE;QACtC,IAAI,mBAAmB,GAAG,kDAAsB,CAC5C,YAAY,EAAE,CAAC,CAClB,CAAC;QACF,YAAY,GAAG,mDAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;QAEF,YAAY,GAAG,mDAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;KACL;IAED,OAAO,YAAY,CAAC;AACxB,CAAC;AAGQ,4CAAgB"}
+{"version":3,"file":"cull-bezier-pieces.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/cull-bezier-pieces.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AACzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAGzE;;;;;GAKG;AACH,SAAS,gBAAgB,CACjB,YAA2B,EAC3B,CAAW;IAEf,MAAM,cAAc,GAAG,CAAC,CAAC;IAEzB,IAAI,YAAY,CAAC,MAAM,GAAG,cAAc,EAAE;QACtC,IAAI,mBAAmB,GAAG,sBAAsB,CAC5C,YAAY,EAAE,CAAC,CAClB,CAAC;QACF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;QAEF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;KACL;IAED,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

package/node/mat/closest-boundary-point/cull-by-loose-bounding-box.d.ts

@@ -1,4 +1,4 @@
-import { BezierPiece } from "../bezier-piece";
+import { BezierPiece } from '../bezier-piece.js';
 /**
  * @hidden
  * When checking distances, ignore all those with closest possible distance

package/node/mat/closest-boundary-point/cull-by-loose-bounding-box.js

@@ -1,7 +1,5 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const flo_bezier3_1 = require("flo-bezier3");
-const get_closest_square_distance_to_rect_1 = require("../geometry/get-closest-square-distance-to-rect");
+import { getBoundingBox_ } from '../../get-bounding-box-.js';
+import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
 /**
  * @hidden
  * When checking distances, ignore all those with closest possible distance
@@ -15,13 +13,13 @@ function cullByLooseBoundingBox(bezierPieces, p, dSquared) {
     for (let i = 0; i < bezierPieces.length; i++) {
         let bezierPiece = bezierPieces[i];
         let ps = bezierPiece.curve.ps;
-        let boundingBox = flo_bezier3_1.getBoundingBox(ps);
-        let d = get_closest_square_distance_to_rect_1.getClosestSquareDistanceToRect(boundingBox, p);
+        let boundingBox = getBoundingBox_(ps);
+        let d = getClosestSquareDistanceToRect(boundingBox, p);
         if (d <= dSquared) {
             candidateBezierPieces.push(bezierPiece);
         }
     }
     return candidateBezierPieces;
 }
-exports.cullByLooseBoundingBox = cullByLooseBoundingBox;
+export { cullByLooseBoundingBox };
 //# sourceMappingURL=cull-by-loose-bounding-box.js.map