flo-mat 4.0.2 → 4.0.3

package/node/reconstruct-from-mat/get-mbss-by-loop-per-sat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-mbss-by-loop-per-sat.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/get-mbss-by-loop-per-sat.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,uBAAuB,EAAE,MAAM,oCAAoC,CAAC;AAC7E,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAG/D,SAAS,mBAAmB,CACpB,IAAW,EACX,QAAgB;IAEpB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAEtC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;IAEnD,OAAO,cAAc,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;AACvD,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}

package/node/reconstruct-from-mat/get-mbss-by-loop-with-opp-arr.d.ts

@@ -0,0 +1,7 @@
+import type { CpNode } from "../cp-node/cp-node.js";
+import type { MatchedBeziers } from "./matched-beziers.js";
+declare function getMbssByLoopWithOppArr(cpNodess: CpNode[][]): {
+    mbssByLoop: (MatchedBeziers[] | undefined)[][];
+    oppArr: [[number, number], [number, number]][];
+};
+export { getMbssByLoopWithOppArr };

package/node/reconstruct-from-mat/get-mbss-by-loop-with-opp-arr.js

@@ -0,0 +1,47 @@
+import { getMatchingBeziers } from "./get-matching-beziers.js";
+import { isFullyTerminating } from "./is-fully-terminating.js";
+function getMbssByLoopWithOppArr(cpNodess) {
+    const mbssByLoop = [];
+    /**
+     * An array with each entry being a pair of indices mapping from
+     * `MatchedBeziers[]` on one side to `MatchedBeziers[]` on the other side
+     */
+    const mbMap = new Map();
+    for (let l = 0; l < cpNodess.length; l++) {
+        const cpNodes = cpNodess[l];
+        const mbss = [];
+        for (let i = 0; i < cpNodes.length; i++) {
+            const cpNode = cpNodes[i];
+            mbMap.set(cpNode, [l, i]);
+            const mbs = getMatchingBeziers(cpNode);
+            mbss.push(mbs);
+        }
+        mbssByLoop.push(mbss);
+    }
+    const oppArr = [];
+    for (let l = 0; l < cpNodess.length; l++) {
+        const cpNodes = cpNodess[l];
+        for (let i = 0; i < cpNodes.length; i++) {
+            const cpNode = cpNodes[i];
+            const cpNodeOpp = isFullyTerminating(cpNode)
+                ? undefined // no opposite boundary
+                : cpNode.next.prevOnCircle;
+            // if (cpNodeOpp === undefined) {
+            //     continue;
+            // }
+            const oppIdxs = cpNodeOpp === undefined
+                ? [255, 65535]
+                : mbMap.get(cpNodeOpp);
+            const mbs = mbssByLoop[l][i];
+            if (oppIdxs !== undefined && mbs !== undefined) {
+                oppArr.push([[l, i], oppIdxs]);
+            }
+            else {
+                oppArr.push([[l, i], [255, 65535]]);
+            }
+        }
+    }
+    return { mbssByLoop, oppArr };
+}
+export { getMbssByLoopWithOppArr };
+//# sourceMappingURL=get-mbss-by-loop-with-opp-arr.js.map

package/node/reconstruct-from-mat/get-mbss-by-loop-with-opp-arr.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-mbss-by-loop-with-opp-arr.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/get-mbss-by-loop-with-opp-arr.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAG/D,SAAS,uBAAuB,CACxB,QAAoB;IAExB,MAAM,UAAU,GAAuC,EAAE,CAAC;IAE1D;;;OAGG;IACH,MAAM,KAAK,GAAiC,IAAI,GAAG,EAAE,CAAC;IAEtD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE5B,MAAM,IAAI,GAAqC,EAAE,CAAC;QAClD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAE1B,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;YAEzB,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;YAEvC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;QAED,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAGD,MAAM,MAAM,GAAwC,EAAE,CAAC;IAEvD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAE1B,MAAM,SAAS,GAAG,kBAAkB,CAAC,MAAM,CAAC;gBACxC,CAAC,CAAC,SAAS,CAAC,uBAAuB;gBACnC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;YAE/B,iCAAiC;YACjC,gBAAgB;YAChB,IAAI;YAEJ,MAAM,OAAO,GAAG,SAAS,KAAK,SAAS;gBACnC,CAAC,CAAC,CAAC,GAAG,EAAC,KAAK,CAAoB;gBAChC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAE3B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,OAAO,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBAC7C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAClC,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA"}

package/node/reconstruct-from-mat/get-sats2.d.ts

@@ -0,0 +1,10 @@
+import type { Mat } from '../mat/mat.js';
+/**
+ * Returns the shape information.
+ *
+ * @param font$$ the font from which the glyph outlines will be retrieved
+ * @param glyphId the glyph id for which the shape is to be retrieved
+ * @param options the options for SAT computation
+ */
+declare function getSats2(mats: Mat[], satScale: number): Mat[];
+export { getSats2 };

package/node/reconstruct-from-mat/get-sats2.js

@@ -0,0 +1,16 @@
+import { removeSatInducedTrivial3Prongs } from "./remove-sat-induced-trivial-3prongs.js";
+import { toScaleAxis } from '../sat/to-scale-axis.js';
+/**
+ * Returns the shape information.
+ *
+ * @param font$$ the font from which the glyph outlines will be retrieved
+ * @param glyphId the glyph id for which the shape is to be retrieved
+ * @param options the options for SAT computation
+ */
+// TODO
+function getSats2(mats, satScale) {
+    const sats = mats.map(mat => toScaleAxis(mat, satScale));
+    return sats.map(removeSatInducedTrivial3Prongs);
+}
+export { getSats2 };
+//# sourceMappingURL=get-sats2.js.map

package/node/reconstruct-from-mat/get-sats2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-sats2.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/get-sats2.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,8BAA8B,EAAE,MAAM,yCAAyC,CAAC;AACzF,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAGtD;;;;;;GAMG;AACH,OAAO;AACP,SAAS,QAAQ,CACT,IAAW,EACX,QAAgB;IAEpB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;IAEzD,OAAO,IAAI,CAAC,GAAG,CAAC,8BAA8B,CAAC,CAAC;AACpD,CAAC;AAGD,OAAO,EAAE,QAAQ,EAAE,CAAA"}

package/node/reconstruct-from-mat/is-fully-terminating.d.ts

@@ -0,0 +1,3 @@
+import type { CpNode } from '../cp-node/cp-node.js';
+declare function isFullyTerminating(cpNode: CpNode): boolean;
+export { isFullyTerminating };

package/node/reconstruct-from-mat/is-fully-terminating.js

@@ -0,0 +1,19 @@
+import { getAllOnCircle } from '../cp-node/fs/get-all-on-circle.js';
+import { isTerminating } from '../cp-node/fs/is-terminating.js';
+import { isTrivial } from '../cp-node/fs/is-trivial.js';
+// TODO - DUPLICATE! -> likely other version needs fixing
+function isFullyTerminating(cpNode) {
+    if (!isTerminating(cpNode)) {
+        return false;
+    }
+    if (isTrivial(cpNode)) {
+        return true;
+    }
+    while (cpNode.prev === cpNode.prevOnCircle) {
+        cpNode = cpNode.prev;
+    }
+    const otherOnCircle = getAllOnCircle(cpNode.prevOnCircle, true);
+    return otherOnCircle.every(isTerminating);
+}
+export { isFullyTerminating };
+//# sourceMappingURL=is-fully-terminating.js.map

package/node/reconstruct-from-mat/is-fully-terminating.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"is-fully-terminating.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/is-fully-terminating.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AACpE,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AAGxD,yDAAyD;AACzD,SAAS,kBAAkB,CAAC,MAAc;IACtC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC;QACzC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,MAAM,aAAa,GAAG,cAAc,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IAEhE,OAAO,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;AAC9C,CAAC;AAGD,OAAO,EAAE,kBAAkB,EAAE,CAAA"}

package/node/reconstruct-from-mat/matched-beziers.d.ts

@@ -0,0 +1,10 @@
+import type { BezierPiece } from 'flo-bezier3';
+/**
+ * A type representing a correspondence between 3 bezier curves (one on the
+ * boundary, one on the medial axis and one on the opposite boundary)
+ */
+interface MatchedBeziers {
+    readonly medialBezier: BezierPiece;
+    readonly boundaryBezier: BezierPiece;
+}
+export type { MatchedBeziers };

package/node/reconstruct-from-mat/matched-beziers.js

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

package/node/reconstruct-from-mat/matched-beziers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matched-beziers.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/matched-beziers.ts"],"names":[],"mappings":""}

package/node/reconstruct-from-mat/reconstruct-from-mat.d.ts

@@ -0,0 +1,4 @@
+import type { BezierPiece } from 'flo-bezier3';
+import type { Mat } from '../mat/mat.js';
+declare function reconstructFromMats(mats: Mat[]): BezierPiece[];
+export { reconstructFromMats };

package/node/reconstruct-from-mat/reconstruct-from-mat.js

@@ -0,0 +1,28 @@
+import { getMbssByLoopPerSat } from './get-mbss-by-loop-per-sat.js';
+function reconstructFromMats(mats) {
+    const loopss = [];
+    const bzs = [];
+    const mbssByLoopPerSat = getMbssByLoopPerSat(mats, 1.5);
+    for (const mbssByLoopPS of mbssByLoopPerSat) {
+        const { mbssByLoop, oppArr } = mbssByLoopPS;
+        for (let l = 0; l < mbssByLoop.length; l++) {
+            const rs = mbssByLoop[l];
+            for (let i = 0; i < rs.length; i++) {
+                const r = mbssByLoop[l][i];
+                if (r === undefined) {
+                    continue;
+                }
+                const matchedBezierss = r;
+                for (let j = 0; j < matchedBezierss.length; j++) {
+                    const mb = matchedBezierss[j];
+                    const { boundaryBezier, medialBezier } = mb;
+                    bzs.push(boundaryBezier);
+                }
+            }
+        }
+    }
+    return bzs;
+    // return loopss;
+}
+export { reconstructFromMats };
+//# sourceMappingURL=reconstruct-from-mat.js.map

package/node/reconstruct-from-mat/reconstruct-from-mat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconstruct-from-mat.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/reconstruct-from-mat.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AAIpE,SAAS,mBAAmB,CACpB,IAAW;IAEf,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,MAAM,GAAG,GAAkB,EAAE,CAAC;IAE9B,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAE,CAAC;IAEzD,KAAK,MAAM,YAAY,IAAI,gBAAgB,EAAE,CAAC;QAC1C,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC;QAE5C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAEzB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE3B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;oBAAC,SAAS;gBAAC,CAAC;gBAElC,MAAM,eAAe,GAAG,CAAC,CAAC;gBAE1B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;oBAC9B,MAAM,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC;oBAE5C,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;gBAC5B,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAGD,OAAO,GAAG,CAAC;IACX,iBAAiB;AACrB,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}

package/node/reconstruct-from-mat/remove-sat-induced-trivial-3prongs.d.ts

@@ -0,0 +1,12 @@
+import type { Mat } from '../mat/mat.js';
+/**
+ * In-place removes trivial 3-prongs from the SAT graph; just to simplify
+ * subsequent processing.
+ *
+ * These are 3-prongs that are induced by the SAT construction, and do
+ * not correspond to actual 3-prongs in the shape.
+ *
+ * @param sat the SAT
+ */
+declare function removeSatInducedTrivial3Prongs(sat: Mat): Mat;
+export { removeSatInducedTrivial3Prongs };

package/node/reconstruct-from-mat/remove-sat-induced-trivial-3prongs.js

@@ -0,0 +1,46 @@
+import { isFullyTerminating } from './is-fully-terminating.js';
+/**
+ * In-place removes trivial 3-prongs from the SAT graph; just to simplify
+ * subsequent processing.
+ *
+ * These are 3-prongs that are induced by the SAT construction, and do
+ * not correspond to actual 3-prongs in the shape.
+ *
+ * @param sat the SAT
+ */
+function removeSatInducedTrivial3Prongs(sat) {
+    let { cpNode } = sat;
+    let cpStart = cpNode;
+    do {
+        if (isFullyTerminating(cpNode) ||
+            // cpNode.isHoleClosing ||  // hole-closers are fully terminating
+            cpNode.next !== cpNode.nextOnCircle) {
+            cpNode = cpNode.next;
+            continue;
+        }
+        //-----------------------------
+        // Delete the trivial 3-prong
+        //-----------------------------
+        // console.log('Removing SAT-induced trivial 3-prong');
+        const next = cpNode.next;
+        const nextNext = next.next;
+        const nextNextOC = cpNode.next.nextOnCircle;
+        //-------------------------------------------------------------
+        // In-place update of links to remove the trivial 3-prong node
+        //-------------------------------------------------------------
+        cpNode.next = nextNext;
+        cpNode.nextOnCircle = nextNextOC;
+        nextNext.prev = cpNode;
+        nextNextOC.prevOnCircle = cpNode;
+        //-------------------------------------------------------------
+        if (cpStart === next) {
+            cpStart = cpNode; // ...otherwise the loop will never terminate
+        }
+        cpNode = cpNode.next;
+    } while (cpNode !== cpStart);
+    // ...otherwise the caller will have a reference to a node that has been removed from the graph
+    sat.cpNode = cpNode;
+    return sat;
+}
+export { removeSatInducedTrivial3Prongs };
+//# sourceMappingURL=remove-sat-induced-trivial-3prongs.js.map

package/node/reconstruct-from-mat/remove-sat-induced-trivial-3prongs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-sat-induced-trivial-3prongs.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/remove-sat-induced-trivial-3prongs.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAG/D;;;;;;;;GAQG;AACH,SAAS,8BAA8B,CAC/B,GAAQ;IAEZ,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;IAErB,IAAI,OAAO,GAAG,MAAM,CAAC;IACrB,GAAG,CAAC;QACA,IAAI,kBAAkB,CAAC,MAAM,CAAC;YAC1B,iEAAiE;YACjE,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC;YAEtC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;YACrB,SAAS;QACb,CAAC;QAED,+BAA+B;QAC/B,6BAA6B;QAC7B,+BAA+B;QAC/B,uDAAuD;QAEvD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;QAE5C,+DAA+D;QAC/D,8DAA8D;QAC9D,+DAA+D;QAC9D,MAAiC,CAAC,IAAI,GAAG,QAAQ,CAAC;QAClD,MAAiC,CAAC,YAAY,GAAG,UAAU,CAAC;QAC5D,QAAqC,CAAC,IAAI,GAAG,MAAM,CAAC;QACpD,UAAyC,CAAC,YAAY,GAAG,MAAM,CAAC;QACjE,+DAA+D;QAE/D,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO,GAAG,MAAM,CAAC,CAAE,6CAA6C;QACpE,CAAC;QAED,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC,QAAQ,MAAM,KAAK,OAAO,EAAC;IAE5B,+FAA+F;IAC9F,GAAoB,CAAC,MAAM,GAAG,MAAM,CAAC;IAEtC,OAAO,GAAG,CAAC;AACf,CAAC;AAGD,OAAO,EAAE,8BAA8B,EAAE,CAAA"}

package/node/reconstruct-from-mat/split-tri-path.d.ts

@@ -0,0 +1,5 @@
+import type { BezierPiece } from 'flo-bezier3';
+import type { MatchedBeziers } from './matched-beziers.js';
+declare function splitTriPath(boundaryBeziers: BezierPiece[], medialBezier: BezierPiece, boundaryBeziersOpp: BezierPiece[] | undefined): MatchedBeziers[];
+declare function getCumLengths(lens: number[]): number[];
+export { splitTriPath, getCumLengths };

package/node/reconstruct-from-mat/split-tri-path.js

@@ -0,0 +1,209 @@
+import { getTAtLength } from 'flo-bezier3';
+import { sum } from '../utils/sum.js';
+import { clip } from '../utils/clip.js';
+import { getBezierPieceLength } from './get-bezier-piece-length.js';
+const EPS = 1e-9;
+function splitTriPath(boundaryBeziers, medialBezier, boundaryBeziersOpp) {
+    const _boundaryBeziersOpp = boundaryBeziersOpp ?? [];
+    const boundaryBeziersOpp_ = _boundaryBeziersOpp.map(reverseBezierPiece).toReversed();
+    // Importantly, we need to split on boundaryBeziersOpp_ as well, to ensure
+    // the number of returned pieces is the same for both sides, so that they
+    // can be interpolated.
+    const _paths = boundaryBeziersOpp_.length > 0
+        ? [boundaryBeziers, [medialBezier], boundaryBeziersOpp_]
+        : [boundaryBeziers, [medialBezier]];
+    const paths = splitTriPath_(_paths);
+    const matchedBezierss = [];
+    for (let i = 0; i < paths.length; i++) {
+        const path = paths[i];
+        // const pathOpp = paths[paths.length - 1 - i];
+        const [boundaryBezier, medialBezier] = path;
+        // const boundaryBezierOpp = pathOpp[2];
+        const matchedBeziers = {
+            boundaryBezier,
+            medialBezier,
+            // boundaryBezierOpp
+        };
+        matchedBezierss.push(matchedBeziers);
+    }
+    return matchedBezierss;
+}
+function reverseBezierPiece(bezierPiece) {
+    const { ps, ts: [tS, tE] } = bezierPiece;
+    return {
+        ps: ps.toReversed(),
+        ts: [1 - tE, 1 - tS]
+    };
+}
+/**
+ * Returns an array of arrays of `BezierPiece`s, where each inner array
+ * contains `BezierPiece`s that correspond to each other across the different
+ * paths by normalized length.
+ *
+ * For example, if there are 3 paths, then each inner array will contain 3
+ * `BezierPiece`s, one from each path, that correspond to each other by normalized
+ * length.
+ *
+ * @param bezierPiecess
+ */
+function splitTriPath_(bezierPiecess) {
+    const lenss = mapmap(bezierPiecess, getBezierPieceLength);
+    const lens = lenss.map(sum);
+    const cums = lenss.map(getCumLengths);
+    const normCums = cums.map((cum, i) => {
+        const len = lens[i];
+        if (len <= EPS) {
+            return cum.map((_, j) => j === 0 ? 0 : 1);
+            // return cum.map(() => Number.POSITIVE_INFINITY);
+        }
+        return cum.map(l => l / len);
+    });
+    /** Current position of start t */
+    let ts = new Array(bezierPiecess.length).fill(0);
+    /** Current position of i */
+    let is = new Array(bezierPiecess.length).fill(0);
+    const matchedBezierss = [];
+    normCums; //?
+    let ii = 0;
+    const maxIterations = 100;
+    while (ts.some(t => t < 1) && ii++ < maxIterations) {
+        const normCumsNext = [];
+        for (let k = 0; k < bezierPiecess.length; k++) {
+            const i_ = is[k];
+            const normCum_ = normCums[k][i_ + 1]; //?
+            const normCum = normCum_ === undefined
+                ? Number.POSITIVE_INFINITY
+                : normCum_;
+            normCumsNext.push(normCum);
+        }
+        normCumsNext; //?
+        const minIdx = getMinIdx(normCumsNext); //?
+        const idxs = getIdxs(normCumsNext, normCumsNext[minIdx]); //?
+        const curCum = normCumsNext[minIdx];
+        // if (idxs.length === 0) {
+        //     throw new Error('splitTriPath_: unable to make progress');
+        // }
+        const nextPieces = new Array(bezierPiecess.length).fill([]);
+        for (let m = 0; m < bezierPiecess.length; m++) {
+            const bezierPieces = bezierPiecess[m];
+            const _i = is[m];
+            // This path is already finished; keep emitting a degenerate tail.
+            if (_i >= bezierPieces.length) {
+                const lastBezierPiece = bezierPieces[bezierPieces.length - 1];
+                nextPieces[m] = {
+                    ps: lastBezierPiece.ps,
+                    ts: [1, 1]
+                };
+                ts[m] = 1;
+                continue;
+            }
+            if (idxs.includes(m)) {
+                const _t = ts[m];
+                const bezierPiece = bezierPieces[_i];
+                const [pieceTS, pieceTE] = bezierPiece.ts;
+                const pieceDt = pieceTE - pieceTS;
+                nextPieces[m] = {
+                    ps: bezierPiece.ps,
+                    ts: [pieceTS + _t * pieceDt, pieceTE]
+                };
+                const nextI = _i + 1;
+                is[m] = nextI;
+                ts[m] = nextI >= bezierPieces.length ? 1 : 0;
+            }
+            else {
+                const _t = ts[m];
+                const bezierPiece = bezierPieces[_i];
+                const [pieceTS, pieceTE] = bezierPiece.ts;
+                const pieceDt = pieceTE - pieceTS;
+                const bezierLen = getBezierPieceLength({ ps: bezierPiece.ps, ts: [0, 1] });
+                const normCumStart = normCums[m][_i];
+                const normCumEnd = normCums[m][_i + 1];
+                const normCumDt = normCumEnd - normCumStart;
+                const normWithinPiece = normCumDt <= EPS
+                    ? _t
+                    : clip((curCum - normCumStart) / normCumDt, _t, 1);
+                const t1 = bezierLen <= EPS
+                    ? _t
+                    : clip(getTAtLength(bezierPiece.ps, bezierLen * normWithinPiece), _t, 1);
+                nextPieces[m] = {
+                    ps: bezierPiece.ps,
+                    ts: [pieceTS + _t * pieceDt, pieceTS + t1 * pieceDt]
+                };
+                if (closeToEps(t1, 1)) {
+                    const nextI = _i + 1;
+                    is[m] = nextI;
+                    ts[m] = nextI >= bezierPieces.length ? 1 : 0;
+                }
+                else {
+                    is[m] = _i;
+                    ts[m] = t1;
+                }
+            }
+        }
+        matchedBezierss.push(nextPieces);
+    }
+    if (ts.some(t => t < 1)) {
+        throw new Error('splitTriPath_: exceeded maximum iterations');
+    }
+    return matchedBezierss;
+}
+function getCumLengths(lens) {
+    const cum = [0];
+    let cumLen = 0;
+    for (let j = 0; j < lens.length; j++) {
+        cumLen += lens[j];
+        cum.push(cumLen);
+    }
+    return cum;
+}
+/**
+ * Returns the index within the given array of the number with the highest
+ * value.
+ *
+ * * returns `undefined` if the array is empty
+ */
+function getMinIdx(vs) {
+    let minIdx = undefined;
+    let minVal = Number.POSITIVE_INFINITY;
+    for (let i = 0; i < vs.length; i++) {
+        if (vs[i] <= minVal) {
+            minVal = vs[i];
+            minIdx = i;
+        }
+    }
+    return minIdx;
+}
+/**
+ * Returns the indices within the given array of the numbers that are equal to
+ * the given max value (within an EPS value).
+ *
+ * @param vs
+ * @param maxVal
+ */
+function getIdxs(vs, maxVal) {
+    const maxIdxs = [];
+    for (let i = 0; i < vs.length; i++) {
+        if (vs[i] === maxVal || closeToEps(vs[i], maxVal)) {
+            maxIdxs.push(i);
+        }
+    }
+    return maxIdxs;
+}
+function closeToEps(a, b) {
+    return Math.abs(a - b) <= EPS;
+}
+export { splitTriPath, getCumLengths };
+// KEEP FOR TESTING! - one in opentype-ts doesn't work with tests due to aliases
+function mapmap(tss, f) {
+    const tss_ = [];
+    for (let i = 0; i < tss.length; i++) {
+        const ts = tss[i];
+        const ts_ = [];
+        for (let j = 0; j < ts.length; j++) {
+            ts_.push(f(ts[j]));
+        }
+        tss_.push(ts_);
+    }
+    return tss_;
+}
+//# sourceMappingURL=split-tri-path.js.map

package/node/reconstruct-from-mat/split-tri-path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"split-tri-path.js","sourceRoot":"","sources":["../../src/reconstruct-from-mat/split-tri-path.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,GAAG,EAAE,MAAM,iBAAiB,CAAC;AACtC,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAGpE,MAAM,GAAG,GAAG,IAAI,CAAC;AAGjB,SAAS,YAAY,CACb,eAA8B,EAC9B,YAAyB,EACzB,kBAA6C;IAEjD,MAAM,mBAAmB,GAAG,kBAAkB,IAAI,EAAE,CAAC;IAErD,MAAM,mBAAmB,GACrB,mBAAmB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,UAAU,EAAE,CAAC;IAE7D,0EAA0E;IAC1E,yEAAyE;IACzE,uBAAuB;IACvB,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,GAAG,CAAC;QACzC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,YAAY,CAAC,EAAE,mBAAmB,CAAC;QACxD,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;IAExC,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAEpC,MAAM,eAAe,GAAqB,EAAE,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,+CAA+C;QAE/C,MAAM,CAAC,cAAc,EAAE,YAAY,CAAC,GAAG,IAAI,CAAC;QAC5C,wCAAwC;QACxC,MAAM,cAAc,GAAmB;YACnC,cAAc;YACd,YAAY;YACZ,oBAAoB;SACvB,CAAC;QACF,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC;AAGD,SAAS,kBAAkB,CACnB,WAAwB;IAE5B,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,WAAW,CAAC;IAEzC,OAAO;QACH,EAAE,EAAE,EAAE,CAAC,UAAU,EAAE;QACnB,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;KACvB,CAAC;AACN,CAAC;AAGD;;;;;;;;;;GAUG;AACH,SAAS,aAAa,CACd,aAA8B;IAElC,MAAM,KAAK,GAAG,MAAM,CAAC,aAAa,EAAE,oBAAoB,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAC,CAAC,EAAE,EAAE;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,kDAAkD;QACtD,CAAC;QAED,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAGH,kCAAkC;IAClC,IAAI,EAAE,GAAG,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,4BAA4B;IAC5B,IAAI,EAAE,GAAG,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjD,MAAM,eAAe,GAAoB,EAAE,CAAC;IAE5C,QAAQ,CAAC,CAAA,GAAG;IAEZ,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,MAAM,aAAa,GAAG,GAAG,CAAC;IAC1B,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,aAAa,EAAE,CAAC;QACjD,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA,GAAG;YACxC,MAAM,OAAO,GAAG,QAAQ,KAAK,SAAS;gBAClC,CAAC,CAAC,MAAM,CAAC,iBAAiB;gBAC1B,CAAC,CAAC,QAAQ,CAAC;YAEf,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;QAED,YAAY,CAAC,CAAA,GAAG;QAEhB,MAAM,MAAM,GAAG,SAAS,CAAC,YAAY,CAAE,CAAC,CAAA,GAAG;QAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA,GAAG;QAC5D,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QAEpC,2BAA2B;QAC3B,iEAAiE;QACjE,IAAI;QAEJ,MAAM,UAAU,GAAkB,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3E,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEjB,kEAAkE;YAClE,IAAI,EAAE,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;gBAC5B,MAAM,eAAe,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC9D,UAAU,CAAC,CAAC,CAAC,GAAG;oBACZ,EAAE,EAAE,eAAe,CAAC,EAAE;oBACtB,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;iBACb,CAAC;gBACF,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACV,SAAS;YACb,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,WAAW,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;gBACrC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC;gBAC1C,MAAM,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;gBAElC,UAAU,CAAC,CAAC,CAAC,GAAG;oBACZ,EAAE,EAAE,WAAW,CAAC,EAAE;oBAClB,EAAE,EAAE,CAAC,OAAO,GAAG,EAAE,GAAC,OAAO,EAAE,OAAO,CAAC;iBACtC,CAAC;gBAEF,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;gBACrB,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBACd,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,CAAC;iBAAM,CAAC;gBACJ,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,WAAW,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;gBACrC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC;gBAC1C,MAAM,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;gBAClC,MAAM,SAAS,GAAG,oBAAoB,CAAC,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAE3E,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrC,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACvC,MAAM,SAAS,GAAG,UAAU,GAAG,YAAY,CAAC;gBAC5C,MAAM,eAAe,GAAG,SAAS,IAAI,GAAG;oBACpC,CAAC,CAAC,EAAE;oBACJ,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBAEvD,MAAM,EAAE,GAAG,SAAS,IAAI,GAAG;oBACvB,CAAC,CAAC,EAAE;oBACJ,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE,EAAE,SAAS,GAAG,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBAE7E,UAAU,CAAC,CAAC,CAAC,GAAG;oBACZ,EAAE,EAAE,WAAW,CAAC,EAAE;oBAClB,EAAE,EAAE,CAAC,OAAO,GAAG,EAAE,GAAC,OAAO,EAAE,OAAO,GAAG,EAAE,GAAC,OAAO,CAAC;iBACnD,CAAC;gBAEF,IAAI,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;oBACpB,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;oBACrB,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBACd,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjD,CAAC;qBAAM,CAAC;oBACJ,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;oBACX,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC;QAED,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrC,CAAC;IAED,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC;AAGD,SAAS,aAAa,CAAC,IAAc;IACjC,MAAM,GAAG,GAAa,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAGD;;;;;GAKG;AACH,SAAS,SAAS,CACV,EAAY;IAEhB,IAAI,MAAM,GAAuB,SAAS,CAAC;IAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACtC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAClB,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,GAAG,CAAC,CAAC;QACf,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD;;;;;;GAMG;AACH,SAAS,OAAO,CACR,EAAY,EACZ,MAAc;IAElB,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;YAChD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAGD,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACpC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;AAClC,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC;AAIvC,gFAAgF;AAChF,SAAS,MAAM,CACP,GAAU,EACV,CAAc;IAElB,MAAM,IAAI,GAAU,EAAE,CAAC;IACvB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/node/sat/add-debug-info.js

@@ -7,8 +7,7 @@ function addDebugInfo(timingStart) {
     if (typeof _debug_ === 'undefined') {
         return;
     }
-    const timing = _debug_.generated.timing;
-    timing.sats = performance.now() - timingStart;
+    _debug_.timing.sats = performance.now() - timingStart;
 }
 export { addDebugInfo };
 //# sourceMappingURL=add-debug-info.js.map

package/node/sat/add-debug-info.js.map

@@ -1 +1 @@
-{"version":3,"file":"add-debug-info.js","sourceRoot":"","sources":["../../src/sat/add-debug-info.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,SAAS,YAAY,CACb,WAAmB;IAEvB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE,CAAC;QAAC,OAAO;IAAC,CAAC;IAE/C,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC;IACxC,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC;AAClD,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}
+{"version":3,"file":"add-debug-info.js","sourceRoot":"","sources":["../../src/sat/add-debug-info.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,SAAS,YAAY,CACb,WAAmB;IAEvB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE,CAAC;QAAC,OAAO;IAAC,CAAC;IAE/C,OAAO,CAAC,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC;AAC1D,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

package/node/utils/clip.d.ts

@@ -0,0 +1,2 @@
+declare function clip(v: number, vMin: number, vMax: number): number;
+export { clip };

package/node/utils/clip.js

@@ -0,0 +1,6 @@
+const { max, min } = Math;
+function clip(v, vMin, vMax) {
+    return max(vMin, min(vMax, v));
+}
+export { clip };
+//# sourceMappingURL=clip.js.map

package/node/utils/clip.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clip.js","sourceRoot":"","sources":["../../src/utils/clip.ts"],"names":[],"mappings":"AACA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE1B,SAAS,IAAI,CACL,CAAS,EACT,IAAY,EACZ,IAAY;IAEhB,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAGD,OAAO,EAAE,IAAI,EAAE,CAAA"}

package/package.json

@@ -2,7 +2,7 @@
     "name": "flo-mat",
     "sideEffects": false,
     "description": "Medial / Scale Axis Transform (MAT/SAT) Library.",
-    "version": "4.0.2",
+    "version": "4.0.3",
     "author": {
         "name": "Floris Steenkamp"
     },
@@ -34,7 +34,7 @@
         "big-float-ts": "^4.0.4",
         "double-double": "^3.0.4",
         "flo-bezier3": "^8.0.11",
-        "flo-boolean": "^5.0.5",
+        "flo-boolean": "^5.0.7",
         "flo-draw": "^2.0.5",
         "flo-gauss-quadrature": "^2.1.4",
         "flo-ll-rb-tree": "^1.0.1",

package/src/cp-node/fs/is-on-same-loop.ts

@@ -0,0 +1,15 @@
+import type { CpNode } from "flo-mat";
+
+
+function isOnSameLoop(
+        cpNode1: CpNode,
+        cpNode2: CpNode): boolean {
+
+    return (
+        cpNode1.pointOnShape.curve.loop === 
+        cpNode2.pointOnShape.curve.loop
+    );
+}
+
+
+export { isOnSameLoop }