flo-mat 3.0.1 → 3.0.2

package/node/find-3-prong.ts/find-and-add-all-3-prongs.d.ts

@@ -1,13 +0,0 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from '../cp-node/cp-node.js';
-import { Loop } from 'flo-boolean';
-/**
- * @internal
- * Finds and adds all 3-prongs.
- * @param cpGraphs
- * @param cpStart The CpNode to start traversing from.
- * @param extreme The maximum coordinate value used to calculate floating point
- * tolerances.
- */
-declare function findAndAddAll3Prongs(cpGraphs: Map<Loop, LlRbTree<CpNode>>, cpStart: CpNode, extreme: number): void;
-export { findAndAddAll3Prongs };

package/node/find-3-prong.ts/find-and-add-all-3-prongs.js

@@ -1,66 +0,0 @@
-import { getCpNodesOnCircle } from '../cp-node/cp-node.js';
-import { isPosSharpCorner } from '../point-on-shape/is-pos-sharp-corner.js';
-import { findAndAdd3Prongs } from './find-and-add-3-prongs.js';
-/**
- * @internal
- * Finds and adds all 3-prongs.
- * @param cpGraphs
- * @param cpStart The CpNode to start traversing from.
- * @param extreme The maximum coordinate value used to calculate floating point
- * tolerances.
- */
-function findAndAddAll3Prongs(cpGraphs, cpStart, extreme) {
-    // Don't change this function to be recursive, the call stack may overflow 
-    // if there are too many two-prongs.
-    const visitedEdges = new Map();
-    const edgesToCheck = [{ fromCpNode: undefined, cpStart }];
-    while (edgesToCheck.length) {
-        const { fromCpNode, cpStart } = edgesToCheck.shift();
-        markEdgeAsTaken(visitedEdges, fromCpNode, cpStart);
-        for (const cpNode of getCpNodesOnCircle(cpStart)) {
-            if (!isPosSharpCorner(cpNode.cp.pointOnShape)) {
-                if (findAndAdd3Prongs(cpGraphs, cpNode, extreme) === undefined) {
-                    console.log('Unable to find 3-prong');
-                    return; // only for debugging purposes
-                }
-            }
-            if (hasEdgeBeenTaken(visitedEdges, cpNode, cpNode.next)) {
-                continue; // We already visited this edge
-            }
-            edgesToCheck.push({ fromCpNode: cpStart, cpStart: cpNode.next });
-        }
-    }
-    // for (const [k,v] of cpGraphs) {
-    //     fixOrdering(v.root!.datum);
-    // }
-}
-/**
- * @internal
- * Marks the given edge as already taken.
- */
-function markEdgeAsTaken(visitedEdges, cp1, cp2) {
-    if (cp1 === undefined) {
-        return;
-    }
-    markEdgeAsTaken_(cp1, cp2);
-    markEdgeAsTaken_(cp2, cp1);
-    function markEdgeAsTaken_(cp1, cp2) {
-        let visited = visitedEdges.get(cp1);
-        if (!visited) {
-            visited = new Set();
-            visitedEdges.set(cp1, visited);
-        }
-        visited.add(cp2);
-    }
-}
-/** @internal */
-function hasEdgeBeenTaken(visitedEdges, cp1, cp2) {
-    let cps;
-    cps = visitedEdges.get(cp1);
-    const takenForward = cps && cps.has(cp2);
-    cps = visitedEdges.get(cp2);
-    const takenBackwards = cps && cps.has(cp1);
-    return takenForward || takenBackwards;
-}
-export { findAndAddAll3Prongs };
-//# sourceMappingURL=find-and-add-all-3-prongs.js.map

package/node/find-3-prong.ts/find-and-add-all-3-prongs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-and-add-all-3-prongs.js","sourceRoot":"","sources":["../../src/find-3-prong.ts/find-and-add-all-3-prongs.ts"],"names":[],"mappings":"AAKA,OAAO,EAAU,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAEnE,OAAO,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAE5E,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAS/D;;;;;;;GAOG;AACH,SAAS,oBAAoB,CACrB,QAAoC,EACpC,OAAe,EACf,OAAe;IAEnB,2EAA2E;IAC3E,oCAAoC;IAEpC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEpD,MAAM,YAAY,GAAW,CAAC,EAAE,UAAU,EAAE,SAAoB,EAAE,OAAO,EAAE,CAAC,CAAC;IAE7E,OAAO,YAAY,CAAC,MAAM,EAAE;QACxB,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC,KAAK,EAAG,CAAC;QAEtD,eAAe,CAAC,YAAY,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;QAEnD,KAAK,MAAM,MAAM,IAAI,kBAAkB,CAAC,OAAO,CAAC,EAAE;YAE9C,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE;gBAC3C,IAAI,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,SAAS,EAAE;oBAC5D,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;oBACtC,OAAO,CAAC,8BAA8B;iBACzC;aACJ;YAED,IAAI,gBAAgB,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE;gBACrD,SAAS,CAAC,+BAA+B;aAC5C;YAED,YAAY,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;SACpE;KACJ;IAED,kCAAkC;IAClC,kCAAkC;IAClC,IAAI;AACR,CAAC;AAGD;;;GAGG;AACH,SAAS,eAAe,CAChB,YAAsC,EACtC,GAAW,EACX,GAAW;IAEf,IAAI,GAAG,KAAK,SAAS,EAAE;QAAE,OAAO;KAAE;IAElC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAE3B,SAAS,gBAAgB,CAAC,GAAW,EAAE,GAAW;QAC9C,IAAI,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,EAAE;YACV,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAC5B,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;SAClC;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;AACL,CAAC;AAGD,gBAAgB;AAChB,SAAS,gBAAgB,CACjB,YAAsC,EACtC,GAAW,EACX,GAAW;IAEf,IAAI,GAA4B,CAAC;IAEjC,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,YAAY,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAEzC,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,cAAc,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAE3C,OAAO,YAAY,IAAI,cAAc,CAAC;AAC1C,CAAC;AAED,OAAO,EAAE,oBAAoB,EAAE,CAAA"}

package/node/find-mat/add-debug-info.d.ts

@@ -1,9 +0,0 @@
-import { Loop } from 'flo-boolean';
-import { Mat } from '../mat/mat.js';
-/** @internal */
-declare function addDebugInfo1(loops: Loop[]): void;
-/** @internal */
-declare function addDebugInfo2(): void;
-declare function addDebugInfo3(): void;
-declare function addDebugInfo4(mat: Mat): void;
-export { addDebugInfo1, addDebugInfo2, addDebugInfo3, addDebugInfo4 };

package/node/find-mat/add-debug-info.js

@@ -1,68 +0,0 @@
-import { getBoundingHull, getBoundingBoxTight } from 'flo-bezier3';
-import { getCornerAtEnd } from '../curve/curve.js';
-import { getBoundingBox_ } from '../geometry/get-bounding-box-.js';
-let timingStart;
-/** @internal */
-function addDebugInfo1(loops) {
-    if (typeof _debug_ === 'undefined') {
-        return;
-    }
-    timingStart = performance.now();
-    for (const loop of loops) {
-        _debug_.fs.nameObj(loop, 'l|');
-    }
-    const generated = _debug_.generated;
-    //generated.elems.loop.push(...loops);
-    //generated.elems.loops.push(loops);
-    for (const loop of loops) {
-        let i = 0;
-        loop.curves.forEach(function (curve) {
-            const ps = curve.ps;
-            const hull = getBoundingHull(ps);
-            generated.elems.boundingHull.push(hull);
-            const looseBoundingBox = getBoundingBox_(ps);
-            generated.elems.looseBoundingBox.push(looseBoundingBox);
-            const tightBoundingBox = getBoundingBoxTight(ps);
-            generated.elems.tightBoundingBox.push(tightBoundingBox);
-            const corner = getCornerAtEnd(curve);
-            if (corner.isQuiteSharp) {
-                generated.elems.sharpCorner.push(curve);
-            }
-            else if (corner.isQuiteDull) {
-                generated.elems.dullCorner.push(curve);
-            }
-            i++;
-        });
-    }
-}
-/** @internal */
-function addDebugInfo2() {
-    if (typeof _debug_ === 'undefined') {
-        return;
-    }
-    const timing = _debug_.generated.timing;
-    const now = performance.now();
-    timing.holeClosers += now - timingStart;
-    timingStart = now;
-}
-function addDebugInfo3() {
-    if (typeof _debug_ === 'undefined') {
-        return;
-    }
-    const generated = _debug_.generated;
-    const timing = generated.timing;
-    const now = performance.now();
-    timing.oneAnd2Prongs += now - timingStart;
-    timingStart = now;
-}
-function addDebugInfo4(mat) {
-    if (typeof _debug_ === 'undefined') {
-        return;
-    }
-    const generated = _debug_.generated;
-    const timing = generated.timing;
-    generated.elems.mat.push(mat);
-    timing.threeProngs += performance.now() - timingStart;
-}
-export { addDebugInfo1, addDebugInfo2, addDebugInfo3, addDebugInfo4 };
-//# sourceMappingURL=add-debug-info.js.map

package/node/find-mat/add-debug-info.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"add-debug-info.js","sourceRoot":"","sources":["../../src/find-mat/add-debug-info.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAGnE,OAAO,EAAS,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAE1D,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAOnE,IAAI,WAAmB,CAAC;AAGxB,gBAAgB;AAChB,SAAS,aAAa,CAAC,KAAa;IAChC,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,OAAO;KAAE;IAE/C,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACtB,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAC,IAAI,CAAC,CAAC;KACjC;IAED,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IAEpC,sCAAsC;IACtC,oCAAoC;IAEpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACtB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAS,KAAY;YACrC,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,CAAE,CAAC;YAElC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAExC,MAAM,gBAAgB,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;YAC7C,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAExD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;YACjD,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAExD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,MAAM,CAAC,YAAY,EAAE;gBACrB,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC3C;iBAAM,IAAI,MAAM,CAAC,WAAW,EAAE;gBAC3B,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC1C;YAED,CAAC,EAAE,CAAC;QACR,CAAC,CAAC,CAAC;KACN;AACL,CAAC;AAGD,gBAAgB;AAChB,SAAS,aAAa;IAClB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,OAAO;KAAE;IAE/C,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC;IACxC,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAC9B,MAAM,CAAC,WAAW,IAAI,GAAG,GAAG,WAAW,CAAC;IACxC,WAAW,GAAG,GAAG,CAAC;AACtB,CAAC;AAGD,SAAS,aAAa;IAClB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,OAAO;KAAE;IAE/C,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IACpC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChC,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAE9B,MAAM,CAAC,aAAa,IAAI,GAAG,GAAG,WAAW,CAAC;IAC1C,WAAW,GAAG,GAAG,CAAC;AACtB,CAAC;AAGD,SAAS,aAAa,CAAC,GAAQ;IAC3B,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,OAAO;KAAE;IAE/C,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IACpC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAEhC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAE9B,MAAM,CAAC,WAAW,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC;AAC1D,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,CAAA"}

package/node/find-mat/create-initial-cp-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"create-initial-cp-graph.js","sourceRoot":"","sources":["../../src/find-mat/create-initial-cp-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,EAAU,gBAAgB,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAK/E;;;;;GAKG;AACH,SAAS,oBAAoB,CACrB,KAAa,EACb,OAAoC,EACpC,aAA+B,CAAA;0CACW;IAE9C,IAAI,MAAM,CAAC;IAEX,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAEtC,MAAM,MAAM,GAAG,IAAI,QAAQ,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAErD,IAAI,OAAO,GAAW,SAAU,CAAC;QACjC,IAAI,OAAO,GAAW,SAAU,CAAC;QACjC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE;YAC5B,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,yBAAyB;YACzB,6BAA6B;YAE7B,MAAM,MAAM,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YAE5C,MAAM,GAAG,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YAC9E,MAAM,GAAG,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YAE9E,OAAO,GAAG,YAAY,CAAC,KAAK,EAAE,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,OAAQ,CAAC,CAAC;YAC/E,OAAO,GAAG,YAAY,CAAC,KAAK,EAAE,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YAE9E,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC;YAC/B,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC;YAE/B,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC;YAC/B,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC;SAClC;QAED,IAAI,CAAC,MAAM,EAAE;YAAE,MAAM,GAAG,OAAO,CAAC;SAAE;QAElC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;KAC7B;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,oBAAoB,EAAE,CAAA"}

package/node/find-mat/fix-ordering.d.ts

@@ -1,8 +0,0 @@
-import { CpNode } from "../cp-node/cp-node.js";
-/**
- * @internal
- *
- * Use only for debugging. Check all nodes around the loop.
- */
-declare function fixOrdering(cpNode: CpNode): void;
-export { fixOrdering };

package/node/find-mat/fix-ordering.js

@@ -1,59 +0,0 @@
-/**
- * @internal
- *
- * Use only for debugging. Check all nodes around the loop.
- */
-function fixOrdering(cpNode) {
-    const cpStart = cpNode;
-    /* holeCloser order causes an issue here
-    {
-        const cpNodes = getAllOnLoop(cpStart);
-
-        cpNodes.sort(cpNodeComparator);
-        // console.log(cpNodes.map(cpn => enhanceCpNode(cpn).ordering))
-
-        const len = cpNodes.length;
-        for (let i=0; i<len; i++) {
-            const cpNode = cpNodes[i];
-            const prev = cpNodes[(i + len - 1)%len];
-            const next = cpNodes[(i + len + 1)%len];
-            if (cpNode.prev !== prev) {
-                // console.log(enhanceCpNode(cpNode));
-            }
-            if (cpNode.next !== next) {
-                // console.log(enhanceCpNode(cpNode));
-            }
-            // cpNode.prev = prev;
-            // cpNode.next = next;
-        }
-    }
-    */
-    /*
-    {
-        let cpNode2 = cpStart.next;
-        while (cpNode2 !== cpStart) {
-            const cpNode1 = cpNode2;
-            cpNode2 = cpNode2.next;
-
-            const c = cpNodeComparator(cpNode1, cpNode2)!;
-            const looplen = cpNode1.cp.pointOnShape.curve.loop.beziers.length;
-            if (c > 0 && !cpNode1.isHoleClosing && !cpNode2.isHoleClosing) {
-                const o1 = cpNode1.cp.pointOnShape.curve.idx;
-                const o2 = cpNode2.cp.pointOnShape.curve.idx;
-                if (if) {
-                   1;
-                } else {
-                    console.log('ORDER IS WRONG!', looplen, o1, o2)
-                    console.log(c);
-                    console.log(enhanceCpNode(cpNode1));
-                    console.log(enhanceCpNode(cpNode2));
-                    console.log('');
-                }
-            }
-        }
-    }
-    */
-    // return cpNodes;
-}
-export { fixOrdering };
-//# sourceMappingURL=fix-ordering.js.map

package/node/find-mat/fix-ordering.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fix-ordering.js","sourceRoot":"","sources":["../../src/find-mat/fix-ordering.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,SAAS,WAAW,CACZ,MAAc;IAElB,MAAM,OAAO,GAAG,MAAM,CAAC;IAEvB;;;;;;;;;;;;;;;;;;;;;;MAsBE;IAEF;;;;;;;;;;;;;;;;;;;;;;;;MAwBE;IAEL,kBAAkB;AACnB,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"get-dull-corners.js","sourceRoot":"","sources":["../../src/find-mat/get-dull-corners.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,uBAAuB,EAAE,MAAM,aAAa,CAAC;AAGtD,gBAAgB;AAChB,SAAS,oBAAoB,CACrB,YAAoB;IAExB,OAAO,CAAC,IAAU,EAAE,EAAE;QAClB,MAAM,WAAW,GAAmB,EAAE,CAAC;QAEvC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAE7B,IAAI,uBAAuB,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE;gBAClD,SAAS;aACZ;YAED,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE;gBACnC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBAC5C,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;aACpD;SACJ;QAED,OAAO,WAAW,CAAC;IACvB,CAAC,CAAA;AACL,CAAC;AAID,OAAO,EAAE,oBAAoB,EAAE,CAAA"}

package/node/find-mat/get-size-params.d.ts

@@ -1,7 +0,0 @@
-declare function getSizeParams(bezierLoops: number[][][][], maxCurviness: number, maxLength: number): {
-    maxCurviness: number;
-    maxLength: number;
-    maxCoordinate: number;
-    minBezLength: number;
-};
-export { getSizeParams };

package/node/find-mat/get-size-params.js

@@ -1,33 +0,0 @@
-import { getLoopsMetrics } from '../loop/get-max-coordinate.js';
-function getSizeParams(bezierLoops, maxCurviness, maxLength) {
-    // Gather some shape metrics
-    const { maxCoordinate, maxRadius } = getLoopsMetrics(bezierLoops);
-    const expMax = Math.ceil(Math.log2(maxCoordinate));
-    const minBezLengthSigBits = 16;
-    /**
-     * 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 };
-}
-export { getSizeParams };
-//# sourceMappingURL=get-size-params.js.map

package/node/find-mat/get-size-params.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-size-params.js","sourceRoot":"","sources":["../../src/find-mat/get-size-params.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,SAAS,aAAa,CACd,WAA2B,EAC3B,YAAoB,EACpB,SAAiB;IAErB,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;AACpE,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/get-curve/get-curve-between.d.ts

@@ -1,9 +0,0 @@
-import { CpNode } from '../cp-node/cp-node.js';
-/**
- * Returns the bezier curve from the maximal disk of one [[CpNode]] to another
- * [[CpNode]]'s maximal disk.
- * @param cpNodeFrom
- * @param cpNodeTo
- */
-declare function getCurveBetween(cpNodeFrom: CpNode, cpNodeTo: CpNode): number[][];
-export { getCurveBetween };

package/node/get-curve/get-curve-between.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-curve-between.js","sourceRoot":"","sources":["../../src/get-curve/get-curve-between.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,eAAe,EAAE,WAAW,EAAE,SAAS,EAC3D,oBAAoB,EACvB,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAG3D,gBAAgB;AAChB,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAClC,gBAAgB;AAChB,MAAM,kBAAkB,GAAG,MAAM,CAAC,CAAC,aAAa;AAGhD;;;;;GAKG;AACH,SAAS,eAAe,CAChB,UAAkB,EAClB,QAAgB;IAEpB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3C,MAAM,KAAK,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAE3C,MAAM,IAAI,GAAG,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;IACvC,MAAM,GAAG,GAAG,gBAAgB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;IAEpD,MAAM,GAAG,GAAG,oBAAoB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAE7C,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAC,IAAI,CAAC,CAAC;IAE9B,IAAI,OAAgB,CAAC;IACrB,IAAI,CAAC,GAAG,EAAE;QACN,OAAO,GAAG,IAAI,CAAC;KAClB;SAAM;QACH,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,EAAI,GAAG,CAAC,CAAC;QAE9B,OAAO,GAAG,GAAG,CAAC,CAAC,EAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KAC1C;IAED,IAAI,CAAC,OAAO,EAAE;QACV,OAAO,CAAC,MAAM,EAAE,GAAI,EAAE,IAAI,CAAC,CAAC;KAC/B;IAED,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB;IAC/D,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,wBAAwB;IAE7D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;IAE1C,IAAI,EAAE,GAAG,oBAAoB,IAAI,EAAE,GAAG,oBAAoB,EAAE;QACxD,4DAA4D;QAC5D,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;KACzB;IAED,IAAI,EAAE,GAAG,kBAAkB,IAAI,EAAE,GAAG,kBAAkB,EAAE;QACpD,gCAAgC;QAChC,MAAM,EAAE,GAAG,WAAW,CAAC,MAAM,EAAC,IAAI,EAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,WAAW,CAAC,MAAM,EAAC,IAAI,EAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QACnB,MAAM,IAAI,GAAG,oBAAoB,CAAC,KAAK,EAAE,EAAE,CAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,EAAI,EAAE,CAAE,CAAC;QAE9C,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;KACrC;IAED,uDAAuD;IACvD,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAC1B,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/get-curve/get-edge-direction.d.ts

@@ -1,9 +0,0 @@
-import { CpNode } from '../cp-node/cp-node.js';
-/**
- * @internal
- * Returns a line segment of unit length starting in the given Vertex center and
- * pointing in the direction of the medial axis (viewed as a rooted tree).
- * @param cpNode
- */
-declare function getEdgeDirection(cpNode: CpNode): number[][];
-export { getEdgeDirection };

package/node/get-curve/get-edge-direction.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-edge-direction.js","sourceRoot":"","sources":["../../src/get-curve/get-edge-direction.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,OAAO,EAAE,GAAG,EACzE,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,OAAO,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAI5E;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,MAAc;IACpC,MAAM,YAAY,GAAG,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;IAE7C,MAAM,GAAG,GAAG,MAAM,CAAC;IACnB,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;IAEhC,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC;IACjC,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC;IAEjC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IAElB,IAAI,IAAI,CAAC;IAET,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;QACzB,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YACpC,IAAI,GAAG,MAAM,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC,CAAC,YAAY;SAChD;aAAM;YACH,IAAI,GAAG,eAAe,CAAE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAE,CAAC,CAAC,iBAAiB;SAC9D;KACJ;SAAM;QACH,IAAI,MAAa,CAAC;QAClB,IAAI,MAAa,CAAC;QAElB,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE;YACd,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;YACpB,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;SAC5B;aAAM,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE;YACrB,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;SACvB;QAED,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,MAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,OAAO,CAAE,YAAY,CAAC,OAAO,CAAC,MAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;QAE7D,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1B,+DAA+D;QAC/D,oEAAoE;QACpE,iBAAiB;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAElC,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;KACnC;IAED,MAAM,CAAC,GAAG,SAAS,CACf,YAAY,CAAC,IAAI,CAAC,EAClB,YAAY,CACf,CAAC;IAEF,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;AAC7B,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

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

@@ -1,33 +0,0 @@
-import { insertCpNode } from '../cp-node/cp-node.js';
-import { getNeighbouringPoints } from './get-neighboring-cps.js';
-/**
- * @internal
- *
- * @param circle
- * @param orders
- * @param cpTrees
- * @param poss
- * @param neighbors
- * @internal
- */
-function addToCpGraph(circle, orders, cpTrees, poss, neighbors) {
-    const newCps = poss.map((pos, i) => {
-        const cpTree = cpTrees.get(pos.curve.loop);
-        const newCp_ = { pointOnShape: pos, circle, order: orders[i], order2: 0 };
-        const neighboringCp = neighbors
-            ? neighbors[i]
-            : getNeighbouringPoints(cpTree, pos, orders[i], 0);
-        const newCp = insertCpNode(false, false, cpTree, newCp_, neighboringCp[0]);
-        return newCp;
-    });
-    const len = poss.length;
-    for (let i = 0; i < len; i++) {
-        const indxPrev = i === 0 ? len - 1 : i - 1;
-        const indxNext = i === len - 1 ? 0 : i + 1;
-        newCps[i].prevOnCircle = newCps[indxPrev];
-        newCps[i].nextOnCircle = newCps[indxNext];
-    }
-    return newCps;
-}
-export { addToCpGraph };
-//# sourceMappingURL=add-to-cp-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"add-to-cp-graph.js","sourceRoot":"","sources":["../../src/mat/add-to-cp-graph.ts"],"names":[],"mappings":"AAKA,OAAO,EAAU,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AAGjE;;;;;;;;;GASG;AACH,SAAS,YAAY,CACb,MAAgB,EAChB,MAAkB,EAClB,OAAoC,EACpC,IAAwB,EACxB,SAAuB;IAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;QAE5C,MAAM,MAAM,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAExF,MAAM,aAAa,GAAG,SAAS;YAC3B,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvD,MAAM,KAAK,GAAG,YAAY,CAClB,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,aAAa,CAAC,CAAC,CAAC,CACvB,CAAC;QAEF,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IACxB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACtB,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE/C,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;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

package/node/mat/bezier-piece.js

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

package/node/mat/bezier-piece.js.map

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

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

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

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"elem-type-two-prong.js","sourceRoot":"","sources":["../../src/mat/elem-type-two-prong.ts"],"names":[],"mappings":""}

package/node/mat/get-neighboring-cps.d.ts

@@ -1,16 +0,0 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { PointOnShape } from '../point-on-shape/point-on-shape.js';
-import { CpNode } from '../cp-node/cp-node.js';
-/**
- * @internal
- *
- * Returns the boundary piece that starts at the immediate previous point on the
- * shape and ends at the immediate next point.
- *
- * @param cpTree
- * @param pos
- * @param order
- * @param order2
- */
-declare function getNeighbouringPoints(cpTree: LlRbTree<CpNode>, pos: PointOnShape, order: number, order2: number): CpNode[];
-export { getNeighbouringPoints };

package/node/mat/get-neighboring-cps.js

@@ -1,33 +0,0 @@
-import { createCpNode } from '../cp-node/create-cp-node.js';
-/**
- * @internal
- *
- * Returns the boundary piece that starts at the immediate previous point on the
- * shape and ends at the immediate next point.
- *
- * @param cpTree
- * @param pos
- * @param order
- * @param order2
- */
-function getNeighbouringPoints(cpTree, pos, order, order2) {
-    const cps = cpTree.findBounds(createCpNode({ pointOnShape: pos, circle: undefined, order, order2 }, false, false));
-    if (!cps[0] && !cps[1]) {
-        // The tree is still empty
-        return [undefined, undefined];
-    }
-    if (!cps[0] || !cps[1]) {
-        // Smaller than all -> cptree.min() === cps[1].data OR
-        // Larger  than all -> cptree.max() === cps[0].data
-        return [
-            cpTree.max(cpTree.root),
-            cpTree.min(cpTree.root)
-        ];
-    }
-    return [
-        cps[0].datum,
-        cps[1].datum
-    ];
-}
-export { getNeighbouringPoints };
-//# sourceMappingURL=get-neighboring-cps.js.map

package/node/mat/get-neighboring-cps.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-neighboring-cps.js","sourceRoot":"","sources":["../../src/mat/get-neighboring-cps.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAG5D;;;;;;;;;;GAUG;AACH,SAAS,qBAAqB,CACtB,MAAwB,EACxB,GAAiB,EACjB,KAAa,EACb,MAAc;IAElB,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CACzB,YAAY,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,SAAU,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CACvF,CAAC;IAEF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACpB,0BAA0B;QAC1B,OAAO,CAAC,SAAU,EAAE,SAAU,CAAa,CAAC;KAC/C;IAED,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACpB,sDAAsD;QACtD,mDAAmD;QACnD,OAAO;YACH,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;SACd,CAAC;KACjB;IAED,OAAO;QACH,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK;QACZ,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK;KACH,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,qBAAqB,EAAE,CAAA"}

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

@@ -1,5 +0,0 @@
-import { TwoProngForDebugging } from '../debug/two-prong-for-debugging.js';
-import { ElemType_TwoProng } from './elem-type-two-prong.js';
-/** @internal */
-declare function getTwoProngType(e: TwoProngForDebugging): ElemType_TwoProng;
-export { getTwoProngType };

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

@@ -1,9 +0,0 @@
-/** @internal */
-function getTwoProngType(e) {
-    if (e.holeClosing) {
-        return 'twoProng_holeClosing';
-    }
-    return 'twoProng_regular';
-}
-export { getTwoProngType };
-//# sourceMappingURL=get-two-prong-type.js.map

package/node/mat/get-two-prong-type.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-two-prong-type.js","sourceRoot":"","sources":["../../src/mat/get-two-prong-type.ts"],"names":[],"mappings":"AAIA,gBAAgB;AAChB,SAAS,eAAe,CAAC,CAAuB;IAC/C,IAAI,CAAC,CAAC,WAAW,EAAE;QAAE,OAAO,sBAAsB,CAAA;KAAE;IAEpD,OAAO,kBAAkB,CAAC;AAC3B,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/mat/is-another-cp-closeby.d.ts

@@ -1,21 +0,0 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { Loop } from 'flo-boolean';
-import { CpNode } from '../cp-node/cp-node.js';
-import { PointOnShape } from '../point-on-shape/point-on-shape.js';
-import { Circle } from '../geometry/circle.js';
-/**
- * @internal
- * If another `CpNode` is close by (to the given implied (via `pos`, `order` and
- * `order2`) then return it, else return `undefined`.
- *
- * @param cpTrees
- * @param pos
- * @param circle
- * @param order
- * @param order2
- * @param extreme The maximum coordinate value used to calculate floating point
- * tolerances.
- * @param color Used for debugging only
- */
-declare function isAnotherCpCloseby(cpTrees: Map<Loop, LlRbTree<CpNode>>, pos: PointOnShape, circle: Circle, order: number, order2: number, extreme: number): CpNode | undefined;
-export { isAnotherCpCloseby };

package/node/mat/is-another-cp-closeby.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"is-another-cp-closeby.js","sourceRoot":"","sources":["../../src/mat/is-another-cp-closeby.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AAK1E,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AAGjE,gBAAgB;AAChB,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AAG5D;;;;;;;;;;;;;GAaG;AACH,SAAS,kBAAkB,CACnB,OAAmC,EACnC,GAAiB,EACjB,MAAc,EACd,KAAa,EACb,MAAc,EACd,OAAe;IAEnB,MAAM,kBAAkB,GAAG,OAAO,GAAG,KAAK,CAAC;IAC3C,MAAM,oBAAoB,GAAG,kBAAkB,GAAG,IAAI,CAAC;IAEvD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;IAC5C,MAAM,OAAO,GAAG,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAClE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAAE,OAAO,SAAS,CAAC;KAAE;IAEtC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC;IACrB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;QACpC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,kBAAkB,EAAE;YACxB,SAAS;SACZ;QAED,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QAE5B,IAAI,QAAQ,GAAG,eAAe;YAC1B,CAAC,CAAC,GAAG,oBAAoB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;YAElD,sCAAsC;YACtC,OAAO,MAAM,CAAC;SACjB;KACJ;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAGD,OAAO,EAAE,kBAAkB,EAAE,CAAA"}

package/node/mat/simplify-mat-map-only.d.ts

@@ -1,23 +0,0 @@
-import { CpNode } from '../cp-node/cp-node.js';
-/**
- * Simplifies the given MAT by replacing the piecewise quad beziers composing
- * the MAT with fewer ones to within a given tolerance. Returns the map of
- * to be deleted nodes only - does not actually delete them. Use simplifyMat
- * instead if you want to delete the nodes.
- * @param cpNode A representation of the MAT
- * @param anlgeTolerance 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 - defaults to 15.
- * @param hausdorffTolerance The approximate maximum Hausdorff Distance tolerance -
- * defaults to 0.1
- * @param hausdorffSpacing The spacing on the curves used to calculate the Hausdorff
- * Distance - defaults to 1
- */
-declare function simplifyMatMapOnly(cpNode: CpNode, anlgeTolerance?: number, hausdorffTolerance?: number, hausdorffSpacing?: number): {
-    simpleMap: Map<CpNode, {
-        ps: number[][];
-        ts: number[];
-    }>;
-    cpNode: CpNode;
-};
-export { simplifyMatMapOnly };

package/node/mat/simplify-mat-map-only.js

@@ -1,82 +0,0 @@
-import { closestPointOnBezier, hausdorffDistance, toCubic } from 'flo-bezier3';
-import { isTerminating } from '../cp-node/cp-node.js';
-import { getBranches } from './get-branches.js';
-import { getCurveToNext } from '../cp-node/get-curve-to-next.js';
-import { getCurveBetween } from '../get-curve/get-curve-between.js';
-/**
- * Simplifies the given MAT by replacing the piecewise quad beziers composing
- * the MAT with fewer ones to within a given tolerance. Returns the map of
- * to be deleted nodes only - does not actually delete them. Use simplifyMat
- * instead if you want to delete the nodes.
- * @param cpNode A representation of the MAT
- * @param anlgeTolerance 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 - defaults to 15.
- * @param hausdorffTolerance The approximate maximum Hausdorff Distance tolerance -
- * defaults to 0.1
- * @param hausdorffSpacing The spacing on the curves used to calculate the Hausdorff
- * Distance - defaults to 1
- */
-function simplifyMatMapOnly(cpNode, anlgeTolerance = 15, hausdorffTolerance = 1e-1, hausdorffSpacing = 1e0) {
-    const simpleMap = new Map();
-    // Start from a leaf
-    while (!isTerminating(cpNode)) {
-        cpNode = cpNode.next;
-    }
-    const branches = getBranches(cpNode, anlgeTolerance);
-    const canDeletes = [];
-    for (let k = 0; k < branches.length; k++) {
-        const branch = branches[k];
-        // Try to remove some
-        let j = 0;
-        while (j < branch.length) {
-            const i = j;
-            while (true) {
-                j++;
-                if (j === branch.length) {
-                    break;
-                }
-                const hd = getTotalHausdorffDistance(i, j, branch, hausdorffSpacing);
-                if (hd > hausdorffTolerance) {
-                    break;
-                }
-                else {
-                    canDeletes.push(branch[j]);
-                }
-            }
-            if (i + 1 === j) {
-                // no simplification occured
-            }
-            else {
-                const branStart = branch[i];
-                const branEnd = branch[j - 1];
-                const medial = toCubic(getCurveBetween(branStart, branEnd.next));
-                const rev = medial.slice().reverse();
-                let curCpNode = branStart;
-                let prevT = 0;
-                while (curCpNode !== branEnd) {
-                    const t = closestPointOnBezier(medial, curCpNode.next.cp.circle.center).t;
-                    simpleMap.set(curCpNode, { ps: medial, ts: [prevT, t] });
-                    const oppositeCpNode = curCpNode.nextOnCircle.prev;
-                    simpleMap.set(oppositeCpNode, { ps: rev, ts: [1 - t, 1 - prevT] });
-                    prevT = t;
-                    curCpNode = curCpNode.next;
-                }
-                simpleMap.set(curCpNode, { ps: medial, ts: [prevT, 1] });
-                const oppositeCpNode = curCpNode.nextOnCircle.prev;
-                simpleMap.set(oppositeCpNode, { ps: rev, ts: [0, 1 - prevT] });
-            }
-        }
-    }
-    return { simpleMap, cpNode };
-}
-function getTotalHausdorffDistance(i, j, branch, hausdorffSpacing) {
-    const hds = [];
-    const longCurve = getCurveBetween(branch[i], branch[j].next);
-    for (let m = i; m < j + 1; m++) {
-        hds.push(hausdorffDistance(getCurveToNext(branch[m]), longCurve, hausdorffSpacing));
-    }
-    return Math.max(...hds);
-}
-export { simplifyMatMapOnly };
-//# sourceMappingURL=simplify-mat-map-only.js.map

package/node/mat/simplify-mat-map-only.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"simplify-mat-map-only.js","sourceRoot":"","sources":["../../src/mat/simplify-mat-map-only.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAC/E,OAAO,EAAU,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,mCAAmC,CAAC;AAGpE;;;;;;;;;;;;;GAaG;AACH,SAAS,kBAAkB,CACnB,MAAc,EACd,cAAc,GAAG,EAAE,EACnB,kBAAkB,GAAG,IAAI,EACzB,gBAAgB,GAAG,GAAG;IAE1B,MAAM,SAAS,GAAkD,IAAI,GAAG,EAAE,CAAC;IAE3E,oBAAoB;IACpB,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE;QAC3B,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;KACxB;IAED,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAErD,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE3B,qBAAqB;QACrB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC;YACZ,OAAO,IAAI,EAAE;gBACT,CAAC,EAAE,CAAC;gBAEJ,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE;oBAAE,MAAM;iBAAE;gBAEnC,MAAM,EAAE,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;gBAErE,IAAI,EAAE,GAAG,kBAAkB,EAAE;oBACzB,MAAM;iBACT;qBAAM;oBACH,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9B;aACJ;YAED,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACb,4BAA4B;aAC/B;iBAAM;gBACH,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;gBAE5B,MAAM,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;gBACjE,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;gBACrC,IAAI,SAAS,GAAG,SAAS,CAAC;gBAC1B,IAAI,KAAK,GAAG,CAAC,CAAC;gBACd,OAAO,SAAS,KAAK,OAAO,EAAE;oBAC1B,MAAM,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC1E,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;oBACzD,MAAM,cAAc,GAAG,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC;oBACnD,SAAS,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBAE/D,KAAK,GAAG,CAAC,CAAC;oBACV,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;iBAC9B;gBACD,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAEzD,MAAM,cAAc,GAAG,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC;gBACnD,SAAS,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,EAAE,CAAC,CAAC;aAChE;SACJ;KACJ;IAED,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;AACjC,CAAC;AAGD,SAAS,yBAAyB,CAC1B,CAAS,EACT,CAAS,EACT,MAAgB,EAChB,gBAAwB;IAE5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7D,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,GAAG,CAAC,IAAI,CAAC,iBAAiB,CACtB,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACzB,SAAS,EACT,gBAAgB,CACnB,CAAC,CAAC;KACN;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAC5B,CAAC;AAGD,OAAO,EAAE,kBAAkB,EAAE,CAAA"}

package/node/point-on-shape/is-pos-dull-corner.d.ts

@@ -1,6 +0,0 @@
-import { PointOnShape } from "./point-on-shape.js";
-/**
- * @internal
- */
-declare const isPosDullCorner: (a: PointOnShape) => boolean;
-export { isPosDullCorner };