@griddle/core 0.1.0

package/dist/movement.js

@@ -0,0 +1,333 @@
+// Movement engine — implements Rules 1-6 of the drag/drop spec.
+//
+// The engine mutates the grid in place during attempts but takes a snapshot at
+// each rule boundary so it can roll back on failure. If every rule rejects the
+// move (and the BFS fallback can't repack), the original grid is restored and
+// moveTile returns false.
+//
+// Rule overview:
+//   1. Empty target          — drop straight in.
+//   2. Same-footprint swap   — adjacent partner with identical w×h: swap them.
+//   3-5. Single-step displace — push each overlapping victim by enough cells
+//        along a priority direction to clear the dragger's full footprint.
+//        Each victim is placed independently; if any victim has no legal slot
+//        the rule rejects and we fall through.
+//   6. Cascade push          — push the victim AND any blockers it runs into
+//        along a priority direction. On infinite axes this loops until the
+//        target rect is clear (tiles slide off into space). On fixed grids,
+//        the cascade may run out of room — the move falls through to the 0-1
+//        BFS repack solver as a last resort.
+import { directionStep, faceClosestToOrigin, footprintEquals, priorityDirections, rectsAdjacent, rectsOverlap, tileRect, } from './geometry.js';
+import { solvePushBFS } from './repack.js';
+/**
+ * Attempt to move `tileId` to `target`. On success, the grid is mutated in
+ * place and `true` is returned. On failure, the grid is left unchanged and
+ * `false` is returned.
+ */
+export function moveTile(grid, tileId, target, opts = {}) {
+    const tile = grid.getTile(tileId);
+    if (!tile)
+        return false;
+    const originRect = opts.forceFromRect ?? tileRect(tile);
+    const targetRect = { col: target.col, row: target.row, w: tile.w, h: tile.h };
+    if (!grid.rectInBounds(targetRect))
+        return false;
+    const overlap = grid.tilesIn(targetRect, new Set([tileId]));
+    // Rule 1: empty space
+    if (overlap.length === 0) {
+        grid._setTilePos(tileId, target);
+        return true;
+    }
+    // Rule 2: adjacent same-footprint swap
+    if (overlap.length === 1 &&
+        rectsAdjacent(originRect, tileRect(overlap[0])) &&
+        footprintEquals(overlap[0], tile)) {
+        const other = overlap[0];
+        const otherPos = { col: other.col, row: other.row };
+        const originPos = { col: originRect.col, row: originRect.row };
+        grid._setTilePos(tileId, otherPos);
+        grid._setTilePos(other.id, originPos);
+        return true;
+    }
+    // Rule 3-5: try independent single-displacement of each overlapper.
+    //
+    // Each victim is placed in turn against the live grid. The ONLY tile we
+    // ignore when checking for collisions is the dragger itself — it still
+    // sits at originRect at this point and shouldn't block the displacement
+    // search. Any victim already moved into its new slot DOES block the next
+    // victim's candidate; otherwise two displaced tiles can land on the same
+    // cell (visible to the user as one tile "only moving 1 unit" because the
+    // overlap collapses two tiles into the same rendered position).
+    const snapshot = grid.snapshotTiles();
+    const dirs = priorityDirections(originRect, targetRect);
+    const draggerOnly = new Set([tileId]);
+    let allPlaced = true;
+    for (const victim of overlap) {
+        const moved = tryDisplaceVictim(grid, victim.id, dirs, targetRect, draggerOnly);
+        if (!moved) {
+            allPlaced = false;
+            break;
+        }
+    }
+    if (allPlaced) {
+        grid._setTilePos(tileId, target);
+        return true;
+    }
+    grid.restoreTiles(snapshot);
+    // Rule 6: try cascading push along each priority direction.
+    // First: if the primary direction is on an infinite axis, use unbounded chain push.
+    // Otherwise: try minimum-clearance cascade push along each priority direction in turn.
+    const primaryDir = faceClosestToOrigin(originRect, targetRect);
+    if (isInfiniteDirection(grid, primaryDir)) {
+        if (pushChainInfinite(grid, tileId, target, primaryDir))
+            return true;
+        grid.restoreTiles(snapshot);
+    }
+    for (const dir of dirs) {
+        if (cascadePushOverlap(grid, tileId, targetRect, dir)) {
+            grid._setTilePos(tileId, target);
+            return true;
+        }
+        grid.restoreTiles(snapshot);
+    }
+    // Final fallback: 0-1 BFS on fixed grid.
+    const solved = solvePushBFS(grid, tileId, target, originRect);
+    if (!solved) {
+        grid.restoreTiles(snapshot);
+        return false;
+    }
+    return true;
+}
+/**
+ * Displace `victimId` by the minimum cell count along one of `priorityDirs`
+ * such that it no longer overlaps `targetRect`, stays in bounds, and lands clear.
+ * Cardinal: clear on the moving axis. Diagonal: min(kxClear, kyClear) cells.
+ */
+function tryDisplaceVictim(grid, victimId, priorityDirs, targetRect, ignore) {
+    const victim = grid.getTile(victimId);
+    if (!victim)
+        return false;
+    const victimRect = tileRect(victim);
+    for (const dir of priorityDirs) {
+        const { dx, dy } = directionStep(dir);
+        let kxClear = Infinity;
+        if (dx > 0) {
+            kxClear = Math.max(1, targetRect.col + targetRect.w - victimRect.col);
+        }
+        else if (dx < 0) {
+            kxClear = Math.max(1, victimRect.col + victimRect.w - targetRect.col);
+        }
+        let kyClear = Infinity;
+        if (dy > 0) {
+            kyClear = Math.max(1, targetRect.row + targetRect.h - victimRect.row);
+        }
+        else if (dy < 0) {
+            kyClear = Math.max(1, victimRect.row + victimRect.h - targetRect.row);
+        }
+        let k;
+        if (dx === 0 && dy === 0)
+            continue;
+        else if (dx === 0)
+            k = kyClear;
+        else if (dy === 0)
+            k = kxClear;
+        else
+            k = Math.min(kxClear, kyClear);
+        if (!isFinite(k))
+            continue;
+        const candidate = {
+            col: victimRect.col + k * dx,
+            row: victimRect.row + k * dy,
+            w: victim.w,
+            h: victim.h,
+        };
+        if (!grid.rectInBounds(candidate))
+            continue;
+        const blockIds = new Set(ignore);
+        blockIds.add(victimId);
+        const hits = grid.tilesIn(candidate, blockIds);
+        if (hits.length === 0) {
+            grid._setTilePos(victimId, { col: candidate.col, row: candidate.row });
+            return true;
+        }
+    }
+    return false;
+}
+function isInfiniteDirection(grid, dir) {
+    const { dx, dy } = directionStep(dir);
+    if (dx !== 0 && !grid.config.infiniteX)
+        return false;
+    if (dy !== 0 && !grid.config.infiniteY)
+        return false;
+    if (dx !== 0 && grid.config.infiniteX)
+        return true;
+    if (dy !== 0 && grid.config.infiniteY)
+        return true;
+    return false;
+}
+/**
+ * Push every tile that overlaps `targetRect` by enough cells along `dir` to clear it,
+ * cascading through any tiles those pushes collide with. Aborts if any chained push
+ * would go out of bounds. Mutates the grid; caller restores on failure.
+ *
+ * For cardinal `dir`: each victim moves k = enough-to-clear cells.
+ * For diagonal `dir`: same logic — k = min cell count to clear via either axis.
+ */
+function cascadePushOverlap(grid, draggerId, targetRect, dir) {
+    const { dx, dy } = directionStep(dir);
+    if (dx === 0 && dy === 0)
+        return false;
+    const initialOverlap = grid.tilesIn(targetRect, new Set([draggerId]));
+    if (initialOverlap.length === 0)
+        return true; // already clear
+    // Build the per-tile shift map. Each tile shifts by some multiple of (dx,dy).
+    // Start with the overlappers — each needs enough k to clear targetRect.
+    const shift = new Map(); // tileId -> k cells along (dx,dy)
+    const queue = [];
+    function neededKForClearing(victim, blockRect) {
+        let kx = Infinity;
+        if (dx > 0)
+            kx = Math.max(1, blockRect.col + blockRect.w - victim.col);
+        else if (dx < 0)
+            kx = Math.max(1, victim.col + victim.w - blockRect.col);
+        let ky = Infinity;
+        if (dy > 0)
+            ky = Math.max(1, blockRect.row + blockRect.h - victim.row);
+        else if (dy < 0)
+            ky = Math.max(1, victim.row + victim.h - blockRect.row);
+        if (dx === 0)
+            return ky;
+        if (dy === 0)
+            return kx;
+        return Math.min(kx, ky);
+    }
+    for (const v of initialOverlap) {
+        const k = neededKForClearing(v, targetRect);
+        if (!isFinite(k))
+            return false;
+        shift.set(v.id, k);
+        queue.push({ id: v.id, k });
+    }
+    // Helper: where will tile `id` end up given current shift map?
+    function shiftedRect(t) {
+        const k = shift.get(t.id) ?? 0;
+        return { col: t.col + k * dx, row: t.row + k * dy, w: t.w, h: t.h };
+    }
+    const safety = 1000;
+    let iters = 0;
+    while (queue.length > 0) {
+        if (iters++ > safety)
+            return false;
+        const { id } = queue.shift();
+        const tile = grid.getTile(id);
+        if (!tile)
+            continue;
+        const newRect = shiftedRect(tile);
+        if (!grid.rectInBounds(newRect))
+            return false;
+        // Find any non-dragger tiles that this push collides with.
+        for (const other of grid.tiles) {
+            if (other.id === id || other.id === draggerId)
+                continue;
+            const otherShifted = shiftedRect(other);
+            if (rectsOverlap(newRect, otherShifted)) {
+                // Need to push `other` further along dir to clear newRect.
+                const additional = neededKForClearing(other, newRect);
+                if (!isFinite(additional))
+                    return false;
+                const prevK = shift.get(other.id) ?? 0;
+                // The other tile is currently shifted by prevK. After moving `tile` by k,
+                // other must be shifted relative to its CURRENT position by `additional` more.
+                // But neededKForClearing is computed against `other`'s ORIGINAL position…
+                // we need to use its currently-shifted position. Recompute:
+                const movedOther = {
+                    ...other,
+                    col: other.col + prevK * dx,
+                    row: other.row + prevK * dy,
+                };
+                const extra = neededKForClearing(movedOther, newRect);
+                if (!isFinite(extra))
+                    return false;
+                const newK = prevK + extra;
+                if (newK <= prevK)
+                    continue; // no progress, would loop
+                shift.set(other.id, newK);
+                queue.push({ id: other.id, k: newK });
+            }
+        }
+    }
+    // Validate all final positions in bounds and pairwise non-overlapping (against
+    // each other and against the dragger's targetRect — which now must be free).
+    const finalById = new Map();
+    for (const t of grid.tiles) {
+        if (t.id === draggerId)
+            continue;
+        finalById.set(t.id, shiftedRect(t));
+    }
+    for (const [id, rect] of finalById) {
+        if (!grid.rectInBounds(rect))
+            return false;
+        if (rectsOverlap(rect, targetRect))
+            return false;
+        for (const [otherId, otherRect] of finalById) {
+            if (otherId === id)
+                continue;
+            if (rectsOverlap(rect, otherRect))
+                return false;
+        }
+    }
+    // Commit.
+    for (const [id, rect] of finalById) {
+        grid._setTilePos(id, { col: rect.col, row: rect.row });
+    }
+    return true;
+}
+/**
+ * Infinite-axis push chain. While anything overlaps `target`, shove every
+ * overlapper one cell along `dir`; any tile a shoved tile then collides with
+ * gets queued and shoved on the same pass. The grid grows infinitely along
+ * `dir`, so this always terminates with a clear target — though it may slide
+ * tiles arbitrarily far. Caller restores the snapshot on failure (e.g. if the
+ * safety limit trips).
+ */
+function pushChainInfinite(grid, tileId, target, dir) {
+    const dragger = grid.getTile(tileId);
+    if (!dragger)
+        return false;
+    const targetRect = {
+        col: target.col,
+        row: target.row,
+        w: dragger.w,
+        h: dragger.h,
+    };
+    const { dx, dy } = directionStep(dir);
+    const safety = 10000;
+    for (let iter = 0; iter < safety; iter++) {
+        const overlap = grid.tilesIn(targetRect, new Set([tileId]));
+        if (overlap.length === 0) {
+            grid._setTilePos(tileId, target);
+            return true;
+        }
+        const queue = overlap.map((t) => ({ ...t }));
+        while (queue.length > 0) {
+            const victim = queue.shift();
+            const cur = grid.getTile(victim.id);
+            if (!cur)
+                continue;
+            const newRect = {
+                col: cur.col + dx,
+                row: cur.row + dy,
+                w: cur.w,
+                h: cur.h,
+            };
+            grid._setTilePos(victim.id, { col: newRect.col, row: newRect.row });
+            const collides = grid.tilesIn(newRect, new Set([victim.id, tileId]));
+            for (const c of collides) {
+                if (!queue.find((q) => q.id === c.id))
+                    queue.push(c);
+            }
+        }
+    }
+    return false;
+}
+//# sourceMappingURL=movement.js.map

package/dist/movement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"movement.js","sourceRoot":"","sources":["../src/movement.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAC/E,8EAA8E;AAC9E,0BAA0B;AAC1B,EAAE;AACF,iBAAiB;AACjB,iDAAiD;AACjD,+EAA+E;AAC/E,6EAA6E;AAC7E,2EAA2E;AAC3E,8EAA8E;AAC9E,+CAA+C;AAC/C,6EAA6E;AAC7E,2EAA2E;AAC3E,4EAA4E;AAC5E,6EAA6E;AAC7E,6CAA6C;AAI7C,OAAO,EACL,aAAa,EACb,mBAAmB,EACnB,eAAe,EACf,kBAAkB,EAClB,aAAa,EACb,YAAY,EACZ,QAAQ,GACT,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAW3C;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CACtB,IAAU,EACV,MAAc,EACd,MAAe,EACf,OAAoB,EAAE;IAEtB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAExB,MAAM,UAAU,GAAa,IAAI,CAAC,aAAa,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;IAClE,MAAM,UAAU,GAAa,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;IAExF,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;QAAE,OAAO,KAAK,CAAC;IAEjD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAE5D,sBAAsB;IACtB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uCAAuC;IACvC,IACE,OAAO,CAAC,MAAM,KAAK,CAAC;QACpB,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;QAChD,eAAe,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,EAClC,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QAC1B,MAAM,QAAQ,GAAY,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC;QAC7D,MAAM,SAAS,GAAY,EAAE,GAAG,EAAE,UAAU,CAAC,GAAG,EAAE,GAAG,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC;QACxE,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oEAAoE;IACpE,EAAE;IACF,wEAAwE;IACxE,uEAAuE;IACvE,wEAAwE;IACxE,yEAAyE;IACzE,yEAAyE;IACzE,yEAAyE;IACzE,gEAAgE;IAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,kBAAkB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACxD,MAAM,WAAW,GAAwB,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,IAAI,SAAS,GAAG,IAAI,CAAC;IACrB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;QAChF,IAAI,CAAC,KAAK,EAAE,CAAC;YAAC,SAAS,GAAG,KAAK,CAAC;YAAC,MAAM;QAAC,CAAC;IAC3C,CAAC;IAED,IAAI,SAAS,EAAE,CAAC;QACd,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IAE5B,4DAA4D;IAC5D,oFAAoF;IACpF,uFAAuF;IACvF,MAAM,UAAU,GAAG,mBAAmB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAC/D,IAAI,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;QAC1C,IAAI,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC;YAAE,OAAO,IAAI,CAAC;QACrE,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAED,yCAAyC;IACzC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAC9D,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CACxB,IAAU,EACV,QAAgB,EAChB,YAA0B,EAC1B,UAAoB,EACpB,MAA2B;IAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1B,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAEpC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAEtC,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACX,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC;aAAM,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAClB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACX,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC;aAAM,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAClB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC;QAED,IAAI,CAAS,CAAC;QACd,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;aAC9B,IAAI,EAAE,KAAK,CAAC;YAAE,CAAC,GAAG,OAAO,CAAC;aAC1B,IAAI,EAAE,KAAK,CAAC;YAAE,CAAC,GAAG,OAAO,CAAC;;YAC1B,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAEpC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QAE3B,MAAM,SAAS,GAAa;YAC1B,GAAG,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE;YAC5B,GAAG,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE;YAC5B,CAAC,EAAE,MAAM,CAAC,CAAC;YACX,CAAC,EAAE,MAAM,CAAC,CAAC;SACZ,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC;YAAE,SAAS;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC/C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC;YACvE,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAU,EAAE,GAAe;IACtD,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC;IACrD,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC;IACrD,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IACnD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,kBAAkB,CACzB,IAAU,EACV,SAAiB,EACjB,UAAoB,EACpB,GAAe;IAEf,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEvC,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACtE,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,gBAAgB;IAE9D,8EAA8E;IAC9E,wEAAwE;IACxE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,kCAAkC;IAC3E,MAAM,KAAK,GAAgC,EAAE,CAAC;IAE9C,SAAS,kBAAkB,CAAC,MAAY,EAAE,SAAmB;QAC3D,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC;YAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;aAClE,IAAI,EAAE,GAAG,CAAC;YAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzE,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC;YAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;aAClE,IAAI,EAAE,GAAG,CAAC;YAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzE,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACxB,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,+DAA+D;IAC/D,SAAS,WAAW,CAAC,CAAO;QAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC/B,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACtE,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC;IACpB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,KAAK,EAAE,GAAG,MAAM;YAAE,OAAO,KAAK,CAAC;QACnC,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC;QAC9C,2DAA2D;QAC3D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,KAAK,SAAS;gBAAE,SAAS;YACxD,MAAM,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,EAAE,CAAC;gBACxC,2DAA2D;gBAC3D,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACtD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACvC,0EAA0E;gBAC1E,+EAA+E;gBAC/E,0EAA0E;gBAC1E,4DAA4D;gBAC5D,MAAM,UAAU,GAAS;oBACvB,GAAG,KAAK;oBACR,GAAG,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK,GAAG,EAAE;oBAC3B,GAAG,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK,GAAG,EAAE;iBAC5B,CAAC;gBACF,MAAM,KAAK,GAAG,kBAAkB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;gBACtD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACnC,MAAM,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC;gBAC3B,IAAI,IAAI,IAAI,KAAK;oBAAE,SAAS,CAAC,0BAA0B;gBACvD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,6EAA6E;IAC7E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS;YAAE,SAAS;QACjC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3C,IAAI,YAAY,CAAC,IAAI,EAAE,UAAU,CAAC;YAAE,OAAO,KAAK,CAAC;QACjD,KAAK,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;YAC7C,IAAI,OAAO,KAAK,EAAE;gBAAE,SAAS;YAC7B,IAAI,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClD,CAAC;IACH,CAAC;IAED,UAAU;IACV,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACnC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,iBAAiB,CACxB,IAAU,EACV,MAAc,EACd,MAAe,EACf,GAAe;IAEf,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,MAAM,UAAU,GAAa;QAC3B,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,CAAC,EAAE,OAAO,CAAC,CAAC;QACZ,CAAC,EAAE,OAAO,CAAC,CAAC;KACb,CAAC;IACF,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IAEtC,MAAM,MAAM,GAAG,KAAM,CAAC;IACtB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,KAAK,GAAW,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,MAAM,OAAO,GAAa;gBACxB,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE;gBACjB,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE;gBACjB,CAAC,EAAE,GAAG,CAAC,CAAC;gBACR,CAAC,EAAE,GAAG,CAAC,CAAC;aACT,CAAC;YACF,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;YACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;YACrE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/packing.d.ts

@@ -0,0 +1,16 @@
+import type { CellPos } from './types.js';
+export interface PackTile {
+    id: string;
+    w: number;
+    h: number;
+}
+export interface PackComputation {
+    placements: Map<string, CellPos>;
+    /** Bounding box of the packed layout, in cells. */
+    width: number;
+    height: number;
+    /** Empty cells left inside the bounding box (0 = perfectly dense). */
+    holes: number;
+}
+export declare function computePack(tiles: PackTile[], maxCols: number): PackComputation | null;
+//# sourceMappingURL=packing.d.ts.map

package/dist/packing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"packing.d.ts","sourceRoot":"","sources":["../src/packing.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,mDAAmD;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,sEAAsE;IACtE,KAAK,EAAE,MAAM,CAAC;CACf;AAID,wBAAgB,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,eAAe,GAAG,IAAI,CAetF"}

package/dist/packing.js

@@ -0,0 +1,159 @@
+// packing.ts — dense repacking for loop mode.
+//
+// Loop mode repeats the content's bounding box, so any hole inside it repeats
+// too. `computePack` arranges tiles into the tightest layout it can find:
+//
+// 1. Exact search: for each candidate width W (widest first) whose W x H
+//    rectangle exactly matches the total tile area, run a bounded
+//    backtracking tiler (cover the topmost-leftmost empty cell at each step).
+//    If it succeeds the layout has ZERO holes.
+// 2. Fallback: a gap-filling greedy — walk cells in reading order and drop
+//    the largest remaining tile that fits at each empty cell. Minimizes holes
+//    but cannot always reach zero (not every tile mix tiles a rectangle).
+//
+// Rectangle packing is NP-hard in general; the exact search is capped by a
+// node budget so worst-case inputs degrade to the greedy instead of hanging.
+const EXACT_NODE_BUDGET = 50000;
+export function computePack(tiles, maxCols) {
+    if (tiles.length === 0 || maxCols <= 0)
+        return null;
+    const area = tiles.reduce((s, t) => s + t.w * t.h, 0);
+    const maxW = Math.max(...tiles.map((t) => t.w));
+    const maxH = Math.max(...tiles.map((t) => t.h));
+    for (let w = Math.min(maxCols, area); w >= maxW; w--) {
+        if (area % w !== 0)
+            continue;
+        const h = area / w;
+        if (h < maxH)
+            continue;
+        const exact = exactPack(tiles, w, h);
+        if (exact)
+            return { placements: exact, width: w, height: h, holes: 0 };
+    }
+    return greedyPack(tiles, Math.min(maxCols, area));
+}
+/**
+ * Bounded backtracking tiler: every step covers the topmost-leftmost empty
+ * cell, trying each distinct unused tile size there. Returns null when no
+ * complete tiling is found (or the node budget runs out).
+ */
+function exactPack(tiles, w, h) {
+    const order = [...tiles].sort((a, b) => b.w * b.h - a.w * a.h || b.h - a.h);
+    const n = order.length;
+    const occ = new Uint8Array(w * h);
+    const used = new Array(n).fill(false);
+    const placements = new Map();
+    let nodes = 0;
+    const fits = (c, r, tw, th) => {
+        if (c + tw > w || r + th > h)
+            return false;
+        for (let y = r; y < r + th; y++) {
+            for (let x = c; x < c + tw; x++) {
+                if (occ[y * w + x])
+                    return false;
+            }
+        }
+        return true;
+    };
+    const mark = (c, r, tw, th, v) => {
+        for (let y = r; y < r + th; y++) {
+            for (let x = c; x < c + tw; x++)
+                occ[y * w + x] = v;
+        }
+    };
+    const rec = (scanFrom) => {
+        if (++nodes > EXACT_NODE_BUDGET)
+            return false;
+        let idx = scanFrom;
+        while (idx < w * h && occ[idx])
+            idx++;
+        if (idx >= w * h)
+            return true;
+        const c = idx % w;
+        const r = (idx - c) / w;
+        // Identical-size tiles are interchangeable; trying one per size is enough.
+        const triedSizes = new Set();
+        for (let i = 0; i < n; i++) {
+            if (used[i])
+                continue;
+            const t = order[i];
+            const sizeKey = `${t.w}x${t.h}`;
+            if (triedSizes.has(sizeKey))
+                continue;
+            triedSizes.add(sizeKey);
+            if (!fits(c, r, t.w, t.h))
+                continue;
+            used[i] = true;
+            mark(c, r, t.w, t.h, 1);
+            placements.set(t.id, { col: c, row: r });
+            if (rec(idx + 1))
+                return true;
+            used[i] = false;
+            mark(c, r, t.w, t.h, 0);
+            placements.delete(t.id);
+        }
+        return false;
+    };
+    return rec(0) ? placements : null;
+}
+/**
+ * Gap-filling greedy: walk cells in reading order; at each empty cell place
+ * the largest remaining tile that fits, otherwise leave the cell as a hole
+ * and move on. Never widens the layout to skip a fillable gap.
+ */
+function greedyPack(tiles, w) {
+    const remaining = [...tiles].sort((a, b) => b.w * b.h - a.w * a.h || b.h - a.h);
+    const placements = new Map();
+    const occ = [];
+    const fits = (c, r, tw, th) => {
+        if (c + tw > w)
+            return false;
+        for (let y = r; y < r + th; y++) {
+            const row = occ[y];
+            if (!row)
+                continue;
+            for (let x = c; x < c + tw; x++) {
+                if (row[x])
+                    return false;
+            }
+        }
+        return true;
+    };
+    const mark = (c, r, tw, th) => {
+        for (let y = r; y < r + th; y++) {
+            let row = occ[y];
+            if (!row) {
+                row = new Array(w).fill(false);
+                occ[y] = row;
+            }
+            for (let x = c; x < c + tw; x++)
+                row[x] = true;
+        }
+    };
+    let idx = 0;
+    while (remaining.length > 0) {
+        const c = idx % w;
+        const r = (idx - c) / w;
+        if (!occ[r]?.[c]) {
+            const i = remaining.findIndex((t) => fits(c, r, t.w, t.h));
+            if (i >= 0) {
+                const t = remaining.splice(i, 1)[0];
+                placements.set(t.id, { col: c, row: r });
+                mark(c, r, t.w, t.h);
+            }
+            // else: unfillable hole — leave it and keep scanning.
+        }
+        idx++;
+    }
+    let width = 0;
+    let height = 0;
+    let area = 0;
+    for (const t of tiles) {
+        const p = placements.get(t.id);
+        width = Math.max(width, p.col + t.w);
+        height = Math.max(height, p.row + t.h);
+        area += t.w * t.h;
+    }
+    return { placements, width, height, holes: width * height - area };
+}
+//# sourceMappingURL=packing.js.map

package/dist/packing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"packing.js","sourceRoot":"","sources":["../src/packing.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,EAAE;AACF,8EAA8E;AAC9E,0EAA0E;AAC1E,EAAE;AACF,yEAAyE;AACzE,kEAAkE;AAClE,8EAA8E;AAC9E,+CAA+C;AAC/C,2EAA2E;AAC3E,8EAA8E;AAC9E,0EAA0E;AAC1E,EAAE;AACF,2EAA2E;AAC3E,6EAA6E;AAmB7E,MAAM,iBAAiB,GAAG,KAAM,CAAC;AAEjC,MAAM,UAAU,WAAW,CAAC,KAAiB,EAAE,OAAe;IAC5D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAC7B,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,IAAI;YAAE,SAAS;QACvB,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,KAAK;YAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IACzE,CAAC;IAED,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,KAAiB,EAAE,CAAS,EAAE,CAAS;IACxD,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAU,EAAE,EAAU,EAAW,EAAE;QACrE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YACnC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAU,EAAE,EAAU,EAAE,CAAS,EAAQ,EAAE;QAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,GAAG,GAAG,CAAC,QAAgB,EAAW,EAAE;QACxC,IAAI,EAAE,KAAK,GAAG,iBAAiB;YAAE,OAAO,KAAK,CAAC;QAC9C,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC;YAAE,GAAG,EAAE,CAAC;QACtC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9B,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACxB,2EAA2E;QAC3E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,CAAC,CAAC;gBAAE,SAAS;YACtB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACpB,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,IAAI,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACtC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACpC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACf,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACzC,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAChB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;AACpC,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,KAAiB,EAAE,CAAS;IAC9C,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC9C,MAAM,GAAG,GAAgB,EAAE,CAAC;IAE5B,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAU,EAAE,EAAU,EAAW,EAAE;QACrE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,IAAI,GAAG,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAU,EAAE,EAAU,EAAQ,EAAE;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,GAAG,GAAG,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACf,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACjD,CAAC;IACH,CAAC,CAAC;IAEF,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;gBACrC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACzC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;YACD,sDAAsD;QACxD,CAAC;QACD,GAAG,EAAE,CAAC;IACR,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAChC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;AACrE,CAAC"}

package/dist/pan.d.ts

@@ -0,0 +1,58 @@
+export interface CameraState {
+    /** Unbounded camera offset, px. */
+    x: number;
+    y: number;
+    /** Velocity estimate, px/s. */
+    vx: number;
+    vy: number;
+    /** True while the camera is still easing/coasting toward its target. */
+    isMoving: boolean;
+    /** True between dragStart and dragEnd. */
+    isDragging: boolean;
+}
+export interface PanPhysicsOptions {
+    /** Inertia velocity decay rate after release, 1/s. Default 4. */
+    friction?: number;
+    /** Camera approach rate toward the target, 1/s. Default 12. */
+    ease?: number;
+    /** Fling velocity clamp, px/s. Default 6000. */
+    maxVelocity?: number;
+}
+export declare class PanController {
+    private friction;
+    private ease;
+    private maxVelocity;
+    private x;
+    private y;
+    private targetX;
+    private targetY;
+    private vx;
+    private vy;
+    private dragging;
+    private lastPointer;
+    private samples;
+    private lastTick;
+    constructor(physics?: PanPhysicsOptions);
+    setPhysics(physics: PanPhysicsOptions): void;
+    state(): CameraState;
+    /** Begin a pan gesture at pointer position (px, py), in any stable pixel space. */
+    dragStart(px: number, py: number, now: number): void;
+    /** Pointer moved during a pan gesture. */
+    dragMove(px: number, py: number, now: number): void;
+    /** End the pan gesture, converting recent pointer motion into a fling. */
+    dragEnd(now: number): void;
+    /** Abort a drag without inertia. */
+    dragCancel(): void;
+    /** External scroll delta (native scroll / wheel). Applied directly. */
+    scrollBy(dx: number, dy: number): void;
+    /** Jump the camera (and target) to an absolute offset. Kills motion. */
+    moveTo(x: number, y: number): void;
+    /** Stop all motion at the current offset. */
+    stop(): void;
+    /**
+     * Advance the simulation to time `now` (ms). Returns the camera state.
+     * Call once per animation frame.
+     */
+    tick(now: number): CameraState;
+}
+//# sourceMappingURL=pan.d.ts.map

package/dist/pan.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pan.d.ts","sourceRoot":"","sources":["../src/pan.ts"],"names":[],"mappings":"AAcA,MAAM,WAAW,WAAW;IAC1B,mCAAmC;IACnC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,+BAA+B;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,wEAAwE;IACxE,QAAQ,EAAE,OAAO,CAAC;IAClB,0CAA0C;IAC1C,UAAU,EAAE,OAAO,CAAC;CACrB;AAED,MAAM,WAAW,iBAAiB;IAChC,iEAAiE;IACjE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,+DAA+D;IAC/D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,gDAAgD;IAChD,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAYD,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,WAAW,CAAS;IAE5B,OAAO,CAAC,CAAC,CAAK;IACd,OAAO,CAAC,CAAC,CAAK;IACd,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,EAAE,CAAK;IACf,OAAO,CAAC,EAAE,CAAK;IAEf,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,WAAW,CAAyC;IAC5D,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,QAAQ,CAAuB;gBAE3B,OAAO,GAAE,iBAAsB;IAM3C,UAAU,CAAC,OAAO,EAAE,iBAAiB,GAAG,IAAI;IAM5C,KAAK,IAAI,WAAW;IAgBpB,mFAAmF;IACnF,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI;IAWpD,0CAA0C;IAC1C,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI;IAYnD,0EAA0E;IAC1E,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAuB1B,oCAAoC;IACpC,UAAU,IAAI,IAAI;IAQlB,uEAAuE;IACvE,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI;IAOtC,wEAAwE;IACxE,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IASlC,6CAA6C;IAC7C,IAAI,IAAI,IAAI;IAOZ;;;OAGG;IACH,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,WAAW;CAqC/B"}