@flighthq/path 0.1.0

package/dist/containsPathPoint.d.ts

@@ -0,0 +1,13 @@
+import type { Path } from '@flighthq/types';
+/**
+ * Tests whether point (px, py) lies inside the path using the path's winding rule
+ * ('evenOdd' or 'nonZero'). Curves are adaptively flattened before the winding
+ * number test; the tolerance is in path units.
+ *
+ * The algorithm casts a ray rightward from (px, py) and counts crossings per
+ * contour. For 'nonZero' it accumulates signed winding; for 'evenOdd' it tests
+ * parity. Uses the standard convention: points on the boundary are not guaranteed
+ * to return true.
+ */
+export declare function containsPathPoint(path: Readonly<Path>, px: number, py: number, tolerance?: number): boolean;
+//# sourceMappingURL=containsPathPoint.d.ts.map

package/dist/containsPathPoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"containsPathPoint.d.ts","sourceRoot":"","sources":["../src/containsPathPoint.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAG5C;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,SAAO,GAAG,OAAO,CAIzG"}

package/dist/containsPathPoint.js

@@ -0,0 +1,194 @@
+import { PathCommand } from '@flighthq/types';
+/**
+ * Tests whether point (px, py) lies inside the path using the path's winding rule
+ * ('evenOdd' or 'nonZero'). Curves are adaptively flattened before the winding
+ * number test; the tolerance is in path units.
+ *
+ * The algorithm casts a ray rightward from (px, py) and counts crossings per
+ * contour. For 'nonZero' it accumulates signed winding; for 'evenOdd' it tests
+ * parity. Uses the standard convention: points on the boundary are not guaranteed
+ * to return true.
+ */
+export function containsPathPoint(path, px, py, tolerance = 0.25) {
+    const winding = computePathWindingNumber(path, px, py, tolerance);
+    if (path.winding === 'evenOdd')
+        return (winding & 1) !== 0;
+    return winding !== 0;
+}
+// Squared perpendicular distance from (px,py) to chord (x0,y0)-(x1,y1).
+function chordDistSq(px, py, x0, y0, x1, y1) {
+    const dx = x1 - x0;
+    const dy = y1 - y0;
+    const lenSq = dx * dx + dy * dy;
+    if (lenSq === 0) {
+        const ax = px - x0;
+        const ay = py - y0;
+        return ax * ax + ay * ay;
+    }
+    const cross = dx * (y0 - py) - dy * (x0 - px);
+    return (cross * cross) / lenSq;
+}
+// Computes the winding number of (px, py) relative to the path by flattening each
+// contour to line segments and accumulating signed crossings.
+function computePathWindingNumber(path, px, py, tolerance) {
+    const commands = path.commands;
+    const data = path.data;
+    const toleranceSq = tolerance * tolerance;
+    let windingNumber = 0;
+    let x = 0;
+    let y = 0;
+    let contourStartX = 0;
+    let contourStartY = 0;
+    let hasContour = false;
+    let lastX = 0;
+    let lastY = 0;
+    let di = 0;
+    const flushContour = () => {
+        if (hasContour) {
+            windingNumber += countSegmentCrossings(px, py, lastX, lastY, contourStartX, contourStartY);
+        }
+    };
+    for (let ci = 0; ci < commands.length; ci++) {
+        const command = commands[ci];
+        if (command === PathCommand.MOVE_TO) {
+            flushContour();
+            x = data[di];
+            y = data[di + 1];
+            di += 2;
+            contourStartX = x;
+            contourStartY = y;
+            lastX = x;
+            lastY = y;
+            hasContour = true;
+        }
+        else if (command === PathCommand.WIDE_MOVE_TO) {
+            flushContour();
+            x = data[di + 2];
+            y = data[di + 3];
+            di += 4;
+            contourStartX = x;
+            contourStartY = y;
+            lastX = x;
+            lastY = y;
+            hasContour = true;
+        }
+        else if (command === PathCommand.LINE_TO) {
+            const nx = data[di];
+            const ny = data[di + 1];
+            di += 2;
+            if (hasContour) {
+                windingNumber += countSegmentCrossings(px, py, lastX, lastY, nx, ny);
+            }
+            lastX = nx;
+            lastY = ny;
+            x = nx;
+            y = ny;
+        }
+        else if (command === PathCommand.WIDE_LINE_TO) {
+            const nx = data[di + 2];
+            const ny = data[di + 3];
+            di += 4;
+            if (hasContour) {
+                windingNumber += countSegmentCrossings(px, py, lastX, lastY, nx, ny);
+            }
+            lastX = nx;
+            lastY = ny;
+            x = nx;
+            y = ny;
+        }
+        else if (command === PathCommand.CURVE_TO) {
+            const cx = data[di];
+            const cy = data[di + 1];
+            const ax = data[di + 2];
+            const ay = data[di + 3];
+            di += 4;
+            if (hasContour) {
+                windingNumber += flattenQuadraticWindingNumber(px, py, lastX, lastY, cx, cy, ax, ay, toleranceSq, 0);
+            }
+            lastX = ax;
+            lastY = ay;
+            x = ax;
+            y = ay;
+        }
+        else if (command === PathCommand.CUBIC_CURVE_TO) {
+            const c1x = data[di];
+            const c1y = data[di + 1];
+            const c2x = data[di + 2];
+            const c2y = data[di + 3];
+            const ax = data[di + 4];
+            const ay = data[di + 5];
+            di += 6;
+            if (hasContour) {
+                windingNumber += flattenCubicWindingNumber(px, py, lastX, lastY, c1x, c1y, c2x, c2y, ax, ay, toleranceSq, 0);
+            }
+            lastX = ax;
+            lastY = ay;
+            x = ax;
+            y = ay;
+        }
+        else if (command === PathCommand.CLOSE) {
+            // Explicit close: emit a segment back to the contour start and reset.
+            if (hasContour) {
+                windingNumber += countSegmentCrossings(px, py, lastX, lastY, contourStartX, contourStartY);
+                lastX = contourStartX;
+                lastY = contourStartY;
+                x = contourStartX;
+                y = contourStartY;
+                hasContour = false;
+            }
+        }
+        // NO_OP and unrecognized verbs consume no data.
+    }
+    // Close the final open contour.
+    flushContour();
+    return Math.abs(windingNumber);
+}
+// Returns the signed crossing count contribution of segment (x0,y0)→(x1,y1) for
+// the rightward ray from (px, py). +1 for upward crossings, -1 for downward.
+function countSegmentCrossings(px, py, x0, y0, x1, y1) {
+    // Only segments that cross the horizontal ray (py) contribute.
+    if ((y0 <= py && y1 > py) || (y1 <= py && y0 > py)) {
+        // x coordinate of the crossing — only count if the segment crosses to the right.
+        const crossX = x0 + ((py - y0) * (x1 - x0)) / (y1 - y0);
+        if (px < crossX) {
+            return y1 > y0 ? 1 : -1;
+        }
+    }
+    return 0;
+}
+function flattenCubicWindingNumber(px, py, x0, y0, c1x, c1y, c2x, c2y, x1, y1, toleranceSq, depth) {
+    const d1 = chordDistSq(c1x, c1y, x0, y0, x1, y1);
+    const d2 = chordDistSq(c2x, c2y, x0, y0, x1, y1);
+    if (depth >= MAX_SUBDIVISION_DEPTH || (d1 <= toleranceSq && d2 <= toleranceSq)) {
+        return countSegmentCrossings(px, py, x0, y0, x1, y1);
+    }
+    const x01 = (x0 + c1x) / 2;
+    const y01 = (y0 + c1y) / 2;
+    const x12 = (c1x + c2x) / 2;
+    const y12 = (c1y + c2y) / 2;
+    const x23 = (c2x + x1) / 2;
+    const y23 = (c2y + y1) / 2;
+    const x012 = (x01 + x12) / 2;
+    const y012 = (y01 + y12) / 2;
+    const x123 = (x12 + x23) / 2;
+    const y123 = (y12 + y23) / 2;
+    const xm = (x012 + x123) / 2;
+    const ym = (y012 + y123) / 2;
+    return (flattenCubicWindingNumber(px, py, x0, y0, x01, y01, x012, y012, xm, ym, toleranceSq, depth + 1) +
+        flattenCubicWindingNumber(px, py, xm, ym, x123, y123, x23, y23, x1, y1, toleranceSq, depth + 1));
+}
+function flattenQuadraticWindingNumber(px, py, x0, y0, cx, cy, x1, y1, toleranceSq, depth) {
+    if (depth >= MAX_SUBDIVISION_DEPTH || chordDistSq(cx, cy, x0, y0, x1, y1) <= toleranceSq) {
+        return countSegmentCrossings(px, py, x0, y0, x1, y1);
+    }
+    const mx01 = (x0 + cx) / 2;
+    const my01 = (y0 + cy) / 2;
+    const mx12 = (cx + x1) / 2;
+    const my12 = (cy + y1) / 2;
+    const mx = (mx01 + mx12) / 2;
+    const my = (my01 + my12) / 2;
+    return (flattenQuadraticWindingNumber(px, py, x0, y0, mx01, my01, mx, my, toleranceSq, depth + 1) +
+        flattenQuadraticWindingNumber(px, py, mx, my, mx12, my12, x1, y1, toleranceSq, depth + 1));
+}
+const MAX_SUBDIVISION_DEPTH = 16;
+//# sourceMappingURL=containsPathPoint.js.map

package/dist/containsPathPoint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"containsPathPoint.js","sourceRoot":"","sources":["../src/containsPathPoint.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE9C;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAoB,EAAE,EAAU,EAAE,EAAU,EAAE,SAAS,GAAG,IAAI;IAC9F,MAAM,OAAO,GAAG,wBAAwB,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IAClE,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3D,OAAO,OAAO,KAAK,CAAC,CAAC;AACvB,CAAC;AAED,wEAAwE;AACxE,SAAS,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;IACzF,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAChC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAC3B,CAAC;IACD,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9C,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AACjC,CAAC;AAED,kFAAkF;AAClF,8DAA8D;AAC9D,SAAS,wBAAwB,CAAC,IAAoB,EAAE,EAAU,EAAE,EAAU,EAAE,SAAiB;IAC/F,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;IAC1C,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,MAAM,YAAY,GAAG,GAAG,EAAE;QACxB,IAAI,UAAU,EAAE,CAAC;YACf,aAAa,IAAI,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;QAC7F,CAAC;IACH,CAAC,CAAC;IACF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,OAAO,KAAK,WAAW,CAAC,OAAO,EAAE,CAAC;YACpC,YAAY,EAAE,CAAC;YACf,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjB,EAAE,IAAI,CAAC,CAAC;YACR,aAAa,GAAG,CAAC,CAAC;YAClB,aAAa,GAAG,CAAC,CAAC;YAClB,KAAK,GAAG,CAAC,CAAC;YACV,KAAK,GAAG,CAAC,CAAC;YACV,UAAU,GAAG,IAAI,CAAC;QACpB,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,CAAC,YAAY,EAAE,CAAC;YAChD,YAAY,EAAE,CAAC;YACf,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjB,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjB,EAAE,IAAI,CAAC,CAAC;YACR,aAAa,GAAG,CAAC,CAAC;YAClB,aAAa,GAAG,CAAC,CAAC;YAClB,KAAK,GAAG,CAAC,CAAC;YACV,KAAK,GAAG,CAAC,CAAC;YACV,UAAU,GAAG,IAAI,CAAC;QACpB,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,CAAC,OAAO,EAAE,CAAC;YAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,EAAE,IAAI,CAAC,CAAC;YACR,IAAI,UAAU,EAAE,CAAC;gBACf,aAAa,IAAI,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACvE,CAAC;YACD,KAAK,GAAG,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,CAAC;YACX,CAAC,GAAG,EAAE,CAAC;YACP,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,CAAC,YAAY,EAAE,CAAC;YAChD,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,EAAE,IAAI,CAAC,CAAC;YACR,IAAI,UAAU,EAAE,CAAC;gBACf,aAAa,IAAI,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACvE,CAAC;YACD,KAAK,GAAG,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,CAAC;YACX,CAAC,GAAG,EAAE,CAAC;YACP,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,CAAC,QAAQ,EAAE,CAAC;YAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,EAAE,IAAI,CAAC,CAAC;YACR,IAAI,UAAU,EAAE,CAAC;gBACf,aAAa,IAAI,6BAA6B,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;YACvG,CAAC;YACD,KAAK,GAAG,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,CAAC;YACX,CAAC,GAAG,EAAE,CAAC;YACP,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,CAAC,cAAc,EAAE,CAAC;YAClD,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxB,EAAE,IAAI,CAAC,CAAC;YACR,IAAI,UAAU,EAAE,CAAC;gBACf,aAAa,IAAI,yBAAyB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;YAC/G,CAAC;YACD,KAAK,GAAG,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,CAAC;YACX,CAAC,GAAG,EAAE,CAAC;YACP,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,CAAC,KAAK,EAAE,CAAC;YACzC,sEAAsE;YACtE,IAAI,UAAU,EAAE,CAAC;gBACf,aAAa,IAAI,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;gBAC3F,KAAK,GAAG,aAAa,CAAC;gBACtB,KAAK,GAAG,aAAa,CAAC;gBACtB,CAAC,GAAG,aAAa,CAAC;gBAClB,CAAC,GAAG,aAAa,CAAC;gBAClB,UAAU,GAAG,KAAK,CAAC;YACrB,CAAC;QACH,CAAC;QACD,gDAAgD;IAClD,CAAC;IACD,gCAAgC;IAChC,YAAY,EAAE,CAAC;IACf,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;AACjC,CAAC;AAED,gFAAgF;AAChF,6EAA6E;AAC7E,SAAS,qBAAqB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;IACnG,+DAA+D;IAC/D,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QACnD,iFAAiF;QACjF,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACxD,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC;YAChB,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,yBAAyB,CAChC,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW,EACX,EAAU,EACV,EAAU,EACV,WAAmB,EACnB,KAAa;IAEb,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACjD,IAAI,KAAK,IAAI,qBAAqB,IAAI,CAAC,EAAE,IAAI,WAAW,IAAI,EAAE,IAAI,WAAW,CAAC,EAAE,CAAC;QAC/E,OAAO,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,OAAO,CACL,yBAAyB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,GAAG,CAAC,CAAC;QAC/F,yBAAyB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,GAAG,CAAC,CAAC,CAChG,CAAC;AACJ,CAAC;AAED,SAAS,6BAA6B,CACpC,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,WAAmB,EACnB,KAAa;IAEb,IAAI,KAAK,IAAI,qBAAqB,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;QACzF,OAAO,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,OAAO,CACL,6BAA6B,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,GAAG,CAAC,CAAC;QACzF,6BAA6B,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,GAAG,CAAC,CAAC,CAC1F,CAAC;AACJ,CAAC;AAED,MAAM,qBAAqB,GAAG,EAAE,CAAC"}

package/dist/copyPath.d.ts

@@ -0,0 +1,4 @@
+import type { Path } from '@flighthq/types';
+export declare function clonePath(source: Readonly<Path>): Path;
+export declare function copyPath(source: Readonly<Path>, out?: Path): Path;
+//# sourceMappingURL=copyPath.d.ts.map

package/dist/copyPath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"copyPath.d.ts","sourceRoot":"","sources":["../src/copyPath.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAI5C,wBAAgB,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAEtD;AAKD,wBAAgB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAgBjE"}

package/dist/copyPath.js

@@ -0,0 +1,28 @@
+// Allocates a new `Path` that is a deep copy of `source`.
+// Use `copyPath(source, out)` to write into an existing path without allocating.
+export function clonePath(source) {
+    return copyPath(source);
+}
+// Copies all commands, data, and the winding rule from `source` into `out`. If `out` is omitted,
+// allocates and returns a new `Path`. Alias-safe: if `out` is the same object as `source`, the call
+// is a no-op (the path is already in place). Use `clonePath` when you always want a new allocation.
+export function copyPath(source, out) {
+    if (out === undefined) {
+        return {
+            commands: source.commands.slice(),
+            data: source.data.slice(),
+            winding: source.winding,
+        };
+    }
+    if (out !== source) {
+        out.commands.length = 0;
+        for (let i = 0; i < source.commands.length; i++)
+            out.commands.push(source.commands[i]);
+        out.data.length = 0;
+        for (let i = 0; i < source.data.length; i++)
+            out.data.push(source.data[i]);
+        out.winding = source.winding;
+    }
+    return out;
+}
+//# sourceMappingURL=copyPath.js.map

package/dist/copyPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"copyPath.js","sourceRoot":"","sources":["../src/copyPath.ts"],"names":[],"mappings":"AAEA,0DAA0D;AAC1D,iFAAiF;AACjF,MAAM,UAAU,SAAS,CAAC,MAAsB;IAC9C,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC;AAC1B,CAAC;AAED,iGAAiG;AACjG,oGAAoG;AACpG,oGAAoG;AACpG,MAAM,UAAU,QAAQ,CAAC,MAAsB,EAAE,GAAU;IACzD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO;YACL,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE;YACjC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE;YACzB,OAAO,EAAE,MAAM,CAAC,OAAO;SACxB,CAAC;IACJ,CAAC;IACD,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;QACnB,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC/B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/dashPath.d.ts

@@ -0,0 +1,3 @@
+import type { Path } from '@flighthq/types';
+export declare function dashPath(source: Readonly<Path>, dash: Readonly<number[]>, dashOffset: number, out: Path, tolerance?: number): void;
+//# sourceMappingURL=dashPath.d.ts.map

package/dist/dashPath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dashPath.d.ts","sourceRoot":"","sources":["../src/dashPath.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAU5C,wBAAgB,QAAQ,CACtB,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,EACtB,IAAI,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,EACxB,UAAU,EAAE,MAAM,EAClB,GAAG,EAAE,IAAI,EACT,SAAS,SAAO,GACf,IAAI,CAeN"}

package/dist/dashPath.js

@@ -0,0 +1,105 @@
+import { PathCommand } from '@flighthq/types';
+import { flattenPath } from './flattenPath';
+// Splits `source` into dashed sub-paths according to the given dash pattern and offset. Each
+// dash-on segment becomes an open sub-path (MOVE_TO + LINE_TOs) in `out`. The dash pattern is
+// a repeating [on, off, on, off, ...] length sequence; `dashOffset` shifts the pattern start.
+//
+// An empty or all-zero dash array copies the source unchanged (solid stroke). Alias-safe.
+export function dashPath(source, dash, dashOffset, out, tolerance = 0.25) {
+    out.commands.length = 0;
+    out.data.length = 0;
+    out.winding = source.winding;
+    const totalDashLength = dashTotal(dash);
+    if (totalDashLength <= 0) {
+        copyCommands(source, out);
+        return;
+    }
+    const contours = flattenPath(source, tolerance);
+    for (const contour of contours) {
+        applyDashToContour(contour, dash, dashOffset, totalDashLength, out);
+    }
+}
+function applyDashToContour(pts, dash, dashOffset, totalDashLength, out) {
+    const n = pts.length >> 1;
+    if (n < 2)
+        return;
+    const offset = ((dashOffset % totalDashLength) + totalDashLength) % totalDashLength;
+    let dashIndex = 0;
+    let remaining = 0;
+    let isOn = true;
+    {
+        let acc = 0;
+        for (let i = 0; i < dash.length; i++) {
+            if (acc + dash[i] > offset) {
+                dashIndex = i;
+                remaining = dash[i] - (offset - acc);
+                isOn = i % 2 === 0;
+                break;
+            }
+            acc += dash[i];
+        }
+    }
+    let segStarted = false;
+    for (let i = 0; i < n - 1; i++) {
+        const x0 = pts[i * 2];
+        const y0 = pts[i * 2 + 1];
+        const x1 = pts[(i + 1) * 2];
+        const y1 = pts[(i + 1) * 2 + 1];
+        const dx = x1 - x0;
+        const dy = y1 - y0;
+        const segLen = Math.sqrt(dx * dx + dy * dy);
+        if (isOn && !segStarted) {
+            out.commands.push(PathCommand.MOVE_TO);
+            out.data.push(x0, y0);
+            segStarted = true;
+        }
+        let consumed = 0;
+        while (consumed < segLen) {
+            const step = Math.min(remaining, segLen - consumed);
+            const t = segLen > 0 ? (consumed + step) / segLen : 0;
+            const ix = x0 + t * dx;
+            const iy = y0 + t * dy;
+            if (isOn) {
+                if (!segStarted) {
+                    const tStart = segLen > 0 ? consumed / segLen : 0;
+                    out.commands.push(PathCommand.MOVE_TO);
+                    out.data.push(x0 + tStart * dx, y0 + tStart * dy);
+                    segStarted = true;
+                }
+                out.commands.push(PathCommand.LINE_TO);
+                out.data.push(ix, iy);
+            }
+            consumed += step;
+            remaining -= step;
+            if (remaining <= 1e-10) {
+                dashIndex = (dashIndex + 1) % dash.length;
+                remaining = dash[dashIndex];
+                const wasOn = isOn;
+                isOn = dashIndex % 2 === 0;
+                if (wasOn && !isOn) {
+                    segStarted = false;
+                }
+                if (!wasOn && isOn) {
+                    out.commands.push(PathCommand.MOVE_TO);
+                    out.data.push(ix, iy);
+                    segStarted = true;
+                }
+            }
+        }
+    }
+}
+function copyCommands(source, out) {
+    for (let i = 0; i < source.commands.length; i++) {
+        out.commands.push(source.commands[i]);
+    }
+    for (let i = 0; i < source.data.length; i++) {
+        out.data.push(source.data[i]);
+    }
+}
+function dashTotal(dash) {
+    let total = 0;
+    for (let i = 0; i < dash.length; i++)
+        total += dash[i];
+    return total;
+}
+//# sourceMappingURL=dashPath.js.map

package/dist/dashPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dashPath.js","sourceRoot":"","sources":["../src/dashPath.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE9C,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C,6FAA6F;AAC7F,8FAA8F;AAC9F,8FAA8F;AAC9F,EAAE;AACF,0FAA0F;AAC1F,MAAM,UAAU,QAAQ,CACtB,MAAsB,EACtB,IAAwB,EACxB,UAAkB,EAClB,GAAS,EACT,SAAS,GAAG,IAAI;IAEhB,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACxB,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACpB,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAE7B,MAAM,eAAe,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,eAAe,IAAI,CAAC,EAAE,CAAC;QACzB,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC1B,OAAO;IACT,CAAC;IAED,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAChD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,kBAAkB,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,eAAe,EAAE,GAAG,CAAC,CAAC;IACtE,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,GAAuB,EACvB,IAAwB,EACxB,UAAkB,EAClB,eAAuB,EACvB,GAAS;IAET,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO;IAElB,MAAM,MAAM,GAAG,CAAC,CAAC,UAAU,GAAG,eAAe,CAAC,GAAG,eAAe,CAAC,GAAG,eAAe,CAAC;IACpF,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,CAAC;QACC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;gBAC3B,SAAS,GAAG,CAAC,CAAC;gBACd,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;gBACrC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,MAAM;YACR,CAAC;YACD,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAE5C,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACvC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,UAAU,GAAG,IAAI,CAAC;QACpB,CAAC;QAED,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,OAAO,QAAQ,GAAG,MAAM,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC;YACpD,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YACvB,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YAEvB,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,UAAU,EAAE,CAAC;oBAChB,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;oBACvC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,GAAG,EAAE,EAAE,EAAE,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC;oBAClD,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;gBACD,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBACvC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACxB,CAAC;YAED,QAAQ,IAAI,IAAI,CAAC;YACjB,SAAS,IAAI,IAAI,CAAC;YAClB,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;gBACvB,SAAS,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;gBAC1C,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC;gBACnB,IAAI,GAAG,SAAS,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;oBACnB,UAAU,GAAG,KAAK,CAAC;gBACrB,CAAC;gBACD,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;oBACnB,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;oBACvC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;oBACtB,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,MAAsB,EAAE,GAAS;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,IAAwB;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/fitPathCurves.d.ts

@@ -0,0 +1,3 @@
+import type { Path } from '@flighthq/types';
+export declare function fitPathCurves(source: Readonly<Path>, tolerance: number, out: Path, flattenTolerance?: number): void;
+//# sourceMappingURL=fitPathCurves.d.ts.map

package/dist/fitPathCurves.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fitPathCurves.d.ts","sourceRoot":"","sources":["../src/fitPathCurves.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAU5C,wBAAgB,aAAa,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,gBAAgB,SAAO,GAAG,IAAI,CA4CjH"}

package/dist/fitPathCurves.js

@@ -0,0 +1,222 @@
+import { PathCommand } from '@flighthq/types';
+import { flattenPath } from './flattenPath';
+// Re-curves a polyline (or any flattened path) into smooth cubic bezier segments using
+// Schneider's algorithm. The input path is first flattened, then partitioned at corners
+// (points where the tangent direction changes by more than ~60°), and each span is fit with
+// cubic beziers via least-squares. If the fit error exceeds `tolerance`, the span is split at
+// the point of maximum error and each half is fit recursively. Alias-safe.
+export function fitPathCurves(source, tolerance, out, flattenTolerance = 0.25) {
+    const contours = flattenPath(source, flattenTolerance);
+    out.commands.length = 0;
+    out.data.length = 0;
+    out.winding = source.winding;
+    const toleranceSq = tolerance * tolerance;
+    for (const contour of contours) {
+        const n = contour.length >> 1;
+        if (n < 2)
+            continue;
+        const closed = n >= 3 && contour[0] === contour[contour.length - 2] && contour[1] === contour[contour.length - 1];
+        const pts = closed ? contour.slice(0, (n - 1) * 2) : contour;
+        const pn = pts.length >> 1;
+        if (pn < 2)
+            continue;
+        if (pn === 2) {
+            out.commands.push(PathCommand.MOVE_TO);
+            out.data.push(pts[0], pts[1]);
+            out.commands.push(PathCommand.LINE_TO);
+            out.data.push(pts[2], pts[3]);
+            if (closed)
+                out.commands.push(PathCommand.CLOSE);
+            continue;
+        }
+        const corners = findCorners(pts, pn);
+        out.commands.push(PathCommand.MOVE_TO);
+        out.data.push(pts[0], pts[1]);
+        for (let ci = 0; ci < corners.length - 1; ci++) {
+            const first = corners[ci];
+            const last = corners[ci + 1];
+            if (last - first < 2) {
+                out.commands.push(PathCommand.LINE_TO);
+                out.data.push(pts[last * 2], pts[last * 2 + 1]);
+                continue;
+            }
+            const tHat1 = computeLeftTangent(pts, first);
+            const tHat2 = computeRightTangent(pts, last);
+            fitCubic(pts, first, last, tHat1, tHat2, toleranceSq, out);
+        }
+        if (closed)
+            out.commands.push(PathCommand.CLOSE);
+    }
+}
+function findCorners(pts, n) {
+    const corners = [0];
+    for (let i = 1; i < n - 1; i++) {
+        const dx0 = pts[i * 2] - pts[(i - 1) * 2];
+        const dy0 = pts[i * 2 + 1] - pts[(i - 1) * 2 + 1];
+        const dx1 = pts[(i + 1) * 2] - pts[i * 2];
+        const dy1 = pts[(i + 1) * 2 + 1] - pts[i * 2 + 1];
+        const len0 = Math.sqrt(dx0 * dx0 + dy0 * dy0);
+        const len1 = Math.sqrt(dx1 * dx1 + dy1 * dy1);
+        if (len0 === 0 || len1 === 0)
+            continue;
+        const dot = (dx0 * dx1 + dy0 * dy1) / (len0 * len1);
+        if (dot < 0.5)
+            corners.push(i);
+    }
+    corners.push(n - 1);
+    return corners;
+}
+function computeLeftTangent(pts, idx) {
+    const dx = pts[(idx + 1) * 2] - pts[idx * 2];
+    const dy = pts[(idx + 1) * 2 + 1] - pts[idx * 2 + 1];
+    const len = Math.sqrt(dx * dx + dy * dy);
+    return len > 0 ? [dx / len, dy / len] : [1, 0];
+}
+function computeRightTangent(pts, idx) {
+    const dx = pts[(idx - 1) * 2] - pts[idx * 2];
+    const dy = pts[(idx - 1) * 2 + 1] - pts[idx * 2 + 1];
+    const len = Math.sqrt(dx * dx + dy * dy);
+    return len > 0 ? [dx / len, dy / len] : [-1, 0];
+}
+function chordLengthParameterize(pts, first, last) {
+    const u = [0];
+    for (let i = first + 1; i <= last; i++) {
+        const dx = pts[i * 2] - pts[(i - 1) * 2];
+        const dy = pts[i * 2 + 1] - pts[(i - 1) * 2 + 1];
+        u.push(u[u.length - 1] + Math.sqrt(dx * dx + dy * dy));
+    }
+    const total = u[u.length - 1];
+    if (total > 0) {
+        for (let i = 1; i < u.length; i++)
+            u[i] /= total;
+    }
+    return u;
+}
+function fitCubic(pts, first, last, tHat1, tHat2, toleranceSq, out) {
+    const nPts = last - first + 1;
+    if (nPts === 2) {
+        const dist = Math.sqrt((pts[last * 2] - pts[first * 2]) ** 2 + (pts[last * 2 + 1] - pts[first * 2 + 1]) ** 2);
+        const d = dist / 3;
+        out.commands.push(PathCommand.CUBIC_CURVE_TO);
+        out.data.push(pts[first * 2] + tHat1[0] * d, pts[first * 2 + 1] + tHat1[1] * d, pts[last * 2] + tHat2[0] * d, pts[last * 2 + 1] + tHat2[1] * d, pts[last * 2], pts[last * 2 + 1]);
+        return;
+    }
+    let u = chordLengthParameterize(pts, first, last);
+    const MAX_ITERATIONS = 4;
+    for (let iter = 0; iter <= MAX_ITERATIONS; iter++) {
+        const bezier = generateBezier(pts, first, last, u, tHat1, tHat2);
+        const [maxErr, splitPoint] = computeMaxError(pts, first, last, bezier, u);
+        if (maxErr < toleranceSq) {
+            out.commands.push(PathCommand.CUBIC_CURVE_TO);
+            out.data.push(bezier[2], bezier[3], bezier[4], bezier[5], bezier[6], bezier[7]);
+            return;
+        }
+        if (iter < MAX_ITERATIONS) {
+            u = reparameterize(pts, first, last, u, bezier);
+        }
+        else {
+            const tHatCenter = computeCenterTangent(pts, splitPoint);
+            fitCubic(pts, first, splitPoint, tHat1, [-tHatCenter[0], -tHatCenter[1]], toleranceSq, out);
+            fitCubic(pts, splitPoint, last, tHatCenter, tHat2, toleranceSq, out);
+        }
+    }
+}
+function generateBezier(pts, first, last, u, tHat1, tHat2) {
+    const nPts = last - first + 1;
+    let c00 = 0;
+    let c01 = 0;
+    let c11 = 0;
+    let x0 = 0;
+    let x1 = 0;
+    for (let i = 0; i < nPts; i++) {
+        const t = u[i];
+        const b1 = 3 * t * (1 - t) * (1 - t);
+        const b2 = 3 * t * t * (1 - t);
+        const a1x = tHat1[0] * b1;
+        const a1y = tHat1[1] * b1;
+        const a2x = tHat2[0] * b2;
+        const a2y = tHat2[1] * b2;
+        c00 += a1x * a1x + a1y * a1y;
+        c01 += a1x * a2x + a1y * a2y;
+        c11 += a2x * a2x + a2y * a2y;
+        const b0 = (1 - t) * (1 - t) * (1 - t);
+        const b3 = t * t * t;
+        const tmpx = pts[(first + i) * 2] - (pts[first * 2] * b0 + pts[first * 2] * b1 + pts[last * 2] * b2 + pts[last * 2] * b3);
+        const tmpy = pts[(first + i) * 2 + 1] -
+            (pts[first * 2 + 1] * b0 + pts[first * 2 + 1] * b1 + pts[last * 2 + 1] * b2 + pts[last * 2 + 1] * b3);
+        x0 += a1x * tmpx + a1y * tmpy;
+        x1 += a2x * tmpx + a2y * tmpy;
+    }
+    const det = c00 * c11 - c01 * c01;
+    let alpha1;
+    let alpha2;
+    if (Math.abs(det) < 1e-12) {
+        const dist = Math.sqrt((pts[last * 2] - pts[first * 2]) ** 2 + (pts[last * 2 + 1] - pts[first * 2 + 1]) ** 2);
+        alpha1 = alpha2 = dist / 3;
+    }
+    else {
+        alpha1 = (c11 * x0 - c01 * x1) / det;
+        alpha2 = (c00 * x1 - c01 * x0) / det;
+    }
+    const segLength = Math.sqrt((pts[last * 2] - pts[first * 2]) ** 2 + (pts[last * 2 + 1] - pts[first * 2 + 1]) ** 2);
+    const epsilon = 1e-6 * segLength;
+    if (alpha1 < epsilon || alpha2 < epsilon) {
+        alpha1 = alpha2 = segLength / 3;
+    }
+    return [
+        pts[first * 2],
+        pts[first * 2 + 1],
+        pts[first * 2] + tHat1[0] * alpha1,
+        pts[first * 2 + 1] + tHat1[1] * alpha1,
+        pts[last * 2] + tHat2[0] * alpha2,
+        pts[last * 2 + 1] + tHat2[1] * alpha2,
+        pts[last * 2],
+        pts[last * 2 + 1],
+    ];
+}
+function computeMaxError(pts, first, last, bezier, u) {
+    let maxDist = 0;
+    let splitPoint = (last - first + 1) >> 1;
+    for (let i = 1; i < last - first; i++) {
+        const t = u[i];
+        const mt = 1 - t;
+        const bx = mt * mt * mt * bezier[0] + 3 * mt * mt * t * bezier[2] + 3 * mt * t * t * bezier[4] + t * t * t * bezier[6];
+        const by = mt * mt * mt * bezier[1] + 3 * mt * mt * t * bezier[3] + 3 * mt * t * t * bezier[5] + t * t * t * bezier[7];
+        const dx = pts[(first + i) * 2] - bx;
+        const dy = pts[(first + i) * 2 + 1] - by;
+        const distSq = dx * dx + dy * dy;
+        if (distSq >= maxDist) {
+            maxDist = distSq;
+            splitPoint = first + i;
+        }
+    }
+    return [maxDist, splitPoint];
+}
+function reparameterize(pts, first, last, u, bezier) {
+    const uPrime = [];
+    for (let i = 0; i <= last - first; i++) {
+        uPrime.push(newtonRaphsonRootFind(bezier, pts[(first + i) * 2], pts[(first + i) * 2 + 1], u[i]));
+    }
+    return uPrime;
+}
+function newtonRaphsonRootFind(bezier, px, py, u) {
+    const mt = 1 - u;
+    const qx = mt * mt * mt * bezier[0] + 3 * mt * mt * u * bezier[2] + 3 * mt * u * u * bezier[4] + u * u * u * bezier[6];
+    const qy = mt * mt * mt * bezier[1] + 3 * mt * mt * u * bezier[3] + 3 * mt * u * u * bezier[5] + u * u * u * bezier[7];
+    const q1x = 3 * mt * mt * (bezier[2] - bezier[0]) + 6 * mt * u * (bezier[4] - bezier[2]) + 3 * u * u * (bezier[6] - bezier[4]);
+    const q1y = 3 * mt * mt * (bezier[3] - bezier[1]) + 6 * mt * u * (bezier[5] - bezier[3]) + 3 * u * u * (bezier[7] - bezier[5]);
+    const num = (qx - px) * q1x + (qy - py) * q1y;
+    const q2x = 6 * mt * (bezier[4] - 2 * bezier[2] + bezier[0]) + 6 * u * (bezier[6] - 2 * bezier[4] + bezier[2]);
+    const q2y = 6 * mt * (bezier[5] - 2 * bezier[3] + bezier[1]) + 6 * u * (bezier[7] - 2 * bezier[5] + bezier[3]);
+    const den = q1x * q1x + q1y * q1y + (qx - px) * q2x + (qy - py) * q2y;
+    if (Math.abs(den) < 1e-12)
+        return u;
+    return Math.max(0, Math.min(1, u - num / den));
+}
+function computeCenterTangent(pts, idx) {
+    const dx = pts[(idx - 1) * 2] - pts[(idx + 1) * 2];
+    const dy = pts[(idx - 1) * 2 + 1] - pts[(idx + 1) * 2 + 1];
+    const len = Math.sqrt(dx * dx + dy * dy);
+    return len > 0 ? [dx / len, dy / len] : [1, 0];
+}
+//# sourceMappingURL=fitPathCurves.js.map