framewatch-mcp-server 0.1.0

package/dist/engine/differ.d.ts

@@ -0,0 +1,88 @@
+import type { BoundingBox, DiffCard, FrameTrigger, GridDiffResult, PixelDiffResult, PixelMaskResult, RawFrame } from "../types.js";
+/**
+ * Grid comparison of two same-size 1-channel raw buffers.
+ *
+ * The image is divided into GRID_SIZE x GRID_SIZE cells of
+ * floor(width / GRID_SIZE) x floor(height / GRID_SIZE) pixels. A cell counts
+ * as changed when its mean absolute pixel difference exceeds CELL_THRESHOLD.
+ * The bbox is the union of all changed cells, in buffer coordinates.
+ *
+ * @throws if either buffer's length is not width * height.
+ */
+export declare function computeGridDiff(prev: Buffer, curr: Buffer, width: number, height: number): GridDiffResult;
+/**
+ * Per-pixel comparison of two same-size 1-channel raw buffers at full
+ * resolution. A pixel counts as changed when |prev - curr| > PIXEL_THRESHOLD.
+ * The bbox is tight and inclusive of the last changed pixel
+ * (width = maxX - minX + 1); changePercent is 0..100.
+ *
+ * @throws if either buffer's length is not width * height.
+ */
+export declare function computePixelDiff(prev: Buffer, curr: Buffer, width: number, height: number): PixelDiffResult;
+/**
+ * `computePixelDiff` plus the mask itself: one byte per pixel, 1 where the
+ * pixel changed. `framewatch_compare` paints that mask over the second image
+ * so a reviewer can see *where* two pages differ, not just by how much.
+ *
+ * Kept separate from `computePixelDiff` because the capture path runs it on
+ * every card and has no use for a second full-frame buffer per frame.
+ *
+ * @throws if either buffer's length is not width * height.
+ */
+export declare function computePixelMask(prev: Buffer, curr: Buffer, width: number, height: number): PixelMaskResult;
+/** Pad a bbox by `padding` on every side and clamp it to [0, 0, frameWidth, frameHeight]. */
+export declare function padBoundingBox(bbox: BoundingBox, padding: number, frameWidth: number, frameHeight: number): BoundingBox;
+/**
+ * Decide whether a frame with the given grid change ratio should be kept.
+ * sensitivity <= 0 → always true ("keep all"); sensitivity >= 1 → always
+ * false ("keep none"); otherwise changeRatio > sensitivity (so the default
+ * 0.06 keeps 4/64 = 0.0625 and drops 3/64).
+ */
+export declare function exceedsSensitivity(changeRatio: number, sensitivity: number): boolean;
+export interface FrameSelectionInput {
+    timestamp_ms: number;
+    is_interaction: boolean;
+    trigger?: FrameTrigger;
+}
+export interface SelectFramesOptions {
+    /** Grid change ratio a frame must exceed to be kept (0 = keep all, 1 = keep none). */
+    sensitivity: number;
+    /** Hard cap on the number of frames returned. */
+    max_frames: number;
+}
+/**
+ * Pure selection logic — decides which raw frame indices become diff cards.
+ * `diffBuffers[i]` is the low-res diff buffer (see `toDiffBuffer`) for
+ * `frames[i]`. Returns ascending raw-frame indices.
+ *
+ * Rules, in order:
+ *  1. Frame 0 is always kept.
+ *  2. Each later frame is compared (grid diff) against the LAST KEPT frame —
+ *     not the previous raw frame, so slow drifts accumulate and are eventually
+ *     kept. Forced frames (interaction / trigger) are kept regardless.
+ *  3. The last frame is always kept.
+ *  4. Kept frames within MERGE_WINDOW_MS of the first frame of a cluster are
+ *     merged into that cluster's last ("settled") frame, unless protected
+ *     (first, last, forced). Windows are anchored, not sliding, so a
+ *     continuous animation is thinned to ~every MERGE_WINDOW_MS, not
+ *     collapsed to one frame.
+ *  5. If still over `max_frames`, protected frames are kept first and the
+ *     remaining slots are filled by sampling unprotected frames evenly.
+ */
+export declare function selectFrames(frames: FrameSelectionInput[], diffBuffers: Buffer[], options: SelectFramesOptions): number[];
+export interface BuildDiffCardsOptions {
+    sensitivity: number;
+    max_frames: number;
+}
+export interface DiffCardsResult {
+    cards: DiffCard[];
+    /** Number of raw frames that were examined. */
+    total_frames: number;
+}
+/**
+ * End-to-end: raw frames → diff cards. Computes the low-res diff buffer for
+ * every frame, runs `selectFrames`, then builds one card per selected frame
+ * with the resized full frame and (for every card but the first) the padded
+ * full-resolution change region versus the previous CARD, plus its crop.
+ */
+export declare function buildDiffCards(frames: RawFrame[], options: BuildDiffCardsOptions): Promise<DiffCardsResult>;

package/dist/engine/differ.js

@@ -0,0 +1,373 @@
+import { CELL_THRESHOLD, CROP_PADDING_PX, CROP_SKIP_COVERAGE, DIFF_HEIGHT, DIFF_WIDTH, GRID_SIZE, MERGE_WINDOW_MS, PIXEL_THRESHOLD, } from "../constants.js";
+import { cropRegion, resizeForOutput, toBase64, toDiffBuffer, toGrayscale } from "../utils/image.js";
+/**
+ * Smart diff engine.
+ *
+ * Pure image/array logic — no Playwright. Frames are compared on a low-res
+ * grayscale grid (fast, tolerant of noise) to decide which ones to keep, then
+ * the kept frames are compared pixel-by-pixel at full resolution to locate the
+ * exact change region for cropping.
+ */
+function assertSameSize(fn, prev, curr, width, height) {
+    const expected = width * height;
+    if (prev.length !== expected || curr.length !== expected) {
+        throw new Error(`${fn}: buffer length mismatch — expected ${expected} (${width}x${height}), got ${prev.length} and ${curr.length}`);
+    }
+}
+/**
+ * Grid comparison of two same-size 1-channel raw buffers.
+ *
+ * The image is divided into GRID_SIZE x GRID_SIZE cells of
+ * floor(width / GRID_SIZE) x floor(height / GRID_SIZE) pixels. A cell counts
+ * as changed when its mean absolute pixel difference exceeds CELL_THRESHOLD.
+ * The bbox is the union of all changed cells, in buffer coordinates.
+ *
+ * @throws if either buffer's length is not width * height.
+ */
+export function computeGridDiff(prev, curr, width, height) {
+    assertSameSize("computeGridDiff", prev, curr, width, height);
+    const cellWidth = Math.floor(width / GRID_SIZE);
+    const cellHeight = Math.floor(height / GRID_SIZE);
+    const cellPixels = cellWidth * cellHeight;
+    const totalCells = GRID_SIZE * GRID_SIZE;
+    let changedCells = 0;
+    let minX = width;
+    let minY = height;
+    let maxX = 0;
+    let maxY = 0;
+    for (let gy = 0; gy < GRID_SIZE; gy++) {
+        const y0 = gy * cellHeight;
+        const y1 = y0 + cellHeight;
+        for (let gx = 0; gx < GRID_SIZE; gx++) {
+            const x0 = gx * cellWidth;
+            const x1 = x0 + cellWidth;
+            let cellDiff = 0;
+            for (let py = y0; py < y1; py++) {
+                const row = py * width;
+                for (let px = x0; px < x1; px++) {
+                    const idx = row + px;
+                    const d = prev[idx] - curr[idx];
+                    cellDiff += d < 0 ? -d : d;
+                }
+            }
+            if (cellPixels > 0 && cellDiff / cellPixels > CELL_THRESHOLD) {
+                changedCells++;
+                if (x0 < minX)
+                    minX = x0;
+                if (y0 < minY)
+                    minY = y0;
+                if (x1 > maxX)
+                    maxX = x1;
+                if (y1 > maxY)
+                    maxY = y1;
+            }
+        }
+    }
+    const bbox = changedCells > 0 ? { x: minX, y: minY, width: maxX - minX, height: maxY - minY } : null;
+    return { changedCells, totalCells, changeRatio: changedCells / totalCells, bbox };
+}
+/**
+ * Per-pixel comparison of two same-size 1-channel raw buffers at full
+ * resolution. A pixel counts as changed when |prev - curr| > PIXEL_THRESHOLD.
+ * The bbox is tight and inclusive of the last changed pixel
+ * (width = maxX - minX + 1); changePercent is 0..100.
+ *
+ * @throws if either buffer's length is not width * height.
+ */
+export function computePixelDiff(prev, curr, width, height) {
+    assertSameSize("computePixelDiff", prev, curr, width, height);
+    const totalPixels = width * height;
+    let changedPixels = 0;
+    let minX = width;
+    let minY = height;
+    let maxX = -1;
+    let maxY = -1;
+    for (let y = 0; y < height; y++) {
+        const row = y * width;
+        for (let x = 0; x < width; x++) {
+            const idx = row + x;
+            const d = prev[idx] - curr[idx];
+            if (d > PIXEL_THRESHOLD || d < -PIXEL_THRESHOLD) {
+                changedPixels++;
+                if (x < minX)
+                    minX = x;
+                if (x > maxX)
+                    maxX = x;
+                if (y < minY)
+                    minY = y;
+                if (y > maxY)
+                    maxY = y;
+            }
+        }
+    }
+    const bbox = changedPixels > 0 ? { x: minX, y: minY, width: maxX - minX + 1, height: maxY - minY + 1 } : null;
+    return {
+        changedPixels,
+        totalPixels,
+        changePercent: totalPixels > 0 ? (changedPixels / totalPixels) * 100 : 0,
+        bbox,
+    };
+}
+/**
+ * `computePixelDiff` plus the mask itself: one byte per pixel, 1 where the
+ * pixel changed. `framewatch_compare` paints that mask over the second image
+ * so a reviewer can see *where* two pages differ, not just by how much.
+ *
+ * Kept separate from `computePixelDiff` because the capture path runs it on
+ * every card and has no use for a second full-frame buffer per frame.
+ *
+ * @throws if either buffer's length is not width * height.
+ */
+export function computePixelMask(prev, curr, width, height) {
+    assertSameSize("computePixelMask", prev, curr, width, height);
+    const totalPixels = width * height;
+    const mask = new Uint8Array(totalPixels);
+    let changedPixels = 0;
+    let minX = width;
+    let minY = height;
+    let maxX = -1;
+    let maxY = -1;
+    for (let y = 0; y < height; y++) {
+        const row = y * width;
+        for (let x = 0; x < width; x++) {
+            const idx = row + x;
+            const d = prev[idx] - curr[idx];
+            if (d > PIXEL_THRESHOLD || d < -PIXEL_THRESHOLD) {
+                mask[idx] = 1;
+                changedPixels++;
+                if (x < minX)
+                    minX = x;
+                if (x > maxX)
+                    maxX = x;
+                if (y < minY)
+                    minY = y;
+                if (y > maxY)
+                    maxY = y;
+            }
+        }
+    }
+    const bbox = changedPixels > 0 ? { x: minX, y: minY, width: maxX - minX + 1, height: maxY - minY + 1 } : null;
+    return {
+        mask,
+        changedPixels,
+        totalPixels,
+        changePercent: totalPixels > 0 ? (changedPixels / totalPixels) * 100 : 0,
+        bbox,
+    };
+}
+/** Pad a bbox by `padding` on every side and clamp it to [0, 0, frameWidth, frameHeight]. */
+export function padBoundingBox(bbox, padding, frameWidth, frameHeight) {
+    const x0 = Math.max(0, bbox.x - padding);
+    const y0 = Math.max(0, bbox.y - padding);
+    const x1 = Math.min(frameWidth, bbox.x + bbox.width + padding);
+    const y1 = Math.min(frameHeight, bbox.y + bbox.height + padding);
+    return { x: x0, y: y0, width: Math.max(0, x1 - x0), height: Math.max(0, y1 - y0) };
+}
+/**
+ * Decide whether a frame with the given grid change ratio should be kept.
+ * sensitivity <= 0 → always true ("keep all"); sensitivity >= 1 → always
+ * false ("keep none"); otherwise changeRatio > sensitivity (so the default
+ * 0.06 keeps 4/64 = 0.0625 and drops 3/64).
+ */
+export function exceedsSensitivity(changeRatio, sensitivity) {
+    if (sensitivity <= 0)
+        return true;
+    if (sensitivity >= 1)
+        return false;
+    return changeRatio > sensitivity;
+}
+/** A frame is forced when the recorder captured it because of an event; the differ always keeps it. */
+function isForced(frame) {
+    return frame.is_interaction || frame.trigger !== undefined;
+}
+/** Protected frames (first, last, forced) are never dropped by merging or by the max_frames cap. */
+function isProtected(frames, index) {
+    return index === 0 || index === frames.length - 1 || isForced(frames[index]);
+}
+/**
+ * Pure selection logic — decides which raw frame indices become diff cards.
+ * `diffBuffers[i]` is the low-res diff buffer (see `toDiffBuffer`) for
+ * `frames[i]`. Returns ascending raw-frame indices.
+ *
+ * Rules, in order:
+ *  1. Frame 0 is always kept.
+ *  2. Each later frame is compared (grid diff) against the LAST KEPT frame —
+ *     not the previous raw frame, so slow drifts accumulate and are eventually
+ *     kept. Forced frames (interaction / trigger) are kept regardless.
+ *  3. The last frame is always kept.
+ *  4. Kept frames within MERGE_WINDOW_MS of the first frame of a cluster are
+ *     merged into that cluster's last ("settled") frame, unless protected
+ *     (first, last, forced). Windows are anchored, not sliding, so a
+ *     continuous animation is thinned to ~every MERGE_WINDOW_MS, not
+ *     collapsed to one frame.
+ *  5. If still over `max_frames`, protected frames are kept first and the
+ *     remaining slots are filled by sampling unprotected frames evenly.
+ */
+export function selectFrames(frames, diffBuffers, options) {
+    if (frames.length === 0)
+        return [];
+    // Rules 1–2: walk frames, comparing against the last kept frame.
+    const kept = [0];
+    let lastKept = 0;
+    for (let i = 1; i < frames.length; i++) {
+        let keep = isForced(frames[i]);
+        if (!keep) {
+            const grid = computeGridDiff(diffBuffers[lastKept], diffBuffers[i], DIFF_WIDTH, DIFF_HEIGHT);
+            keep = exceedsSensitivity(grid.changeRatio, options.sensitivity);
+        }
+        if (keep) {
+            kept.push(i);
+            lastKept = i;
+        }
+    }
+    // Rule 3: the last frame is always kept.
+    const last = frames.length - 1;
+    if (kept[kept.length - 1] !== last)
+        kept.push(last);
+    return capFrames(frames, mergeCloseFrames(frames, kept), options.max_frames);
+}
+/**
+ * Rule 4 — merge kept frames that are closer than MERGE_WINDOW_MS.
+ *
+ * A frame is protected when it is the first, the last, or forced; protected
+ * frames are never dropped and never absorb neighbours. For unprotected
+ * frames, a window is anchored at the first frame of a cluster: every
+ * following unprotected frame within MERGE_WINDOW_MS of that anchor belongs
+ * to the cluster, and only the cluster's last ("settled") frame survives. The
+ * next cluster starts at the first frame outside the window — windows never
+ * slide, so a continuous 100ms-step animation is thinned to roughly every
+ * MERGE_WINDOW_MS rather than collapsed to a single frame.
+ */
+function mergeCloseFrames(frames, kept) {
+    const merged = [];
+    let j = 0;
+    while (j < kept.length) {
+        if (isProtected(frames, kept[j])) {
+            merged.push(kept[j]);
+            j++;
+            continue;
+        }
+        const anchorTs = frames[kept[j]].timestamp_ms;
+        let k = j;
+        while (k + 1 < kept.length &&
+            !isProtected(frames, kept[k + 1]) &&
+            frames[kept[k + 1]].timestamp_ms - anchorTs < MERGE_WINDOW_MS) {
+            k++;
+        }
+        merged.push(kept[k]);
+        j = k + 1;
+    }
+    return merged;
+}
+/**
+ * Rule 5 — enforce `max_frames`.
+ *
+ * Protected frames (first, last, forced) are kept first. If they alone exceed
+ * the cap, the first and last frames win, then forced frames in time order
+ * until the cap is hit. Otherwise the remaining slots are filled with
+ * unprotected frames sampled evenly by position. Output stays ascending.
+ */
+function capFrames(frames, kept, maxFrames) {
+    if (maxFrames < 1)
+        maxFrames = 1;
+    if (kept.length <= maxFrames)
+        return kept;
+    const last = frames.length - 1;
+    const protectedFrames = [];
+    const unprotected = [];
+    for (const index of kept) {
+        if (isProtected(frames, index))
+            protectedFrames.push(index);
+        else
+            unprotected.push(index);
+    }
+    let chosen;
+    if (protectedFrames.length >= maxFrames) {
+        // First and last take priority, then the earliest forced frames.
+        const ends = protectedFrames.filter((i) => i === 0 || i === last);
+        const forced = protectedFrames.filter((i) => i !== 0 && i !== last);
+        chosen = [...ends, ...forced.slice(0, Math.max(0, maxFrames - ends.length))];
+        if (chosen.length > maxFrames)
+            chosen = chosen.slice(0, maxFrames);
+    }
+    else {
+        const slots = maxFrames - protectedFrames.length;
+        const sampled = [];
+        for (let i = 0; i < slots; i++) {
+            // Centred even sampling: pick the middle of each of `slots` equal bands.
+            sampled.push(unprotected[Math.floor(((i + 0.5) * unprotected.length) / slots)]);
+        }
+        chosen = [...protectedFrames, ...sampled];
+    }
+    return chosen.sort((a, b) => a - b);
+}
+/**
+ * End-to-end: raw frames → diff cards. Computes the low-res diff buffer for
+ * every frame, runs `selectFrames`, then builds one card per selected frame
+ * with the resized full frame and (for every card but the first) the padded
+ * full-resolution change region versus the previous CARD, plus its crop.
+ */
+export async function buildDiffCards(frames, options) {
+    if (frames.length === 0)
+        return { cards: [], total_frames: 0 };
+    const diffBuffers = await Promise.all(frames.map((f) => toDiffBuffer(f.buffer)));
+    const selected = selectFrames(frames, diffBuffers, options);
+    const cards = [];
+    let prevGray = null;
+    for (let c = 0; c < selected.length; c++) {
+        const frame = frames[selected[c]];
+        const card = {
+            index: c + 1,
+            timestamp_ms: frame.timestamp_ms,
+            trigger: cardTrigger(frame, c === 0),
+            full_frame: toBase64(await resizeForOutput(frame.buffer)),
+        };
+        const gray = await toGrayscale(frame.buffer);
+        if (prevGray !== null) {
+            card.change_region = await buildChangeRegion(prevGray, gray, frame.buffer);
+        }
+        prevGray = gray;
+        cards.push(card);
+    }
+    return { cards, total_frames: frames.length };
+}
+/** First card is "initial"; otherwise the recorder's trigger, or "interaction", or "animation". */
+function cardTrigger(frame, isFirst) {
+    if (isFirst)
+        return "initial";
+    if (frame.trigger !== undefined)
+        return frame.trigger;
+    return frame.is_interaction ? "interaction" : "animation";
+}
+/**
+ * Full-resolution change region between two consecutive cards: padded pixel
+ * bbox plus a crop of the current frame, unless the padded bbox already covers
+ * >= CROP_SKIP_COVERAGE of the frame (the full frame shows the same thing).
+ * Frames of different sizes (e.g. across a viewport change) are treated as a
+ * whole-frame change.
+ */
+async function buildChangeRegion(prev, curr, currPng) {
+    const { width, height } = curr;
+    let pixelBbox;
+    let changePercent;
+    if (prev.width !== width || prev.height !== height) {
+        pixelBbox = { x: 0, y: 0, width, height };
+        changePercent = 100;
+    }
+    else {
+        const diff = computePixelDiff(prev.data, curr.data, width, height);
+        pixelBbox = diff.bbox;
+        changePercent = diff.changePercent;
+    }
+    if (pixelBbox === null) {
+        return { bbox: { x: 0, y: 0, width: 0, height: 0 }, change_percent: 0 };
+    }
+    const bbox = padBoundingBox(pixelBbox, CROP_PADDING_PX, width, height);
+    const region = { bbox, change_percent: changePercent };
+    const coverage = (bbox.width * bbox.height) / (width * height);
+    if (coverage < CROP_SKIP_COVERAGE) {
+        region.crop = toBase64(await resizeForOutput(await cropRegion(currPng, bbox)));
+    }
+    return region;
+}
+//# sourceMappingURL=differ.js.map

package/dist/engine/differ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"differ.js","sourceRoot":"","sources":["../../src/engine/differ.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,cAAc,EACd,eAAe,EACf,kBAAkB,EAClB,WAAW,EACX,UAAU,EACV,SAAS,EACT,eAAe,EACf,eAAe,GAChB,MAAM,iBAAiB,CAAC;AAWzB,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAErG;;;;;;;GAOG;AAEH,SAAS,cAAc,CAAC,EAAU,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa,EAAE,MAAc;IAC3F,MAAM,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC;IAChC,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QACzD,MAAM,IAAI,KAAK,CACb,GAAG,EAAE,uCAAuC,QAAQ,KAAK,KAAK,IAAI,MAAM,UAAU,IAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,MAAM,EAAE,CACnH,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,IAAY,EAAE,KAAa,EAAE,MAAc;IACvF,cAAc,CAAC,iBAAiB,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAE7D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;IAClD,MAAM,UAAU,GAAG,SAAS,GAAG,UAAU,CAAC;IAC1C,MAAM,UAAU,GAAG,SAAS,GAAG,SAAS,CAAC;IAEzC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC;QAC3B,MAAM,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC;QAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,EAAE,GAAG,SAAS,CAAC;YAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,SAAS,CAAC;YAC1B,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBAChC,MAAM,GAAG,GAAG,EAAE,GAAG,KAAK,CAAC;gBACvB,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAChC,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC;oBACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;oBAChC,QAAQ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YACD,IAAI,UAAU,GAAG,CAAC,IAAI,QAAQ,GAAG,UAAU,GAAG,cAAc,EAAE,CAAC;gBAC7D,YAAY,EAAE,CAAC;gBACf,IAAI,EAAE,GAAG,IAAI;oBAAE,IAAI,GAAG,EAAE,CAAC;gBACzB,IAAI,EAAE,GAAG,IAAI;oBAAE,IAAI,GAAG,EAAE,CAAC;gBACzB,IAAI,EAAE,GAAG,IAAI;oBAAE,IAAI,GAAG,EAAE,CAAC;gBACzB,IAAI,EAAE,GAAG,IAAI;oBAAE,IAAI,GAAG,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GACR,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAE1F,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,GAAG,UAAU,EAAE,IAAI,EAAE,CAAC;AACpF,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,IAAY,EAAE,KAAa,EAAE,MAAc;IACxF,cAAc,CAAC,kBAAkB,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAE9D,MAAM,WAAW,GAAG,KAAK,GAAG,MAAM,CAAC;IACnC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,GAAG,eAAe,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC;gBAChD,aAAa,EAAE,CAAC;gBAChB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GACR,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAEnG,OAAO;QACL,aAAa;QACb,WAAW;QACX,aAAa,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACxE,IAAI;KACL,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,IAAY,EAAE,KAAa,EAAE,MAAc;IACxF,cAAc,CAAC,kBAAkB,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAE9D,MAAM,WAAW,GAAG,KAAK,GAAG,MAAM,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAC;IACzC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,GAAG,eAAe,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC;gBAChD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,aAAa,EAAE,CAAC;gBAChB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,GAAG,IAAI;oBAAE,IAAI,GAAG,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GACR,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAEnG,OAAO;QACL,IAAI;QACJ,aAAa;QACb,WAAW;QACX,aAAa,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACxE,IAAI;KACL,CAAC;AACJ,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,cAAc,CAAC,IAAiB,EAAE,OAAe,EAAE,UAAkB,EAAE,WAAmB;IACxG,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC;IAC/D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC;IACjE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AACrF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,WAAmB,EAAE,WAAmB;IACzE,IAAI,WAAW,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAClC,IAAI,WAAW,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACnC,OAAO,WAAW,GAAG,WAAW,CAAC;AACnC,CAAC;AAeD,uGAAuG;AACvG,SAAS,QAAQ,CAAC,KAA0B;IAC1C,OAAO,KAAK,CAAC,cAAc,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC;AAC7D,CAAC;AAED,oGAAoG;AACpG,SAAS,WAAW,CAAC,MAA6B,EAAE,KAAa;IAC/D,OAAO,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,YAAY,CAAC,MAA6B,EAAE,WAAqB,EAAE,OAA4B;IAC7G,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,iEAAiE;IACjE,MAAM,IAAI,GAAa,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,eAAe,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;YAC7F,IAAI,GAAG,kBAAkB,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,QAAQ,GAAG,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEpD,OAAO,SAAS,CAAC,MAAM,EAAE,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,gBAAgB,CAAC,MAA6B,EAAE,IAAc;IACrE,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,IAAI,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;QAC9C,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OACE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM;YACnB,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,QAAQ,GAAG,eAAe,EAC7D,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,MAA6B,EAAE,IAAc,EAAE,SAAiB;IACjF,IAAI,SAAS,GAAG,CAAC;QAAE,SAAS,GAAG,CAAC,CAAC;IACjC,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;QAAE,OAAO,IAAI,CAAC;IAE1C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC;YAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;YACvD,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,MAAgB,CAAC;IACrB,IAAI,eAAe,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;QACxC,iEAAiE;QACjE,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAClE,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QACpE,MAAM,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,MAAM,CAAC,MAAM,GAAG,SAAS;YAAE,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,GAAG,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC;QACjD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,yEAAyE;YACzE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,MAAM,GAAG,CAAC,GAAG,eAAe,EAAE,GAAG,OAAO,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AAaD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,MAAkB,EAAE,OAA8B;IACrF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAE/D,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IAE5D,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,IAAI,QAAQ,GAA2D,IAAI,CAAC;IAE5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAa;YACrB,KAAK,EAAE,CAAC,GAAG,CAAC;YACZ,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,OAAO,EAAE,WAAW,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;YACpC,UAAU,EAAE,QAAQ,CAAC,MAAM,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;SAC1D,CAAC;QAEF,MAAM,IAAI,GAAG,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,IAAI,CAAC,aAAa,GAAG,MAAM,iBAAiB,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7E,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;QAChB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;AAChD,CAAC;AAED,mGAAmG;AACnG,SAAS,WAAW,CAAC,KAAe,EAAE,OAAgB;IACpD,IAAI,OAAO;QAAE,OAAO,SAAS,CAAC;IAC9B,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC;IACtD,OAAO,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC;AAC5D,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,iBAAiB,CAC9B,IAAqD,EACrD,IAAqD,EACrD,OAAe;IAEf,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAE/B,IAAI,SAA6B,CAAC;IAClC,IAAI,aAAqB,CAAC;IAC1B,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QACnD,SAAS,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAC1C,aAAa,GAAG,GAAG,CAAC;IACtB,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACnE,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;IACrC,CAAC;IAED,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;IAC1E,CAAC;IAED,MAAM,IAAI,GAAG,cAAc,CAAC,SAAS,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACvE,MAAM,MAAM,GAAiB,EAAE,IAAI,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC;IAErE,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;IAC/D,IAAI,QAAQ,GAAG,kBAAkB,EAAE,CAAC;QAClC,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,eAAe,CAAC,MAAM,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import {\n  CELL_THRESHOLD,\n  CROP_PADDING_PX,\n  CROP_SKIP_COVERAGE,\n  DIFF_HEIGHT,\n  DIFF_WIDTH,\n  GRID_SIZE,\n  MERGE_WINDOW_MS,\n  PIXEL_THRESHOLD,\n} from \"../constants.js\";\nimport type {\n  BoundingBox,\n  ChangeRegion,\n  DiffCard,\n  FrameTrigger,\n  GridDiffResult,\n  PixelDiffResult,\n  PixelMaskResult,\n  RawFrame,\n} from \"../types.js\";\nimport { cropRegion, resizeForOutput, toBase64, toDiffBuffer, toGrayscale } from \"../utils/image.js\";\n\n/**\n * Smart diff engine.\n *\n * Pure image/array logic — no Playwright. Frames are compared on a low-res\n * grayscale grid (fast, tolerant of noise) to decide which ones to keep, then\n * the kept frames are compared pixel-by-pixel at full resolution to locate the\n * exact change region for cropping.\n */\n\nfunction assertSameSize(fn: string, prev: Buffer, curr: Buffer, width: number, height: number): void {\n  const expected = width * height;\n  if (prev.length !== expected || curr.length !== expected) {\n    throw new Error(\n      `${fn}: buffer length mismatch — expected ${expected} (${width}x${height}), got ${prev.length} and ${curr.length}`,\n    );\n  }\n}\n\n/**\n * Grid comparison of two same-size 1-channel raw buffers.\n *\n * The image is divided into GRID_SIZE x GRID_SIZE cells of\n * floor(width / GRID_SIZE) x floor(height / GRID_SIZE) pixels. A cell counts\n * as changed when its mean absolute pixel difference exceeds CELL_THRESHOLD.\n * The bbox is the union of all changed cells, in buffer coordinates.\n *\n * @throws if either buffer's length is not width * height.\n */\nexport function computeGridDiff(prev: Buffer, curr: Buffer, width: number, height: number): GridDiffResult {\n  assertSameSize(\"computeGridDiff\", prev, curr, width, height);\n\n  const cellWidth = Math.floor(width / GRID_SIZE);\n  const cellHeight = Math.floor(height / GRID_SIZE);\n  const cellPixels = cellWidth * cellHeight;\n  const totalCells = GRID_SIZE * GRID_SIZE;\n\n  let changedCells = 0;\n  let minX = width;\n  let minY = height;\n  let maxX = 0;\n  let maxY = 0;\n\n  for (let gy = 0; gy < GRID_SIZE; gy++) {\n    const y0 = gy * cellHeight;\n    const y1 = y0 + cellHeight;\n    for (let gx = 0; gx < GRID_SIZE; gx++) {\n      const x0 = gx * cellWidth;\n      const x1 = x0 + cellWidth;\n      let cellDiff = 0;\n      for (let py = y0; py < y1; py++) {\n        const row = py * width;\n        for (let px = x0; px < x1; px++) {\n          const idx = row + px;\n          const d = prev[idx] - curr[idx];\n          cellDiff += d < 0 ? -d : d;\n        }\n      }\n      if (cellPixels > 0 && cellDiff / cellPixels > CELL_THRESHOLD) {\n        changedCells++;\n        if (x0 < minX) minX = x0;\n        if (y0 < minY) minY = y0;\n        if (x1 > maxX) maxX = x1;\n        if (y1 > maxY) maxY = y1;\n      }\n    }\n  }\n\n  const bbox: BoundingBox | null =\n    changedCells > 0 ? { x: minX, y: minY, width: maxX - minX, height: maxY - minY } : null;\n\n  return { changedCells, totalCells, changeRatio: changedCells / totalCells, bbox };\n}\n\n/**\n * Per-pixel comparison of two same-size 1-channel raw buffers at full\n * resolution. A pixel counts as changed when |prev - curr| > PIXEL_THRESHOLD.\n * The bbox is tight and inclusive of the last changed pixel\n * (width = maxX - minX + 1); changePercent is 0..100.\n *\n * @throws if either buffer's length is not width * height.\n */\nexport function computePixelDiff(prev: Buffer, curr: Buffer, width: number, height: number): PixelDiffResult {\n  assertSameSize(\"computePixelDiff\", prev, curr, width, height);\n\n  const totalPixels = width * height;\n  let changedPixels = 0;\n  let minX = width;\n  let minY = height;\n  let maxX = -1;\n  let maxY = -1;\n\n  for (let y = 0; y < height; y++) {\n    const row = y * width;\n    for (let x = 0; x < width; x++) {\n      const idx = row + x;\n      const d = prev[idx] - curr[idx];\n      if (d > PIXEL_THRESHOLD || d < -PIXEL_THRESHOLD) {\n        changedPixels++;\n        if (x < minX) minX = x;\n        if (x > maxX) maxX = x;\n        if (y < minY) minY = y;\n        if (y > maxY) maxY = y;\n      }\n    }\n  }\n\n  const bbox: BoundingBox | null =\n    changedPixels > 0 ? { x: minX, y: minY, width: maxX - minX + 1, height: maxY - minY + 1 } : null;\n\n  return {\n    changedPixels,\n    totalPixels,\n    changePercent: totalPixels > 0 ? (changedPixels / totalPixels) * 100 : 0,\n    bbox,\n  };\n}\n\n/**\n * `computePixelDiff` plus the mask itself: one byte per pixel, 1 where the\n * pixel changed. `framewatch_compare` paints that mask over the second image\n * so a reviewer can see *where* two pages differ, not just by how much.\n *\n * Kept separate from `computePixelDiff` because the capture path runs it on\n * every card and has no use for a second full-frame buffer per frame.\n *\n * @throws if either buffer's length is not width * height.\n */\nexport function computePixelMask(prev: Buffer, curr: Buffer, width: number, height: number): PixelMaskResult {\n  assertSameSize(\"computePixelMask\", prev, curr, width, height);\n\n  const totalPixels = width * height;\n  const mask = new Uint8Array(totalPixels);\n  let changedPixels = 0;\n  let minX = width;\n  let minY = height;\n  let maxX = -1;\n  let maxY = -1;\n\n  for (let y = 0; y < height; y++) {\n    const row = y * width;\n    for (let x = 0; x < width; x++) {\n      const idx = row + x;\n      const d = prev[idx] - curr[idx];\n      if (d > PIXEL_THRESHOLD || d < -PIXEL_THRESHOLD) {\n        mask[idx] = 1;\n        changedPixels++;\n        if (x < minX) minX = x;\n        if (x > maxX) maxX = x;\n        if (y < minY) minY = y;\n        if (y > maxY) maxY = y;\n      }\n    }\n  }\n\n  const bbox: BoundingBox | null =\n    changedPixels > 0 ? { x: minX, y: minY, width: maxX - minX + 1, height: maxY - minY + 1 } : null;\n\n  return {\n    mask,\n    changedPixels,\n    totalPixels,\n    changePercent: totalPixels > 0 ? (changedPixels / totalPixels) * 100 : 0,\n    bbox,\n  };\n}\n\n/** Pad a bbox by `padding` on every side and clamp it to [0, 0, frameWidth, frameHeight]. */\nexport function padBoundingBox(bbox: BoundingBox, padding: number, frameWidth: number, frameHeight: number): BoundingBox {\n  const x0 = Math.max(0, bbox.x - padding);\n  const y0 = Math.max(0, bbox.y - padding);\n  const x1 = Math.min(frameWidth, bbox.x + bbox.width + padding);\n  const y1 = Math.min(frameHeight, bbox.y + bbox.height + padding);\n  return { x: x0, y: y0, width: Math.max(0, x1 - x0), height: Math.max(0, y1 - y0) };\n}\n\n/**\n * Decide whether a frame with the given grid change ratio should be kept.\n * sensitivity <= 0 → always true (\"keep all\"); sensitivity >= 1 → always\n * false (\"keep none\"); otherwise changeRatio > sensitivity (so the default\n * 0.06 keeps 4/64 = 0.0625 and drops 3/64).\n */\nexport function exceedsSensitivity(changeRatio: number, sensitivity: number): boolean {\n  if (sensitivity <= 0) return true;\n  if (sensitivity >= 1) return false;\n  return changeRatio > sensitivity;\n}\n\nexport interface FrameSelectionInput {\n  timestamp_ms: number;\n  is_interaction: boolean;\n  trigger?: FrameTrigger;\n}\n\nexport interface SelectFramesOptions {\n  /** Grid change ratio a frame must exceed to be kept (0 = keep all, 1 = keep none). */\n  sensitivity: number;\n  /** Hard cap on the number of frames returned. */\n  max_frames: number;\n}\n\n/** A frame is forced when the recorder captured it because of an event; the differ always keeps it. */\nfunction isForced(frame: FrameSelectionInput): boolean {\n  return frame.is_interaction || frame.trigger !== undefined;\n}\n\n/** Protected frames (first, last, forced) are never dropped by merging or by the max_frames cap. */\nfunction isProtected(frames: FrameSelectionInput[], index: number): boolean {\n  return index === 0 || index === frames.length - 1 || isForced(frames[index]);\n}\n\n/**\n * Pure selection logic — decides which raw frame indices become diff cards.\n * `diffBuffers[i]` is the low-res diff buffer (see `toDiffBuffer`) for\n * `frames[i]`. Returns ascending raw-frame indices.\n *\n * Rules, in order:\n *  1. Frame 0 is always kept.\n *  2. Each later frame is compared (grid diff) against the LAST KEPT frame —\n *     not the previous raw frame, so slow drifts accumulate and are eventually\n *     kept. Forced frames (interaction / trigger) are kept regardless.\n *  3. The last frame is always kept.\n *  4. Kept frames within MERGE_WINDOW_MS of the first frame of a cluster are\n *     merged into that cluster's last (\"settled\") frame, unless protected\n *     (first, last, forced). Windows are anchored, not sliding, so a\n *     continuous animation is thinned to ~every MERGE_WINDOW_MS, not\n *     collapsed to one frame.\n *  5. If still over `max_frames`, protected frames are kept first and the\n *     remaining slots are filled by sampling unprotected frames evenly.\n */\nexport function selectFrames(frames: FrameSelectionInput[], diffBuffers: Buffer[], options: SelectFramesOptions): number[] {\n  if (frames.length === 0) return [];\n\n  // Rules 1–2: walk frames, comparing against the last kept frame.\n  const kept: number[] = [0];\n  let lastKept = 0;\n  for (let i = 1; i < frames.length; i++) {\n    let keep = isForced(frames[i]);\n    if (!keep) {\n      const grid = computeGridDiff(diffBuffers[lastKept], diffBuffers[i], DIFF_WIDTH, DIFF_HEIGHT);\n      keep = exceedsSensitivity(grid.changeRatio, options.sensitivity);\n    }\n    if (keep) {\n      kept.push(i);\n      lastKept = i;\n    }\n  }\n\n  // Rule 3: the last frame is always kept.\n  const last = frames.length - 1;\n  if (kept[kept.length - 1] !== last) kept.push(last);\n\n  return capFrames(frames, mergeCloseFrames(frames, kept), options.max_frames);\n}\n\n/**\n * Rule 4 — merge kept frames that are closer than MERGE_WINDOW_MS.\n *\n * A frame is protected when it is the first, the last, or forced; protected\n * frames are never dropped and never absorb neighbours. For unprotected\n * frames, a window is anchored at the first frame of a cluster: every\n * following unprotected frame within MERGE_WINDOW_MS of that anchor belongs\n * to the cluster, and only the cluster's last (\"settled\") frame survives. The\n * next cluster starts at the first frame outside the window — windows never\n * slide, so a continuous 100ms-step animation is thinned to roughly every\n * MERGE_WINDOW_MS rather than collapsed to a single frame.\n */\nfunction mergeCloseFrames(frames: FrameSelectionInput[], kept: number[]): number[] {\n  const merged: number[] = [];\n  let j = 0;\n  while (j < kept.length) {\n    if (isProtected(frames, kept[j])) {\n      merged.push(kept[j]);\n      j++;\n      continue;\n    }\n    const anchorTs = frames[kept[j]].timestamp_ms;\n    let k = j;\n    while (\n      k + 1 < kept.length &&\n      !isProtected(frames, kept[k + 1]) &&\n      frames[kept[k + 1]].timestamp_ms - anchorTs < MERGE_WINDOW_MS\n    ) {\n      k++;\n    }\n    merged.push(kept[k]);\n    j = k + 1;\n  }\n  return merged;\n}\n\n/**\n * Rule 5 — enforce `max_frames`.\n *\n * Protected frames (first, last, forced) are kept first. If they alone exceed\n * the cap, the first and last frames win, then forced frames in time order\n * until the cap is hit. Otherwise the remaining slots are filled with\n * unprotected frames sampled evenly by position. Output stays ascending.\n */\nfunction capFrames(frames: FrameSelectionInput[], kept: number[], maxFrames: number): number[] {\n  if (maxFrames < 1) maxFrames = 1;\n  if (kept.length <= maxFrames) return kept;\n\n  const last = frames.length - 1;\n  const protectedFrames: number[] = [];\n  const unprotected: number[] = [];\n  for (const index of kept) {\n    if (isProtected(frames, index)) protectedFrames.push(index);\n    else unprotected.push(index);\n  }\n\n  let chosen: number[];\n  if (protectedFrames.length >= maxFrames) {\n    // First and last take priority, then the earliest forced frames.\n    const ends = protectedFrames.filter((i) => i === 0 || i === last);\n    const forced = protectedFrames.filter((i) => i !== 0 && i !== last);\n    chosen = [...ends, ...forced.slice(0, Math.max(0, maxFrames - ends.length))];\n    if (chosen.length > maxFrames) chosen = chosen.slice(0, maxFrames);\n  } else {\n    const slots = maxFrames - protectedFrames.length;\n    const sampled: number[] = [];\n    for (let i = 0; i < slots; i++) {\n      // Centred even sampling: pick the middle of each of `slots` equal bands.\n      sampled.push(unprotected[Math.floor(((i + 0.5) * unprotected.length) / slots)]);\n    }\n    chosen = [...protectedFrames, ...sampled];\n  }\n\n  return chosen.sort((a, b) => a - b);\n}\n\nexport interface BuildDiffCardsOptions {\n  sensitivity: number;\n  max_frames: number;\n}\n\nexport interface DiffCardsResult {\n  cards: DiffCard[];\n  /** Number of raw frames that were examined. */\n  total_frames: number;\n}\n\n/**\n * End-to-end: raw frames → diff cards. Computes the low-res diff buffer for\n * every frame, runs `selectFrames`, then builds one card per selected frame\n * with the resized full frame and (for every card but the first) the padded\n * full-resolution change region versus the previous CARD, plus its crop.\n */\nexport async function buildDiffCards(frames: RawFrame[], options: BuildDiffCardsOptions): Promise<DiffCardsResult> {\n  if (frames.length === 0) return { cards: [], total_frames: 0 };\n\n  const diffBuffers = await Promise.all(frames.map((f) => toDiffBuffer(f.buffer)));\n  const selected = selectFrames(frames, diffBuffers, options);\n\n  const cards: DiffCard[] = [];\n  let prevGray: { data: Buffer; width: number; height: number } | null = null;\n\n  for (let c = 0; c < selected.length; c++) {\n    const frame = frames[selected[c]];\n    const card: DiffCard = {\n      index: c + 1,\n      timestamp_ms: frame.timestamp_ms,\n      trigger: cardTrigger(frame, c === 0),\n      full_frame: toBase64(await resizeForOutput(frame.buffer)),\n    };\n\n    const gray = await toGrayscale(frame.buffer);\n    if (prevGray !== null) {\n      card.change_region = await buildChangeRegion(prevGray, gray, frame.buffer);\n    }\n    prevGray = gray;\n    cards.push(card);\n  }\n\n  return { cards, total_frames: frames.length };\n}\n\n/** First card is \"initial\"; otherwise the recorder's trigger, or \"interaction\", or \"animation\". */\nfunction cardTrigger(frame: RawFrame, isFirst: boolean): FrameTrigger {\n  if (isFirst) return \"initial\";\n  if (frame.trigger !== undefined) return frame.trigger;\n  return frame.is_interaction ? \"interaction\" : \"animation\";\n}\n\n/**\n * Full-resolution change region between two consecutive cards: padded pixel\n * bbox plus a crop of the current frame, unless the padded bbox already covers\n * >= CROP_SKIP_COVERAGE of the frame (the full frame shows the same thing).\n * Frames of different sizes (e.g. across a viewport change) are treated as a\n * whole-frame change.\n */\nasync function buildChangeRegion(\n  prev: { data: Buffer; width: number; height: number },\n  curr: { data: Buffer; width: number; height: number },\n  currPng: Buffer,\n): Promise<ChangeRegion> {\n  const { width, height } = curr;\n\n  let pixelBbox: BoundingBox | null;\n  let changePercent: number;\n  if (prev.width !== width || prev.height !== height) {\n    pixelBbox = { x: 0, y: 0, width, height };\n    changePercent = 100;\n  } else {\n    const diff = computePixelDiff(prev.data, curr.data, width, height);\n    pixelBbox = diff.bbox;\n    changePercent = diff.changePercent;\n  }\n\n  if (pixelBbox === null) {\n    return { bbox: { x: 0, y: 0, width: 0, height: 0 }, change_percent: 0 };\n  }\n\n  const bbox = padBoundingBox(pixelBbox, CROP_PADDING_PX, width, height);\n  const region: ChangeRegion = { bbox, change_percent: changePercent };\n\n  const coverage = (bbox.width * bbox.height) / (width * height);\n  if (coverage < CROP_SKIP_COVERAGE) {\n    region.crop = toBase64(await resizeForOutput(await cropRegion(currPng, bbox)));\n  }\n  return region;\n}\n"]}

package/dist/engine/interaction.d.ts

@@ -0,0 +1,76 @@
+import { z } from "zod";
+import type { Page } from "playwright";
+/**
+ * Interaction executor.
+ *
+ * Turns one declarative interaction step (see CLAUDE.md "Interactions as JSON
+ * script") into real input on a Playwright page. Every step is validated
+ * before anything touches the page, and every Playwright failure is reduced to
+ * a single actionable line naming the step that failed — a recording is a bad
+ * place to surface a 30-line call log.
+ */
+/** Actions `framewatch_capture` can replay during a recording. */
+export declare const CAPTURE_ACTIONS: readonly ["click", "tap", "type", "scroll", "swipe", "wait", "navigate"];
+/** Actions `framewatch_interact` can perform as a one-off. */
+export declare const INTERACT_ACTIONS: readonly ["click", "tap", "type", "scroll", "swipe", "navigate", "select", "hover"];
+export type InteractionAction = (typeof CAPTURE_ACTIONS)[number] | (typeof INTERACT_ACTIONS)[number];
+export interface Interaction {
+    action: InteractionAction;
+    /** CSS selector for click/tap/type/select/hover, or the scroll container. */
+    selector?: string;
+    /** Text to type, option value to select, or URL to navigate to. */
+    value?: string;
+    x?: number;
+    y?: number;
+    delta_x?: number;
+    delta_y?: number;
+    /** Wait this long *before* performing the action. */
+    delay_ms?: number;
+}
+export interface ExecuteOptions {
+    /** Timeout for selector-based actions. Default SELECTOR_TIMEOUT_MS. */
+    timeout_ms?: number;
+}
+/** True when any step needs a touch-enabled browser context. */
+export declare function needsTouch(interactions: readonly Interaction[]): boolean;
+/**
+ * Check that a step carries the fields its action needs. Returns a message
+ * naming what is missing, or null when the step is executable. Used both by
+ * the tools (at input-validation time, before a browser is even launched) and
+ * by `executeInteraction` itself.
+ */
+export declare function validateInteraction(interaction: Interaction): string | null;
+/**
+ * One-line, human-readable summary of a step, used in error messages and in
+ * the capture summary. Long values (a pasted token, a password) are elided
+ * rather than echoed in full.
+ */
+export declare function describeInteraction(interaction: Interaction): string;
+/**
+ * Perform one interaction on `page`.
+ *
+ * Waits `delay_ms` first (that is what `delay_ms` means: "wait before this
+ * action"), so a `wait` step is simply a step with no action of its own.
+ * Throws a single-line Error naming the step on any failure; the page is never
+ * touched when the step is invalid.
+ */
+export declare function executeInteraction(page: Page, interaction: Interaction, options?: ExecuteOptions): Promise<void>;
+/**
+ * The shared zod fields every interaction step accepts. Both tools build their
+ * own object around these (the action enums differ, and `framewatch_capture`
+ * adds `delay_ms` where `framewatch_interact` adds `wait_ms`).
+ */
+export declare const interactionFieldShape: {
+    selector: z.ZodOptional<z.ZodString>;
+    value: z.ZodOptional<z.ZodString>;
+    x: z.ZodOptional<z.ZodNumber>;
+    y: z.ZodOptional<z.ZodNumber>;
+    delta_x: z.ZodOptional<z.ZodNumber>;
+    delta_y: z.ZodOptional<z.ZodNumber>;
+};
+/**
+ * zod `superRefine` hook that rejects a step missing the fields its action
+ * needs, so an unusable script is reported as invalid input instead of failing
+ * half way through a recording.
+ */
+export declare function refineInteraction(value: Interaction, ctx: z.RefinementCtx): void;