flo-mat 3.0.9 → 3.0.11

package/src/svg/get-loop-bounds.ts

@@ -14,95 +14,95 @@ const INF = Number.POSITIVE_INFINITY;
  * @internal 
  */
 const getLoopBounds = memoize(function(loop: Loop): {
-		minX: PointOnShape;
-		minY: PointOnShape;
-		maxX: PointOnShape;
-		maxY: PointOnShape } {	
+        minX: PointOnShape;
+        minY: PointOnShape;
+        maxX: PointOnShape;
+        maxY: PointOnShape } {    
 
-	const extremes: { 
-		bezier: Curve, 
-		t: number, 
-		val: number 
-	}[][] = [
-		[
-			{ bezier: undefined!, t: undefined!, val: INF}, 
-			{ bezier: undefined!, t: undefined!, val: INF}
-		], 
-		[
-			{ bezier: undefined!, t: undefined!, val: -INF}, 
-			{ bezier: undefined!, t: undefined!, val: -INF}
-		]
-	];
-	
-	loop.curves.forEach(function(curve: Curve): void {			
-		const ps = curve.ps; 
-		// const bounds = getBounds_(ps);
-		const bounds = getBounds(ps);
-		
-		
-		{	
-			{
-				const v = bounds.box[0][0];
-				const x = extremes[0][0].val;
-				if (v < x || (v === x && bounds.ts[0][0] > extremes[0][0].t)) { 
-					extremes[0][0] = { 
-						bezier : curve, 
-						t      : bounds.ts[0][0],
-						val    : v
-					};
-				}
-			}
+    const extremes: { 
+        bezier: Curve, 
+        t: number, 
+        val: number 
+    }[][] = [
+        [
+            { bezier: undefined!, t: undefined!, val: INF}, 
+            { bezier: undefined!, t: undefined!, val: INF}
+        ], 
+        [
+            { bezier: undefined!, t: undefined!, val: -INF}, 
+            { bezier: undefined!, t: undefined!, val: -INF}
+        ]
+    ];
+    
+    loop.curves.forEach(function(curve: Curve): void {            
+        const ps = curve.ps; 
+        // const bounds = getBounds_(ps);
+        const bounds = getBounds(ps);
+        
+        
+        {    
+            {
+                const v = bounds.box[0][0];
+                const x = extremes[0][0].val;
+                if (v < x || (v === x && bounds.ts[0][0] > extremes[0][0].t)) { 
+                    extremes[0][0] = { 
+                        bezier : curve, 
+                        t      : bounds.ts[0][0],
+                        val    : v
+                    };
+                }
+            }
 
-			{
-				const v = bounds.box[0][1];
-				const x = extremes[0][1].val;
-				if (v < x || (v === x && bounds.ts[0][1] > extremes[0][1].t)) { 
-					extremes[0][1] = { 
-						bezier : curve, 
-						t      : bounds.ts[0][1],
-						val    : v
-					};
-				}
-			}
-		}
+            {
+                const v = bounds.box[0][1];
+                const x = extremes[0][1].val;
+                if (v < x || (v === x && bounds.ts[0][1] > extremes[0][1].t)) { 
+                    extremes[0][1] = { 
+                        bezier : curve, 
+                        t      : bounds.ts[0][1],
+                        val    : v
+                    };
+                }
+            }
+        }
 
-		{	
-			{
-				const v = bounds.box[1][0];
-				const x = extremes[1][0].val;
-				if (v > x || (v === x && bounds.ts[1][0] > extremes[1][0].t)) { 
-					extremes[1][0] = { 
-						bezier : curve, 
-						t      : bounds.ts[1][0],
-						val    : v
-					};
-				}
-			}
+        {    
+            {
+                const v = bounds.box[1][0];
+                const x = extremes[1][0].val;
+                if (v > x || (v === x && bounds.ts[1][0] > extremes[1][0].t)) { 
+                    extremes[1][0] = { 
+                        bezier : curve, 
+                        t      : bounds.ts[1][0],
+                        val    : v
+                    };
+                }
+            }
 
-			{
-				const v = bounds.box[1][1];
-				const x = extremes[1][1].val;
-				if (v > x || (v === x && bounds.ts[1][1] > extremes[1][1].t)) { 
-					extremes[1][1] = { 
-						bezier : curve, 
-						t      : bounds.ts[1][1],
-						val    : v
-					};
-				}
-			}
-		}
-	});
+            {
+                const v = bounds.box[1][1];
+                const x = extremes[1][1].val;
+                if (v > x || (v === x && bounds.ts[1][1] > extremes[1][1].t)) { 
+                    extremes[1][1] = { 
+                        bezier : curve, 
+                        t      : bounds.ts[1][1],
+                        val    : v
+                    };
+                }
+            }
+        }
+    });
 
-	return {
-		// minX : new PointOnShape(extremes[0][0].bezier, extremes[0][0].t),
-		// minY : new PointOnShape(extremes[0][1].bezier, extremes[0][1].t),
-		// maxX : new PointOnShape(extremes[1][0].bezier, extremes[1][0].t),
-		// maxY : new PointOnShape(extremes[1][1].bezier, extremes[1][1].t)
-		minY : createPos(extremes[0][1].bezier, extremes[0][1].t, true),
-		minX : createPos(extremes[0][0].bezier, extremes[0][0].t, true),
-		maxX : createPos(extremes[1][0].bezier, extremes[1][0].t, true),
-		maxY : createPos(extremes[1][1].bezier, extremes[1][1].t, true)
-	};
+    return {
+        // minX : new PointOnShape(extremes[0][0].bezier, extremes[0][0].t),
+        // minY : new PointOnShape(extremes[0][1].bezier, extremes[0][1].t),
+        // maxX : new PointOnShape(extremes[1][0].bezier, extremes[1][0].t),
+        // maxY : new PointOnShape(extremes[1][1].bezier, extremes[1][1].t)
+        minY : createPos(extremes[0][1].bezier, extremes[0][1].t, true),
+        minX : createPos(extremes[0][0].bezier, extremes[0][0].t, true),
+        maxX : createPos(extremes[1][0].bezier, extremes[1][0].t, true),
+        maxY : createPos(extremes[1][1].bezier, extremes[1][1].t, true)
+    };
 });
 
 

package/src/svg/get-min-y-pos.ts

@@ -8,7 +8,7 @@ import { getLoopBounds } from './get-loop-bounds.js';
  * Get topmost PointOnShape of the given loop.
  */
 function getMinYPos(loop: Loop) {
-	return getLoopBounds(loop).minY;
+    return getLoopBounds(loop).minY;
 }
 
 

package/src/sweep-line/sweep-line.ts

@@ -33,42 +33,42 @@ function sweepLine<T>(
 
     // Initialize event queue to contain all endpoints.
     const events: IEvent<T>[] = [];
-	for (const item of items) {
-		events.push({ 
+    for (const item of items) {
+        events.push({ 
             type: EVENT_LEFT, 
             item, 
             x: getLeftmost(item)
         });
-		events.push({ 
+        events.push({ 
             type: EVENT_RIGHT, 
             item, 
             x: getRightmost(item)
         });
-	}
+    }
 
-	events.sort(compare);
-	
-	const activeItems = new Set<T>();
+    events.sort(compare);
+    
+    const activeItems = new Set<T>();
     
     /** A list of pairs of items that passed the predicate */
-	const pairedItems: [T,T][] = [];
-	for (const event of events) {
-    	const { item } = event;
-    	
-   		if (event.type === EVENT_LEFT) {
-   			for (const activeItem of activeItems.values()) {
-   				if (predicate(item, activeItem)) { 
+    const pairedItems: [T,T][] = [];
+    for (const event of events) {
+        const { item } = event;
+        
+           if (event.type === EVENT_LEFT) {
+               for (const activeItem of activeItems.values()) {
+                   if (predicate(item, activeItem)) { 
                     pairedItems.push([item, activeItem]);
-   				}
-   			}
+                   }
+               }
 
-   			activeItems.add(item);
-   		} else if (event.type === EVENT_RIGHT) {
-   			activeItems.delete(event.item);
-   		}
-	}
-	
-	return pairedItems;
+               activeItems.add(item);
+           } else if (event.type === EVENT_RIGHT) {
+               activeItems.delete(event.item);
+           }
+    }
+    
+    return pairedItems;
 }
 
 /** @internal */

package/src/utils/bezier-piece-to-bezier.ts

@@ -1,13 +1,13 @@
-import { BezierPiece, fromTo } from "flo-bezier3";
+// import { BezierPiece, fromTo } from "flo-bezier3";
 
 
-function bezierPieceToBezier(
-        piece: BezierPiece) {
+// function bezierPieceToBezier(
+//         piece: BezierPiece) {
 
-    const { ps, ts } = piece;
+//     const { ps, ts } = piece;
 
-    return fromTo(ps, ts[0], ts[1]);
-}
+//     return fromTo(ps, ts[0], ts[1]);
+// }
 
 
-export { bezierPieceToBezier }
+// export { bezierPieceToBezier }

package/__tests__/cp-node/fs/check-jsog-eql-calc.spec.ts

@@ -1,30 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { mats_obj1, getMats_calc1 } from './mat-dummys.js';
-
-
-test('Check MAT objects equal (JSOG)', function() {
-    const mats_calc1 = getMats_calc1();
-
-    // too hard for Jest due to circular references
-    // expect(mats_obj1).toEqual(mats_calc1);
-    
-    // Fast path: check root array structure and length
-    expect(Array.isArray(mats_obj1)).toBe(true);
-    expect(Array.isArray(mats_calc1)).toBe(true);
-    expect(mats_obj1.length).toBe(mats_calc1.length);
-    
-    // Verify key properties of the MAT objects instead of deep comparison
-    if (mats_obj1.length > 0) {
-        const obj = mats_obj1[0];
-        const calc = mats_calc1[0];
-        
-        // Check critical structure exists
-        expect(obj).toHaveProperty('cpNode');
-        expect(calc).toHaveProperty('cpNode');
-        
-        // Verify circular reference integrity
-        if (obj.cpNode && obj.cpNode.nextOnCircle) {
-            expect(obj.cpNode.nextOnCircle).toBeDefined();
-        }
-    }
-});

package/node/cp-node/fs/cp-nodes-to-boundary-beziers.d.ts

@@ -1,3 +0,0 @@
-import { CpNode } from "../cp-node.js";
-declare function cpNodesToBoundaryBeziers(cpNodes: CpNode[]): number[][][];
-export { cpNodesToBoundaryBeziers };

package/node/cp-node/fs/cp-nodes-to-boundary-beziers.js

@@ -1,6 +0,0 @@
-import { getBoundaryBeziersToNext } from "./get-boundary-beziers-to-next.js";
-function cpNodesToBoundaryBeziers(cpNodes) {
-    return cpNodes.flatMap(getBoundaryBeziersToNext);
-}
-export { cpNodesToBoundaryBeziers };
-//# sourceMappingURL=cp-nodes-to-boundary-beziers.js.map

package/node/cp-node/fs/cp-nodes-to-boundary-beziers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cp-nodes-to-boundary-beziers.js","sourceRoot":"","sources":["../../../src/cp-node/fs/cp-nodes-to-boundary-beziers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,wBAAwB,EAAE,MAAM,mCAAmC,CAAC;AAG7E,SAAS,wBAAwB,CAAC,OAAiB;IAC/C,OAAO,OAAO,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAA;AACpD,CAAC;AAGD,OAAO,EAAE,wBAAwB,EAAE,CAAA"}

package/src/closest-boundary-point/get-closest-boundary-point-certified.ts

@@ -1,70 +0,0 @@
-// import { getObjClosestTo } from 'flo-vector2d';
-// import { Curve } from '../curve/curve.js';
-// import { PointOnShape } from '../point-on-shape/point-on-shape.js';
-// import { createPos } from '../point-on-shape/create-pos.js';
-// import { BezierPiece  } from '../mat/bezier-piece.js';
-// import { cullBezierPieces1 } from './cull-bezier-pieces.js';
-// import { getPotentialClosestPointsOnCurveCertified } from './get-potential-closest-points-on-curve-certified.js';
-// import { squaredDistanceBetweenDd } from '../find-2-prong/squared-distance-between-dd.js';
-
-
-// /**
-//  * @internal
-//  * Returns the closest boundary point to the given point, limited to the given 
-//  * bezier pieces, including the beziers actually checked after culling.
-//  * @param bezierPieces
-//  * @param x
-//  * @param touchedCurve
-//  * @param t
-//  * @param extreme
-//  */
-// function getClosestBoundaryPointCertified(
-// 		angle: number,
-//         bezierPieces: BezierPiece[], 
-//         x: number[], 
-// 		touchedCurve: Curve, 
-// 		t: number,
-// 		for1Prong: boolean) {
-	
-// 	bezierPieces = cullBezierPieces1(bezierPieces, x);
- 
-// 	let bestDistance = Number.POSITIVE_INFINITY;
-// 	let pos: PointOnShape;
-// 	for (let i=0; i<bezierPieces.length; i++) {
-// 		const bezierPiece = bezierPieces[i];
-
-//         const ps = getPotentialClosestPointsOnCurveCertified(
-//             bezierPiece.curve, 
-//             x, 
-//             bezierPiece.ts, 
-//             touchedCurve, 
-//             t,
-// 			for1Prong,
-// 			angle
-//         );
-
-// 		const p = getObjClosestTo(x, ps, p => p.p)
-
-// 		if (p === undefined) { continue; }
-
-// 		const d = squaredDistanceBetweenDd(p.p, x);
-
-// 		let curve = bezierPiece.curve;
-// 		let t_= p.t;
-
-// 		if (d < bestDistance) {
-// 			if (t_ === 0) {
-// 				t_ = 1;
-// 				curve = bezierPiece.curve.prev;
-// 			}
-			
-// 			pos = createPos(curve, t_, false);
-// 			bestDistance = d;
-// 		}
-// 	}
-
-// 	return pos!;
-// }
-
-
-// export { getClosestBoundaryPointCertified };

package/src/cp-node/fs/cp-nodes-to-boundary-beziers.ts

@@ -1,10 +0,0 @@
-import { CpNode } from "../cp-node.js";
-import { getBoundaryBeziersToNext } from "./get-boundary-beziers-to-next.js";
-
-
-function cpNodesToBoundaryBeziers(cpNodes: CpNode[]) {
-    return cpNodes.flatMap(getBoundaryBeziersToNext)
-}
-
-
-export { cpNodesToBoundaryBeziers }