flo-mat 3.0.14 → 4.0.1

package/src/sweep-line/are-boxes-intersecting.ts

@@ -1,12 +1,13 @@
 
 /**
- * @internal
  * Returns true if the 2 given (closed) boxes intersect. At this stage we already
  * know their x-axis intersect.
  * @param a A rectangular box
  * @param a Another rectangular box
  * @param closed (defaults to true) Interpret boxes as being closed (i.e. they
  * contain their border) or open.
+ * 
+ * @internal
  */
 function areBoxesIntersecting(closed: boolean) {
     return (a: number[][], b: number[][]): boolean => {
@@ -28,7 +29,7 @@ function areBoxesIntersecting(closed: boolean) {
             : (
                 ax0 < bx1 && ax1 > bx0 && 
                 by0 < ay1 && by1 > ay0
-            )
+            );
     }
 }
 

package/src/utils/mutable.ts

@@ -0,0 +1,7 @@
+
+type Mutable<T> = {
+    -readonly [K in keyof T]: T[K]
+}
+
+
+export type { Mutable }

package/src/utils/rad-to-deg.ts

@@ -1,6 +1,6 @@
 
 function radToDeg(rad: number) {
-    return rad*360/2/Math.PI;
+    return rad*180/Math.PI;
 }
 
 

package/src/utils/smart-log.ts

@@ -0,0 +1,20 @@
+
+let lastLog: any = null;
+let logCount = 1;
+
+/** For debugging only */
+function smartLog(msg: any) {
+    if (msg === lastLog) {
+        logCount++;
+        // Clears the previous line to prevent clutter, keeping only the latest count
+        console.clear(); 
+        console.log(`[${logCount}] ${msg}`);
+    } else {
+        logCount = 1;
+        lastLog = msg;
+        console.log(msg);
+    }
+}
+
+
+export { smartLog }

package/src/utils/sum.ts

@@ -1,5 +1,7 @@
 
-function sum(ns: number[]) {
+function sum(
+        ns: number[]) {
+
     let total = 0;
     for (let n of ns) {
         total += n;

package/src/utils/time-function-call.ts

@@ -0,0 +1,53 @@
+import { sum } from './sum.js';
+
+
+type TimedFunction<T extends (...args: any[]) => any> =
+    ((this: ThisParameterType<T>, ...args: Parameters<T>) => ReturnType<T>) & {
+        getStats: () => {
+            count: number;
+            totalMs: number;
+            avg: number;
+            // history: number[];
+        };
+
+        resetStats: () => void;
+    };
+
+
+/**
+ * 
+ * @param f 
+ */
+function timeFunctionCalls<T extends (...args: any[]) => any>(f: T): TimedFunction<T> {
+    const history: number[] = [];
+
+    function wrapper(this: ThisParameterType<T>, ...args: Parameters<T>): ReturnType<T> {
+        const start = performance.now();
+        const result = f.apply(this, args); // Execute original function
+        const end = performance.now();
+        
+        history.push(end - start); // Track the duration
+
+        return result;
+    };
+
+    // Attach a helper method to inspect stats at any time
+    wrapper.getStats = () => {
+        const total = sum(history);
+        return {
+            totalMs: total,
+            count: history.length,
+            avg: history.length === 0 ? 0 : total / history.length,
+            // history: history
+        };
+    };
+
+    wrapper.resetStats = () => {
+        history.length = 0;
+    }
+
+    return wrapper as TimedFunction<T>;
+}
+
+
+export { timeFunctionCalls }

package/src/vertex/remove-vertex.ts

@@ -1,5 +1,3 @@
-// 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';
@@ -9,13 +7,13 @@ import { removeCpNode } from '../cp-node/fs/remove-cp-node.js';
 
 /**
  * Removes a cpNode from the MAT.
+ * 
  * @param cpTree The tree graph holding the `CpNodes` of the MAT.
  * @param cpNode The `CpNode` to remove.
  */
 function removeVertex(
         cpNode: CpNode,
         meta: MatMeta): void {
-        // cpTrees: Map<Loop, LlRbTree<CpNode>>): void {
 
     const prongCount = getProngCount(cpNode);
     if (prongCount !== 2) {

package/.eslintrc.cjs

@@ -1,69 +0,0 @@
-module.exports = {
-    "env": {
-        "browser": true,
-        "es2021": true,
-        "node": true
-    },
-    "ignorePatterns": [
-        "*.cjs",
-        "*.min.js",
-        "node_modules/",
-        "dist/**/*",
-        "build/**/*",
-        "node/**/*",
-        "browser/**/*",
-        "unused/**/*",
-        "src-unused/**/*",
-        "test/**/*",
-        "docs/**/*",
-        "github assets/**/*",
-        "papers/**/*"
-    ],
-    "extends": [
-        "eslint:recommended",
-        "plugin:@typescript-eslint/recommended"
-    ],
-    "overrides": [
-    ],
-    "parser": "@typescript-eslint/parser",
-    "parserOptions": {
-        "ecmaVersion": "latest",
-        "sourceType": "module"
-    },
-    "plugins": [
-        "@typescript-eslint",
-        "tree-shaking"
-    ],
-    "rules": {
-        'no-constant-condition': 'off',
-        'no-mixed-spaces-and-tabs': 'off',
-        'no-sparse-arrays': 'off',
-        '@typescript-eslint/no-non-null-assertion': 'off',
-        '@typescript-eslint/no-unused-vars': 'off',
-        '@typescript-eslint/no-explicit-any': 'off',
-        '@typescript-eslint/ban-ts-comment': 'off',
-        '@typescript-eslint/no-empty-function': 'off',
-        '@typescript-eslint/no-empty-interface': 'off',
-        '@typescript-eslint/no-loss-of-precision': 'off',
-        '@typescript-eslint/no-this-alias': 'off',
-        "tree-shaking/no-side-effects-in-initialization": [
-            2,
-            {
-                "noSideEffectsWhenCalled": [
-                    { "function": "Object.freeze" },
-                    {
-                        "module": "#local",
-                        "functions": [
-                            "drawMat",
-                            "getTotalBy"
-                        ]
-                    },
-                    {
-                        "module": "flo-memoize",
-                        "functions": ["memoize"],
-                    }
-                ]
-            }
-        ]
-    }
-}

package/__tests__/cp-node/fs/add-distance-from.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { addDistanceFrom } from '../../../src/cp-node/fs/add-distance-from.js';
-
-test.skip('addDistanceFrom [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

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

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { cpNodesToBoundaryBeziers } from '../../../src/cp-node/fs/cp-nodes-to-boundary-beziers.js';
-
-test.skip('cpNodesToBoundaryBeziers [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/cp-node/fs/create-cp-node.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { createCpNode } from '../../../src/cp-node/fs/create-cp-node.js';
-
-test.skip('createCpNode [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/cp-node/fs/enhance-cp-node.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { enhanceCpNode } from '../../../src/cp-node/fs/enhance-cp-node.js';
-
-test.skip('enhanceCpNode [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/cp-node/fs/get-avg-speed.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { getAvgSpeed } from '../../../src/cp-node/fs/get-avg-speed.js';
-
-test.skip('getAvgSpeed [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/cp-node/fs/get-smoothed-speed.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { getSmoothedSpeed$ } from '../../../src/cp-node/fs/get-smoothed-speed.js';
-
-test.skip('getSmoothedSpeed$ [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/cp-node/fs/get-smoothed.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { getSmoothed$ } from '../../../src/cp-node/fs/get-smoothed.js';
-
-test.skip('getSmoothed$ [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/cp-node/fs/get-speed.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { getSpeed } from '../../../src/cp-node/fs/get-speed.js';
-
-test.skip('getSpeed [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/cp-node/fs/is-order-correct.spec.ts

@@ -1,7 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { isOrderCorrect } from '../../../src/cp-node/fs/is-order-correct.js';
-
-test.skip('isOrderCorrect [STUB]', () => {
-    // TODO: implement test
-    expect(true).toBe(true);
-});

package/__tests__/jsog/get-mats1.ts

@@ -1,41 +0,0 @@
-import type { Mat } from "../../src/mat/mat.js";
-import { findMats } from "../../src/find-mat/find-mats.js";
-
-
-/** mat-demo: "achispado" font, "comma" glyph */
-const loops1 = [
-    [
-        [[139, 8], [82, -101]],
-        [[82, -101], [24, 8]],
-        [[24, 8], [46, 8]],
-        [[46, 8], [46, 54]],
-        [[46, 54], [117, 54]],
-        [[117, 54], [117, 8]],
-        [[117, 8], [139, 8]],
-        [[139, 8], [139, 8]]
-    ]
-];
-
-
-// Cache
-let mats1: Mat[] | undefined = undefined;
-function getMats1() {
-    if (mats1) { return mats1; }
-
-    mats1 = findMats(loops1, {
-        applySat: false,
-        simplify: true,
-        satScale: 1.675,
-        maxCurviness: 0.05,
-        maxLength: 40,
-        // maxCurviness: 5,
-        // maxLength: 4000,
-        angleIncrement: 15,
-        simplifyTolerance: 2**-1
-    });
-
-    return mats1;
-}
-
-
-export { getMats1 }

package/node/bezier/fit-quads-to-cubic.d.ts

@@ -1,19 +0,0 @@
-/**
- * TODO2 - change description - just basically copied from flo-bezier3
- * Approximate the given cubic bezier curve (up to the given tolerance) by
- * fitting an array of ordered (by `t` value) piecewise bezier curves
- * (of quadratic order or less).
- *
- * * the start and end point of each approximating curve lies on the cubic
- * curve and the the tangents of each approximating curve coincide with that of
- * the cubic at each such point
- *
- * @param ps a cubic bezier curve given as an ordered array of its
- * control point coordinates, e.g. `[[0,0], [1,1], [2,1], [2,0]]`
- * @param tolerance tolerance given as the maximum total absolute area difference
- * between the two curves
- *
- * @doc mdx
- */
-declare function fitQuadsToCubicTsOnly(ps: number[][], tolerance: number): number[];
-export { fitQuadsToCubicTsOnly };

package/node/bezier/fit-quads-to-cubic.js

@@ -1,83 +0,0 @@
-import { classify, fromToInclErrorBound, cubicToQuadratic, getAbsAreaBetween, bezierSelfIntersection } from 'flo-bezier3';
-/**
- * TODO2 - change description - just basically copied from flo-bezier3
- * Approximate the given cubic bezier curve (up to the given tolerance) by
- * fitting an array of ordered (by `t` value) piecewise bezier curves
- * (of quadratic order or less).
- *
- * * the start and end point of each approximating curve lies on the cubic
- * curve and the the tangents of each approximating curve coincide with that of
- * the cubic at each such point
- *
- * @param ps a cubic bezier curve given as an ordered array of its
- * control point coordinates, e.g. `[[0,0], [1,1], [2,1], [2,0]]`
- * @param tolerance tolerance given as the maximum total absolute area difference
- * between the two curves
- *
- * @doc mdx
- */
-function fitQuadsToCubicTsOnly(ps, tolerance) {
-    const { collinear, realOrder, nodeType } = classify(ps);
-    // if all points collinear or a line (or point)
-    if (collinear || realOrder <= 1) {
-        // return a quad that's a line between the first and last points
-        // return [ps[0], [(ps[0][0] + ps[3][0])/2, (ps[0][1] + ps[3][1])/2], ps[3]];
-        return [0, 1];
-    }
-    if (realOrder === 2) {
-        // already a quadratic in disguise
-        // It is not possible that `toQuadraticFromCubic(ps)` be undefined here
-        // since the `real order` is exactly 2 and the control points are *not*
-        // collinear.
-        return [0, 1];
-    }
-    const stack = [];
-    // if endpoints coincide
-    if (ps[0][0] === ps[3][0] && ps[0][1] === ps[3][1]) {
-        stack.push([0, 0.5], [0.5, 1]);
-    }
-    else if (nodeType === 'cusp') {
-        const t = bezierSelfIntersection(ps)[0];
-        stack.push([0, t], [t, 1]); // split at cusp
-    }
-    else if (nodeType === 'crunode') {
-        const ts = bezierSelfIntersection(ps);
-        if (ts.length > 1) {
-            stack.push([0, ts[0]], [ts[0], ts[1]], [ts[1], 1]); // split at intersections
-        }
-        else {
-            // the intersection is outside the range [0,1]
-            stack.push([0, 1]);
-        }
-    }
-    else {
-        stack.push([0, 1]);
-    }
-    const qs = [];
-    const r = [];
-    while (stack.length !== 0) {
-        const ts = stack.pop();
-        const [tS, tE] = ts;
-        /** the piece of the cubic bezier to approximate */
-        const psCubic = fromToInclErrorBound(ps, tS, tE).ps;
-        const psQuad = cubicToQuadratic(psCubic);
-        // const spanRatio = tE - tS;
-        if (psQuad === undefined ||
-            // spanRatio*getAbsAreaBetween(psQuad, psCubic) > tolerance) {
-            getAbsAreaBetween(psQuad, psCubic) > tolerance) {
-            const tM = (tE + tS) / 2;
-            stack.push([tS, tM], [tM, tE]); // split cubic in 2 equal pieces
-        }
-        else {
-            qs.push(psQuad);
-            r.push(tS);
-        }
-    }
-    r.reverse();
-    r.push(1);
-    return r;
-}
-export { fitQuadsToCubicTsOnly };
-// TESTING
-// fitQuadsToCubicTsOnly([[0,0],[1,0],[0.5,1],[2,0.4]], 0.00001); //?
-//# sourceMappingURL=fit-quads-to-cubic.js.map

package/node/bezier/fit-quads-to-cubic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fit-quads-to-cubic.js","sourceRoot":"","sources":["../../src/bezier/fit-quads-to-cubic.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,QAAQ,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,iBAAiB,EACnE,sBAAsB,EACzB,MAAM,aAAa,CAAC;AAGrB;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,qBAAqB,CACtB,EAAc,EACd,SAAiB;IAErB,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAExD,+CAA+C;IAC/C,IAAI,SAAS,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QAC9B,gEAAgE;QAChE,6EAA6E;QAC7E,OAAO,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QAClB,kCAAkC;QAElC,uEAAuE;QACvE,uEAAuE;QACvE,aAAa;QACb,OAAO,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IAED,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,wBAAwB;IACxB,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;SAAM,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,CAAE,gBAAgB;IAC/C,CAAC;SAAM,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChB,KAAK,CAAC,IAAI,CACN,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EACV,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EACd,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CACb,CAAC,CAAE,yBAAyB;QACjC,CAAC;aAAM,CAAC;YACJ,8CAA8C;YAC9C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;SAAM,CAAC;QACJ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,EAAE,GAAiB,EAAE,CAAC;IAC5B,MAAM,CAAC,GAAa,EAAE,CAAC;IACvB,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAExB,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACnB,mDAAmD;QACnD,MAAM,OAAO,GAAG,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACzC,6BAA6B;QAC7B,IAAI,MAAM,KAAK,SAAS;YACpB,8DAA8D;YAC1D,iBAAiB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAAE,CAAC;YAErD,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAE,gCAAgC;QACnE,CAAC;aAAM,CAAC;YACJ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAChB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;IACL,CAAC;IAED,CAAC,CAAC,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEV,OAAO,CAAC,CAAC;AACb,CAAC;AAGD,OAAO,EAAE,qBAAqB,EAAE,CAAA;AAGhC,UAAU;AACV,qEAAqE"}

package/node/bezier/total-curvature.d.ts

@@ -1,14 +0,0 @@
-import { totalCurvature } from "flo-bezier3";
-declare const totalCurvature$: typeof totalCurvature & {
-    readonly weakMapS: WeakMap<object, {
-        readonly weakMap: WeakMap<object, any>;
-        readonly map: Map<object, any>;
-    }>;
-    readonly mapS: Map<object, {
-        readonly weakMap: WeakMap<object, any>;
-        readonly map: Map<object, any>;
-    }>;
-    readonly clearCache: () => void;
-    readonly addToCache: (r: unknown, ...args: any) => void;
-};
-export { totalCurvature$ };

package/node/bezier/total-curvature.js

@@ -1,5 +0,0 @@
-import { totalCurvature } from "flo-bezier3";
-import { memoize } from "flo-memoize";
-const totalCurvature$ = memoize(totalCurvature);
-export { totalCurvature$ };
-//# sourceMappingURL=total-curvature.js.map

package/node/bezier/total-curvature.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"total-curvature.js","sourceRoot":"","sources":["../../src/bezier/total-curvature.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC,MAAM,eAAe,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;AAGhD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/bezier/total-length.d.ts

@@ -1,14 +0,0 @@
-import { totalLength } from "flo-bezier3";
-declare const totalLength$: typeof totalLength & {
-    readonly weakMapS: WeakMap<object, {
-        readonly weakMap: WeakMap<object, any>;
-        readonly map: Map<object, any>;
-    }>;
-    readonly mapS: Map<object, {
-        readonly weakMap: WeakMap<object, any>;
-        readonly map: Map<object, any>;
-    }>;
-    readonly clearCache: () => void;
-    readonly addToCache: (r: unknown, ...args: any) => void;
-};
-export { totalLength$ };

package/node/bezier/total-length.js

@@ -1,5 +0,0 @@
-import { totalLength } from "flo-bezier3";
-import { memoize } from "flo-memoize";
-const totalLength$ = memoize(totalLength);
-export { totalLength$ };
-//# sourceMappingURL=total-length.js.map

package/node/bezier/total-length.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"total-length.js","sourceRoot":"","sources":["../../src/bezier/total-length.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;AAG1C,OAAO,EAAE,YAAY,EAAE,CAAA"}

package/node/closest-boundary-point/cull-bezier-pieces.d.ts

@@ -1,10 +0,0 @@
-import { CurvePiece } from '../mat/curve-piece.js';
-/**
- * @param curvePieces
- * @param p
- * @param extreme
- *
- * @internal
- */
-declare function cullCurvePieces1(curvePieces: CurvePiece[], p: number[]): CurvePiece[];
-export { cullCurvePieces1 };

package/node/closest-boundary-point/cull-bezier-pieces.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cull-bezier-pieces.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-bezier-pieces.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AACzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAGzE;;;;;;GAMG;AACH,SAAS,gBAAgB,CACjB,WAAyB,EACzB,CAAW;IAEf,MAAM,mBAAmB,GAAG,sBAAsB,CAC9C,WAAW,EAAE,CAAC,CACjB,CAAC;IACF,WAAW,GAAG,sBAAsB,CAChC,WAAW,EAAE,CAAC,EACd,mBAAmB,CACtB,CAAC;IAEF,WAAW,GAAG,sBAAsB,CAChC,WAAW,EAAE,CAAC,EACd,mBAAmB,CACtB,CAAC;IAGF,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

package/node/closest-boundary-point/dd-deflate-with-running-error.d.ts

@@ -1,25 +0,0 @@
-/**
- * Deflates the given polynomial *approximately* by removing a factor (x - t).
- *
- * @param p a polynomial with coefficients given densely as an array of
- * double-double precision floating point numbers from highest to lowest power,
- * e.g. `[[0,5],[0,-3],[0,0]]` represents the polynomial `5x^2 - 3x`
- * @param pE the coefficient-wise absolute error of the input polynomial that
- * still need to be multiplied by γγ3, i.e. it is `γγ3` times too big.
- * @param t an evaluation point of the polynomial.
- *
- * @example
- * ```typescript
- * // The polynomial x^3 - 5x^2 + 8x - 4 has a root at 1 and a double root at 2
- * ddDeflate([[0,1], [0,-5], [0,8], [0,-4]], [0,2]); //=> [[0,1], [0,-3], [0,2]]
- * ddDeflate([[0,1], [0,-3], [0,2], [0,2]);          //=> [[0,1], [0,-1]]
- * ddDeflate([[0,1], [0,-1]], [0,1]);                //=> [[0,1]]
- * ```
- *
- * @doc
- */
-declare function ddDeflateWithRunningError(p: number[][], pE: number[], t: number): {
-    coeffs: number[][];
-    errBound: number[];
-};
-export { ddDeflateWithRunningError };

package/node/closest-boundary-point/dd-deflate-with-running-error.js

@@ -1,68 +0,0 @@
-// TODO - import from `flo-poly` in the future
-import { ddMultDouble2 } from "double-double";
-import { ddAddDd } from "double-double";
-import { γγ } from '../error-analysis/gamma.js';
-// We *have* to do the below❗ The assignee is a getter❗ The assigned is a pure function❗ Otherwise code is too slow❗
-const qmd = ddMultDouble2;
-const qaq = ddAddDd;
-const { abs } = Math;
-const γγ3 = γγ(3);
-/**
- * Deflates the given polynomial *approximately* by removing a factor (x - t).
- *
- * @param p a polynomial with coefficients given densely as an array of
- * double-double precision floating point numbers from highest to lowest power,
- * e.g. `[[0,5],[0,-3],[0,0]]` represents the polynomial `5x^2 - 3x`
- * @param pE the coefficient-wise absolute error of the input polynomial that
- * still need to be multiplied by γγ3, i.e. it is `γγ3` times too big.
- * @param t an evaluation point of the polynomial.
- *
- * @example
- * ```typescript
- * // The polynomial x^3 - 5x^2 + 8x - 4 has a root at 1 and a double root at 2
- * ddDeflate([[0,1], [0,-5], [0,8], [0,-4]], [0,2]); //=> [[0,1], [0,-3], [0,2]]
- * ddDeflate([[0,1], [0,-3], [0,2], [0,2]);          //=> [[0,1], [0,-1]]
- * ddDeflate([[0,1], [0,-1]], [0,1]);                //=> [[0,1]]
- * ```
- *
- * @doc
- */
-function ddDeflateWithRunningError(p, pE, t) {
-    //--------------------------------------------------------------------------
-    // `var` -> a variable
-    // `$var` -> the double precision approximation to `var`
-    // `_var` -> the absolute value of $var (a prefix underscore on a variable means absolute value)
-    // `var_` -> the error in var (a postfix underscore means error bound but should still be multiplied by 3*γ²)
-    // `_var_` -> means both absolute value and absolute error bound
-    // recall: `a*b`, where both `a` and `b` have errors |a| and |b| we get for the
-    //   * error bound of (a*b) === a_|b| + |a|b_ + |a*b|   (when either of a and b is double)
-    //   * error bound of (a*b) === a_|b| + |a|b_ + 2|a*b|  (when both a and b is double-double)
-    //   * error bound of (a+b) === a_ + b_ + |a+b|         (when a and/or b is double or double-double)
-    // * the returned errors need to be multiplied by 3γ² to get the true error
-    // * can use either `$var` or `var[var.length-1]` (the approx value) in error calculations
-    //   due to multiplication by 3*γ² and not 3*u²
-    //--------------------------------------------------------------------------
-    const d = p.length - 1;
-    const bs = [p[0]]; // coefficients
-    let b_ = pE[0]; // running error
-    const bEs = [b_]; // coefficient-wise error bound
-    for (let i = 1; i < d; i++) {
-        // p[i] + t*bs[i-1];
-        const a = bs[i - 1];
-        const $m = t * a[1];
-        const _t = abs(t);
-        const m_ = _t * b_ + abs($m);
-        const pi = p[i];
-        const p_ = pE[i];
-        b_ = p_ + m_ + abs(pi[1] + $m);
-        const b = qaq(pi, qmd(t, a));
-        bs.push(b);
-        bEs.push(b_);
-    }
-    return {
-        coeffs: bs,
-        errBound: bEs.map(e => γγ3 * e)
-    };
-}
-export { ddDeflateWithRunningError };
-//# sourceMappingURL=dd-deflate-with-running-error.js.map

package/node/closest-boundary-point/dd-deflate-with-running-error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dd-deflate-with-running-error.js","sourceRoot":"","sources":["../../src/closest-boundary-point/dd-deflate-with-running-error.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,EAAE,EAAE,MAAM,4BAA4B,CAAC;AAGhD,oHAAoH;AACpH,MAAM,GAAG,GAAG,aAAa,CAAC;AAC1B,MAAM,GAAG,GAAG,OAAO,CAAC;AAEpB,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAErB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAGlB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,yBAAyB,CAC1B,CAAa,EACb,EAAY,EACZ,CAAS;IAKb,4EAA4E;IAC5E,sBAAsB;IACtB,wDAAwD;IACxD,gGAAgG;IAChG,6GAA6G;IAC7G,gEAAgE;IAChE,+EAA+E;IAC/E,0FAA0F;IAC1F,4FAA4F;IAC5F,oGAAoG;IACpG,2EAA2E;IAC3E,0FAA0F;IAC1F,+CAA+C;IAC/C,4EAA4E;IAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,eAAe;IACrC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAO,gBAAgB;IACtC,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAK,+BAA+B;IAErD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACrB,oBAAoB;QAEpB,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,EAAE,GAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;QAE3B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjB,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAE/B,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,EAAC,GAAG,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;QAE3B,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,OAAO;QACH,MAAM,EAAE,EAAE;QACV,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAC,CAAC,CAAC;KAChC,CAAC;AACN,CAAC;AAGD,OAAO,EAAE,yBAAyB,EAAE,CAAA"}

package/node/contact-point/contact-point.d.ts

@@ -1,26 +0,0 @@
-import { PointOnShape } from '../point-on-shape/point-on-shape.js';
-import { Circle } from '../geometry/circle.js';
-/**
- * Represents a point on the shape boundary for which MAT data has been
- * calculated.
- */
-interface ContactPoint {
-    /** Identifies the point on the shape boundary. */
-    pointOnShape: PointOnShape;
-    /** The maximal disk circle touching this point. */
-    circle: Circle;
-    /** Internally used to order two points lying at the same planar point. */
-    order: number;
-    /** Internally used to order two points lying at the same planar point. */
-    order2: number;
-}
-/**
- * Primarily for internal use.
- *
- * Compares the two contact points according to their order along the shape
- * boundary. Returns > 0 if a > b, < 0 if a < b or 0 if a === b.
- * @param a The first contact point.
- * @param b The second contact point.
- */
-declare function compareCps(a: ContactPoint, b: ContactPoint): number;
-export { ContactPoint, compareCps };