@flighthq/path-boolean 0.1.0

package/dist/offsetPath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"offsetPath.d.ts","sourceRoot":"","sources":["../src/offsetPath.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAiC,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAc9F,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAgD3G"}

package/dist/offsetPath.js

@@ -0,0 +1,318 @@
+import { flattenPath } from '@flighthq/path';
+import { resolvePathRegions } from './resolvePathRegions';
+// Offsets a path outward (positive `delta`, inflate) or inward (negative `delta`, deflate) by a signed
+// distance, returning a fresh polygon-outline `Path`. The input is flattened to polygon contours at the
+// option tolerance; each closed contour is offset into a grown/shrunk ring and each open contour is
+// offset into a closed slab outline capped at both terminals. Corner style on the convex side of a
+// vertex is chosen by `options.join` (miter/bevel/round/square); open-path terminals by `options.end`
+// (butt/round/square). The raw offset rings are then self-unioned by the active boolean kernel under
+// non-zero fill to resolve the self-overlap concave corners produce, merge touching rings, and emit a
+// clean, hole-correct outline. `delta` is signed against a canonical orientation, so positive always
+// grows regardless of input winding. Over-deflating a region past self-collapse drops it, so the result
+// can be an empty path (no commands).
+export function offsetPath(path, delta, options) {
+    const join = options?.join ?? 'miter';
+    const end = options?.end ?? 'butt';
+    const miterLimit = options?.miterLimit ?? DEFAULT_MITER_LIMIT;
+    const arcTolerance = options?.arcTolerance ?? DEFAULT_ARC_TOLERANCE;
+    const contours = flattenPath(path, options?.tolerance);
+    // Coincident-point tolerance, made relative to the input's coordinate extent so the same corners
+    // collapse whether the contour is in pixels or micrometres; falls back to a fixed absolute when the
+    // extent is degenerate. Squared to match the squared-distance comparisons it feeds.
+    const pointEpsSq = getContourPointEps(contours) ** 2;
+    const rawRings = [];
+    for (const contour of contours) {
+        const closed = isClosedContour(contour, pointEpsSq);
+        const vertices = getCleanContourVertices(contour, closed, pointEpsSq);
+        if (closed) {
+            // Fewer than three distinct vertices enclose no area to offset.
+            if (vertices.length < 6)
+                continue;
+            const orientation = getRingOrientationSign(vertices);
+            const ring = buildOffsetRing(vertices, delta * orientation, NO_CAPS, join, end, miterLimit, arcTolerance);
+            if (ring.length < 6)
+                continue;
+            // Drop a ring deflated past self-collapse. Such a ring either fully inverts (its winding flips) or
+            // folds back so an inward offset fails to reduce the enclosed area — the global signature of a full
+            // collapse. (Partial self-overlap that stays same-signed is left for the positive-fill union below.)
+            const offsetArea = getRingSignedArea(ring);
+            const inverted = Math.sign(offsetArea) !== orientation;
+            const notReduced = delta < 0 && Math.abs(offsetArea) >= Math.abs(getRingSignedArea(vertices));
+            if (inverted || notReduced)
+                continue;
+            // Orient the surviving ring counter-clockwise (positive area) so the positive-fill self-union keeps
+            // it whatever the source winding was.
+            rawRings.push(offsetArea < 0 ? reverseVertexLoop(ring) : ring);
+        }
+        else {
+            // Fewer than two distinct vertices form no segment to stroke.
+            if (vertices.length < 4)
+                continue;
+            const caps = new Set([0, vertices.length / 2 - 1]);
+            const loop = getOpenContourLoop(vertices);
+            const ring = buildOffsetRing(loop, Math.abs(delta), caps, join, end, miterLimit, arcTolerance);
+            // A stroked slab always bounds a positive-area band; orient it counter-clockwise so positive-fill
+            // union keeps it regardless of which way the doubled loop happened to wind.
+            if (ring.length >= 6)
+                rawRings.push(getRingSignedArea(ring) < 0 ? reverseVertexLoop(ring) : ring);
+        }
+    }
+    // Self-union the raw rings under positive fill (Clipper's InflatePaths cleanup fill): where a concave
+    // corner's inner-miter emission overshoots on a feature narrower than 2·|delta|, it dissolves the
+    // negatively-wound self-overlap that non-zero fill would have kept; it also merges touching rings and
+    // emits a clean, hole-correct outline (empty ring set → empty path).
+    return resolvePathRegions(rawRings, 'positive');
+}
+// Assembles one offset ring for a closed vertex loop by walking its vertices and emitting, at each, the
+// join (or end cap, for the flagged terminal indices of an open-path loop) that bridges the offset end
+// of the previous edge to the offset start of the next. `signedDelta` is the outward offset distance;
+// the outward direction is the per-edge right normal, so a positively-oriented loop grows on positive
+// `signedDelta`. `capIndices` is empty for a genuine closed contour and holds the two terminal indices
+// for an open contour's doubled loop.
+function buildOffsetRing(vertices, signedDelta, capIndices, join, end, miterLimit, arcTolerance) {
+    const count = vertices.length / 2;
+    // Per-edge unit direction and right normal; edge k runs from vertex k to vertex (k + 1) mod count.
+    const dirX = new Array(count);
+    const dirY = new Array(count);
+    const normalX = new Array(count);
+    const normalY = new Array(count);
+    for (let k = 0; k < count; k++) {
+        const kn = (k + 1) % count;
+        const dx = vertices[2 * kn] - vertices[2 * k];
+        const dy = vertices[2 * kn + 1] - vertices[2 * k + 1];
+        const length = Math.hypot(dx, dy);
+        const inverse = length > 0 ? 1 / length : 0;
+        dirX[k] = dx * inverse;
+        dirY[k] = dy * inverse;
+        normalX[k] = dirY[k];
+        normalY[k] = -dirX[k];
+    }
+    const ring = [];
+    for (let k = 0; k < count; k++) {
+        const previous = (k - 1 + count) % count;
+        const vx = vertices[2 * k];
+        const vy = vertices[2 * k + 1];
+        const previousEndX = vx + signedDelta * normalX[previous];
+        const previousEndY = vy + signedDelta * normalY[previous];
+        const thisStartX = vx + signedDelta * normalX[k];
+        const thisStartY = vy + signedDelta * normalY[k];
+        if (capIndices.has(k)) {
+            emitOffsetEndCap(ring, vx, vy, previousEndX, previousEndY, thisStartX, thisStartY, dirX[previous], dirY[previous], dirX[k], dirY[k], Math.abs(signedDelta), end, arcTolerance);
+        }
+        else {
+            emitOffsetJoin(ring, vx, vy, previousEndX, previousEndY, thisStartX, thisStartY, dirX[previous], dirY[previous], dirX[k], dirY[k], signedDelta, join, miterLimit, arcTolerance);
+        }
+    }
+    return ring;
+}
+// Emits the terminal cap of an open path at vertex (vx, vy), bridging the offset end of the incoming
+// side (previousEnd) to the offset start of the outgoing side (thisStart), which sit on opposite sides
+// of the terminal. `butt` connects them flat, `square` extends both out past the terminal by `radius`,
+// and `round` sweeps a half-circle of that radius around the terminal. `previousEnd` is emitted first;
+// `thisStart` is always emitted last.
+function emitOffsetEndCap(ring, vx, vy, previousEndX, previousEndY, thisStartX, thisStartY, previousDirX, previousDirY, thisDirX, thisDirY, radius, end, arcTolerance) {
+    ring.push(previousEndX, previousEndY);
+    if (end === 'square') {
+        ring.push(previousEndX + radius * previousDirX, previousEndY + radius * previousDirY);
+        ring.push(thisStartX - radius * thisDirX, thisStartY - radius * thisDirY);
+    }
+    else if (end === 'round') {
+        const startAngle = Math.atan2(previousEndY - vy, previousEndX - vx);
+        // Sweep the half-circle that bulges past the terminal — the side the incoming direction points.
+        const midX = Math.cos(startAngle + HALF_PI);
+        const midY = Math.sin(startAngle + HALF_PI);
+        const sweep = (midX * previousDirX + midY * previousDirY >= 0 ? 1 : -1) * Math.PI;
+        pushOffsetArc(ring, vx, vy, radius, startAngle, sweep, arcTolerance);
+    }
+    ring.push(thisStartX, thisStartY);
+}
+// Emits the join at vertex (vx, vy) on the convex (gap) side, bridging the offset end of the previous
+// edge (previousEnd) to the offset start of the next edge (thisStart). On the concave side the two
+// offset edges overlap; the outline routes back through the original vertex (previousEnd → vertex →
+// thisStart), leaving a self-crossing spur with consistent winding for the kernel's self-union to
+// resolve. `miter` extends the two offset edges to their apex, falling back to a bevel
+// when that apex is farther than `miterLimit * |signedDelta|`; `bevel` chamfers straight across;
+// `round` sweeps an arc of radius `|signedDelta|`; `square` extends both edges by `|signedDelta|`.
+// `previousEnd` is emitted first; `thisStart` is always emitted last.
+function emitOffsetJoin(ring, vx, vy, previousEndX, previousEndY, thisStartX, thisStartY, previousDirX, previousDirY, thisDirX, thisDirY, signedDelta, join, miterLimit, arcTolerance) {
+    ring.push(previousEndX, previousEndY);
+    const turn = previousDirX * thisDirY - previousDirY * thisDirX;
+    const convex = turn * signedDelta > 0;
+    if (!convex) {
+        // Inner (overlap) corner: emit where the two offset edge lines cross — the inner miter point. For a
+        // mild corner this is the correct clean vertex; for a feature narrower than 2·|delta| it overshoots
+        // past the offset edges, and the resulting self-crossing spur is dissolved by the positive-fill
+        // self-union, which drops the negatively-wound overshoot region. Positive fill is what makes this
+        // robust where non-zero fill (which keeps the overshoot) could not.
+        if (Math.abs(turn) > PARALLEL_EPS) {
+            const advance = ((thisStartX - previousEndX) * thisDirY - (thisStartY - previousEndY) * thisDirX) / turn;
+            ring.push(previousEndX + advance * previousDirX, previousEndY + advance * previousDirY);
+        }
+    }
+    else {
+        if (join === 'miter') {
+            // Intersect the two offset edge lines; the apex is where the extended normals meet.
+            if (Math.abs(turn) > PARALLEL_EPS) {
+                const advance = ((thisStartX - previousEndX) * thisDirY - (thisStartY - previousEndY) * thisDirX) / turn;
+                const apexX = previousEndX + advance * previousDirX;
+                const apexY = previousEndY + advance * previousDirY;
+                const miterLength = Math.hypot(apexX - vx, apexY - vy);
+                if (miterLength <= miterLimit * Math.abs(signedDelta))
+                    ring.push(apexX, apexY);
+            }
+        }
+        else if (join === 'square') {
+            const radius = Math.abs(signedDelta);
+            ring.push(previousEndX + radius * previousDirX, previousEndY + radius * previousDirY);
+            ring.push(thisStartX - radius * thisDirX, thisStartY - radius * thisDirY);
+        }
+        else if (join === 'round') {
+            const radius = Math.abs(signedDelta);
+            const startAngle = Math.atan2(previousEndY - vy, previousEndX - vx);
+            const endAngle = Math.atan2(thisStartY - vy, thisStartX - vx);
+            pushOffsetArc(ring, vx, vy, radius, startAngle, getShortSweep(startAngle, endAngle), arcTolerance);
+        }
+        // A bevel adds nothing between previousEnd and thisStart — the straight edge is the chamfer.
+    }
+    ring.push(thisStartX, thisStartY);
+}
+// Removes consecutive coincident points from a flattened contour and, for a closed contour, the closing
+// vertex that repeats the first, yielding a clean `[x0, y0, ...]` vertex loop with no zero-length edges.
+// `pointEpsSq` is the squared coincidence tolerance (magnitude-relative, computed by the caller).
+function getCleanContourVertices(contour, closed, pointEpsSq) {
+    const out = [];
+    for (let i = 0; i < contour.length; i += 2) {
+        const x = contour[i];
+        const y = contour[i + 1];
+        if (out.length >= 2) {
+            const dx = x - out[out.length - 2];
+            const dy = y - out[out.length - 1];
+            if (dx * dx + dy * dy <= pointEpsSq)
+                continue;
+        }
+        out.push(x, y);
+    }
+    if (closed && out.length >= 4) {
+        const dx = out[0] - out[out.length - 2];
+        const dy = out[1] - out[out.length - 1];
+        if (dx * dx + dy * dy <= pointEpsSq)
+            out.length -= 2;
+    }
+    return out;
+}
+// The coincident-point tolerance for a contour set, scaled to the largest coordinate span across all
+// contours so it tracks the input magnitude; falls back to a fixed absolute for degenerate extent.
+function getContourPointEps(contours) {
+    let minX = Infinity;
+    let minY = Infinity;
+    let maxX = -Infinity;
+    let maxY = -Infinity;
+    for (const contour of contours) {
+        for (let i = 0; i < contour.length; i += 2) {
+            const x = contour[i];
+            const y = contour[i + 1];
+            if (x < minX)
+                minX = x;
+            if (x > maxX)
+                maxX = x;
+            if (y < minY)
+                minY = y;
+            if (y > maxY)
+                maxY = y;
+        }
+    }
+    const extent = Math.max(maxX - minX, maxY - minY);
+    return extent > 0 ? extent * POINT_EPS_RELATIVE : POINT_EPS;
+}
+// Builds the doubled vertex loop for an open contour: the forward vertices followed by the interior
+// vertices in reverse. Offsetting this as a closed loop strokes both sides of the polyline, with the
+// two terminal vertices (indices 0 and count - 1) reversing 180° so they take an end cap, not a join.
+function getOpenContourLoop(vertices) {
+    const count = vertices.length / 2;
+    const loop = vertices.slice();
+    for (let k = count - 2; k >= 1; k--)
+        loop.push(vertices[2 * k], vertices[2 * k + 1]);
+    return loop;
+}
+// Signed orientation of a vertex loop under the standard shoelace convention: +1 counter-clockwise,
+// -1 clockwise, +1 for a degenerate zero-area loop.
+function getRingOrientationSign(vertices) {
+    const sign = Math.sign(getRingSignedArea(vertices));
+    return sign === 0 ? 1 : sign;
+}
+// Twice-halved shoelace signed area of an implicitly-closed vertex loop.
+function getRingSignedArea(vertices) {
+    let area = 0;
+    const count = vertices.length / 2;
+    for (let k = 0; k < count; k++) {
+        const kn = (k + 1) % count;
+        area += vertices[2 * k] * vertices[2 * kn + 1] - vertices[2 * kn] * vertices[2 * k + 1];
+    }
+    return area * 0.5;
+}
+// The signed angular sweep from `startAngle` to `endAngle` taking the short way around, in (-PI, PI].
+// Convex offset corners subtend the exterior turn angle, which is always the short arc.
+function getShortSweep(startAngle, endAngle) {
+    let sweep = endAngle - startAngle;
+    while (sweep <= -Math.PI)
+        sweep += TWO_PI;
+    while (sweep > Math.PI)
+        sweep -= TWO_PI;
+    return sweep;
+}
+// Whether a flattened contour is closed: it has at least three points and its last point coincides with
+// its first (the explicit closing vertex `flattenPath` appends on a CLOSE). An open polyline whose ends
+// happen to coincide is treated as closed — an acceptable inference at pixel scale. `pointEpsSq` is the
+// squared coincidence tolerance (magnitude-relative, computed by the caller).
+function isClosedContour(contour, pointEpsSq) {
+    const n = contour.length;
+    if (n < 6)
+        return false;
+    const dx = contour[0] - contour[n - 2];
+    const dy = contour[1] - contour[n - 1];
+    return dx * dx + dy * dy <= pointEpsSq;
+}
+// Tessellates a circular arc about (cx, cy) of the given radius from `startAngle` sweeping by the signed
+// `sweep`, pushing only the interior points (the caller emits the arc endpoints). Segment count is set
+// so no chord deviates from the true circle by more than `arcTolerance`.
+function pushOffsetArc(ring, cx, cy, radius, startAngle, sweep, arcTolerance) {
+    const maxAngle = arcTolerance > 0 && arcTolerance < radius ? 2 * Math.acos(1 - arcTolerance / radius) : Math.PI;
+    const steps = Math.max(1, Math.ceil(Math.abs(sweep) / maxAngle));
+    for (let i = 1; i < steps; i++) {
+        const angle = startAngle + sweep * (i / steps);
+        ring.push(cx + radius * Math.cos(angle), cy + radius * Math.sin(angle));
+    }
+}
+// Reverses a flat `[x0, y0, ...]` vertex loop in place-free fashion, flipping its winding while keeping
+// vertex 0 first, so a clockwise loop becomes counter-clockwise and vice versa.
+function reverseVertexLoop(vertices) {
+    const count = vertices.length / 2;
+    const out = new Array(vertices.length);
+    out[0] = vertices[0];
+    out[1] = vertices[1];
+    for (let k = 1; k < count; k++) {
+        const source = count - k;
+        out[2 * k] = vertices[2 * source];
+        out[2 * k + 1] = vertices[2 * source + 1];
+    }
+    return out;
+}
+// Default maximum deviation between a round join/end arc and its true circle, in path units — a quarter
+// pixel, matching the flattener's default and sane for pixel-scale output.
+const DEFAULT_ARC_TOLERANCE = 0.25;
+// Default miter length ceiling as a multiple of |delta|, the Clipper2 default: corners sharper than
+// ~60° fall back to a bevel.
+const DEFAULT_MITER_LIMIT = 2;
+const HALF_PI = Math.PI / 2;
+const NO_CAPS = new Set();
+// Fallback absolute coincidence epsilon for degenerate zero-extent input, where the relative form has
+// nothing to scale against. Well below any realistic flatten tolerance.
+const POINT_EPS = 1e-9;
+// Relative coincidence factor: the point-merge tolerance is this fraction of the input's coordinate
+// extent, so corners collapse consistently whether the contour is in pixels or micrometres.
+const POINT_EPS_RELATIVE = 1e-9;
+// Below this cross-product magnitude the two offset edges are effectively parallel and a miter apex is
+// unstable, so the join degrades to a bevel.
+const PARALLEL_EPS = 1e-12;
+const TWO_PI = Math.PI * 2;
+//# sourceMappingURL=offsetPath.js.map

package/dist/offsetPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"offsetPath.js","sourceRoot":"","sources":["../src/offsetPath.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAG7C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,uGAAuG;AACvG,wGAAwG;AACxG,oGAAoG;AACpG,mGAAmG;AACnG,sGAAsG;AACtG,qGAAqG;AACrG,sGAAsG;AACtG,qGAAqG;AACrG,wGAAwG;AACxG,sCAAsC;AACtC,MAAM,UAAU,UAAU,CAAC,IAAoB,EAAE,KAAa,EAAE,OAAqC;IACnG,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,OAAO,CAAC;IACtC,MAAM,GAAG,GAAG,OAAO,EAAE,GAAG,IAAI,MAAM,CAAC;IACnC,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,mBAAmB,CAAC;IAC9D,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,IAAI,qBAAqB,CAAC;IACpE,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACvD,iGAAiG;IACjG,oGAAoG;IACpG,oFAAoF;IACpF,MAAM,UAAU,GAAG,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAErD,MAAM,QAAQ,GAAe,EAAE,CAAC;IAChC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,uBAAuB,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;QACtE,IAAI,MAAM,EAAE,CAAC;YACX,gEAAgE;YAChE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAClC,MAAM,WAAW,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAC;YACrD,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,GAAG,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;YAC1G,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAC9B,mGAAmG;YACnG,oGAAoG;YACpG,qGAAqG;YACrG,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,WAAW,CAAC;YACvD,MAAM,UAAU,GAAG,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC9F,IAAI,QAAQ,IAAI,UAAU;gBAAE,SAAS;YACrC,oGAAoG;YACpG,sCAAsC;YACtC,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjE,CAAC;aAAM,CAAC;YACN,8DAA8D;YAC9D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAClC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,IAAI,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;YAC/F,kGAAkG;YAClG,4EAA4E;YAC5E,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACpG,CAAC;IACH,CAAC;IAED,sGAAsG;IACtG,kGAAkG;IAClG,sGAAsG;IACtG,qEAAqE;IACrE,OAAO,kBAAkB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AAClD,CAAC;AAED,wGAAwG;AACxG,uGAAuG;AACvG,sGAAsG;AACtG,sGAAsG;AACtG,uGAAuG;AACvG,sCAAsC;AACtC,SAAS,eAAe,CACtB,QAA2B,EAC3B,WAAmB,EACnB,UAA+B,EAC/B,IAAoB,EACpB,GAAkB,EAClB,UAAkB,EAClB,YAAoB;IAEpB,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAClC,mGAAmG;IACnG,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;QACvB,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;QACzC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,MAAM,YAAY,GAAG,EAAE,GAAG,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1D,MAAM,YAAY,GAAG,EAAE,GAAG,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,EAAE,GAAG,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,UAAU,GAAG,EAAE,GAAG,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,gBAAgB,CACd,IAAI,EACJ,EAAE,EACF,EAAE,EACF,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,UAAU,EACV,IAAI,CAAC,QAAQ,CAAC,EACd,IAAI,CAAC,QAAQ,CAAC,EACd,IAAI,CAAC,CAAC,CAAC,EACP,IAAI,CAAC,CAAC,CAAC,EACP,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EACrB,GAAG,EACH,YAAY,CACb,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,cAAc,CACZ,IAAI,EACJ,EAAE,EACF,EAAE,EACF,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,UAAU,EACV,IAAI,CAAC,QAAQ,CAAC,EACd,IAAI,CAAC,QAAQ,CAAC,EACd,IAAI,CAAC,CAAC,CAAC,EACP,IAAI,CAAC,CAAC,CAAC,EACP,WAAW,EACX,IAAI,EACJ,UAAU,EACV,YAAY,CACb,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,qGAAqG;AACrG,uGAAuG;AACvG,uGAAuG;AACvG,uGAAuG;AACvG,sCAAsC;AACtC,SAAS,gBAAgB,CACvB,IAAc,EACd,EAAU,EACV,EAAU,EACV,YAAoB,EACpB,YAAoB,EACpB,UAAkB,EAClB,UAAkB,EAClB,YAAoB,EACpB,YAAoB,EACpB,QAAgB,EAChB,QAAgB,EAChB,MAAc,EACd,GAAkB,EAClB,YAAoB;IAEpB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IACtC,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,MAAM,GAAG,YAAY,EAAE,YAAY,GAAG,MAAM,GAAG,YAAY,CAAC,CAAC;QACtF,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,MAAM,GAAG,QAAQ,EAAE,UAAU,GAAG,MAAM,GAAG,QAAQ,CAAC,CAAC;IAC5E,CAAC;SAAM,IAAI,GAAG,KAAK,OAAO,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,EAAE,EAAE,YAAY,GAAG,EAAE,CAAC,CAAC;QACpE,gGAAgG;QAChG,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;QAClF,aAAa,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AACpC,CAAC;AAED,sGAAsG;AACtG,mGAAmG;AACnG,oGAAoG;AACpG,kGAAkG;AAClG,uFAAuF;AACvF,iGAAiG;AACjG,mGAAmG;AACnG,sEAAsE;AACtE,SAAS,cAAc,CACrB,IAAc,EACd,EAAU,EACV,EAAU,EACV,YAAoB,EACpB,YAAoB,EACpB,UAAkB,EAClB,UAAkB,EAClB,YAAoB,EACpB,YAAoB,EACpB,QAAgB,EAChB,QAAgB,EAChB,WAAmB,EACnB,IAAoB,EACpB,UAAkB,EAClB,YAAoB;IAEpB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,YAAY,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,CAAC;IAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,WAAW,GAAG,CAAC,CAAC;IACtC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,oGAAoG;QACpG,oGAAoG;QACpG,gGAAgG;QAChG,kGAAkG;QAClG,oEAAoE;QACpE,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,GAAG,YAAY,CAAC,GAAG,QAAQ,GAAG,CAAC,UAAU,GAAG,YAAY,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC;YACzG,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,OAAO,GAAG,YAAY,EAAE,YAAY,GAAG,OAAO,GAAG,YAAY,CAAC,CAAC;QAC1F,CAAC;IACH,CAAC;SAAM,CAAC;QACN,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YACrB,oFAAoF;YACpF,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;gBAClC,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,GAAG,YAAY,CAAC,GAAG,QAAQ,GAAG,CAAC,UAAU,GAAG,YAAY,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC;gBACzG,MAAM,KAAK,GAAG,YAAY,GAAG,OAAO,GAAG,YAAY,CAAC;gBACpD,MAAM,KAAK,GAAG,YAAY,GAAG,OAAO,GAAG,YAAY,CAAC;gBACpD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;gBACvD,IAAI,WAAW,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,MAAM,GAAG,YAAY,EAAE,YAAY,GAAG,MAAM,GAAG,YAAY,CAAC,CAAC;YACtF,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,MAAM,GAAG,QAAQ,EAAE,UAAU,GAAG,MAAM,GAAG,QAAQ,CAAC,CAAC;QAC5E,CAAC;aAAM,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACrC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,EAAE,EAAE,YAAY,GAAG,EAAE,CAAC,CAAC;YACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,EAAE,EAAE,UAAU,GAAG,EAAE,CAAC,CAAC;YAC9D,aAAa,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,YAAY,CAAC,CAAC;QACrG,CAAC;QACD,6FAA6F;IAC/F,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AACpC,CAAC;AAED,wGAAwG;AACxG,yGAAyG;AACzG,kGAAkG;AAClG,SAAS,uBAAuB,CAAC,OAA0B,EAAE,MAAe,EAAE,UAAkB;IAC9F,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,UAAU;gBAAE,SAAS;QAChD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,UAAU;YAAE,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qGAAqG;AACrG,mGAAmG;AACnG,SAAS,kBAAkB,CAAC,QAAwC;IAClE,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,GAAG,IAAI;gBAAE,IAAI,GAAG,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;IAClD,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC;AAC9D,CAAC;AAED,oGAAoG;AACpG,qGAAqG;AACrG,sGAAsG;AACtG,SAAS,kBAAkB,CAAC,QAA2B;IACrD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oGAAoG;AACpG,oDAAoD;AACpD,SAAS,sBAAsB,CAAC,QAA2B;IACzD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpD,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/B,CAAC;AAED,yEAAyE;AACzE,SAAS,iBAAiB,CAAC,QAA2B;IACpD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC3B,IAAI,IAAI,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1F,CAAC;IACD,OAAO,IAAI,GAAG,GAAG,CAAC;AACpB,CAAC;AAED,sGAAsG;AACtG,wFAAwF;AACxF,SAAS,aAAa,CAAC,UAAkB,EAAE,QAAgB;IACzD,IAAI,KAAK,GAAG,QAAQ,GAAG,UAAU,CAAC;IAClC,OAAO,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,KAAK,IAAI,MAAM,CAAC;IAC1C,OAAO,KAAK,GAAG,IAAI,CAAC,EAAE;QAAE,KAAK,IAAI,MAAM,CAAC;IACxC,OAAO,KAAK,CAAC;AACf,CAAC;AAED,wGAAwG;AACxG,wGAAwG;AACxG,wGAAwG;AACxG,8EAA8E;AAC9E,SAAS,eAAe,CAAC,OAA0B,EAAE,UAAkB;IACrE,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACxB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,UAAU,CAAC;AACzC,CAAC;AAED,yGAAyG;AACzG,uGAAuG;AACvG,yEAAyE;AACzE,SAAS,aAAa,CACpB,IAAc,EACd,EAAU,EACV,EAAU,EACV,MAAc,EACd,UAAkB,EAClB,KAAa,EACb,YAAoB;IAEpB,MAAM,QAAQ,GAAG,YAAY,GAAG,CAAC,IAAI,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;IAChH,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,CAAC;AACH,CAAC;AAED,wGAAwG;AACxG,gFAAgF;AAChF,SAAS,iBAAiB,CAAC,QAA2B;IACpD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/C,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;QACzB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;QAClC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,wGAAwG;AACxG,2EAA2E;AAC3E,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAEnC,oGAAoG;AACpG,6BAA6B;AAC7B,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;AAE5B,MAAM,OAAO,GAAwB,IAAI,GAAG,EAAU,CAAC;AAEvD,sGAAsG;AACtG,wEAAwE;AACxE,MAAM,SAAS,GAAG,IAAI,CAAC;AAEvB,oGAAoG;AACpG,4FAA4F;AAC5F,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEhC,uGAAuG;AACvG,6CAA6C;AAC7C,MAAM,YAAY,GAAG,KAAK,CAAC;AAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC"}

package/dist/pathBooleanBackend.d.ts

@@ -0,0 +1,5 @@
+import type { PathBooleanBackend } from '@flighthq/types';
+export declare function createDefaultPathBooleanBackend(): PathBooleanBackend;
+export declare function getPathBooleanBackend(): PathBooleanBackend;
+export declare function setPathBooleanBackend(backend: PathBooleanBackend | null): void;
+//# sourceMappingURL=pathBooleanBackend.d.ts.map

package/dist/pathBooleanBackend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathBooleanBackend.d.ts","sourceRoot":"","sources":["../src/pathBooleanBackend.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAO1D,wBAAgB,+BAA+B,IAAI,kBAAkB,CAEpE;AAID,wBAAgB,qBAAqB,IAAI,kBAAkB,CAG1D;AAKD,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,kBAAkB,GAAG,IAAI,GAAG,IAAI,CAE9E"}

package/dist/pathBooleanBackend.js

@@ -0,0 +1,24 @@
+import { createMartinezPathBooleanBackend } from './martinezKernel';
+// Builds a fresh instance of the default boolean kernel — the from-scratch Martinez–Rueda–Feito
+// sweep-line. Callers that want the built-in behavior without touching the shared module-level backend
+// (for example to run it alongside a swapped-in native kernel) construct one here.
+export function createDefaultPathBooleanBackend() {
+    return createMartinezPathBooleanBackend();
+}
+// Returns the active boolean kernel, lazily installing the default Martinez kernel on first use. There
+// is always a backend; the operation functions dispatch through this.
+export function getPathBooleanBackend() {
+    if (_backend === null)
+        _backend = createDefaultPathBooleanBackend();
+    return _backend;
+}
+// Installs a boolean kernel for all subsequent operations, or clears back to the lazy default when
+// passed null. A heavier or faster kernel (a faithful Clipper port, a wasm drop-in) swaps in here
+// without changing the operation API.
+export function setPathBooleanBackend(backend) {
+    _backend = backend;
+}
+// The active kernel, or null until the first getPathBooleanBackend call installs the default. Held at
+// module scope but never populated at import time, so importing this package has no side effects.
+let _backend = null;
+//# sourceMappingURL=pathBooleanBackend.js.map

package/dist/pathBooleanBackend.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathBooleanBackend.js","sourceRoot":"","sources":["../src/pathBooleanBackend.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,gCAAgC,EAAE,MAAM,kBAAkB,CAAC;AAEpE,gGAAgG;AAChG,uGAAuG;AACvG,mFAAmF;AACnF,MAAM,UAAU,+BAA+B;IAC7C,OAAO,gCAAgC,EAAE,CAAC;AAC5C,CAAC;AAED,uGAAuG;AACvG,sEAAsE;AACtE,MAAM,UAAU,qBAAqB;IACnC,IAAI,QAAQ,KAAK,IAAI;QAAE,QAAQ,GAAG,+BAA+B,EAAE,CAAC;IACpE,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,mGAAmG;AACnG,kGAAkG;AAClG,sCAAsC;AACtC,MAAM,UAAU,qBAAqB,CAAC,OAAkC;IACtE,QAAQ,GAAG,OAAO,CAAC;AACrB,CAAC;AAED,sGAAsG;AACtG,kGAAkG;AAClG,IAAI,QAAQ,GAA8B,IAAI,CAAC"}

package/dist/resolvePathRegions.d.ts

@@ -0,0 +1,3 @@
+import type { Path, PathBooleanContour, PathBooleanFillRule } from '@flighthq/types';
+export declare function resolvePathRegions(rings: readonly PathBooleanContour[], fillRule: PathBooleanFillRule): Path;
+//# sourceMappingURL=resolvePathRegions.d.ts.map

package/dist/resolvePathRegions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolvePathRegions.d.ts","sourceRoot":"","sources":["../src/resolvePathRegions.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAarF,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,kBAAkB,EAAE,EAAE,QAAQ,EAAE,mBAAmB,GAAG,IAAI,CAW5G"}

package/dist/resolvePathRegions.js

@@ -0,0 +1,28 @@
+import { appendPathClose, appendPathLineTo, appendPathMoveTo, createPath } from '@flighthq/path';
+import { getPathBooleanBackend } from './pathBooleanBackend';
+// Resolves a set of raw polygon rings into a single clean, valid filled-region `Path` by self-unioning
+// them through the active boolean kernel under `fillRule`, then rebuilding the resolved contours with the
+// path builders. This is the shared "raw rings → clean outline" primitive that both `offsetPath` (feeding
+// the rings it strokes around each contour, always `nonZero`) and `simplifyPath` (feeding a path's own
+// flattened contours under the caller's fill rule) compose over. The kernel dissolves self-overlap, merges
+// touching rings, and traces holes counter-wound to their outer ring, so the rebuilt path is always
+// `nonZero` regardless of the input fill rule. `fillRule` is the kernel-level `PathBooleanFillRule`
+// superset: `simplifyPath` passes the caller's `evenOdd`/`nonZero`, while `offsetPath` passes `positive`
+// for its offset-cleanup fill. An empty ring set yields an empty path (no commands).
+export function resolvePathRegions(rings, fillRule) {
+    const path = createPath('nonZero');
+    if (rings.length === 0)
+        return path;
+    const resolved = getPathBooleanBackend().computePathBoolean(rings, EMPTY_CONTOURS, 'union', fillRule);
+    for (const ring of resolved) {
+        if (ring.length < 6)
+            continue;
+        appendPathMoveTo(path, ring[0], ring[1]);
+        for (let i = 2; i < ring.length; i += 2)
+            appendPathLineTo(path, ring[i], ring[i + 1]);
+        appendPathClose(path);
+    }
+    return path;
+}
+const EMPTY_CONTOURS = [];
+//# sourceMappingURL=resolvePathRegions.js.map

package/dist/resolvePathRegions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolvePathRegions.js","sourceRoot":"","sources":["../src/resolvePathRegions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAGjG,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAE7D,uGAAuG;AACvG,0GAA0G;AAC1G,0GAA0G;AAC1G,uGAAuG;AACvG,2GAA2G;AAC3G,oGAAoG;AACpG,oGAAoG;AACpG,yGAAyG;AACzG,qFAAqF;AACrF,MAAM,UAAU,kBAAkB,CAAC,KAAoC,EAAE,QAA6B;IACpG,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;IACnC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,QAAQ,GAAG,qBAAqB,EAAE,CAAC,kBAAkB,CAAC,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACtG,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC9B,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;YAAE,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtF,eAAe,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,cAAc,GAAkC,EAAE,CAAC"}

package/dist/simplifyPath.d.ts

@@ -0,0 +1,3 @@
+import type { Path, PathBooleanOptions } from '@flighthq/types';
+export declare function simplifyPath(path: Readonly<Path>, options?: Readonly<PathBooleanOptions>): Path;
+//# sourceMappingURL=simplifyPath.d.ts.map

package/dist/simplifyPath.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplifyPath.d.ts","sourceRoot":"","sources":["../src/simplifyPath.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAYhE,wBAAgB,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,IAAI,CAI/F"}

package/dist/simplifyPath.js

@@ -0,0 +1,16 @@
+import { flattenPath } from '@flighthq/path';
+import { resolvePathRegions } from './resolvePathRegions';
+// Resolves a single path — possibly self-intersecting, self-overlapping, or holding several contours —
+// into a clean, valid filled-region outline under its fill rule. This is the Clipper `SimplifyPaths` /
+// Skia `Simplify` operation: the path is flattened to polygon contours at `options.tolerance`, then
+// self-unioned through the active boolean kernel under `options.fillRule` (default `nonZero`). The two
+// fill rules diverge on self-overlapping input — a region covered twice with the same winding fills solid
+// under `nonZero` but punches an even-odd hole — which is why the fill rule travels with the operation.
+// Returns a fresh polygon-outline `Path` (holes traced counter-wound to their outer ring); empty or fully
+// degenerate input yields an empty path with no commands.
+export function simplifyPath(path, options) {
+    const fillRule = options?.fillRule ?? 'nonZero';
+    const contours = flattenPath(path, options?.tolerance);
+    return resolvePathRegions(contours, fillRule);
+}
+//# sourceMappingURL=simplifyPath.js.map

package/dist/simplifyPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplifyPath.js","sourceRoot":"","sources":["../src/simplifyPath.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAG7C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,uGAAuG;AACvG,uGAAuG;AACvG,oGAAoG;AACpG,uGAAuG;AACvG,0GAA0G;AAC1G,wGAAwG;AACxG,0GAA0G;AAC1G,0DAA0D;AAC1D,MAAM,UAAU,YAAY,CAAC,IAAoB,EAAE,OAAsC;IACvF,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,SAAS,CAAC;IAChD,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACvD,OAAO,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AAChD,CAAC"}

package/dist/unionAllPaths.d.ts

@@ -0,0 +1,3 @@
+import type { Path, PathBooleanOptions } from '@flighthq/types';
+export declare function unionAllPaths(paths: readonly Readonly<Path>[], out?: Path, options?: Readonly<PathBooleanOptions>): Path;
+//# sourceMappingURL=unionAllPaths.d.ts.map

package/dist/unionAllPaths.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unionAllPaths.d.ts","sourceRoot":"","sources":["../src/unionAllPaths.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAsB,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAWpF,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,QAAQ,CAAC,IAAI,CAAC,EAAE,EAChC,GAAG,CAAC,EAAE,IAAI,EACV,OAAO,CAAC,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GACrC,IAAI,CAsBN"}

package/dist/unionAllPaths.js

@@ -0,0 +1,35 @@
+import { appendPathClose, appendPathLineTo, appendPathMoveTo, createPath, flattenPath } from '@flighthq/path';
+import { getPathBooleanBackend } from './pathBooleanBackend';
+// N-way union of a list of paths into one clean filled-region outline. Every path is flattened to polygon
+// contours at the option tolerance and the whole set is folded together in a single union pass through the
+// active kernel under the fill rule (default `nonZero`), so overlaps merge and holes are preserved exactly
+// as a repeated binary `unionPaths` fold would produce, without the intermediate allocations. The result
+// contours are written into `out` (a fresh `nonZero` path when omitted). An empty list yields an empty
+// path; a single path yields its own self-overlap-resolved region, matching `simplifyPath`. Every input is
+// fully read before `out` is written, so `out` may safely alias any path in the list.
+export function unionAllPaths(paths, out, options) {
+    const fillRule = options?.fillRule ?? 'nonZero';
+    const contours = [];
+    for (const path of paths) {
+        for (const contour of flattenPath(path, options?.tolerance))
+            contours.push(contour);
+    }
+    const result = contours.length === 0
+        ? EMPTY_CONTOURS
+        : getPathBooleanBackend().computePathBoolean(contours, EMPTY_CONTOURS, 'union', fillRule);
+    const path = out ?? createPath('nonZero');
+    path.commands.length = 0;
+    path.data.length = 0;
+    path.winding = 'nonZero';
+    for (const ring of result) {
+        if (ring.length < 6)
+            continue;
+        appendPathMoveTo(path, ring[0], ring[1]);
+        for (let i = 2; i < ring.length; i += 2)
+            appendPathLineTo(path, ring[i], ring[i + 1]);
+        appendPathClose(path);
+    }
+    return path;
+}
+const EMPTY_CONTOURS = [];
+//# sourceMappingURL=unionAllPaths.js.map

package/dist/unionAllPaths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unionAllPaths.js","sourceRoot":"","sources":["../src/unionAllPaths.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAG9G,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAE7D,0GAA0G;AAC1G,2GAA2G;AAC3G,2GAA2G;AAC3G,yGAAyG;AACzG,uGAAuG;AACvG,2GAA2G;AAC3G,sFAAsF;AACtF,MAAM,UAAU,aAAa,CAC3B,KAAgC,EAChC,GAAU,EACV,OAAsC;IAEtC,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,SAAS,CAAC;IAChD,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtF,CAAC;IACD,MAAM,MAAM,GACV,QAAQ,CAAC,MAAM,KAAK,CAAC;QACnB,CAAC,CAAC,cAAc;QAChB,CAAC,CAAC,qBAAqB,EAAE,CAAC,kBAAkB,CAAC,QAAQ,EAAE,cAAc,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAE9F,MAAM,IAAI,GAAG,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACrB,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC9B,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;YAAE,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtF,eAAe,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,cAAc,GAAkC,EAAE,CAAC"}

package/package.json

@@ -0,0 +1,38 @@
+{
+  "name": "@flighthq/path-boolean",
+  "version": "0.1.0",
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "src/**/*.test.ts",
+    "!dist/**/*.test.js",
+    "!dist/**/*.test.d.ts",
+    "!dist/**/*.test.js.map",
+    "!dist/**/*.test.d.ts.map"
+  ],
+  "scripts": {
+    "build": "tsc -b",
+    "clean": "tsc -b --clean",
+    "test": "vitest run --config vitest.config.ts",
+    "test:watch": "vitest --watch --config vitest.config.ts",
+    "prepack": "npm run clean && npm run clean:dist && npm run build",
+    "clean:dist": "tsx ../../scripts/clean-package-dist.ts"
+  },
+  "dependencies": {
+    "@flighthq/path": "0.1.0",
+    "@flighthq/types": "0.1.0"
+  },
+  "devDependencies": {
+    "typescript": "^5.3.0"
+  },
+  "description": "2D constructive solid geometry boolean operations (union/intersection/difference/xor) for @flighthq/path",
+  "sideEffects": false
+}