flo-mat 4.1.5 → 5.0.1

package/src/sat/cull.ts

@@ -1,9 +1,8 @@
 import type { CpNode } from '../cp-node/cp-node.js';
-import type { DualSet } from '../utils/dual-set.js';
+import type { Circle } from '../geometry/circle.js';
 import type { Mutable } from '../utils/mutable.js';
 import { getLeaves } from './get-leaves.js';
 import { isTerminating } from '../cp-node/fs/is-terminating.js';
-import { DualSetFs } from '../utils/dual-set.js';
 import { isOnSameCircle } from '../cp-node/fs/is-on-same-circle.js';
 
 
@@ -32,17 +31,18 @@ function getNonTrivialForwardEdges(cpStart: CpNode) {
 
 
 /**
- * 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 `CpNode`s (referred to by circles) that should be culled
+ * Culls (in place) the vertices of the given MAT tree: walking the tree from
+ * the maximal vertex, all vertices in the cull set are removed except those
+ * that have a non-culled vertex further down the line toward the tree leaves
+ * (which are kept to preserve the topology).
+ *
+ * @param culls the vertices (identified by their `Circle`) that should be culled
  * @param maxCpNode the start `CpNode` which must represent the maximal vertex
  * 
  * @internal
  */
 function cull(
-        culls: DualSet<number, number>,
+        culls: Set<Circle>,
         maxCpNode: CpNode) {
 
     const leaves = getLeaves(maxCpNode);
@@ -50,8 +50,7 @@ function cull(
     while (leaves.length) {
         const leaf = leaves.pop()!;
 
-        const { center: c } = leaf.pointOnShape.circle;
-        if (!DualSetFs.has(culls, c[0], c[1]) ||
+        if (!culls.has(leaf.pointOnShape.circle) ||
             // Preserve topology.
             leaf.isIntersection) {
 
@@ -63,8 +62,7 @@ function cull(
         while (!cut) {
             cpNode = cpNode.next;
 
-            const { center: c } = cpNode.pointOnShape.circle;
-            if (!DualSetFs.has(culls, c[0], c[1])) {
+            if (!culls.has(cpNode.pointOnShape.circle)) {
                 // Cut off the edge once a non-cull has been reached.
                 while (isTerminating(cpNode.prevOnCircle)) {
                     cpNode = cpNode.prevOnCircle;
@@ -83,14 +81,12 @@ function cull(
             }
         }
 
-        if (cut) {
-            const cp1 = cpNode.prevOnCircle as Mutable<CpNode>;
-            cp1.next = cpNode;
-            (cpNode as Mutable<CpNode>).prev = cp1;
-
-            cp1.nextOnCircle = cpNode;
-            (cpNode as Mutable<CpNode>).prevOnCircle = cp1;
-        }
+        // Cut the edge: link the node we stopped at directly to the one before
+        // it on its circle (`cut` is necessarily `true` here; the on-circle
+        // links are already consistent by the ring invariant)
+        const cp1 = cpNode.prevOnCircle as Mutable<CpNode>;
+        cp1.next = cpNode;
+        (cpNode as Mutable<CpNode>).prev = cp1;
     }
 }
 

package/src/sat/get-sat-culls.ts

@@ -1,41 +1,46 @@
-import type { DualSet } from "../utils/dual-set.js";
 import type { CpNode } from "../cp-node/cp-node.js";
-import { length } from "flo-bezier3";
-import { getAllOnCircle } from "../cp-node/fs/get-all-on-circle.js";
-import { getMatCurveToNext } from "../cp-node/fs/get-mat-curve-to-next.js";
+import type { Circle } from "../geometry/circle.js";
+import { getMatDistanceToNext } from "../cp-node/fs/get-distance-to-next.js";
 import { traverseEdges } from "../cp-node/fs/traverse-edges.js";
-import { DualSetFs } from "../utils/dual-set.js";
 
 
+/**
+ * Returns the set of MAT vertices (identified by their `Circle` - all `CpNode`s
+ * on a vertex share the same `Circle` object) that are to be culled by the
+ * Scale Axis Transform with the given scale factor.
+ *
+ * @param cpNode the `CpNode` representing the maximal vertex
+ * @param s the scale factor
+ *
+ * @internal
+ */
 function getSatCulls(
-        cpNode: CpNode, 
-        s: number) {
+        cpNode: CpNode,
+        s: number): Set<Circle> {
 
-    /** 
-     * All vertices that are set to be culled initially. This may change later 
-     * in order to preserve topology. 
+    /**
+     * All vertices that are set to be culled initially. This may change later
+     * in order to preserve topology.
      */
-    const culls: DualSet<number,number> = new Map();
+    const culls = new Set<Circle>();
 
-    const rMap: Map<CpNode,number> = new Map();
+    /** The osculating radius stored with each vertex. */
+    const rMap = new Map<Circle, number>();
 
     traverseEdges(cpNode, function(cpNode) {
-        /** The occulating radius stored with this vertex. */
-        const R = rMap.get(cpNode) || (s*cpNode.pointOnShape.circle.radius);
+        const circle = cpNode.pointOnShape.circle;
+        const R = rMap.get(circle) ?? s*circle.radius;
 
         const cpNode_ = cpNode.next;
+        const circle_ = cpNode_.pointOnShape.circle;
 
-        const l = length([0,1], getMatCurveToNext(cpNode));
+        const l = getMatDistanceToNext(cpNode);
 
-        const r = cpNode_.pointOnShape.circle.radius;
-        const r_ = s*r;
+        const r_ = s*circle_.radius;
         if (R - l > r_) {
-            for (const cpNode of getAllOnCircle(cpNode_)) {
-                rMap.set(cpNode, R - l); // Update osculating radii
-                if (!cpNode_.isHoleClosing) {
-                    const { center: c } = cpNode_.pointOnShape.circle;
-                    DualSetFs.add(culls, c[0], c[1]);
-                }
+            rMap.set(circle_, R - l); // Update osculating radius
+            if (!cpNode_.isHoleClosing) {
+                culls.add(circle_);
             }
         }
     });

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

@@ -1,11 +1,10 @@
 import type { Loop } from 'flo-boolean';
 import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
-import { memoize } from 'flo-memoize';
 import { getLoopBounds$ } from './get-loop-bounds.js';
 
 
 /** @internal */
-const getShapeBounds = memoize(function(loops: Loop[]) {
+function getShapeBounds(loops: Loop[]) {
     let minX_ = +Infinity;
     let maxX_ = -Infinity;
     let minY_ = +Infinity;
@@ -42,7 +41,7 @@ const getShapeBounds = memoize(function(loops: Loop[]) {
         maxX: maxX!,
         maxY: maxY!
     };
-});
+}
 
 
 export { getShapeBounds }

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

@@ -58,7 +58,7 @@ function sweepLine<T>(
            if (event.type === EVENT_LEFT) {
                for (const activeItem of activeItems.values()) {
                    if (predicate(item, activeItem)) { 
-                    pairedItems.push([item, activeItem]);
+                        pairedItems.push([item, activeItem]);
                    }
                }
 

package/src/utils/get-beziers-from-tangents.ts

@@ -0,0 +1,110 @@
+import { fromTo, dot, cross, lineLineIntersection } from 'flo-vector2d';
+
+const { abs, sqrt } = Math;
+
+
+/**
+ * The maximum sine of the angle between the chord and either tangent for
+ * which a 'twisted' (inflected) curve is approximated by a straight line -
+ * the line then deviates from the true curve by only about a millionth of the
+ * chord length.
+ *
+ * * a relative (angle) tolerance and thus independent of the scale of the
+ *   shape and of the magnitude of the given tangents
+ *
+ * @internal
+ */
+const SIN_TOLERANCE_USE_LINE = 2**-16;
+
+
+/**
+ * Returns an array of 1 or 2 bezier curves (each a line or a quadratic) that
+ * together form a smooth curve from the start point of `l0` to the start point
+ * of `l1` such that the curve is tangent to `l0` at its start and tangent to
+ * `l1` at its end.
+ *
+ * * `l0` and `l1` are given as `[p, p + dir]` where `p` is the curve endpoint
+ * and `dir` is the tangent direction (of any magnitude; its orientation does
+ * not matter)
+ * * if the tangent lines are not 'twisted' (they meet strictly between the
+ * endpoints along the chord) a single quadratic is returned
+ * * if the tangent lines are 'twisted' (the curve must have an inflection)
+ * 2 quadratics joined smoothly at the inflection are returned as an
+ * approximation - or, if both tangents deviate from the chord by less than
+ * `SIN_TOLERANCE_USE_LINE`, a single line
+ * * if the endpoints coincide (or a tangent is degenerate) a (degenerate) line
+ * is returned
+ *
+ * FUTURE: a strongly twisted MAT edge indicates that an additional 2-prong
+ * should be added so that the edge is approximated by two less twisted ones.
+ *
+ * @param l0 the tangent line at the start of the curve
+ * @param l1 the tangent line at the end of the curve
+ *
+ * @internal
+ */
+function getBeziersFromTangents(
+        l0: number[][],
+        l1: number[][]): number[][][] {
+
+    const p0 = l0[0];
+    const p1 = l1[0];
+
+    const c = fromTo(p0,p1);
+    if (c[0] === 0 && c[1] === 0) {
+        return [[p0, p1]];  // coinciding endpoints - a degenerate line
+    }
+
+    const w0 = fromTo(l0[0], l0[1]);
+    const w1 = fromTo(l1[0], l1[1]);
+    const lc = sqrt(dot(c,c));
+    const lw0 = sqrt(dot(w0,w0));
+    const lw1 = sqrt(dot(w1,w1));
+    if (lw0 === 0 || lw1 === 0) {
+        return [[p0, p1]];  // a degenerate tangent - fall back to a line
+    }
+
+    const mid = lineLineIntersection(l0, l1);
+
+    let twisted: boolean;
+    if (!mid) {
+        twisted = true;
+    } else {
+        const a = fromTo(p0, mid);
+        const b = fromTo(p1, mid);
+
+        // (`<= 0` / `>= 0`: an intersection *at* an endpoint, which happens for
+        // collinear tangents, would give a degenerate quadratic with a zero
+        // end tangent - treat it as twisted so a line results instead)
+        twisted = dot(a,c) <= 0 || dot(b,c) >= 0;
+    }
+
+    if (!twisted) {
+        return [[p0, mid!, p1]];
+    }
+
+    // the sines of the angles between the chord and the tangents
+    const sin0 = abs(cross(c, w0)) / (lc*lw0);
+    const sin1 = abs(cross(c, w1)) / (lc*lw1);
+
+    if (sin0 <= SIN_TOLERANCE_USE_LINE && sin1 <= SIN_TOLERANCE_USE_LINE) {
+        return [[p0, p1]];  // within tolerance - a straight line
+    }
+
+    // Approximate with 2 quadratic beziers joined smoothly at the inflection.
+    // The control points lie on the tangent lines a quarter of the chord
+    // length away from the endpoints, on the side facing the other endpoint
+    // (for small angles this is the midpoint degree reduction of the cubic
+    // having control points at 1/3 and 2/3 along the chord; unlike placing
+    // them at 1/4 and 3/4 *along* the chord it stays bounded for any angle).
+    const q0 = (dot(w0,c) < 0 ? -1 : 1) * lc/(4*lw0);
+    const q1 = (dot(w1,c) < 0 ? 1 : -1) * lc/(4*lw1);
+    const c0 = [p0[0] + q0*w0[0], p0[1] + q0*w0[1]];
+    const c1 = [p1[0] + q1*w1[0], p1[1] + q1*w1[1]];
+    const j = [(c0[0] + c1[0])/2, (c0[1] + c1[1])/2];
+
+    return [[p0, c0, j], [j, c1, p1]];
+}
+
+
+export { getBeziersFromTangents }

package/src/utils/map-map.ts

@@ -19,7 +19,7 @@ function mapmap<T,U>(
         for (let j=0; j<ts.length; j++) {
             const v = f(ts[j]);
             if (filter(v)) {
-                ts_.push(f(ts[j]));
+                ts_.push(v);
             }
         }
         tss_.push(ts_);

package/src/vertex/remove-vertex.ts

@@ -6,10 +6,12 @@ import { removeCpNode } from '../cp-node/fs/remove-cp-node.js';
 
 
 /**
- * Removes a cpNode from the MAT.
+ * Removes the (2-prong) vertex represented by the given `CpNode` from the MAT,
+ * i.e. both `CpNode`s on its circle are unlinked from the boundary and removed
+ * from `meta.cpTrees`.
  * 
- * @param cpTree The tree graph holding the `CpNodes` of the MAT.
- * @param cpNode The `CpNode` to remove.
+ * @param cpNode a `CpNode` on the vertex to remove
+ * @param meta the `MatMeta` whose `cpTrees` hold the `CpNode`s of the MAT
  */
 function removeVertex(
         cpNode: CpNode,

package/__tests__/cp-node/fs/get-distance-between.spec.ts

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

package/__tests__/cp-node/fs/get-terminating-on-circle.spec.ts

@@ -1,24 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { getTerminatingOnCircle } from '../../../src/cp-node/fs/get-terminating-on-circle.js';
-import { getNonTerminatingOnCircle } from '../../../src/cp-node/fs/get-non-terminating-on-circle.js';
-import { getProngCount } from '../../../src/cp-node/fs/get-prong-count.js';
-import { isTerminating } from '../../../src/cp-node/fs/is-terminating.js';
-import { getMats1 } from '../../get-mats1.js';
-
-
-test('getTerminatingOnCircle', function() {
-    const { cpNode } = getMats1()[0];
-
-    const terminating = getTerminatingOnCircle(cpNode);
-    for (const n of terminating) {
-        expect(isTerminating(n)).toBe(true);
-    }
-
-    // terminating + non-terminating = total prong count
-    const nonTerminating = getNonTerminatingOnCircle(cpNode);
-    expect(terminating.length + nonTerminating.length).toBe(getProngCount(cpNode));
-
-    // exclThis: cpNode should not be included
-    const termExcl = getTerminatingOnCircle(cpNode, true);
-    expect(termExcl.includes(cpNode)).toBe(false);
-});

package/__tests__/cp-node/fs/is-single-3-prong.spec.ts

@@ -1,17 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { isSingle3Prong } from '../../../src/cp-node/fs/is-single-3-prong.js';
-import { getAllOnLoop } from '../../../src/cp-node/fs/get-all-on-loop.js';
-import { getMats1 } from '../../get-mats1.js';
-
-
-test('isSingle3Prong', function() {
-    const { cpNode } = getMats1()[0];
-    const allOnLoop = getAllOnLoop(cpNode);
-
-    for (const n of allOnLoop) {
-        if (isSingle3Prong(n)) {
-            expect(n.next === n.nextOnCircle).toBe(true);
-            expect(n.next.next === n.next.nextOnCircle).toBe(true);
-        }
-    }
-});

package/__tests__/cp-node/fs/iterate-all-on-loop.spec.ts

@@ -1,17 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { iterateAllOnLoop } from '../../../src/cp-node/fs/iterate-all-on-loop.js';
-import { getAllOnLoop } from '../../../src/cp-node/fs/get-all-on-loop.js';
-import { getMats1 } from '../../get-mats1.js';
-
-
-test('iterateAllOnLoop', function() {
-    const { cpNode } = getMats1()[0];
-
-    const iterated = [...iterateAllOnLoop(cpNode)];
-    const expected = getAllOnLoop(cpNode);
-
-    expect(iterated.length).toBe(expected.length);
-    for (let i = 0; i < iterated.length; i++) {
-        expect(iterated[i] === expected[i]).toBe(true);
-    }
-});

package/__tests__/cp-node/fs/traverse-all-forward.spec.ts

@@ -1,14 +0,0 @@
-import { expect, test } from '@jest/globals';
-import { traverseAllForward } from '../../../src/cp-node/fs/traverse-all-forward.js';
-import { getMats1 } from '../../get-mats1.js';
-
-
-test('traverseAllForward', function() {
-    const { cpNode } = getMats1()[0];
-
-    const visited: (typeof cpNode)[] = [];
-    traverseAllForward(cpNode, cp => visited.push(cp));
-
-    expect(visited.length).toBeGreaterThan(0);
-    expect(visited[0] === cpNode).toBe(true);
-});

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

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

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

@@ -1,17 +0,0 @@
-import { getBestDistanceSquared } from './get-best-distance-squared.js';
-import { cullByLooseBoundingBox } from './cull-by-loose-bounding-box.js';
-import { cullByTightBoundingBox } from './cull-by-tight-boundary-box.js';
-/**
- * @param curvePieces
- * @param xO
- *
- * @internal
- */
-function cullCurvePieces1(curvePieces, xO) {
-    const bestSquaredDistance = getBestDistanceSquared(curvePieces, xO);
-    curvePieces = cullByLooseBoundingBox(curvePieces, xO, bestSquaredDistance);
-    curvePieces = cullByTightBoundingBox(curvePieces, xO, bestSquaredDistance);
-    return curvePieces;
-}
-export { cullCurvePieces1 };
-//# sourceMappingURL=cull-bezier-pieces-1.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"cull-bezier-pieces-1.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-bezier-pieces-1.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;;;;;GAKG;AACH,SAAS,gBAAgB,CACjB,WAAyB,EACzB,EAAY;IAEhB,MAAM,mBAAmB,GAAG,sBAAsB,CAC9C,WAAW,EAAE,EAAE,CAClB,CAAC;IAEF,WAAW,GAAG,sBAAsB,CAChC,WAAW,EAAE,EAAE,EACf,mBAAmB,CACtB,CAAC;IAEF,WAAW,GAAG,sBAAsB,CAChC,WAAW,EAAE,EAAE,EACf,mBAAmB,CACtB,CAAC;IAGF,OAAO,WAAW,CAAC;AACvB,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

package/node/closest-boundary-point/cull-by-loose-bounding-box.d.ts

@@ -1,13 +0,0 @@
-import type { CurvePiece } from '../mat/curve-piece.js';
-/**
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- *
- * @param curvePieces
- * @param xO
- * @param xy2
- *
- * @internal
- */
-declare function cullByLooseBoundingBox(curvePieces: CurvePiece[], xO: number[], xy2: number): CurvePiece[];
-export { cullByLooseBoundingBox };

package/node/closest-boundary-point/cull-by-loose-bounding-box.js

@@ -1,27 +0,0 @@
-import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
-import { getBoundingBox$ } from '../geometry/get-bounding-box-.js';
-/**
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- *
- * @param curvePieces
- * @param xO
- * @param xy2
- *
- * @internal
- */
-function cullByLooseBoundingBox(curvePieces, xO, xy2) {
-    const curvePieces_ = [];
-    for (let i = 0; i < curvePieces.length; i++) {
-        const curvePiece = curvePieces[i];
-        const { ps } = curvePiece.curve;
-        const boundingBox = getBoundingBox$(ps);
-        const d = getClosestSquareDistanceToRect(boundingBox, xO);
-        if (d <= xy2) {
-            curvePieces_.push(curvePiece);
-        }
-    }
-    return curvePieces_;
-}
-export { cullByLooseBoundingBox };
-//# sourceMappingURL=cull-by-loose-bounding-box.js.map

package/node/closest-boundary-point/cull-by-loose-bounding-box.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cull-by-loose-bounding-box.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-by-loose-bounding-box.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AACpG,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAGnE;;;;;;;;;GASG;AACH,SAAS,sBAAsB,CACvB,WAAyB,EACzB,EAAY,EACZ,GAAW;IAEf,MAAM,YAAY,GAAG,EAAE,CAAC;IAExB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC;QAEhC,MAAM,WAAW,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAExC,MAAM,CAAC,GAAG,8BAA8B,CACpC,WAAW,EACX,EAAE,CACL,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YACX,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC;IACL,CAAC;IAED,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}

package/node/closest-boundary-point/cull-by-tight-boundary-box.d.ts

@@ -1,11 +0,0 @@
-import { CurvePiece } from "../mat/curve-piece.js";
-/**
- * @internal
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- * @param curvePieces
- * @param p
- * @param bestSquaredDistance
- */
-declare function cullByTightBoundingBox(curvePieces: CurvePiece[], p: number[], bestSquaredDistance: number): CurvePiece[];
-export { cullByTightBoundingBox };

package/node/closest-boundary-point/cull-by-tight-boundary-box.js

@@ -1,27 +0,0 @@
-import { getBoundingBoxTight } from "flo-bezier3";
-import { memoize } from "flo-memoize";
-import { getClosestSquaredDistanceToRotatedRect } from '../geometry/get-closest-squared-distance-to-rotated-rect.js';
-const getBoundingBoxTight$ = memoize(getBoundingBoxTight);
-/**
- * @internal
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- * @param curvePieces
- * @param p
- * @param bestSquaredDistance
- */
-function cullByTightBoundingBox(curvePieces, p, bestSquaredDistance) {
-    const candidateCurvePieces = [];
-    for (let i = 0; i < curvePieces.length; i++) {
-        const curvePiece = curvePieces[i];
-        const ps = curvePiece.curve.ps;
-        const tightBoundingBox = getBoundingBoxTight$(ps);
-        const d = getClosestSquaredDistanceToRotatedRect(tightBoundingBox, p);
-        if (d <= bestSquaredDistance) {
-            candidateCurvePieces.push(curvePiece);
-        }
-    }
-    return candidateCurvePieces;
-}
-export { cullByTightBoundingBox };
-//# sourceMappingURL=cull-by-tight-boundary-box.js.map

package/node/closest-boundary-point/cull-by-tight-boundary-box.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cull-by-tight-boundary-box.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-by-tight-boundary-box.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,OAAO,EAAE,sCAAsC,EAAE,MAAM,6DAA6D,CAAC;AAGrH,MAAM,oBAAoB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;AAG1D;;;;;;;GAOG;AACH,SAAS,sBAAsB,CACvB,WAAyB,EACzB,CAAW,EACX,mBAA2B;IAE/B,MAAM,oBAAoB,GAAG,EAAE,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAE/B,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,sCAAsC,CACxC,gBAAgB,EAChB,CAAC,CACR,CAAC;QACF,IAAI,CAAC,IAAI,mBAAmB,EAAE,CAAC;YAC3B,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,CAAC;IACL,CAAC;IAED,OAAO,oBAAoB,CAAC;AAChC,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}

package/node/cp-node/fs/find-first.d.ts

@@ -1,10 +0,0 @@
-import type { CpNode } from "../cp-node.js";
-/**
- * Finds the first `CpNode` in the same MAT tree for which `f` returns a
- * truthy value. Returns `undefined` if no such `CpNode` exists.
- *
- * @param f a function that takes a `CpNode` and returns a `CpNode` or `undefined`
- * @param cpNode a `CpNode` on the MAT tree to search from
- */
-declare function findFirst(f: (cpNode: CpNode) => boolean, cpNode: CpNode): CpNode | undefined;
-export { findFirst };

package/node/cp-node/fs/find-first.js

@@ -1,19 +0,0 @@
-/**
- * Finds the first `CpNode` in the same MAT tree for which `f` returns a
- * truthy value. Returns `undefined` if no such `CpNode` exists.
- *
- * @param f a function that takes a `CpNode` and returns a `CpNode` or `undefined`
- * @param cpNode a `CpNode` on the MAT tree to search from
- */
-function findFirst(f, cpNode) {
-    const cpStart = cpNode;
-    do {
-        if (f(cpNode)) {
-            return cpNode;
-        }
-        cpNode = cpNode.next;
-    } while (cpNode !== cpStart);
-    return undefined;
-}
-export { findFirst };
-//# sourceMappingURL=find-first.js.map

package/node/cp-node/fs/find-first.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-first.js","sourceRoot":"","sources":["../../../src/cp-node/fs/find-first.ts"],"names":[],"mappings":"AAGA;;;;;;GAMG;AACH,SAAS,SAAS,CACV,CAA8B,EAC9B,MAAc;IAElB,MAAM,OAAO,GAAG,MAAM,CAAC;IAEvB,GAAG,CAAC;QACA,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACZ,OAAO,MAAM,CAAC;QAClB,CAAC;QACD,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC,QAAQ,MAAM,KAAK,OAAO,EAAE;IAE7B,OAAO,SAAS,CAAC;AACrB,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}

package/node/debug/functions/check-ordering.d.ts

@@ -1,4 +0,0 @@
-import type { MatMeta } from "../../mat/mat-meta.js";
-import { CpNode } from "../../cp-node/cp-node.js";
-declare function checkOrdering(meta: MatMeta, cpStart: CpNode): void;
-export { checkOrdering };

package/node/debug/functions/check-ordering.js

@@ -1,43 +0,0 @@
-import { getAllOnLoop } from "../../cp-node/fs/get-all-on-loop.js";
-import { getProngCount } from "../../cp-node/fs/get-prong-count.js";
-import { isOrderCorrect } from "../../cp-node/fs/is-order-correct.js";
-function checkOrdering(meta, cpStart) {
-    const { cpTrees } = meta;
-    const cpNodes = getAllOnLoop(cpStart);
-    const wrongsPerLoop = new Map();
-    for (const cpNode of cpNodes) {
-        const pos = cpNode.pointOnShape;
-        const loop = pos.curve.loop;
-        if (loop !== cpNode.prev.pointOnShape.curve.loop ||
-            loop !== cpNode.next.pointOnShape.curve.loop) {
-            continue;
-        }
-        const cpTree = cpTrees.get(loop);
-        const orderCorrect = isOrderCorrect(cpTree, cpNode.prev, cpNode.pointOnShape, cpNode.next, true);
-        if (!orderCorrect) {
-            const A = toOrder(cpNode);
-            const B = toOrder(cpNode.next);
-            let wrongs = wrongsPerLoop.getOrInsert(loop, []);
-            wrongs.push([A, B]);
-        }
-    }
-    for (const [loop, wrongs] of wrongsPerLoop) {
-        for (const wrong of wrongs) {
-            const A = wrong[0];
-            const B = wrong[1];
-            // const c = comparePoss(A.cpNode.pointOnShape, B.cpNode.pointOnShape);
-            console.log(A);
-            console.log(B);
-            console.log('---------');
-        }
-    }
-}
-function toOrder(cpNode) {
-    const prongCount = getProngCount(cpNode);
-    const { pointOnShape } = cpNode;
-    const { p, t, order, order2, curve } = pointOnShape;
-    const curveIdx = curve.idx;
-    return { cpNode, prongCount, p, curveIdx, t, order, order2 };
-}
-export { checkOrdering };
-//# sourceMappingURL=check-ordering.js.map

package/node/debug/functions/check-ordering.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"check-ordering.js","sourceRoot":"","sources":["../../../src/debug/functions/check-ordering.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,qCAAqC,CAAC;AACpE,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AAetE,SAAS,aAAa,CACd,IAAa,EACb,OAAe;IAEnB,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAEzB,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IAEtC,MAAM,aAAa,GAA8B,IAAI,GAAG,EAAE,CAAC;IAC3D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;QAChC,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;QAE5B,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI;YAC5C,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAE/C,SAAS;QACb,CAAC;QAED,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAElC,MAAM,YAAY,GAAG,cAAc,CAC/B,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAC9D,CAAC;QACF,IAAI,CAAC,YAAY,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAE/B,IAAI,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACjD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,EAAC,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,uEAAuE;YAEvE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC7B,CAAC;IACL,CAAC;AACL,CAAC;AAGD,SAAS,OAAO,CACR,MAAc;IAElB,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;IAChC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC;IACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;IAE3B,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AACjE,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/find-2-prong/cull-bezier-pieces.d.ts

@@ -1,13 +0,0 @@
-import type { CurvePiece } from '../mat/curve-piece.js';
-/**
- * Cull all `curvePieces` not within the given radius of a given point.
- *
- * @param extreme
- * @param curvePieces
- * @param xO
- * @param xy2
- *
- * @internal
- */
-declare function cullCurvePieces(curvePieces: CurvePiece[], xO: number[], xy2: number): CurvePiece[];
-export { cullCurvePieces };