flo-mat 3.0.6 → 3.0.9

package/src/point-on-shape/pos-to-human-string.ts

@@ -2,7 +2,7 @@ import { PointOnShape } from "./point-on-shape.js"
 
 
 /**
- * Returns a human-readable string of the given [[PointOnShape]]. 
+ * Returns a human-readable string of the given `PointOnShape`.
  * For debugging only.
  * @internal
  */

package/src/sat/to-scale-axis.ts

@@ -20,7 +20,7 @@ import { getSatCulls } from './get-sat-culls.js';
  * boundary of the shape. The SAT is a simplification of the MAT that preserves
  * less detail the higher the applied scale factor. The severity at which noise
  * are removed depends on the local scale of the shape.
- * @param mat The Medial Axis Transform ([[Mat]]) on which to apply the SAT. 
+ * @param mat The Medial Axis Transform (`Mat`) on which to apply the SAT. 
  * @param s The scale factor >= 1 (e.g. 1.3)
  */
 function toScaleAxis(

package/src/vertex/remove-vertex.ts

@@ -1,6 +1,7 @@
-import { Loop } from 'flo-boolean';
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from "../cp-node/cp-node.js";
+// import { Loop } from 'flo-boolean';
+// import { LlRbTree } from 'flo-ll-rb-tree';
+import type { CpNode } from "../cp-node/cp-node.js";
+import type { MatMeta } from '../mat/mat-meta.js';
 import { getAllOnCircle } from '../cp-node/fs/get-all-on-circle.js';
 import { getProngCount } from '../cp-node/fs/get-prong-count.js';
 import { removeCpNode } from '../cp-node/fs/remove-cp-node.js';
@@ -8,14 +9,15 @@ import { removeCpNode } from '../cp-node/fs/remove-cp-node.js';
 
 function removeVertex(
         cpNode: CpNode,
-        cpTrees: Map<Loop, LlRbTree<CpNode>>): void {
+        meta: MatMeta): void {
+        // cpTrees: Map<Loop, LlRbTree<CpNode>>): void {
 
     const prongCount = getProngCount(cpNode);
     if (prongCount !== 2) {
         throw new Error(`Cannot delete \`CpNode\` on ${prongCount}-prong`)
     }
 
-    getAllOnCircle(cpNode).forEach(cpNode => removeCpNode(cpNode, cpTrees));
+    getAllOnCircle(cpNode).forEach(cpNode => removeCpNode(cpNode, meta));
 }
 
 

package/.mocharc.cjs

@@ -1,17 +0,0 @@
-'use strict';
-
-module.exports = {
-    extension: ['ts', 'tsx'],
-    spec: ['__tests__/**/*.spec.ts'],
-    recursive: true,
-    loader: ['ts-node/esm'],
-    // slow: '75',
-    // timeout: '2000',
-    // ignore: ['/path/to/some/ignored/file'],
-    color: true,
-    diff: true,
-    exit: false,
-    parallel: true,
-    timeout: '2000',
-    'v8-stack-trace-limit': 100 // V8 flags are prepended with "v8-"
-};

package/src/debug/functions/draw-elem/branch.ts

@@ -1,26 +0,0 @@
-import { drawFs } from 'flo-draw';
-import { CpNode, isTerminating } from '../../../cp-node/cp-node.js';
-import { getCurveToNext } from '../../../cp-node/get-curve-to-next.js';
-
-
-/** @internal */
-function drawBranch(g: SVGGElement, branch: CpNode[], delay?: number) {
-
-    const classes = 'thin5 purple nofill';
-
-    const $svgs: SVGElement[] = [];
-    let i = 0;
-
-    for (const cpNode of branch) {
-        if (isTerminating(cpNode)) { continue; }
-        const bezier = getCurveToNext(cpNode);
-        if (!bezier) { continue; }
-        i++;
-        $svgs.push( ...drawFs.bezier(g, bezier, classes, delay));
-    }
-    
-    return $svgs;
-}
-
-
-export { drawBranch }

package/src/find-mat/create-initial-cp-graph.ts

@@ -1,59 +0,0 @@
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { Loop } from 'flo-boolean';
-import { CpNode, cpNodeComparator, insertCpNode } from '../cp-node/cp-node.js';
-import { PointOnShape } from '../point-on-shape/point-on-shape.js';
-import { ContactPoint } from '../contact-point/contact-point.js';
-
-
-/**
- * @internal
- * Creates the initial ContactPoint loops from the given sharp corners.
- * @param shape
- * @param sharpCornerss
- */
-function createInitialCpGraph(
-        loops: Loop[], 
-        cpTrees: Map<Loop, LlRbTree<CpNode>>,
-        sharpCornerss: PointOnShape[][]/*,
-        xMap: Map<number[][],{ ps: number[][] }>*/) {
-
-    let cpNode;
-
-    for (let k=0; k<sharpCornerss.length; k++) {
-        const sharpCorners = sharpCornerss[k];
-
-        const cpTree = new LlRbTree(cpNodeComparator, false);
-        
-        let cpNode1: CpNode = undefined!;
-        let cpNode2: CpNode = undefined!;
-        for (const pos of sharpCorners) {
-            const ps = pos.curve.next.ps;
-            //const x = xMap.get(ps);
-            //const isIntersection = !!x;
-            
-            const circle = { center: pos.p, radius: 0 };
-
-            const cp1: ContactPoint = { pointOnShape: pos, circle, order: -1, order2: 0 };
-            const cp2: ContactPoint = { pointOnShape: pos, circle, order: +1, order2: 0 };
-
-            cpNode1 = insertCpNode(false, /*isIntersection*/ false, cpTree, cp1, cpNode2!);
-            cpNode2 = insertCpNode(false, /*isIntersection*/ false, cpTree, cp2, cpNode1);
-            
-            cpNode1.prevOnCircle = cpNode2; 
-            cpNode2.prevOnCircle = cpNode1; 
-
-            cpNode1.nextOnCircle = cpNode2; 
-            cpNode2.nextOnCircle = cpNode1; 
-        }
-
-        if (!cpNode) { cpNode = cpNode1; }
-
-        const loop = loops[k];
-        cpTrees.set(loop, cpTree);
-    }
-
-    return cpNode;
-}
-
-
-export { createInitialCpGraph }