flo-mat 2.0.1 → 2.0.3

package/node/mat/get-leaves.d.ts

@@ -1,4 +1,4 @@
-import { CpNode } from '../cp-node.js';
-/** @hidden */
-declare function getLeaves(cpNode: CpNode): CpNode[];
-export { getLeaves };
+import { CpNode } from '../cp-node.js';
+/** @hidden */
+declare function getLeaves(cpNode: CpNode): CpNode[];
+export { getLeaves };

package/node/mat/get-leaves.js

@@ -1,13 +1,13 @@
-/** @hidden */
-function getLeaves(cpNode) {
-    let leaves = [];
-    let cps = cpNode.getAllOnLoop();
-    cps.forEach(function (cp) {
-        if (cp.isTerminating()) {
-            leaves.push(cp);
-        }
-    });
-    return leaves;
-}
-export { getLeaves };
+/** @hidden */
+function getLeaves(cpNode) {
+    const leaves = [];
+    const cps = cpNode.getAllOnLoop();
+    cps.forEach(function (cp) {
+        if (cp.isTerminating()) {
+            leaves.push(cp);
+        }
+    });
+    return leaves;
+}
+export { getLeaves };
 //# sourceMappingURL=get-leaves.js.map

package/node/mat/get-leaves.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-leaves.js","sourceRoot":"","sources":["../../src/mat/get-leaves.ts"],"names":[],"mappings":"AAGA,cAAc;AACd,SAAS,SAAS,CAAC,MAAc;IAC7B,IAAI,MAAM,GAAa,EAAE,CAAC;IAE1B,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;IAChC,GAAG,CAAC,OAAO,CAAC,UAAS,EAAE;QACnB,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACnB;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}
+{"version":3,"file":"get-leaves.js","sourceRoot":"","sources":["../../src/mat/get-leaves.ts"],"names":[],"mappings":"AAGA,cAAc;AACd,SAAS,SAAS,CAAC,MAAc;IAC7B,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;IAClC,GAAG,CAAC,OAAO,CAAC,UAAS,EAAE;QACnB,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE;YACpB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACnB;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}

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

@@ -1,14 +1,14 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { IPointOnShape } from '../point-on-shape.js';
-import { CpNode } from '../cp-node.js';
-/**
- * @hidden
- * 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: IPointOnShape, order: number, order2: number): CpNode[];
-export { getNeighbouringPoints };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { IPointOnShape } from '../point-on-shape.js';
+import { CpNode } from '../cp-node.js';
+/**
+ * @hidden
+ * 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: IPointOnShape, order: number, order2: number): CpNode[];
+export { getNeighbouringPoints };

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

@@ -1,31 +1,31 @@
-import { CpNode } from '../cp-node.js';
-/**
- * @hidden
- * 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) {
-    let cps = cpTree.findBounds(new CpNode({ 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 };
+import { CpNode } from '../cp-node.js';
+/**
+ * @hidden
+ * 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(new CpNode({ 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 +1 @@
-{"version":3,"file":"get-neighboring-cps.js","sourceRoot":"","sources":["../../src/mat/get-neighboring-cps.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAGvC;;;;;;;;GAQG;AACH,SAAS,qBAAqB,CACtB,MAAwB,EACxB,GAAkB,EAClB,KAAa,EACb,MAAc;IAElB,IAAI,GAAG,GAAG,MAAM,CAAC,UAAU,CACvB,IAAI,MAAM,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CACpF,CAAC;IAEF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACpB,0BAA0B;QAC1B,OAAO,CAAC,SAAS,EAAE,SAAS,CAAa,CAAC;KAC7C;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"}
+{"version":3,"file":"get-neighboring-cps.js","sourceRoot":"","sources":["../../src/mat/get-neighboring-cps.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAGvC;;;;;;;;GAQG;AACH,SAAS,qBAAqB,CACtB,MAAwB,EACxB,GAAkB,EAClB,KAAa,EACb,MAAc;IAElB,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CACzB,IAAI,MAAM,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CACpF,CAAC;IAEF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACpB,0BAA0B;QAC1B,OAAO,CAAC,SAAS,EAAE,SAAS,CAAa,CAAC;KAC7C;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 +1,5 @@
-import { TwoProngForDebugging } from '../debug/two-prong-for-debugging.js';
-import { ElemType_TwoProng } from './elem-type-two-prong.js';
-/** @hidden */
-declare function getTwoProngType(e: TwoProngForDebugging): ElemType_TwoProng;
-export { getTwoProngType };
+import { TwoProngForDebugging } from '../debug/two-prong-for-debugging.js';
+import { ElemType_TwoProng } from './elem-type-two-prong.js';
+/** @hidden */
+declare function getTwoProngType(e: TwoProngForDebugging): ElemType_TwoProng;
+export { getTwoProngType };

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

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

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

@@ -1,20 +1,20 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { Loop } from '../loop.js';
-import { CpNode } from '../cp-node.js';
-import { IPointOnShape } from '../point-on-shape.js';
-import { Circle } from '../circle.js';
-/**
- * @hidden
- * Returns true if another CpNode is close to the given implied (via pos, order
- * and order2) CpNode.
- * @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: IPointOnShape, circle: Circle, order: number, order2: number, extreme: number, color: string): boolean;
-export { isAnotherCpCloseby };
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { Loop } from '../loop.js';
+import { CpNode } from '../cp-node.js';
+import { IPointOnShape } from '../point-on-shape.js';
+import { Circle } from '../circle.js';
+/**
+ * @hidden
+ * Returns true if another CpNode is close to the given implied (via pos, order
+ * and order2) CpNode.
+ * @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: IPointOnShape, circle: Circle, order: number, order2: number, extreme: number, color: string): boolean;
+export { isAnotherCpCloseby };

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

@@ -1,56 +1,56 @@
-import { distanceBetween, toUnitVector, fromTo, dot } from 'flo-vector2d';
-import { getNeighbouringPoints } from './get-neighboring-cps.js';
-/** @hidden */
-//const ANGLE_THRESHOLD = Math.cos(3 * (Math.PI / 180)); // 3 degrees
-const ANGLE_THRESHOLD = 0.9986295347545738; // === Math.cos(3  degrees)
-//const ANGLE_THRESHOLD = 0.9848077530122080; // === Math.cos(10 degrees)
-//const ANGLE_THRESHOLD = 0.9998476951563913; // === Math.cos(1 degrees)
-//const ANGLE_THRESHOLD = 0.9999984769132877; // === Math.cos(0.1 degrees)   
-//const ANGLE_THRESHOLD = 0.9999999847691291  // === Math.cos(0.01 degrees)   
-/**
- * @hidden
- * Returns true if another CpNode is close to the given implied (via pos, order
- * and order2) CpNode.
- * @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
- */
-function isAnotherCpCloseby(cpTrees, pos, circle, order, order2, extreme, color) {
-    //console.log(extreme)
-    //const DISTANCE_THRESHOLD = extreme * 1e-1; 
-    //const DISTANCE_THRESHOLD = extreme * 1e-1;
-    const DISTANCE_THRESHOLD = extreme * 1e-4;
-    //const DISTANCE_THRESHOLD = extreme * 1e-4; - was this
-    //const DISTANCE_THRESHOLD = extreme * 1e-6;
-    //const DISTANCE_THRESHOLD = extreme * 1e-12;
-    // It seems this can be zero else the ordering should be correct
-    //const DISTANCE_THRESHOLD = 0;
-    let cpTree = cpTrees.get(pos.curve.loop);
-    let cpNodes = getNeighbouringPoints(cpTree, pos, order, order2);
-    if (!cpNodes[0]) {
-        return false;
-    }
-    for (let cpNode of cpNodes) {
-        let pos2 = cpNode.cp.pointOnShape;
-        let p1 = pos.p;
-        let p2 = pos2.p;
-        if (distanceBetween(p1, p2) > DISTANCE_THRESHOLD) {
-            continue;
-        }
-        let v1 = toUnitVector(fromTo(cpNode.cp.pointOnShape.p, cpNode.cp.circle.center));
-        let v2 = toUnitVector(fromTo(p1, circle.center));
-        let cosTheta = dot(v1, v2);
-        if (cosTheta > ANGLE_THRESHOLD) {
-            //console.log(`%c${cosTheta} - ${distanceBetween(p1,p2)}`, `color: ${color}`);
-            return true;
-        }
-    }
-    return false;
-}
-export { isAnotherCpCloseby };
+import { distanceBetween, toUnitVector, fromTo, dot } from 'flo-vector2d';
+import { getNeighbouringPoints } from './get-neighboring-cps.js';
+/** @hidden */
+//const ANGLE_THRESHOLD = Math.cos(3 * (Math.PI / 180)); // 3 degrees
+const ANGLE_THRESHOLD = 0.9986295347545738; // === Math.cos(3  degrees)
+//const ANGLE_THRESHOLD = 0.9848077530122080; // === Math.cos(10 degrees)
+//const ANGLE_THRESHOLD = 0.9998476951563913; // === Math.cos(1 degrees)
+//const ANGLE_THRESHOLD = 0.9999984769132877; // === Math.cos(0.1 degrees)   
+//const ANGLE_THRESHOLD = 0.9999999847691291  // === Math.cos(0.01 degrees)   
+/**
+ * @hidden
+ * Returns true if another CpNode is close to the given implied (via pos, order
+ * and order2) CpNode.
+ * @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
+ */
+function isAnotherCpCloseby(cpTrees, pos, circle, order, order2, extreme, color) {
+    //console.log(extreme)
+    //const DISTANCE_THRESHOLD = extreme * 1e-1; 
+    //const DISTANCE_THRESHOLD = extreme * 1e-1;
+    const DISTANCE_THRESHOLD = extreme * 1e-4;
+    //const DISTANCE_THRESHOLD = extreme * 1e-4; - was this
+    //const DISTANCE_THRESHOLD = extreme * 1e-6;
+    //const DISTANCE_THRESHOLD = extreme * 1e-12;
+    // It seems this can be zero else the ordering should be correct
+    //const DISTANCE_THRESHOLD = 0;
+    const cpTree = cpTrees.get(pos.curve.loop);
+    const cpNodes = getNeighbouringPoints(cpTree, pos, order, order2);
+    if (!cpNodes[0]) {
+        return false;
+    }
+    for (const cpNode of cpNodes) {
+        const pos2 = cpNode.cp.pointOnShape;
+        const p1 = pos.p;
+        const p2 = pos2.p;
+        if (distanceBetween(p1, p2) > DISTANCE_THRESHOLD) {
+            continue;
+        }
+        const v1 = toUnitVector(fromTo(cpNode.cp.pointOnShape.p, cpNode.cp.circle.center));
+        const v2 = toUnitVector(fromTo(p1, circle.center));
+        const cosTheta = dot(v1, v2);
+        if (cosTheta > ANGLE_THRESHOLD) {
+            //console.log(`%c${cosTheta} - ${distanceBetween(p1,p2)}`, `color: ${color}`);
+            return true;
+        }
+    }
+    return false;
+}
+export { isAnotherCpCloseby };
 //# sourceMappingURL=is-another-cp-closeby.js.map

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

@@ -1 +1 @@
-{"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,cAAc;AACd,qEAAqE;AACrE,MAAM,eAAe,GAAG,kBAAkB,CAAC,CAAC,2BAA2B;AACvE,yEAAyE;AACzE,wEAAwE;AACxE,6EAA6E;AAC7E,8EAA8E;AAG9E;;;;;;;;;;;;GAYG;AACH,SAAS,kBAAkB,CACnB,OAAmC,EACnC,GAAkB,EAClB,MAAc,EACd,KAAa,EACb,MAAc,EACd,OAAe,EACf,KAAa;IAEjB,sBAAsB;IACtB,6CAA6C;IAC7C,4CAA4C;IAC5C,MAAM,kBAAkB,GAAG,OAAO,GAAG,IAAI,CAAC;IAC1C,uDAAuD;IACvD,4CAA4C;IAC5C,6CAA6C;IAC7C,gEAAgE;IAChE,+BAA+B;IAE/B,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,OAAO,GAAG,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAChE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAAE,OAAO,KAAK,CAAA;KAAE;IAEjC,KAAK,IAAI,MAAM,IAAI,OAAO,EAAE;QACxB,IAAI,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;QAClC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QACf,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAEhB,IAAI,eAAe,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE;YAC7C,SAAS;SACZ;QAED,IAAI,EAAE,GAAG,YAAY,CAAC,MAAM,CACxB,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EACxB,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAC1B,CAAC,CAAC;QACH,IAAI,EAAE,GAAG,YAAY,CAAC,MAAM,CACxB,EAAE,EACF,MAAM,CAAC,MAAM,CAChB,CAAC,CAAC;QACH,IAAI,QAAQ,GAAG,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QAE1B,IAAI,QAAQ,GAAG,eAAe,EAAE;YAC5B,8EAA8E;YAC9E,OAAO,IAAI,CAAC;SACf;KACJ;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,kBAAkB,EAAE,CAAA"}
+{"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,cAAc;AACd,qEAAqE;AACrE,MAAM,eAAe,GAAG,kBAAkB,CAAC,CAAC,2BAA2B;AACvE,yEAAyE;AACzE,wEAAwE;AACxE,6EAA6E;AAC7E,8EAA8E;AAG9E;;;;;;;;;;;;GAYG;AACH,SAAS,kBAAkB,CACnB,OAAmC,EACnC,GAAkB,EAClB,MAAc,EACd,KAAa,EACb,MAAc,EACd,OAAe,EACf,KAAa;IAEjB,sBAAsB;IACtB,6CAA6C;IAC7C,4CAA4C;IAC5C,MAAM,kBAAkB,GAAG,OAAO,GAAG,IAAI,CAAC;IAC1C,uDAAuD;IACvD,4CAA4C;IAC5C,6CAA6C;IAC7C,gEAAgE;IAChE,+BAA+B;IAE/B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAG,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAClE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAAE,OAAO,KAAK,CAAA;KAAE;IAEjC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC;QACpC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAElB,IAAI,eAAe,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE;YAC7C,SAAS;SACZ;QAED,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAC1B,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,EACxB,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAC1B,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAC1B,EAAE,EACF,MAAM,CAAC,MAAM,CAChB,CAAC,CAAC;QACH,MAAM,QAAQ,GAAG,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QAE5B,IAAI,QAAQ,GAAG,eAAe,EAAE;YAC5B,8EAA8E;YAC9E,OAAO,IAAI,CAAC;SACf;KACJ;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,kBAAkB,EAAE,CAAA"}

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

@@ -1,23 +1,23 @@
-import { CpNode } from '../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 };
+import { CpNode } from '../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,81 +1,81 @@
-import { closestPointOnBezier, hausdorffDistance, toCubic } from 'flo-bezier3';
-import { getBranches } from '../get-branches.js';
-import { getCurveToNext } from '../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) {
-    let simpleMap = new Map();
-    // Start from a leaf
-    while (!cpNode.isTerminating()) {
-        cpNode = cpNode.next;
-    }
-    let branches = getBranches(cpNode, anlgeTolerance);
-    let canDeletes = [];
-    for (let k = 0; k < branches.length; k++) {
-        let branch = branches[k];
-        // Try to remove some
-        let j = 0;
-        while (j < branch.length) {
-            let i = j;
-            while (true) {
-                j++;
-                if (j === branch.length) {
-                    break;
-                }
-                let hd = getTotalHausdorffDistance(i, j, branch, hausdorffSpacing);
-                if (hd > hausdorffTolerance) {
-                    break;
-                }
-                else {
-                    canDeletes.push(branch[j]);
-                }
-            }
-            if (i + 1 === j) {
-                // no simplification occured
-            }
-            else {
-                let branStart = branch[i];
-                let branEnd = branch[j - 1];
-                let medial = toCubic(getCurveBetween(branStart, branEnd.next));
-                let rev = medial.slice().reverse();
-                let curCpNode = branStart;
-                let prevT = 0;
-                while (curCpNode !== branEnd) {
-                    let t = closestPointOnBezier(medial, curCpNode.next.cp.circle.center).t;
-                    simpleMap.set(curCpNode, { ps: medial, ts: [prevT, t] });
-                    let 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] });
-                let oppositeCpNode = curCpNode.nextOnCircle.prev;
-                simpleMap.set(oppositeCpNode, { ps: rev, ts: [0, 1 - prevT] });
-            }
-        }
-    }
-    return { simpleMap, cpNode };
-}
-function getTotalHausdorffDistance(i, j, branch, hausdorffSpacing) {
-    let hds = [];
-    let 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 };
+import { closestPointOnBezier, hausdorffDistance, toCubic } from 'flo-bezier3';
+import { getBranches } from '../get-branches.js';
+import { getCurveToNext } from '../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 (!cpNode.isTerminating()) {
+        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 +1 @@
-{"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;AAE/E,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,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,IAAI,SAAS,GAAkD,IAAI,GAAG,EAAE,CAAC;IAEzE,oBAAoB;IACpB,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE;QAC5B,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;KACxB;IAED,IAAI,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAEnD,IAAI,UAAU,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAClC,IAAI,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEzB,qBAAqB;QACrB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE;YACtB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,IAAI,EAAE;gBACT,CAAC,EAAE,CAAC;gBAEJ,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE;oBAAE,MAAM;iBAAE;gBAEnC,IAAI,EAAE,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;gBAEnE,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,GAAC,CAAC,KAAK,CAAC,EAAE;gBACX,4BAA4B;aAC/B;iBAAM;gBACH,IAAI,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,OAAO,GAAG,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;gBAE1B,IAAI,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC/D,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;gBACnC,IAAI,SAAS,GAAG,SAAS,CAAC;gBAC1B,IAAI,KAAK,GAAG,CAAC,CAAC;gBACd,OAAO,SAAS,KAAK,OAAO,EAAE;oBAC1B,IAAI,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACxE,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;oBACzD,IAAI,cAAc,GAAG,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC;oBACjD,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,IAAI,cAAc,GAAG,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC;gBACjD,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,IAAI,GAAG,GAAa,EAAE,CAAC;IACvB,IAAI,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3D,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"}
+{"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;AAE/E,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,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,MAAM,CAAC,aAAa,EAAE,EAAE;QAC5B,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,GAAC,CAAC,KAAK,CAAC,EAAE;gBACX,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/mat/to-scale-axis/add-debug-info.d.ts

@@ -1,7 +1,7 @@
-import { Mat } from '../../mat.js';
-/**
- * @hidden
- * @param sat
- */
-declare function addDebugInfo(sat: Mat, timingStart: number): void;
-export { addDebugInfo };
+import { Mat } from '../../mat.js';
+/**
+ * @hidden
+ * @param sat
+ */
+declare function addDebugInfo(sat: Mat, timingStart: number): void;
+export { addDebugInfo };

package/node/mat/to-scale-axis/add-debug-info.js

@@ -1,14 +1,14 @@
-/**
- * @hidden
- * @param sat
- */
-function addDebugInfo(sat, timingStart) {
-    if (typeof _debug_ === 'undefined') {
-        return;
-    }
-    _debug_.generated.elems.sat.push(sat);
-    let timing = _debug_.generated.timing;
-    timing.sats = performance.now() - timingStart;
-}
-export { addDebugInfo };
+/**
+ * @hidden
+ * @param sat
+ */
+function addDebugInfo(sat, timingStart) {
+    if (typeof _debug_ === 'undefined') {
+        return;
+    }
+    _debug_.generated.elems.sat.push(sat);
+    const timing = _debug_.generated.timing;
+    timing.sats = performance.now() - timingStart;
+}
+export { addDebugInfo };
 //# sourceMappingURL=add-debug-info.js.map

package/node/mat/to-scale-axis/add-debug-info.js.map

@@ -1 +1 @@
-{"version":3,"file":"add-debug-info.js","sourceRoot":"","sources":["../../../src/mat/to-scale-axis/add-debug-info.ts"],"names":[],"mappings":"AAMA;;;GAGG;AACH,SAAS,YAAY,CAAC,GAAQ,EAAE,WAAmB;IAClD,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,OAAO;KAAE;IAE/C,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAEtC,IAAI,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC;IACtC,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC;AAC/C,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}
+{"version":3,"file":"add-debug-info.js","sourceRoot":"","sources":["../../../src/mat/to-scale-axis/add-debug-info.ts"],"names":[],"mappings":"AAMA;;;GAGG;AACH,SAAS,YAAY,CACnB,GAAQ,EACR,WAAmB;IAEpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,OAAO;KAAE;IAE/C,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAEtC,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC;IACxC,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC;AAC/C,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

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

@@ -1,9 +1,9 @@
-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.
- */
-declare function cullNonCycles(cpStart: CpNode): CpNode;
-export { cullNonCycles };
+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.
+ */
+declare function cullNonCycles(cpStart: CpNode): CpNode;
+export { cullNonCycles };