flo-mat 2.0.1 → 2.0.3

package/node/find-mats.js

@@ -1,126 +1,123 @@
-import { simplifyPaths } from 'flo-boolean';
-import { findAndAddAll3Prongs } from './mat/find-mat/find-and-add-3-prongs.js';
-import { createInitialCpGraph } from './mat/find-mat/create-initial-cp-graph.js';
-;
-import { addDebugInfo1, addDebugInfo2, addDebugInfo3, addDebugInfo4 } from './mat/find-mat/add-debug-info.js';
-import { getPotential2Prongs } from './mat/find-mat/get-potential-2-prongs.js';
-import { getSharpCorners } from './mat/find-mat/get-sharp-corners.js';
-import { findAndAdd2ProngsOnAllPaths } from './mat/find-mat/find-and-add-2-prongs-on-all-paths.js';
-import { getInterestingPointsOnLoop } from './mat/find-mat/create-get-interesting-points-on-loop.js';
-import { findAndAddHoleClosing2Prongs } from './mat/find-mat/find-and-add-hole-closing-2-prongs.js';
-import { getLoopsMetrics } from './loop/get-max-coordinate.js';
-/**
- * Finds and returns the Medial Axis Transforms (MATs) from the given array of
- * bezier loops representing shape boundaries.
- *
- * @param bezierLoops An array of (possibly intersecting) loops with each loop
- * representing one or more piecewise smooth closed curves (i.e. shapes). Each
- * loop consists of an array of beziers represented by an array of control
- * points with 2,3 or 4 elements corresponding to linear, quadratic and cubic
- * beziers respectively. Each point is a two-element array (ordered pair), the
- * first of which is the x-coordinate and the second the y-coordinate.
- *
- * @param maxCurviness The maximum value the 'curviness' of a curve can have
- * before an additional MAT point is inserted in between. Defaults to 0.4.
- * (Curviness is measured as the total angle in radians between the consecutive
- * vectors formed by the ordered control points of th bezier curve). The value
- * is clipped in the range `[0.05,3]`.
- * @param maxLength The maximum length a curve can have before an additional MAT
- * point is inserted. This value is scaled to a reference 1024 x 1024
- * grid (e.g. if the shape fits in a 512 x 512 axis-aligned box the value will be
- * halved, e.g. from 10 to 5). Together with maxCurviness it represents a
- * tolerance for the accuracy of the MAT. Defaults to 4. The value is clipped
- * in [1,100].
- */
-function findMats(bezierLoops, maxCurviness = 0.4, maxLength = 4) {
-    if (typeof _debug_ !== 'undefined') {
-        var timingStart = performance.now();
-    }
-    let maxCoordinate;
-    let minBezLength;
-    ({ maxCurviness, maxLength, maxCoordinate, minBezLength } =
-        getSizeParams(bezierLoops, maxCurviness, maxLength));
-    let loopss = simplifyPaths(bezierLoops, maxCoordinate);
-    let mats = [];
-    for (let loops of loopss) {
-        let mat = findMat(loops, minBezLength, maxCurviness, maxLength, maxCoordinate);
-        if (mat) {
-            mats.push(mat);
-        }
-    }
-    return mats;
-}
-function getSizeParams(bezierLoops, maxCurviness, maxLength) {
-    // Gather some shape metrics
-    let { maxCoordinate, maxRadius } = getLoopsMetrics(bezierLoops);
-    let expMax = Math.ceil(Math.log2(maxCoordinate));
-    let minBezLengthSigBits = 14;
-    /**
-     * If a curve is shorter than this value then no points on it will be
-     * selected for the purpose of finding the MAT.
-     */
-    let minBezLength = 2 ** expMax * 2 ** (-minBezLengthSigBits);
-    // Limit the tolerance to a reasonable level
-    if (maxCurviness < 0.05) {
-        maxCurviness = 0.05;
-    }
-    if (maxCurviness > 3) {
-        maxCurviness = 3;
-    }
-    // Limit the tolerance to a reasonable level
-    if (maxLength < 0.1) {
-        maxLength = 0.1;
-    }
-    if (maxLength > 100) {
-        maxLength = 100;
-    }
-    // Adjust length tolerance according to a reference max coordinate
-    let expMaxRadius = Math.ceil(Math.log2(maxRadius));
-    let maxLengthSigBits = 10; // 1024 x 1024
-    maxLength = maxLength * (2 ** expMaxRadius * 2 ** (-maxLengthSigBits));
-    return { maxCurviness, maxLength, maxCoordinate, minBezLength };
-}
-/**
- * @hidden
- * Find the MAT of the given loops.
- * @param loops The loops (that as a precondition must be ordered from highest
- * (i.e. smallest y-value) topmost point loops to lowest)
- */
-function findMat(loops, minBezLength, maxCurviness, maxLength, maxCoordinate) {
-    addDebugInfo1(loops);
-    // Gets interesting points on the shape, i.e. those that makes sense to use 
-    // for the 2-prong procedure.
-    let pointsPerLoop = loops.map(getInterestingPointsOnLoop(minBezLength, maxCurviness, maxLength));
-    let for2ProngsPerLoop = getPotential2Prongs(pointsPerLoop);
-    let sharpCornersPerLoop = getSharpCorners(pointsPerLoop);
-    let cpTrees = new Map();
-    let cpNode = createInitialCpGraph(loops, cpTrees, sharpCornersPerLoop);
-    findAndAddHoleClosing2Prongs(loops, cpTrees, maxCoordinate);
-    if (typeof _debug_ !== 'undefined') {
-        if (_debug_.directives.stopAfterHoleClosers) {
-            return undefined;
-        }
-    }
-    addDebugInfo2();
-    cpNode = findAndAdd2ProngsOnAllPaths(loops, cpTrees, for2ProngsPerLoop, maxCoordinate);
-    addDebugInfo3();
-    if (typeof _debug_ !== 'undefined') {
-        if (_debug_.directives.stopAfterTwoProngs) {
-            return undefined;
-        }
-    }
-    if (cpNode === undefined) {
-        return undefined;
-    }
-    findAndAddAll3Prongs(cpTrees, cpNode, maxCoordinate);
-    if (typeof _debug_ !== 'undefined') {
-        if (_debug_.directives.stopAfterThreeProngs) {
-            return undefined;
-        }
-    }
-    let mat = { cpNode, cpTrees };
-    addDebugInfo4(mat);
-    return mat;
-}
-export { findMats };
+import { simplifyPaths } from 'flo-boolean';
+import { findAndAddAll3Prongs } from './mat/find-mat/find-and-add-3-prongs.js';
+import { createInitialCpGraph } from './mat/find-mat/create-initial-cp-graph.js';
+import { addDebugInfo1, addDebugInfo2, addDebugInfo3, addDebugInfo4 } from './mat/find-mat/add-debug-info.js';
+import { getPotential2Prongs } from './mat/find-mat/get-potential-2-prongs.js';
+import { getSharpCorners } from './mat/find-mat/get-sharp-corners.js';
+import { findAndAdd2ProngsOnAllPaths } from './mat/find-mat/find-and-add-2-prongs-on-all-paths.js';
+import { getInterestingPointsOnLoop } from './mat/find-mat/create-get-interesting-points-on-loop.js';
+import { findAndAddHoleClosing2Prongs } from './mat/find-mat/find-and-add-hole-closing-2-prongs.js';
+import { getLoopsMetrics } from './loop/get-max-coordinate.js';
+/**
+ * Finds and returns the Medial Axis Transforms (MATs) from the given array of
+ * bezier loops representing shape boundaries.
+ *
+ * @param bezierLoops An array of (possibly intersecting) loops with each loop
+ * representing one or more piecewise smooth closed curves (i.e. shapes). Each
+ * loop consists of an array of beziers represented by an array of control
+ * points with 2,3 or 4 elements corresponding to linear, quadratic and cubic
+ * beziers respectively. Each point is a two-element array (ordered pair), the
+ * first of which is the x-coordinate and the second the y-coordinate.
+ *
+ * @param maxCurviness The maximum value the 'curviness' of a curve can have
+ * before an additional MAT point is inserted in between. Defaults to 0.4.
+ * (Curviness is measured as the total angle in radians between the consecutive
+ * vectors formed by the ordered control points of th bezier curve). The value
+ * is clipped in the range `[0.05,3]`.
+ * @param maxLength The maximum length a curve can have before an additional MAT
+ * point is inserted. This value is scaled to a reference 1024 x 1024
+ * grid (e.g. if the shape fits in a 512 x 512 axis-aligned box the value will be
+ * halved, e.g. from 10 to 5). Together with maxCurviness it represents a
+ * tolerance for the accuracy of the MAT. Defaults to 4. The value is clipped
+ * in [1,100].
+ */
+function findMats(bezierLoops, maxCurviness = 0.4, maxLength = 4) {
+    // if (typeof _debug_ !== 'undefined') { var timingStart = performance.now(); }
+    let maxCoordinate;
+    let minBezLength;
+    ({ maxCurviness, maxLength, maxCoordinate, minBezLength } =
+        getSizeParams(bezierLoops, maxCurviness, maxLength));
+    const loopss = simplifyPaths(bezierLoops, maxCoordinate);
+    const mats = [];
+    for (const loops of loopss) {
+        const mat = findMat(loops, minBezLength, maxCurviness, maxLength, maxCoordinate);
+        if (mat) {
+            mats.push(mat);
+        }
+    }
+    return mats;
+}
+function getSizeParams(bezierLoops, maxCurviness, maxLength) {
+    // Gather some shape metrics
+    const { maxCoordinate, maxRadius } = getLoopsMetrics(bezierLoops);
+    const expMax = Math.ceil(Math.log2(maxCoordinate));
+    const minBezLengthSigBits = 14;
+    /**
+     * If a curve is shorter than this value then no points on it will be
+     * selected for the purpose of finding the MAT.
+     */
+    const minBezLength = 2 ** expMax * 2 ** (-minBezLengthSigBits);
+    // Limit the tolerance to a reasonable level
+    if (maxCurviness < 0.05) {
+        maxCurviness = 0.05;
+    }
+    if (maxCurviness > 3) {
+        maxCurviness = 3;
+    }
+    // Limit the tolerance to a reasonable level
+    if (maxLength < 0.1) {
+        maxLength = 0.1;
+    }
+    if (maxLength > 100) {
+        maxLength = 100;
+    }
+    // Adjust length tolerance according to a reference max coordinate
+    const expMaxRadius = Math.ceil(Math.log2(maxRadius));
+    const maxLengthSigBits = 10; // 1024 x 1024
+    maxLength = maxLength * (2 ** expMaxRadius * 2 ** (-maxLengthSigBits));
+    return { maxCurviness, maxLength, maxCoordinate, minBezLength };
+}
+/**
+ * @hidden
+ * Find the MAT of the given loops.
+ * @param loops The loops (that as a precondition must be ordered from highest
+ * (i.e. smallest y-value) topmost point loops to lowest)
+ */
+function findMat(loops, minBezLength, maxCurviness, maxLength, maxCoordinate) {
+    addDebugInfo1(loops);
+    // Gets interesting points on the shape, i.e. those that makes sense to use 
+    // for the 2-prong procedure.
+    const pointsPerLoop = loops.map(getInterestingPointsOnLoop(minBezLength, maxCurviness, maxLength));
+    const for2ProngsPerLoop = getPotential2Prongs(pointsPerLoop);
+    const sharpCornersPerLoop = getSharpCorners(pointsPerLoop);
+    const cpTrees = new Map();
+    let cpNode = createInitialCpGraph(loops, cpTrees, sharpCornersPerLoop);
+    findAndAddHoleClosing2Prongs(loops, cpTrees, maxCoordinate);
+    if (typeof _debug_ !== 'undefined') {
+        if (_debug_.directives.stopAfterHoleClosers) {
+            return undefined;
+        }
+    }
+    addDebugInfo2();
+    cpNode = findAndAdd2ProngsOnAllPaths(loops, cpTrees, for2ProngsPerLoop, maxCoordinate);
+    addDebugInfo3();
+    if (typeof _debug_ !== 'undefined') {
+        if (_debug_.directives.stopAfterTwoProngs) {
+            return undefined;
+        }
+    }
+    if (cpNode === undefined) {
+        return undefined;
+    }
+    findAndAddAll3Prongs(cpTrees, cpNode, maxCoordinate);
+    if (typeof _debug_ !== 'undefined') {
+        if (_debug_.directives.stopAfterThreeProngs) {
+            return undefined;
+        }
+    }
+    const mat = { cpNode, cpTrees };
+    addDebugInfo4(mat);
+    return mat;
+}
+export { findMats };
 //# sourceMappingURL=find-mats.js.map

package/node/find-mats.js.map

@@ -1 +1 @@
-{"version":3,"file":"find-mats.js","sourceRoot":"","sources":["../src/find-mats.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAK5C,OAAO,EAAE,oBAAoB,EAAE,MAAM,yCAAyC,CAAC;AAC/E,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AAAA,CAAC;AAClF,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,kCAAkC,CAAC;AAC9G,OAAO,EAAE,mBAAmB,EAAE,MAAM,0CAA0C,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAC;AACtE,OAAO,EAAE,2BAA2B,EAAE,MAAM,sDAAsD,CAAC;AACnG,OAAO,EAAE,0BAA0B,EAAE,MAAM,yDAAyD,CAAC;AACrG,OAAO,EAAE,4BAA4B,EAAE,MAAM,sDAAsD,CAAC;AACpG,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAG/D;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAS,QAAQ,CACf,WAA2B,EAC3B,YAAY,GAAG,GAAG,EACZ,SAAS,GAAG,CAAC;IAEpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,IAAI,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;KAAE;IAE5E,IAAI,aAAqB,CAAC;IAC1B,IAAI,YAAoB,CAAC;IACzB,CAAC,EAAE,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY,EAAE;QACxD,aAAa,CAAC,WAAW,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;IAEtD,IAAI,MAAM,GAAG,aAAa,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IAEvD,IAAI,IAAI,GAAU,EAAE,CAAC;IACrB,KAAK,IAAI,KAAK,IAAI,MAAM,EAAE;QACzB,IAAI,GAAG,GAAG,OAAO,CAChB,KAAK,EACL,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,aAAa,CACb,CAAC;QACF,IAAI,GAAG,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAAE;KAC5B;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAGD,SAAS,aAAa,CACpB,WAA2B,EAC3B,YAAoB,EACd,SAAiB;IAExB,4BAA4B;IAC5B,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAChE,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACjD,IAAI,mBAAmB,GAAG,EAAE,CAAC;IAC7B;;;OAGG;IACH,IAAI,YAAY,GAAG,CAAC,IAAE,MAAM,GAAG,CAAC,IAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC;IAEzD,4CAA4C;IAC5C,IAAI,YAAY,GAAG,IAAI,EAAE;QAAE,YAAY,GAAG,IAAI,CAAC;KAAE;IACjD,IAAI,YAAY,GAAG,CAAC,EAAK;QAAE,YAAY,GAAG,CAAC,CAAC;KAAK;IACjD,4CAA4C;IAC5C,IAAI,SAAS,GAAG,GAAG,EAAE;QAAE,SAAS,GAAG,GAAG,CAAC;KAAE;IACzC,IAAI,SAAS,GAAG,GAAG,EAAE;QAAE,SAAS,GAAG,GAAG,CAAC;KAAE;IACzC,kEAAkE;IAClE,IAAI,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACnD,IAAI,gBAAgB,GAAG,EAAE,CAAC,CAAE,cAAc;IAC1C,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC,IAAE,YAAY,GAAG,CAAC,IAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEnE,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;AACjE,CAAC;AAGD;;;;;GAKG;AACH,SAAS,OAAO,CACd,KAAa,EACb,YAAoB,EACpB,YAAoB,EACpB,SAAiB,EACjB,aAAqB;IAEtB,aAAa,CAAC,KAAK,CAAC,CAAC;IAErB,4EAA4E;IAC5E,6BAA6B;IAC7B,IAAI,aAAa,GAAG,KAAK,CAAC,GAAG,CAC5B,0BAA0B,CAAC,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CACjE,CAAC;IAEF,IAAI,iBAAiB,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;IAC3D,IAAI,mBAAmB,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC;IAEzD,IAAI,OAAO,GAAgC,IAAI,GAAG,EAAE,CAAC;IACrD,IAAI,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;IAEvE,4BAA4B,CAAC,KAAK,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;IAE5D,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,OAAO,CAAC,UAAU,CAAC,oBAAoB,EAAE;YAC5C,OAAO,SAAS,CAAC;SACjB;KACD;IAED,aAAa,EAAE,CAAC;IAEhB,MAAM,GAAG,2BAA2B,CACnC,KAAK,EAAE,OAAO,EAAE,iBAAiB,EAAE,aAAa,CAChD,CAAC;IAEF,aAAa,EAAE,CAAC;IAEhB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,OAAO,CAAC,UAAU,CAAC,kBAAkB,EAAE;YAC1C,OAAO,SAAS,CAAC;SACjB;KACD;IAED,IAAI,MAAM,KAAK,SAAS,EAAE;QAAE,OAAO,SAAS,CAAC;KAAE;IAE/C,oBAAoB,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;IAErD,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,OAAO,CAAC,UAAU,CAAC,oBAAoB,EAAE;YAC5C,OAAO,SAAS,CAAC;SACjB;KACD;IAED,IAAI,GAAG,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IAE9B,aAAa,CAAC,GAAG,CAAC,CAAC;IAEnB,OAAO,GAAG,CAAC;AACZ,CAAC;AAGD,OAAO,EAAE,QAAQ,EAAE,CAAA"}
+{"version":3,"file":"find-mats.js","sourceRoot":"","sources":["../src/find-mats.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAK5C,OAAO,EAAE,oBAAoB,EAAE,MAAM,yCAAyC,CAAC;AAC/E,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,kCAAkC,CAAC;AAC9G,OAAO,EAAE,mBAAmB,EAAE,MAAM,0CAA0C,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAC;AACtE,OAAO,EAAE,2BAA2B,EAAE,MAAM,sDAAsD,CAAC;AACnG,OAAO,EAAE,0BAA0B,EAAE,MAAM,yDAAyD,CAAC;AACrG,OAAO,EAAE,4BAA4B,EAAE,MAAM,sDAAsD,CAAC;AACpG,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAG/D;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAS,QAAQ,CACf,WAA2B,EAC3B,YAAY,GAAG,GAAG,EACZ,SAAS,GAAG,CAAC;IAEpB,+EAA+E;IAE/E,IAAI,aAAqB,CAAC;IAC1B,IAAI,YAAoB,CAAC;IACzB,CAAC,EAAE,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY,EAAE;QACxD,aAAa,CAAC,WAAW,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;IAEtD,MAAM,MAAM,GAAG,aAAa,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IAEzD,MAAM,IAAI,GAAU,EAAE,CAAC;IACvB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC3B,MAAM,GAAG,GAAG,OAAO,CAClB,KAAK,EACL,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,aAAa,CACb,CAAC;QACF,IAAI,GAAG,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAAE;KAC5B;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAGD,SAAS,aAAa,CACpB,WAA2B,EAC3B,YAAoB,EACd,SAAiB;IAExB,4BAA4B;IAC5B,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAClE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACnD,MAAM,mBAAmB,GAAG,EAAE,CAAC;IAC/B;;;OAGG;IACH,MAAM,YAAY,GAAG,CAAC,IAAE,MAAM,GAAG,CAAC,IAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC;IAE3D,4CAA4C;IAC5C,IAAI,YAAY,GAAG,IAAI,EAAE;QAAE,YAAY,GAAG,IAAI,CAAC;KAAE;IACjD,IAAI,YAAY,GAAG,CAAC,EAAK;QAAE,YAAY,GAAG,CAAC,CAAC;KAAK;IACjD,4CAA4C;IAC5C,IAAI,SAAS,GAAG,GAAG,EAAE;QAAE,SAAS,GAAG,GAAG,CAAC;KAAE;IACzC,IAAI,SAAS,GAAG,GAAG,EAAE;QAAE,SAAS,GAAG,GAAG,CAAC;KAAE;IACzC,kEAAkE;IAClE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACrD,MAAM,gBAAgB,GAAG,EAAE,CAAC,CAAE,cAAc;IAC5C,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC,IAAE,YAAY,GAAG,CAAC,IAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEnE,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;AACjE,CAAC;AAGD;;;;;GAKG;AACH,SAAS,OAAO,CACd,KAAa,EACb,YAAoB,EACpB,YAAoB,EACpB,SAAiB,EACjB,aAAqB;IAEtB,aAAa,CAAC,KAAK,CAAC,CAAC;IAErB,4EAA4E;IAC5E,6BAA6B;IAC7B,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAC9B,0BAA0B,CAAC,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CACjE,CAAC;IAEF,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;IAC7D,MAAM,mBAAmB,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC;IAE3D,MAAM,OAAO,GAAgC,IAAI,GAAG,EAAE,CAAC;IACvD,IAAI,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;IAEvE,4BAA4B,CAAC,KAAK,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;IAE5D,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,OAAO,CAAC,UAAU,CAAC,oBAAoB,EAAE;YAC5C,OAAO,SAAS,CAAC;SACjB;KACD;IAED,aAAa,EAAE,CAAC;IAEhB,MAAM,GAAG,2BAA2B,CACnC,KAAK,EAAE,OAAO,EAAE,iBAAiB,EAAE,aAAa,CAChD,CAAC;IAEF,aAAa,EAAE,CAAC;IAEhB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,OAAO,CAAC,UAAU,CAAC,kBAAkB,EAAE;YAC1C,OAAO,SAAS,CAAC;SACjB;KACD;IAED,IAAI,MAAM,KAAK,SAAS,EAAE;QAAE,OAAO,SAAS,CAAC;KAAE;IAE/C,oBAAoB,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;IAErD,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,OAAO,CAAC,UAAU,CAAC,oBAAoB,EAAE;YAC5C,OAAO,SAAS,CAAC;SACjB;KACD;IAED,MAAM,GAAG,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IAEhC,aAAa,CAAC,GAAG,CAAC,CAAC;IAEnB,OAAO,GAAG,CAAC;AACZ,CAAC;AAGD,OAAO,EAAE,QAAQ,EAAE,CAAA"}

package/node/get-boundary-bezier-parts-to-next.d.ts

@@ -1,9 +1,9 @@
-import { BezierPiece } from 'flo-bezier3';
-import { CpNode } from './cp-node.js';
-/**
- * Returns the ordered bezier curves from this CpNode to the next CpNode
- * on the boundary.
- * @param cpNode
- */
-declare function getBoundaryBezierPartsToNext(cpNode: CpNode): BezierPiece[];
-export { getBoundaryBezierPartsToNext };
+import { BezierPiece } from 'flo-bezier3';
+import { CpNode } from './cp-node.js';
+/**
+ * Returns the ordered bezier curves from this CpNode to the next CpNode
+ * on the boundary.
+ * @param cpNode
+ */
+declare function getBoundaryBezierPartsToNext(cpNode: CpNode): BezierPiece[];
+export { getBoundaryBezierPartsToNext };

package/node/get-boundary-bezier-parts-to-next.js

@@ -1,43 +1,43 @@
-/**
- * Returns the ordered bezier curves from this CpNode to the next CpNode
- * on the boundary.
- * @param cpNode
- */
-function getBoundaryBezierPartsToNext(cpNode) {
-    let cpThis = cpNode;
-    let cpNext = cpNode.next;
-    let posThis = cpThis.cp.pointOnShape;
-    let posNext = cpNext.cp.pointOnShape;
-    let curveThis = posThis.curve;
-    let curveNext = posNext.curve;
-    if (curveThis.loop !== curveNext.loop) {
-        // It is a hole-closer going over to the other loop - a kind of terminal
-        // CpNode.
-        return undefined;
-    }
-    let bezierParts = [];
-    if (curveNext === curveThis) {
-        bezierParts.push({ ps: posThis.curve.ps, ts: [posThis.t, posNext.t] });
-    }
-    else {
-        bezierParts.push({ ps: posThis.curve.ps, ts: [posThis.t, 1] });
-        addSkippedBeziers(bezierParts, posThis.curve, posNext.curve, posNext.t);
-    }
-    return bezierParts;
-}
-/**
- * @hidden
- * Adds pieces of skipped beziers.
- */
-function addSkippedBeziers(bezierParts, curveStart, curveEnd, t1) {
-    let curveThis = curveStart;
-    do {
-        curveThis = curveThis.next;
-        let bezierPart = curveThis === curveEnd
-            ? { ps: curveThis.ps, ts: [0, t1] }
-            : { ps: curveThis.ps, ts: [0, 1] };
-        bezierParts.push(bezierPart);
-    } while (curveThis !== curveEnd);
-}
-export { getBoundaryBezierPartsToNext };
+/**
+ * Returns the ordered bezier curves from this CpNode to the next CpNode
+ * on the boundary.
+ * @param cpNode
+ */
+function getBoundaryBezierPartsToNext(cpNode) {
+    const cpThis = cpNode;
+    const cpNext = cpNode.next;
+    const posThis = cpThis.cp.pointOnShape;
+    const posNext = cpNext.cp.pointOnShape;
+    const curveThis = posThis.curve;
+    const curveNext = posNext.curve;
+    if (curveThis.loop !== curveNext.loop) {
+        // It is a hole-closer going over to the other loop - a kind of terminal
+        // CpNode.
+        return undefined;
+    }
+    const bezierParts = [];
+    if (curveNext === curveThis) {
+        bezierParts.push({ ps: posThis.curve.ps, ts: [posThis.t, posNext.t] });
+    }
+    else {
+        bezierParts.push({ ps: posThis.curve.ps, ts: [posThis.t, 1] });
+        addSkippedBeziers(bezierParts, posThis.curve, posNext.curve, posNext.t);
+    }
+    return bezierParts;
+}
+/**
+ * @hidden
+ * Adds pieces of skipped beziers.
+ */
+function addSkippedBeziers(bezierParts, curveStart, curveEnd, t1) {
+    let curveThis = curveStart;
+    do {
+        curveThis = curveThis.next;
+        const bezierPart = curveThis === curveEnd
+            ? { ps: curveThis.ps, ts: [0, t1] }
+            : { ps: curveThis.ps, ts: [0, 1] };
+        bezierParts.push(bezierPart);
+    } while (curveThis !== curveEnd);
+}
+export { getBoundaryBezierPartsToNext };
 //# sourceMappingURL=get-boundary-bezier-parts-to-next.js.map

package/node/get-boundary-bezier-parts-to-next.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-boundary-bezier-parts-to-next.js","sourceRoot":"","sources":["../src/get-boundary-bezier-parts-to-next.ts"],"names":[],"mappings":"AAKA;;;;GAIG;AACH,SAAS,4BAA4B,CAAC,MAAc;IAChD,IAAI,MAAM,GAAG,MAAM,CAAC;IACpB,IAAI,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAEzB,IAAI,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IACrC,IAAI,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IAErC,IAAI,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAC9B,IAAI,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAE9B,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE;QACnC,wEAAwE;QACxE,UAAU;QACV,OAAO,SAAS,CAAC;KACpB;IAED,IAAI,WAAW,GAAkB,EAAE,CAAC;IAEpC,IAAI,SAAS,KAAK,SAAS,EAAE;QACzB,WAAW,CAAC,IAAI,CACZ,EAAE,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CACvD,CAAC;KACL;SAAM;QACH,WAAW,CAAC,IAAI,CACZ,EAAE,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAC/C,CAAC;QAEF,iBAAiB,CACT,WAAW,EACX,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;KACL;IAED,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,WAA+C,EAC/C,UAAkB,EAClB,QAAkB,EAClB,EAAmB;IAEvB,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG;QACC,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,IAAI,UAAU,GAAG,SAAS,KAAK,QAAQ;YACnC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;YACnC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAA;QAEtC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;KAChC,QAAQ,SAAS,KAAK,QAAQ,EAAE;AAGrC,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}
+{"version":3,"file":"get-boundary-bezier-parts-to-next.js","sourceRoot":"","sources":["../src/get-boundary-bezier-parts-to-next.ts"],"names":[],"mappings":"AAKA;;;;GAIG;AACH,SAAS,4BAA4B,CAAC,MAAc;IAChD,MAAM,MAAM,GAAG,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAE3B,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IAEvC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAChC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAEhC,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE;QACnC,wEAAwE;QACxE,UAAU;QACV,OAAO,SAAS,CAAC;KACpB;IAED,MAAM,WAAW,GAAkB,EAAE,CAAC;IAEtC,IAAI,SAAS,KAAK,SAAS,EAAE;QACzB,WAAW,CAAC,IAAI,CACZ,EAAE,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CACvD,CAAC;KACL;SAAM;QACH,WAAW,CAAC,IAAI,CACZ,EAAE,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAC/C,CAAC;QAEF,iBAAiB,CACT,WAAW,EACX,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;KACL;IAED,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,WAA+C,EAC/C,UAAkB,EAClB,QAAkB,EAClB,EAAmB;IAEvB,IAAI,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG;QACC,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,MAAM,UAAU,GAAG,SAAS,KAAK,QAAQ;YACrC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;YACnC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAA;QAEtC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;KAChC,QAAQ,SAAS,KAAK,QAAQ,EAAE;AAGrC,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}

package/node/get-boundary-beziers-to-next.d.ts

@@ -1,8 +1,8 @@
-import { CpNode } from './cp-node.js';
-/**
- * Returns the ordered bezier curves from this CpNode to the next CpNode
- * on the boundary.
- * @param cpNode
- */
-declare function getBoundaryBeziersToNext(cpNode: CpNode): number[][][];
-export { getBoundaryBeziersToNext };
+import { CpNode } from './cp-node.js';
+/**
+ * Returns the ordered bezier curves from this CpNode to the next CpNode
+ * on the boundary.
+ * @param cpNode
+ */
+declare function getBoundaryBeziersToNext(cpNode: CpNode): number[][][];
+export { getBoundaryBeziersToNext };

package/node/get-boundary-beziers-to-next.js

@@ -1,45 +1,45 @@
-// qqq import { fromTo, fromTTo1, from0ToT } from 'flo-bezier3';
-import { fromTo } from 'flo-bezier3';
-/**
- * Returns the ordered bezier curves from this CpNode to the next CpNode
- * on the boundary.
- * @param cpNode
- */
-function getBoundaryBeziersToNext(cpNode) {
-    let cpThis = cpNode;
-    let cpNext = cpNode.next;
-    let posThis = cpThis.cp.pointOnShape;
-    let posNext = cpNext.cp.pointOnShape;
-    let curveThis = posThis.curve;
-    let curveNext = posNext.curve;
-    if (curveThis.loop !== curveNext.loop) {
-        // It is a hole-closer going over to the other loop - a kind of terminal
-        // CpNode.
-        return undefined;
-    }
-    let beziers = [];
-    if (curveNext === curveThis) {
-        beziers.push(fromTo(posThis.curve.ps, posThis.t, posNext.t));
-    }
-    else {
-        beziers.push(fromTo(posThis.curve.ps, posThis.t, 1));
-        addSkippedBeziers(beziers, posThis.curve, posNext.curve, posNext.t);
-    }
-    return beziers;
-}
-/**
- * Adds pieces of skipped beziers.
- * @hidden
- */
-function addSkippedBeziers(beziers, curveStart, curveEnd, t1) {
-    let curveThis = curveStart;
-    do {
-        curveThis = curveThis.next;
-        let tEnd = curveThis === curveEnd ? t1 : 1;
-        beziers.push(
-        // qqq from0ToT(curveThis.ps, tEnd) 
-        fromTo(curveThis.ps, 0, tEnd));
-    } while (curveThis !== curveEnd);
-}
-export { getBoundaryBeziersToNext };
+// qqq import { fromTo, fromTTo1, from0ToT } from 'flo-bezier3';
+import { fromTo } from 'flo-bezier3';
+/**
+ * Returns the ordered bezier curves from this CpNode to the next CpNode
+ * on the boundary.
+ * @param cpNode
+ */
+function getBoundaryBeziersToNext(cpNode) {
+    const cpThis = cpNode;
+    const cpNext = cpNode.next;
+    const posThis = cpThis.cp.pointOnShape;
+    const posNext = cpNext.cp.pointOnShape;
+    const curveThis = posThis.curve;
+    const curveNext = posNext.curve;
+    if (curveThis.loop !== curveNext.loop) {
+        // It is a hole-closer going over to the other loop - a kind of terminal
+        // CpNode.
+        return undefined;
+    }
+    const beziers = [];
+    if (curveNext === curveThis) {
+        beziers.push(fromTo(posThis.curve.ps, posThis.t, posNext.t));
+    }
+    else {
+        beziers.push(fromTo(posThis.curve.ps, posThis.t, 1));
+        addSkippedBeziers(beziers, posThis.curve, posNext.curve, posNext.t);
+    }
+    return beziers;
+}
+/**
+ * Adds pieces of skipped beziers.
+ * @hidden
+ */
+function addSkippedBeziers(beziers, curveStart, curveEnd, t1) {
+    let curveThis = curveStart;
+    do {
+        curveThis = curveThis.next;
+        const tEnd = curveThis === curveEnd ? t1 : 1;
+        beziers.push(
+        // qqq from0ToT(curveThis.ps, tEnd) 
+        fromTo(curveThis.ps, 0, tEnd));
+    } while (curveThis !== curveEnd);
+}
+export { getBoundaryBeziersToNext };
 //# sourceMappingURL=get-boundary-beziers-to-next.js.map

package/node/get-boundary-beziers-to-next.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-boundary-beziers-to-next.js","sourceRoot":"","sources":["../src/get-boundary-beziers-to-next.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAKrC;;;;GAIG;AACH,SAAS,wBAAwB,CAAC,MAAc;IAC5C,IAAI,MAAM,GAAG,MAAM,CAAC;IACpB,IAAI,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAEzB,IAAI,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IACrC,IAAI,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IAErC,IAAI,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAC9B,IAAI,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAE9B,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE;QACnC,wEAAwE;QACxE,UAAU;QACV,OAAO,SAAS,CAAC;KACpB;IAED,IAAI,OAAO,GAAG,EAAE,CAAC;IAEjB,IAAI,SAAS,KAAK,SAAS,EAAE;QACzB,OAAO,CAAC,IAAI,CACR,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CACjD,CAAC;KACL;SAAM;QACH,OAAO,CAAC,IAAI,CACR,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CACzC,CAAC;QAEF,iBAAiB,CACT,OAAO,EACP,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;KACL;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,OAAyB,EACzB,UAAkB,EAClB,QAAkB,EAClB,EAAmB;IAEvB,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,OAAO,CAAC,IAAI;QACR,oCAAoC;QACpC,MAAM,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAChC,CAAC;KACL,QAAQ,SAAS,KAAK,QAAQ,EAAE;AACrC,CAAC;AAGD,OAAO,EAAE,wBAAwB,EAAE,CAAA"}
+{"version":3,"file":"get-boundary-beziers-to-next.js","sourceRoot":"","sources":["../src/get-boundary-beziers-to-next.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAKrC;;;;GAIG;AACH,SAAS,wBAAwB,CAAC,MAAc;IAC5C,MAAM,MAAM,GAAG,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAE3B,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;IAEvC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAChC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAEhC,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,EAAE;QACnC,wEAAwE;QACxE,UAAU;QACV,OAAO,SAAS,CAAC;KACpB;IAED,MAAM,OAAO,GAAG,EAAE,CAAC;IAEnB,IAAI,SAAS,KAAK,SAAS,EAAE;QACzB,OAAO,CAAC,IAAI,CACR,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CACjD,CAAC;KACL;SAAM;QACH,OAAO,CAAC,IAAI,CACR,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CACzC,CAAC;QAEF,iBAAiB,CACT,OAAO,EACP,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,CAAC,CAChB,CAAC;KACL;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAGD;;;GAGG;AACH,SAAS,iBAAiB,CAClB,OAAyB,EACzB,UAAkB,EAClB,QAAkB,EAClB,EAAmB;IAEvB,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,OAAO,CAAC,IAAI;QACR,oCAAoC;QACpC,MAAM,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAChC,CAAC;KACL,QAAQ,SAAS,KAAK,QAAQ,EAAE;AACrC,CAAC;AAGD,OAAO,EAAE,wBAAwB,EAAE,CAAA"}

package/node/get-bounding-box-.d.ts

@@ -1,2 +1,2 @@
-declare const getBoundingBox_: (a: number[][]) => number[][];
-export { getBoundingBox_ };
+declare const getBoundingBox_: (a: number[][]) => number[][];
+export { getBoundingBox_ };

package/node/get-bounding-box-.js

@@ -1,5 +1,5 @@
-import { getBoundingBox } from "flo-bezier3";
-import { memoize } from "flo-memoize";
-const getBoundingBox_ = memoize(getBoundingBox);
-export { getBoundingBox_ };
+import { getBoundingBox } from "flo-bezier3";
+import { memoize } from "flo-memoize";
+const getBoundingBox_ = memoize(getBoundingBox);
+export { getBoundingBox_ };
 //# sourceMappingURL=get-bounding-box-.js.map

package/node/get-branches.d.ts

@@ -1,12 +1,12 @@
-import { CpNode } from './cp-node.js';
-/**
- * Traverses all edges (depth first) of the given MAT tree starting at the given
- * vertex (represented by a [[CpNode]]). Returns the result as an array of
- * smooth branches, where smoothness is total or within a given tolerance.
- * @param cpNode Any [[CpNode]] representing the start vertex.
- * @param tolerance Tolerance given as the degrees difference of the unit
- * direction vectors at the interface between curves. A tolerance of zero means
- * perfect smoothness is required.
- */
-declare function getBranches(cpNode: CpNode, tolerance?: number): CpNode[][];
-export { getBranches };
+import { CpNode } from './cp-node.js';
+/**
+ * Traverses all edges (depth first) of the given MAT tree starting at the given
+ * vertex (represented by a [[CpNode]]). Returns the result as an array of
+ * smooth branches, where smoothness is total or within a given tolerance.
+ * @param cpNode Any [[CpNode]] representing the start vertex.
+ * @param tolerance Tolerance given as the degrees difference of the unit
+ * direction vectors at the interface between curves. A tolerance of zero means
+ * perfect smoothness is required.
+ */
+declare function getBranches(cpNode: CpNode, tolerance?: number): CpNode[][];
+export { getBranches };