flo-mat 2.0.1 → 2.0.3

package/node/mat/to-scale-axis/cull-non-cycles.js

@@ -1,52 +1,52 @@
-import { getLeaves } from '../get-leaves.js';
-import { CpNode } from '../../cp-node.js';
-/**
- * @hidden
- * Cull all edges not part of a cycle in the MAT planar graph.
- * @param cpStart The start CpNode which must reprsesent the maximal 3-prong
- * vertex.
- */
-function cullNonCycles(cpStart) {
-    let cpNodeKept = cpStart;
-    let leaves = getLeaves(cpStart);
-    while (leaves.length) {
-        let leaf = leaves.pop();
-        // Preserve topology - keep cycles.
-        if (leaf.isHoleClosing || leaf.isIntersection) {
-            continue;
-        }
-        let cpNode = leaf.next; // Turn around
-        while (true) {
-            cpNode = cpNode.next;
-            let cut = false;
-            let cp1 = cpNode.prevOnCircle;
-            if (cpNode.getProngCount() > 2) {
-                //let cp2 = cp1.prevOnCircle;
-                let cp2 = cpNode.nextOnCircle;
-                //if (cpStart === cpNode || cpStart === cp1 || cpStart === cp2) {
-                if (CpNode.isOnSameCircle(cpNode, cpStart)) {
-                    cut = true; // We are at the max disk - cut whole edge
-                }
-                else if (cpNode.next === cp2) {
-                    cpNode = cp2;
-                }
-                else if (cp2.next !== cp1) {
-                    cut = true; // Cut whole edge
-                }
-            }
-            else if (cpNode.isTerminating() && !cpNode.isIntersection) {
-                cpNodeKept = cpNode;
-                return undefined;
-            }
-            if (cut) {
-                cp1.next = cpNode;
-                cpNode.prev = cp1;
-                cpNodeKept = cpNode;
-                break;
-            }
-        }
-    }
-    return cpNodeKept;
-}
-export { cullNonCycles };
+import { getLeaves } from '../get-leaves.js';
+import { CpNode } from '../../cp-node.js';
+/**
+ * @hidden
+ * Cull all edges not part of a cycle in the MAT planar graph.
+ * @param cpStart The start CpNode which must reprsesent the maximal 3-prong
+ * vertex.
+ */
+function cullNonCycles(cpStart) {
+    let cpNodeKept = cpStart;
+    const leaves = getLeaves(cpStart);
+    while (leaves.length) {
+        const leaf = leaves.pop();
+        // Preserve topology - keep cycles.
+        if (leaf.isHoleClosing || leaf.isIntersection) {
+            continue;
+        }
+        let cpNode = leaf.next; // Turn around
+        while (true) {
+            cpNode = cpNode.next;
+            let cut = false;
+            const cp1 = cpNode.prevOnCircle;
+            if (cpNode.getProngCount() > 2) {
+                //const cp2 = cp1.prevOnCircle;
+                const cp2 = cpNode.nextOnCircle;
+                //if (cpStart === cpNode || cpStart === cp1 || cpStart === cp2) {
+                if (CpNode.isOnSameCircle(cpNode, cpStart)) {
+                    cut = true; // We are at the max disk - cut whole edge
+                }
+                else if (cpNode.next === cp2) {
+                    cpNode = cp2;
+                }
+                else if (cp2.next !== cp1) {
+                    cut = true; // Cut whole edge
+                }
+            }
+            else if (cpNode.isTerminating() && !cpNode.isIntersection) {
+                cpNodeKept = cpNode;
+                return undefined;
+            }
+            if (cut) {
+                cp1.next = cpNode;
+                cpNode.prev = cp1;
+                cpNodeKept = cpNode;
+                break;
+            }
+        }
+    }
+    return cpNodeKept;
+}
+export { cullNonCycles };
 //# sourceMappingURL=cull-non-cycles.js.map

package/node/mat/to-scale-axis/cull-non-cycles.js.map

@@ -1 +1 @@
-{"version":3,"file":"cull-non-cycles.js","sourceRoot":"","sources":["../../../src/mat/to-scale-axis/cull-non-cycles.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAG1C;;;;;GAKG;AACH,SAAS,aAAa,CAAC,OAAe;IAElC,IAAI,UAAU,GAAG,OAAO,CAAC;IAEzB,IAAI,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAGhC,OAAO,MAAM,CAAC,MAAM,EAAE;QAClB,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;QAExB,mCAAmC;QACnC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,cAAc,EAAE;YAAE,SAAS;SAAE;QAE5D,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,cAAc;QAEtC,OAAO,IAAI,EAAE;YACT,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;YACrB,IAAI,GAAG,GAAG,KAAK,CAAC;YAChB,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;YAE9B,IAAI,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE;gBAC5B,6BAA6B;gBAC7B,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;gBAE9B,iEAAiE;gBACjE,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;oBACxC,GAAG,GAAG,IAAI,CAAC,CAAC,0CAA0C;iBACzD;qBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,EAAE;oBAC5B,MAAM,GAAG,GAAG,CAAC;iBAChB;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE;oBACzB,GAAG,GAAG,IAAI,CAAC,CAAC,iBAAiB;iBAChC;aACJ;iBAAM,IAAI,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE;gBACzD,UAAU,GAAG,MAAM,CAAC;gBACpB,OAAO,SAAS,CAAC;aACpB;YAED,IAAI,GAAG,EAAE;gBACL,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC;gBAClB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;gBAElB,UAAU,GAAG,MAAM,CAAC;gBACpB,MAAM;aACT;SACJ;KACJ;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}
+{"version":3,"file":"cull-non-cycles.js","sourceRoot":"","sources":["../../../src/mat/to-scale-axis/cull-non-cycles.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAG1C;;;;;GAKG;AACH,SAAS,aAAa,CAAC,OAAe;IAElC,IAAI,UAAU,GAAG,OAAO,CAAC;IAEzB,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAGlC,OAAO,MAAM,CAAC,MAAM,EAAE;QAClB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;QAE1B,mCAAmC;QACnC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,cAAc,EAAE;YAAE,SAAS;SAAE;QAE5D,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,cAAc;QAEtC,OAAO,IAAI,EAAE;YACT,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;YACrB,IAAI,GAAG,GAAG,KAAK,CAAC;YAChB,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;YAEhC,IAAI,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE;gBAC5B,+BAA+B;gBAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;gBAEhC,iEAAiE;gBACjE,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;oBACxC,GAAG,GAAG,IAAI,CAAC,CAAC,0CAA0C;iBACzD;qBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,EAAE;oBAC5B,MAAM,GAAG,GAAG,CAAC;iBAChB;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE;oBACzB,GAAG,GAAG,IAAI,CAAC,CAAC,iBAAiB;iBAChC;aACJ;iBAAM,IAAI,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE;gBACzD,UAAU,GAAG,MAAM,CAAC;gBACpB,OAAO,SAAS,CAAC;aACpB;YAED,IAAI,GAAG,EAAE;gBACL,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC;gBAClB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;gBAElB,UAAU,GAAG,MAAM,CAAC;gBACpB,MAAM;aACT;SACJ;KACJ;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/mat/to-scale-axis/cull.d.ts

@@ -1,12 +1,12 @@
-import { Circle } from '../../circle.js';
-import { CpNode } from '../../cp-node.js';
-/**
- * @hidden
- * Returns the set of Vertices passing the following test: walk the MAT tree and
- * keep all Vertices not in the current cull set and any Vertices that have a
- * non-culled node further down the line toward the tree leaves.
- * @param culls The CpNodes (referred to by circles) that should be culled.
- * @param maxCpNode The start CpNode which must reprsesent the maximal vertex.
- */
-declare function cull(culls: Set<Circle>, maxCpNode: CpNode): void;
-export { cull };
+import { Circle } from '../../circle.js';
+import { CpNode } from '../../cp-node.js';
+/**
+ * @hidden
+ * Returns the set of Vertices passing the following test: walk the MAT tree and
+ * keep all Vertices not in the current cull set and any Vertices that have a
+ * non-culled node further down the line toward the tree leaves.
+ * @param culls The CpNodes (referred to by circles) that should be culled.
+ * @param maxCpNode The start CpNode which must reprsesent the maximal vertex.
+ */
+declare function cull(culls: Set<Circle>, maxCpNode: CpNode): void;
+export { cull };

package/node/mat/to-scale-axis/cull.js

@@ -1,133 +1,133 @@
-import { getLeaves } from '../get-leaves.js';
-import { CpNode } from '../../cp-node.js';
-/**
- * @hidden
- * Returns the set of Vertices passing the following test: walk the MAT tree and
- * keep all Vertices not in the current cull set and any Vertices that have a
- * non-culled node further down the line toward the tree leaves.
- * @param culls The CpNodes (referred to by circles) that should be culled.
- * @param maxCpNode The start CpNode which must reprsesent the maximal vertex.
- */
-function cull(culls, maxCpNode) {
-    let leaves = getLeaves(maxCpNode);
-    function getNonTrivialEdges(cpStart) {
-        let cp = cpStart;
-        let cps = [];
-        do {
-            if (cp.next !== cp.nextOnCircle) {
-                cps.push(cp);
-            }
-            cp = cp.nextOnCircle;
-        } while (cp !== cpStart.prevOnCircle);
-        return cps;
-    }
-    while (leaves.length) {
-        let leaf = leaves.pop();
-        // Preserve topology.
-        if (leaf.isHoleClosing || leaf.isIntersection) {
-            continue;
-        }
-        if (!culls.has(leaf.cp.circle)) {
-            continue;
-        }
-        let cpNode = leaf.next; // Turn around
-        while (true) {
-            cpNode = cpNode.next;
-            let cut = false;
-            let cp1 = cpNode.prevOnCircle;
-            if (!culls.has(cpNode.cp.circle)) {
-                // Cut off the edge once a non-cull has been reached.
-                cut = true;
-            }
-            else if (CpNode.isOnSameCircle(cpNode, maxCpNode)) {
-                cut = true; // We are at the max disk - cut whole edge
-            }
-            else {
-                let cps = getNonTrivialEdges(cpNode);
-                if (cps.length === 1) {
-                    cpNode = cps[0];
-                }
-                else {
-                    cut = true;
-                }
-            }
-            if (cut) {
-                cp1.next = cpNode;
-                cpNode.prev = cp1;
-                break;
-            }
-        }
-    }
-}
-/*
-function cull(
-    culls: Set<Circle>,
-    maxCpNode: CpNode) {
-
-let leaves = getLeaves(maxCpNode);
-
-function getNonTrivialBranches(cpStart: CpNode) {
-    let cp = cpStart.next;
-    
-    let cps: CpNode[] = [];
-    do {
-        if (cp.next !== cp.nextOnCircle) {
-            cps.push(cp);
-        }
-        cp = cp.nextOnCircle;
-    } while (cp !== cpStart)
-
-    return cps;
-}
-
-while (leaves.length) {
-    let leaf = leaves.pop();
-
-    // Preserve topology.
-    if (leaf.isHoleClosing || leaf.isIntersection) { continue; }
-
-    if (!culls.has(leaf.cp.circle)) {
-        continue;
-    }
-
-    let cpNode = leaf.next; // Turn around
-
-    while (true) {
-        cpNode = cpNode.next;
-        let cut = false;
-        let cp1 = cpNode.prevOnCircle;
-
-        if (!culls.has(cpNode.cp.circle)) {
-            // Cut the branch once a non-cull has been reached.
-            cut = true;
-        } else {
-            //let cp2 = cp1.prevOnCircle;
-            let cp2 = cpNode.nextOnCircle;
-
-            //if (maxCpNode === cpNode || maxCpNode === cp1 || maxCpNode === cp2) {
-            if (CpNode.isOnSameCircle(cpNode, maxCpNode)) {
-                cut = true; // We are at the max disk - cut whole edge
-            } else if (cpNode.next === cp2) {
-                // Continue but starting from cp2
-                cpNode = cp2;
-            } else if (cp2.next === cp1) {
-                // Do nothing - ignore the branch starting from cp2 since it
-                // is terminating.
-            } else if (cp2.next !== cp1) {
-                // At this stage (cpNode.next !== cp2 && cp2.next !== cp1)
-                // so it is a bifurcation point - cut the edge.
-                cut = true;
-            }
-        }
-
-        if (cut) {
-            cp1.next = cpNode;
-            cpNode.prev = cp1;
-            break;
-        }
-    }
-}
-}
-*/
-export { cull };
+import { getLeaves } from '../get-leaves.js';
+import { CpNode } from '../../cp-node.js';
+/**
+ * @hidden
+ * Returns the set of Vertices passing the following test: walk the MAT tree and
+ * keep all Vertices not in the current cull set and any Vertices that have a
+ * non-culled node further down the line toward the tree leaves.
+ * @param culls The CpNodes (referred to by circles) that should be culled.
+ * @param maxCpNode The start CpNode which must reprsesent the maximal vertex.
+ */
+function cull(culls, maxCpNode) {
+    const leaves = getLeaves(maxCpNode);
+    function getNonTrivialEdges(cpStart) {
+        let cp = cpStart;
+        const cps = [];
+        do {
+            if (cp.next !== cp.nextOnCircle) {
+                cps.push(cp);
+            }
+            cp = cp.nextOnCircle;
+        } while (cp !== cpStart.prevOnCircle);
+        return cps;
+    }
+    while (leaves.length) {
+        const leaf = leaves.pop();
+        // Preserve topology.
+        if (leaf.isHoleClosing || leaf.isIntersection) {
+            continue;
+        }
+        if (!culls.has(leaf.cp.circle)) {
+            continue;
+        }
+        let cpNode = leaf.next; // Turn around
+        while (true) {
+            cpNode = cpNode.next;
+            let cut = false;
+            const cp1 = cpNode.prevOnCircle;
+            if (!culls.has(cpNode.cp.circle)) {
+                // Cut off the edge once a non-cull has been reached.
+                cut = true;
+            }
+            else if (CpNode.isOnSameCircle(cpNode, maxCpNode)) {
+                cut = true; // We are at the max disk - cut whole edge
+            }
+            else {
+                const cps = getNonTrivialEdges(cpNode);
+                if (cps.length === 1) {
+                    cpNode = cps[0];
+                }
+                else {
+                    cut = true;
+                }
+            }
+            if (cut) {
+                cp1.next = cpNode;
+                cpNode.prev = cp1;
+                break;
+            }
+        }
+    }
+}
+/*
+function cull(
+    culls: Set<Circle>,
+    maxCpNode: CpNode) {
+
+let leaves = getLeaves(maxCpNode);
+
+function getNonTrivialBranches(cpStart: CpNode) {
+    let cp = cpStart.next;
+    
+    let cps: CpNode[] = [];
+    do {
+        if (cp.next !== cp.nextOnCircle) {
+            cps.push(cp);
+        }
+        cp = cp.nextOnCircle;
+    } while (cp !== cpStart)
+
+    return cps;
+}
+
+while (leaves.length) {
+    let leaf = leaves.pop();
+
+    // Preserve topology.
+    if (leaf.isHoleClosing || leaf.isIntersection) { continue; }
+
+    if (!culls.has(leaf.cp.circle)) {
+        continue;
+    }
+
+    let cpNode = leaf.next; // Turn around
+
+    while (true) {
+        cpNode = cpNode.next;
+        let cut = false;
+        let cp1 = cpNode.prevOnCircle;
+
+        if (!culls.has(cpNode.cp.circle)) {
+            // Cut the branch once a non-cull has been reached.
+            cut = true;
+        } else {
+            //let cp2 = cp1.prevOnCircle;
+            let cp2 = cpNode.nextOnCircle;
+
+            //if (maxCpNode === cpNode || maxCpNode === cp1 || maxCpNode === cp2) {
+            if (CpNode.isOnSameCircle(cpNode, maxCpNode)) {
+                cut = true; // We are at the max disk - cut whole edge
+            } else if (cpNode.next === cp2) {
+                // Continue but starting from cp2
+                cpNode = cp2;
+            } else if (cp2.next === cp1) {
+                // Do nothing - ignore the branch starting from cp2 since it
+                // is terminating.
+            } else if (cp2.next !== cp1) {
+                // At this stage (cpNode.next !== cp2 && cp2.next !== cp1)
+                // so it is a bifurcation point - cut the edge.
+                cut = true;
+            }
+        }
+
+        if (cut) {
+            cp1.next = cpNode;
+            cpNode.prev = cp1;
+            break;
+        }
+    }
+}
+}
+*/
+export { cull };
 //# sourceMappingURL=cull.js.map

package/node/mat/to-scale-axis/cull.js.map

@@ -1 +1 @@
-{"version":3,"file":"cull.js","sourceRoot":"","sources":["../../../src/mat/to-scale-axis/cull.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAG1C;;;;;;;GAOG;AACH,SAAS,IAAI,CACL,KAAkB,EAClB,SAAiB;IAErB,IAAI,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;IAElC,SAAS,kBAAkB,CAAC,OAAe;QAC7C,IAAI,EAAE,GAAG,OAAO,CAAC;QAEX,IAAI,GAAG,GAAa,EAAE,CAAC;QAC7B,GAAG;YACO,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,YAAY,EAAE;gBAC7B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAChB;YACV,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC;SACrB,QAAQ,EAAE,KAAK,OAAO,CAAC,YAAY,EAAC;QAErC,OAAO,GAAG,CAAC;IACT,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,EAAE;QAClB,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;QAExB,qBAAqB;QACrB,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,cAAc,EAAE;YAAE,SAAS;SAAE;QAE5D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE;YAC5B,SAAS;SACZ;QAED,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,cAAc;QAEtC,OAAO,IAAI,EAAE;YACT,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;YACrB,IAAI,GAAG,GAAG,KAAK,CAAC;YAChB,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;YAE9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE;gBAC9B,qDAAqD;gBACrD,GAAG,GAAG,IAAI,CAAC;aACd;iBAAM,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;gBACjD,GAAG,GAAG,IAAI,CAAC,CAAC,0CAA0C;aACzD;iBAAM;gBACH,IAAI,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;gBAErC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;oBAClB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;iBACnB;qBAAM;oBACH,GAAG,GAAG,IAAI,CAAC;iBACd;aACJ;YAED,IAAI,GAAG,EAAE;gBACL,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC;gBAClB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;gBAClB,MAAM;aACT;SACJ;KACJ;AACL,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAqEE;AAGF,OAAO,EAAE,IAAI,EAAE,CAAA"}
+{"version":3,"file":"cull.js","sourceRoot":"","sources":["../../../src/mat/to-scale-axis/cull.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAG1C;;;;;;;GAOG;AACH,SAAS,IAAI,CACL,KAAkB,EAClB,SAAiB;IAErB,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;IAEpC,SAAS,kBAAkB,CAAC,OAAe;QAC7C,IAAI,EAAE,GAAG,OAAO,CAAC;QAEX,MAAM,GAAG,GAAa,EAAE,CAAC;QAC/B,GAAG;YACO,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,YAAY,EAAE;gBAC7B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAChB;YACV,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC;SACrB,QAAQ,EAAE,KAAK,OAAO,CAAC,YAAY,EAAC;QAErC,OAAO,GAAG,CAAC;IACT,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,EAAE;QAClB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;QAE1B,qBAAqB;QACrB,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,cAAc,EAAE;YAAE,SAAS;SAAE;QAE5D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE;YAC5B,SAAS;SACZ;QAED,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,cAAc;QAEtC,OAAO,IAAI,EAAE;YACT,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;YACrB,IAAI,GAAG,GAAG,KAAK,CAAC;YAChB,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;YAEhC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE;gBAC9B,qDAAqD;gBACrD,GAAG,GAAG,IAAI,CAAC;aACd;iBAAM,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE;gBACjD,GAAG,GAAG,IAAI,CAAC,CAAC,0CAA0C;aACzD;iBAAM;gBACH,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;gBAEvC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;oBAClB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;iBACnB;qBAAM;oBACH,GAAG,GAAG,IAAI,CAAC;iBACd;aACJ;YAED,IAAI,GAAG,EAAE;gBACL,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC;gBAClB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;gBAClB,MAAM;aACT;SACJ;KACJ;AACL,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAqEE;AAGF,OAAO,EAAE,IAAI,EAAE,CAAA"}

package/node/mat/trim-mat.d.ts

@@ -1,8 +1,8 @@
-import { Mat } from '../mat.js';
-/**
- * Trims the given Medial Axis Transform so that only cycles remain. Similar to
- * toScaleAxis(mat, Number.POSITIVE_INFINITY).
- * @param mat The MAT to trim.
- */
-declare function trimMat(mat: Mat): Mat;
-export { trimMat };
+import { Mat } from '../mat.js';
+/**
+ * Trims the given Medial Axis Transform so that only cycles remain. Similar to
+ * toScaleAxis(mat, Number.POSITIVE_INFINITY).
+ * @param mat The MAT to trim.
+ */
+declare function trimMat(mat: Mat): Mat;
+export { trimMat };

package/node/mat/trim-mat.js

@@ -1,17 +1,17 @@
-import { createNewCpTree } from './create-new-cp-tree.js';
-import { cullNonCycles } from './to-scale-axis/cull-non-cycles.js';
-import { clone } from '../cp-node/clone.js';
-/**
- * Trims the given Medial Axis Transform so that only cycles remain. Similar to
- * toScaleAxis(mat, Number.POSITIVE_INFINITY).
- * @param mat The MAT to trim.
- */
-function trimMat(mat) {
-    let cpNode = cullNonCycles(clone(mat.cpNode));
-    if (!cpNode) {
-        return undefined;
-    }
-    return { cpNode, cpTrees: createNewCpTree(cpNode) };
-}
-export { trimMat };
+import { createNewCpTree } from './create-new-cp-tree.js';
+import { cullNonCycles } from './to-scale-axis/cull-non-cycles.js';
+import { clone } from '../cp-node/clone.js';
+/**
+ * Trims the given Medial Axis Transform so that only cycles remain. Similar to
+ * toScaleAxis(mat, Number.POSITIVE_INFINITY).
+ * @param mat The MAT to trim.
+ */
+function trimMat(mat) {
+    const cpNode = cullNonCycles(clone(mat.cpNode));
+    if (!cpNode) {
+        return undefined;
+    }
+    return { cpNode, cpTrees: createNewCpTree(cpNode) };
+}
+export { trimMat };
 //# sourceMappingURL=trim-mat.js.map

package/node/mat/trim-mat.js.map

@@ -1 +1 @@
-{"version":3,"file":"trim-mat.js","sourceRoot":"","sources":["../../src/mat/trim-mat.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C;;;;GAIG;AACH,SAAS,OAAO,CAAC,GAAQ;IACxB,IAAI,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3C,IAAI,CAAC,MAAM,EAAE;QAAE,OAAO,SAAS,CAAC;KAAE;IAElC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;AACxD,CAAC;AAGD,OAAO,EAAE,OAAO,EAAE,CAAC"}
+{"version":3,"file":"trim-mat.js","sourceRoot":"","sources":["../../src/mat/trim-mat.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C;;;;GAIG;AACH,SAAS,OAAO,CAAC,GAAQ;IACxB,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAE7C,IAAI,CAAC,MAAM,EAAE;QAAE,OAAO,SAAS,CAAC;KAAE;IAElC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;AACxD,CAAC;AAGD,OAAO,EAAE,OAAO,EAAE,CAAC"}

package/node/mat.d.ts

@@ -1,22 +1,22 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from './cp-node.js';
-import { Loop } from './loop.js';
-/**
- * Represents a complete Medial Axis Transform (MAT).
- *
- * The MAT is fully described through its [[CpNode]] property. The [[cpTrees]]
- * property is only added to facilitate extension of the MAT, e.g. by adding
- * extra maximal disks and is typically not used. See [[CpNode]] for more
- * details.
- */
-interface Mat {
-    /** A complete representation of the MAT. See [[CpNode]]. */
-    cpNode: CpNode;
-    /**
-     * Primarily for internal use. A tree structure storing the
-     * [[CpNode]]s of the MAT by their compare order, i.e. their cyclic order
-     * around the shape boundary.
-     */
-    cpTrees: Map<Loop, LlRbTree<CpNode>>;
-}
-export { Mat };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { CpNode } from './cp-node.js';
+import { Loop } from './loop.js';
+/**
+ * Represents a complete Medial Axis Transform (MAT).
+ *
+ * The MAT is fully described through its [[CpNode]] property. The [[cpTrees]]
+ * property is only added to facilitate extension of the MAT, e.g. by adding
+ * extra maximal disks and is typically not used. See [[CpNode]] for more
+ * details.
+ */
+interface Mat {
+    /** A complete representation of the MAT. See [[CpNode]]. */
+    cpNode: CpNode;
+    /**
+     * Primarily for internal use. A tree structure storing the
+     * [[CpNode]]s of the MAT by their compare order, i.e. their cyclic order
+     * around the shape boundary.
+     */
+    cpTrees: Map<Loop, LlRbTree<CpNode>>;
+}
+export { Mat };

package/node/mat.js

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